Fast enclosure for solutions in underdetermined systems
From MaRDI portal
Publication:989149
DOI10.1016/j.cam.2010.05.005zbMath1201.65064OpenAlexW2084914444MaRDI QIDQ989149
Publication date: 27 August 2010
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.05.005
Related Items (4)
Fast enclosure for the minimum norm least squares solution of the matrix equation AXB = C ⋮ Componentwise enclosure for solutions of least squares problems and underdetermined systems ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ Improved componentwise verified error bounds for least squares problems and underdetermined linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A method of obtaining verified solutions for linear systems suited for Java
- Solution of augmented linear systems using orthogonal factorizations
- Fast verification of solutions of matrix equations
- Computation of sharp rigorous componentwise error bounds for the approximate solutions of systems of linear equations
- The university of Florida sparse matrix collection
- Error bounds for approximate solutions of systems of equations
- Improved Error Bounds for Underdetermined System Solvers
- $l_2 $-Solutions to Underdetermined Linear Systems
- Optimal Backward Perturbation Bounds for Underdetermined Systems
- Accuracy and Stability of Numerical Algorithms
- Large-Scale Scientific Computing
This page was built for publication: Fast enclosure for solutions in underdetermined systems