Block elimination with one refinement solves bordered linear systems accurately
From MaRDI portal
Linear systems with an \((n+1)\times (n+1)\) matrix of the form \(\begin{pmatrix} A & b \\ c & d\end{pmatrix} \) are studied with \(A\) being an \(n\times n\)-matrix. Equations with this matrix may be solved by using a black box solver for \(A\) twice. If \(A\) is not a well-conditioned matrix, then only approximate solvers will be available. It turns out that one step of iterative refinement is sufficient, if the approximate inverse \(A^{-1}\) is good from the viewpoint of backward error analysis.
Recommendations
- scientific article; zbMATH DE number 17450
- Stable Solvers and Block Elimination for Bordered Systems
- Stability and performance analysis of a block elimination solver for bordered linear systems
- scientific article; zbMATH DE number 1241468
- Mixed block elimination for linear systems with wider borders
Cites work
- A New Approach to Error Arithmetic
- A New Measure of Relative Error for Vectors
- A singular value inequality for block matrices
- Deflated Decomposition of Solutions of Nearly Singular Systems
- Deflation Techniques and Block-Elimination Algorithms for Solving Bordered Singular Systems
- Generalized Deflated Block-Elimination
- scientific article; zbMATH DE number 3854346 (Why is no real title available?)
- scientific article; zbMATH DE number 3872582 (Why is no real title available?)
- scientific article; zbMATH DE number 3932312 (Why is no real title available?)
- scientific article; zbMATH DE number 4064364 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Iterative refinement implies numerical stability
- Iterative Refinement Implies Numerical Stability for Gaussian Elimination
- Multiplicative Error Analysis of Matrix Transformation Algorithms
- On the Existence and Computation of LU-Factorizations with Small Pivots
- Rank and null space calculations using matrix decomposition without column interchanges
- The Bordering Algorithm and Path Following Near Singular Points of Higher Nullity
Cited in
(18)- Path-following methods in bifurcation problems
- Finite element analysis of nonlocal coupled parabolic problem using Newton's method
- A singular value inequality for block matrices
- Finite element analysis for coupled time-fractional nonlinear diffusion system
- Galerkin finite element schemes with fractional Crank-Nicolson method for the coupled time-fractional nonlinear diffusion system
- scientific article; zbMATH DE number 17450 (Why is no real title available?)
- Mixed block elimination for linear systems with wider borders
- scientific article; zbMATH DE number 1241468 (Why is no real title available?)
- Finite element scheme with Crank-Nicolson method for parabolic nonlocal problems involving the Dirichlet energy
- Solving Sparse Linear Systems with Sparse Backward Error
- Semi-discrete finite-element approximation of nonlocal hyperbolic problem
- scientific article; zbMATH DE number 7553749 (Why is no real title available?)
- Fully discrete finite element scheme for nonlocal parabolic problem involving the Dirichlet energy
- Finite element approximation of nonlocal parabolic problem
- Mixed precision algorithms in numerical linear algebra
- Full discretization to an hyperbolic equation with nonlocal coefficient
- Solving the parametric eigenvalue problem by Taylor series and Chebyshev expansion
- Bordered augmented linear systems in numerical continuation and bifurcation
This page was built for publication: Block elimination with one refinement solves bordered linear systems accurately
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915359)
