Block-triangular preconditioners for PDE-constrained optimization
Publication:3090809
DOI10.1002/nla.693zbMath1240.65097OpenAlexW2161327317MaRDI QIDQ3090809
Publication date: 2 September 2011
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:ee57a575-1a29-4ba8-ae8b-edddaacf54b5
linear systemsnumerical examplespreconditioningsaddle point problemsKrylov subspace methodPDE-constrained optimizationconjugate gradient-type methodChebyshev semi-iterationBramble-Pasciak method
Numerical optimization and variational techniques (65K10) Iterative numerical methods for linear systems (65F10) Existence theories for optimal control problems involving partial differential equations (49J20) Preconditioners for iterative methods (65F08)
Related Items (45)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
- Chebyshev semi-iteration in preconditioning for problems including the mass matrix
- Fast parallel solvers for symmetric boundary element domain decomposition equations
- Domain decomposition preconditioners for \(p\) and \(hp\) finite element approximation of Stokes equations
- Block triangular preconditioners for symmetric saddle-point problems
- Preconditioners for saddle point problems arising in computational fluid dynamics
- Analysis of iterative methods for saddle point problems: a unified approach
- Conjugate gradient method for dual-dual mixed formulations
- A Taxonomy for Conjugate Gradient Methods
- On relaxation of jacobi iteration for consistent and generalized mass matrices
- Numerical solution of saddle point problems
- Combination Preconditioning and the Bramble–Pasciak$^{+}$ Preconditioner
- Realistic Eigenvalue Bounds for the Galerkin Mass Matrix
- Corrigenda
- Solution of Sparse Indefinite Systems of Linear Equations
- Fast Iterative Solution of Stabilised Stokes Systems. Part I: Using Simple Diagonal Preconditioners
- Fast Iterative Solution of Stabilised Stokes Systems Part II: Using General Block Preconditioners
- Block-Triangular Preconditioners for Saddle Point Problems with a Penalty Term
- On the Numerical Solution of the Biharmonic Equation and the Role of Squaring Matrices for Preconditioning
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Preconditioning methods for linear systems arising in constrained optimization problems
- Fast Iterative Solvers for Discrete Stokes Equations
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Block-triangular preconditioners for PDE-constrained optimization