Null-Space Preconditioners for Saddle Point Systems
From MaRDI portal
Publication:2818269
DOI10.1137/15M1021349zbMath1347.65060OpenAlexW884468685MaRDI QIDQ2818269
Publication date: 7 September 2016
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1021349
numerical examplesSchur complementpreconditioningconjugate gradient methodblock factorizationsaddle point systemsnull-space methodsymmetric positive definite system
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items (6)
3D-1D coupling on non conforming meshes via a three-field optimization based domain decomposition ⋮ Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization ⋮ An alternative method for SPP with full rank (2,1)-block matrix and nonzero right-hand side vector ⋮ A PDE-constrained optimization method for 3D-1D coupled problems with discontinuous solutions ⋮ Threshold incomplete factorization constraint preconditioners for saddle-point matrices ⋮ A least squares approach for saddle point problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solution of indefinite linear systems using an LQ decomposition for the linear constraints
- Convergence analysis of the inexact infeasible interior-point method for linear optimization
- Construction of null bases for the divergence operator associated with incompressible Navier-Stokes equations
- Minimum residual methods for augmented systems
- Preconditioning indefinite systems in interior point methods for optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- On the choice of preconditioner for minimum residual methods for non-Hermitian matrices
- On nonsymmetric saddle point matrices that allow conjugate gradient iterations
- On the eigenvalues of a class of saddle point matrices
- On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
- A Note on the LDLT Decomposition of Matrices from Saddle-Point Problems
- A New Analysis of Block Preconditioners for Saddle Point Problems
- Preconditioning discretizations of systems of partial differential equations
- On block preconditioners for saddle point problems with singular or indefinite (1, 1) block
- On the Eigenvalues and Eigenvectors of Block Triangular Preconditioned Block Matrices
- Preconditioning Saddle-Point Systems with Applications in Optimization
- Optimal Solvers for PDE-Constrained Optimization
- Block-triangular preconditioners for PDE-constrained optimization
- Preconditioners for the discretized time-harmonic Maxwell equations in mixed form
- Numerical solution of saddle point problems
- Preconditioning of Active-Set Newton Methods for PDE-constrained Optimal Control Problems
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation
- Symmetric Indefinite Preconditioners for Saddle Point Problems with Applications to PDE-Constrained Optimization Problems
- Preconditioned Nullspace Method for the Two-Dimensional Oseen Problem
- On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
- Sparse Orthogonal Schemes for Structural Optimization Using the Force Method
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Preconditioning Technique for Indefinite Systems Resulting from Mixed Approximations of Elliptic Problems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Numerical Optimization
- Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization
- Constraint Preconditioning for Indefinite Linear Systems
- A Note on Preconditioning for Indefinite Linear Systems
- A null space algorithm for mixed finite-element approximations of Darcy's equation
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- A Reduced Hessian Method for Large-Scale Constrained Optimization
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Parallel numerical solution of the time‐harmonic Maxwell equations in mixed form
- Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods
- Projected Krylov Methods for Saddle-Point Systems
- On Nonsingular Saddle-Point Systems with a Maximally Rank Deficient Leading Block
- An Augmented Lagrangian‐Based Approach to the Oseen Problem
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- A Primal-Based Penalty Preconditioner for Elliptic Saddle Point Systems
- Finite Elements
This page was built for publication: Null-Space Preconditioners for Saddle Point Systems
