Null-space preconditioners for saddle point systems
From MaRDI portal
Recommendations
- A comparative study of null-space factorizations for sparse symmetric saddle point systems.
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- On nonsingular saddle-point systems with a maximally rank deficient leading block
- Preconditioners for saddle point linear systems with highly singular (1,1) blocks
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
Cites work
- A new analysis of block preconditioners for saddle point problems
- A Note on Preconditioning for Indefinite Linear Systems
- A note on the LDL\(^{T}\) decomposition of matrices from saddle-point problems
- A null space algorithm for mixed finite-element approximations of Darcy's equation
- A Preconditioning Technique for Indefinite Systems Resulting from Mixed Approximations of Elliptic Problems
- A Primal-Based Penalty Preconditioner for Elliptic Saddle Point Systems
- A Reduced Hessian Method for Large-Scale Constrained Optimization
- An Augmented Lagrangian‐Based Approach to the Oseen Problem
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Block-triangular preconditioners for PDE-constrained optimization
- Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods
- Constraint Preconditioning for Indefinite Linear Systems
- Construction of null bases for the divergence operator associated with incompressible Navier-Stokes equations
- Convergence analysis of the inexact infeasible interior-point method for linear optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Finite Elements
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- scientific article; zbMATH DE number 2221749 (Why is no real title available?)
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization
- Minimum residual methods for augmented systems
- Numerical Optimization
- Numerical solution of saddle point problems
- On block preconditioners for saddle point problems with singular or indefinite (1,1) block.
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- On nonsingular saddle-point systems with a maximally rank deficient leading block
- On nonsymmetric saddle point matrices that allow conjugate gradient iterations
- On the choice of preconditioner for minimum residual methods for non-Hermitian matrices
- On the eigenvalues and eigenvectors of block triangular preconditioned block matrices
- On the eigenvalues of a class of saddle point matrices
- On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
- On the solution of equality constrained quadratic programming problems arising in optimization
- Optimal solvers for PDE-constrained optimization
- Parallel numerical solution of the time-harmonic Maxwell equations in mixed form.
- Preconditioned nullspace method for the two-dimensional Oseen problem
- Preconditioners for the discretized time-harmonic Maxwell equations in mixed form
- Preconditioning discretizations of systems of partial differential equations.
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation
- Preconditioning indefinite systems in interior point methods for optimization
- Preconditioning of active-set Newton methods for PDE-constrained optimal control problems
- Preconditioning saddle-point systems with applications in optimization
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- Projected Krylov methods for saddle-point systems
- Solution of indefinite linear systems using an LQ decomposition for the linear constraints
- Sparse Orthogonal Schemes for Structural Optimization Using the Force Method
- Symmetric Indefinite Preconditioners for Saddle Point Problems with Applications to PDE-Constrained Optimization Problems
Cited in
(10)- Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization
- Threshold incomplete factorization constraint preconditioners for saddle-point matrices
- A least squares approach for saddle point problems
- 3D-1D coupling on non conforming meshes via a three-field optimization based domain decomposition
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- A comparative study of null-space factorizations for sparse symmetric saddle point systems.
- 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
- A block Householder-based algorithm for the QR decomposition of hierarchical matrices
- New approach for solving sequences of saddle-point linear systems
This page was built for publication: Null-space preconditioners for saddle point systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2818269)
