A fast and efficient algorithm for solving ill-conditioned linear systems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 781814 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Accuracy and Stability of Numerical Algorithms
- Accurate Sum and Dot Product
- Accurate matrix factorization: Inverse LU and inverse QR factorizations
- Accurate solution of dense linear systems I: Algorithms in rounding to nearest
- Inversion of extremely ill-conditioned matrices in floating-point
- Tight and efficient enclosure of matrix multiplication by using optimized BLAS.
Cited in
(11)- A maximum-principle-preserving third order finite volume SWENO scheme on unstructured triangular meshes
- scientific article; zbMATH DE number 4026660 (Why is no real title available?)
- Comments on "Fast direct solution of method of moments linear system
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- Balanced incomplete factorization preconditioner with pivoting
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- scientific article; zbMATH DE number 3919643 (Why is no real title available?)
- A new technique for ill-conditioned linear systems
- Fast Multiresolution Algorithms for Solving Linear Equations: A Comparative Study
- A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
- On the iterative refinement of the solution of ill-conditioned linear system of equations
This page was built for publication: A fast and efficient algorithm for solving ill-conditioned linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3121374)
