Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"saddle-point problems"”.
-
Preconditioners for Generalized Saddle -Point Problems
For these applications, we present results illustrating the eigenvalue bounds on our preconditioners and demonstrating the theoretical justification of these methods. We also present convergence and timing results, showing the effectiveness of our methods in practice. Specifically the use of …
-
Efficient Iterative Methods for Saddle Point Problems
… efficient iterative methods for a type of saddle-point problem, namely the generalized Stokes problem, which arises frequently in the simulation of time-dependent Navier-Stokes equations for incompressible fluid flow. These systems are indefinite due to a set of linear constraints on the …
-
Some new results for solving linear systems arising from computational fluid dynamics problems
… solution of four kinds of linear systems: saddle-point problems, Stokes problems, symmetric systems (positive definite or indefinite), and unsymmetric systems. These systems are related, and all of them arise from the numerical solution of partial differential equations. For saddle-point …
-
Optimal Linear Feedback Control for Incompressible Fluid Flow
… equations arising from discretization of saddle point problems. Necessary conditions are derived by applying the Maximum Principle and have the form of constrained Riccati equations. We consider two approaches for solving the feedback control problem as well as practical numerical methods. …
-
Parallel symmetric eigenvalue problem solvers
<p>Sparse symmetric eigenvalue problems arise in many computational science and engineering applications: in structural mechanics, nanoelectronics, and spectral reordering, for example. Often, the large size of these problems requires the development of eigensolvers that scale well on parallel …
-
Distributed Newton-Seeking for Resource Allocation
… an approach to solve resource allocation problems in a fully distributed fashion where the separable cost function is unknown with dynamics in discrete time. To accomplish this, we utilize a distributed extremum-seeking scheme that estimates the cost function’s gradient and Hessian to …
-
Exponential Integrators for the Incompressible Navier-Stokes Equations
… Both the H1 and L2 projections are solutions to saddle point problems that are efficiently solved by a preconditioned Uzawa algorithm.
-
Applications of accuracy certificates for problems with convex structure
Applications of accuracy certificates for problems with convex structure This dissertation addresses the efficient generation and potential applications of accuracy certificates in the framework of “black-box-represented” convex optimization problems - convex problems where the objective and the …
-
On the saddle-point solution and the large-coalition behavior of fingerprinting games
… However, these games generally do not admit saddle-point solutions and are very hard to solve numerically. Here under the so-called Boneh-Shaw marking assumption, we reformulate the capacity as the value of a single two-person zero-sum game, and show that it is achieved by a saddle-point …