Block elimination with one refinement solves bordered linear systems accurately

DOI10.1007/BF01931663zbMath0702.65024OpenAlexW2062816736MaRDI QIDQ915359

John D. Pryce, Willy Govaerts

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01931663

zbMATH Keywords

backward error analysisapproximate inverseiterative refinementblack box solverblock eliminationbordered linear systems

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (13)

Mixed precision algorithms in numerical linear algebra ⋮ Semi-discrete finite-element approximation of nonlocal hyperbolic problem ⋮ Finite Element Scheme with Crank–Nicolson Method for Parabolic Nonlocal Problems Involving the Dirichlet Energy ⋮ Path-following methods in bifurcation problems ⋮ Full discretization to an hyperbolic equation with nonlocal coefficient ⋮ Finite element analysis for coupled time-fractional nonlinear diffusion system ⋮ Bordered augmented linear systems in numerical continuation and bifurcation ⋮ Finite element analysis of nonlocal coupled parabolic problem using Newton's method ⋮ Fully discrete finite element scheme for nonlocal parabolic problem involving the Dirichlet energy ⋮ Unnamed Item ⋮ A singular value inequality for block matrices ⋮ Galerkin finite element schemes with fractional Crank-Nicolson method for the coupled time-fractional nonlinear diffusion system ⋮ Finite element approximation of nonlocal parabolic problem

Uses Software

• PITCON

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rank and null space calculations using matrix decomposition without column interchanges
• A singular value inequality for block matrices
• Generalized Deflated Block-Elimination
• A New Measure of Relative Error for Vectors
• The Bordering Algorithm and Path Following Near Singular Points of Higher Nullity
• Deflation Techniques and Block-Elimination Algorithms for Solving Bordered Singular Systems
• Deflated Decomposition of Solutions of Nearly Singular Systems
• On the Existence and Computation of LU-Factorizations with Small Pivots
• Multiplicative Error Analysis of Matrix Transformation Algorithms
• Iterative Refinement Implies Numerical Stability for Gaussian Elimination
• Iterative refinement implies numerical stability
• A New Approach to Error Arithmetic

This page was built for publication: Block elimination with one refinement solves bordered linear systems accurately