Some Preconditioning Techniques for Saddle Point Problems
Saddle point problems arise frequently in many applications in science and engineering, including constrained optimization, mixed finite element formulations of partial differential equations, circuit analysis, and so forth. Indeed the formulation of most problems with constraints gives rise to sadd...
| Main Authors: | , |
|---|---|
| Format: | Report |
| Published: |
Unspecified
2006
|
| _version_ | 1826259891246858240 |
|---|---|
| author | Benzi, M Wathen, A |
| author_facet | Benzi, M Wathen, A |
| author_sort | Benzi, M |
| collection | OXFORD |
| description | Saddle point problems arise frequently in many applications in science and engineering, including constrained optimization, mixed finite element formulations of partial differential equations, circuit analysis, and so forth. Indeed the formulation of most problems with constraints gives rise to saddle point systems. This paper provides a concise overview of iterative approaches for the solution of such systems which are of particular importance in the context of large scale computation. In particular we describe some of the most useful preconditioning techniques for Krylov subspace solvers applied to saddle point problems, including block and constrained preconditioners. The work of Michele Benzi was supported in part by the National Science Foundation grant DMS-0511336. |
| first_indexed | 2024-03-06T18:56:58Z |
| format | Report |
| id | oxford-uuid:122c152f-38c9-40b2-b4d4-97f35998c47d |
| institution | University of Oxford |
| last_indexed | 2024-03-06T18:56:58Z |
| publishDate | 2006 |
| publisher | Unspecified |
| record_format | dspace |
| spelling | oxford-uuid:122c152f-38c9-40b2-b4d4-97f35998c47d2022-03-26T10:06:22ZSome Preconditioning Techniques for Saddle Point ProblemsReporthttp://purl.org/coar/resource_type/c_93fcuuid:122c152f-38c9-40b2-b4d4-97f35998c47dMathematical Institute - ePrintsUnspecified2006Benzi, MWathen, ASaddle point problems arise frequently in many applications in science and engineering, including constrained optimization, mixed finite element formulations of partial differential equations, circuit analysis, and so forth. Indeed the formulation of most problems with constraints gives rise to saddle point systems. This paper provides a concise overview of iterative approaches for the solution of such systems which are of particular importance in the context of large scale computation. In particular we describe some of the most useful preconditioning techniques for Krylov subspace solvers applied to saddle point problems, including block and constrained preconditioners. The work of Michele Benzi was supported in part by the National Science Foundation grant DMS-0511336. |
| spellingShingle | Benzi, M Wathen, A Some Preconditioning Techniques for Saddle Point Problems |
| title | Some Preconditioning Techniques for Saddle Point Problems |
| title_full | Some Preconditioning Techniques for Saddle Point Problems |
| title_fullStr | Some Preconditioning Techniques for Saddle Point Problems |
| title_full_unstemmed | Some Preconditioning Techniques for Saddle Point Problems |
| title_short | Some Preconditioning Techniques for Saddle Point Problems |
| title_sort | some preconditioning techniques for saddle point problems |
| work_keys_str_mv | AT benzim somepreconditioningtechniquesforsaddlepointproblems AT wathena somepreconditioningtechniquesforsaddlepointproblems |