Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations
From MaRDI portal
(Redirected from Publication:360337)
Recommendations
- Preconditioners for least squares problems by LU factorization
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- scientific article; zbMATH DE number 1911052
- A Purely Algebraic Approach to Preconditioning Based on Hierarchical LU Factorizations
- Iterative Methods and Preconditioners for Systems of Linear Equations
- Preconditioned iterative methods for solving linear least squares problems
- Multiple solution of systems of linear algebraic equations by an iterative method with recomputed preconditioners
- Solving linear systems. An analysis of matrix prefactorization iterative methods
- scientific article; zbMATH DE number 1254370
- Iterative ILU preconditioners for linear systems and eigenproblems
Cites work
- scientific article; zbMATH DE number 51442 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1969611 (Why is no real title available?)
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- A comparison of some GMRES-like methods
- A new family of block methods
- A stopping criterion for the conjugate gradient algorithm in a finite element method framework
- Accelerating with rank-one updates
- Accuracy and Stability of Numerical Algorithms
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Error estimation in preconditioned conjugate gradients
- Error norm estimation and stopping criteria in preconditioned conjugate gradient iterations
- Estimates in quadratic formulas
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
- Numerical experiments in computing bounds for the norm of the error in the preconditioned conjugate gradient algorithm
- On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique
- On error estimation in the conjugate gradient method and why it works in finite precision computations
- Recent computational developments in Krylov subspace methods for linear systems
- Stopping criteria for iterations in finite element methods
- Stopping criteria for iterative methods: applications to PDE's
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- The computation of bounds for the norm of the error in the conjugate gradient algorithm
- Use of Iterative Refinement in the Solution of Sparse Linear Systems
Cited in
(4)- Explicit Runge-Kutta methods combined with advanced versions of the Richardson extrapolation
- scientific article; zbMATH DE number 1969611 (Why is no real title available?)
- Generalized augmented matrix preconditioning approach and its application to iterative solution of ill-conditioned algebraic systems
- Preconditioners for least squares problems by LU factorization
This page was built for publication: Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360337)
