Sparse block factorization of saddle point matrices
From MaRDI portal
Recommendations
- The antitriangular factorization of saddle point matrices
- The generalized Cholesky factorization method for saddle point problems
- Numerically stable LDLT-factorization of F-type saddle point matrices
- A comparative study of null-space factorizations for sparse symmetric saddle point systems.
- Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
Cites work
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Note on Preconditioning for Indefinite Linear Systems
- A Preconditioned Iterative Method for Saddlepoint Problems
- A class of constraint preconditioners for nonsymmetric saddle point matrices
- A note on the LDL\(^{T}\) decomposition of matrices from saddle-point problems
- A preconditioning technique for indefinite linear systems
- A primal-dual regularized interior-point method for convex quadratic programs
- A stable and efficient method for solving a convex quadratic program with application to optimal control
- Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
- Block preconditioning for saddle point systems with indefinite (1, 1) block
- Constraint Preconditioning for Indefinite Linear Systems
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- Direct Methods for Sparse Linear Systems
- Error Analysis of Direct Methods of Matrix Inversion
- Error analysis of an algorithm for equality-constrained quadratic programming problems
- Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems
- Interior Methods for Nonlinear Optimization
- New preconditioning techniques for saddle point problems arising from the time-harmonic Maxwell equations
- Numerical Optimization
- Numerical solution of saddle point problems
- Numerically stable LDLT-factorization of F-type saddle point matrices
- On Modified Factorizations for Large-Scale Linearly Constrained Optimization
- On Solving Block-Structured Indefinite Linear Systems
- On fast factorization pivoting methods for sparse symmetric indefinite systems
- Preconditioners for Indefinite Systems Arising in Optimization
- Solution of indefinite linear systems using an LQ decomposition for the linear constraints
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Sparse inverse incidence matrices for Schilders' factorization applied to resistor network modeling
- Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
- The Antitriangular Factorization of Symmetric Matrices
- The antitriangular factorization of saddle point matrices
- Using constraint preconditioners with regularized saddle-point problems
Cited in
(12)- Computing the block triangular form of a sparse matrix
- Numerically stable LDLT-factorization of F-type saddle point matrices
- On some properties of saddle point matrices with vector blocks
- Sparsified block elimination for directed laplacians
- Preordering saddle‐point systems for sparse LDLT factorization without pivoting
- Threshold incomplete factorization constraint preconditioners for saddle-point matrices
- scientific article; zbMATH DE number 3858845 (Why is no real title available?)
- Sparse inverse incidence matrices for Schilders' factorization applied to resistor network modeling
- The antitriangular factorization of saddle point matrices
- Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots
- scientific article; zbMATH DE number 6533779 (Why is no real title available?)
- A comparative study of null-space factorizations for sparse symmetric saddle point systems.
This page was built for publication: Sparse block factorization of saddle point matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281977)
