Solving Sparse Linear Systems with Sparse Backward Error
From MaRDI portal
Recommendations
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- LU-decomposition with iterative refinement for solving sparse linear systems
- Estimating the Backward Error in LSQR
- Iterative refinement for ill-conditioned linear systems
- Block elimination with one refinement solves bordered linear systems accurately
Cited in
(45)- On accurate and time efficient solution of primal-mixed finite element equations in multiscale solid mechanics
- Componentwise perturbation theory for linear systems with multiple right- hand sides
- Computation of optimal backward perturbation bounds for large sparse linear least squares problems
- Chebyshev acceleration of iterative refinement
- A survey of direct methods for sparse linear systems
- On the symmetric componentwise relative backward error for linear systems of equations
- Coupling of continuous and hybridizable discontinuous Galerkin methods: application to conjugate heat transfer problem
- Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems
- Formation of Finite-Time Singularities in the 3D Axisymmetric Euler Equations: A Numerics Guided Study
- Statistical Condition Estimation for Linear Systems
- Symbiosis between linear algebra and optimization
- Error estimation in preconditioned conjugate gradients
- Perturbation analysis of saddle-point problems
- Condition numbers and their condition numbers
- On perturbation bounds of Kronecker product linear systems and their level-2 condition numbers
- Using dual techniques to derive componentwise and mixed condition numbers for a linear function of a linear least squares solution
- Linear algebra software for large-scale accelerated multicore computing
- Combining sparse approximate factorizations with mixed-precision iterative refinement
- Algorithm 1050: SPEX Cholesky, LDL, and backslash for exactly solving sparse linear systems
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- Algebraic Error Analysis for Mixed-Precision Multigrid Solvers
- A tearing-based hybrid parallel sparse linear system solver
- scientific article; zbMATH DE number 794384 (Why is no real title available?)
- Experiments with data perturbations to study condition numbers and numerical stability
- Toward the finite-time blowup of the 3D axisymmetric Euler equations: a numerical investigation
- On the augmented system approach to sparse least-squares problems
- The structured sensitivity of Vandermonde-like systems
- LU-decomposition with iterative refinement for solving sparse linear systems
- Improving multifrontal methods by means of block low-rank representations
- Estimation of the sensitivity of linear and nonlinear algebraic problems
- Gaussian elimination: When is scaling beneficial!
- A Note on Monitoring the Stability of Triangular Decomposition of Sparse Matrices
- Frequency domain Bernstein-Bézier finite element solver for modelling short waves in elastodynamics
- Accelerating scientific computations with mixed precision algorithms
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Perturbation theory and backward error for AX - XB = C
- Entrywise relative perturbation theory for nonsingular \(M\)-matrices and applications
- Fully parallel and pipelined sparse direct solver for large symmetric indefinite finite element problems
- Algebraic Error Analysis for Mixed-Precision Multigrid Solvers
- Component-wise perturbation analysis and error bounds for linear least squares solutions
- Bernstein-Bézier based finite elements for efficient solution of short wave problems
- Accuracy and effectiveness of preconditioned conjugate gradient algorithms for large and ill-conditioned problems
- Comparison of high-order continuous and hybridizable discontinuous Galerkin methods for incompressible fluid flow problems
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- Iterative refinement enhances the stability of \(QR\) factorization methods for solving linear equations
This page was built for publication: Solving Sparse Linear Systems with Sparse Backward Error
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4734658)
