Solution of indefinite linear systems using an LQ decomposition for the linear constraints
DOI10.1016/J.LAA.2009.02.036zbMATH Open1169.65039OpenAlexW2164805844MaRDI QIDQ1025858FDOQ1025858
Authors: W. H. A. Schilders 
Publication date: 23 June 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/solution-of-indefinite-linear-systems-using-an-lq-decomposition-for-the-linear-constraints(f2423a5a-0ae0-4ef1-962b-32259af8bf58).html
Recommendations
LQ decompositionpreconditionersconjugate gradientslinear constraintBunch-Kaufman-Parlett algorithmdirect solution algorithmindefinite system
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- Title not available (Why is that?)
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Numerical solution of saddle point problems
- Mixed and Hybrid Finite Element Methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constraint Preconditioning for Indefinite Linear Systems
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- A class of constraint preconditioners for nonsymmetric saddle point matrices
- Using constraint preconditioners with regularized saddle-point problems
- A Preconditioned Iterative Method for Saddlepoint Problems
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
- Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems
- Two-Dimensional Exponential Fitting and Applications to Drift-Diffusion Models
- Iterative Krylov Methods for Large Linear Systems
- Model order reduction: Theory, research aspects and applications. Selected papers based on the presentations at the workshop `Model order reduction, coupled problems and optimization', Leiden, The Netherlands, September 19--23, 2005.
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- A note on constraint preconditioners for nonsymmetric saddle point problems
- Crout versions of ILU factorization with pivoting for sparse symmetric matrices
- Simulation of EMC behaviour
- On implicit-factorization constraint preconditioners
Cited In (5)
- Sparse block factorization of saddle point matrices
- Threshold incomplete factorization constraint preconditioners for saddle-point matrices
- Sparse inverse incidence matrices for Schilders' factorization applied to resistor network modeling
- Consistent-inconsistent decomposition to initial value problem of descriptor linear systems
- Null-space preconditioners for saddle point systems
This page was built for publication: Solution of indefinite linear systems using an LQ decomposition for the linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025858)
