Fast enclosure for solutions in underdetermined systems

DOI10.1016/J.CAM.2010.05.005zbMATH Open1201.65064OpenAlexW2084914444MaRDI QIDQ989149FDOQ989149

Authors Shinya Miyajima

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

zbMATH Keywords

error boundgeneralized inverseunderdetermined systemnumerical enclosureminimal 2-norm solution

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Recommendations

• Fast enclosure for solutions of Sylvester equations
• Fast enclosure for solutions of generalized Sylvester equations
• Efficient methods for enclosing solutions of systems of nonlinear equations
• Componentwise enclosure for solutions of least squares problems and underdetermined systems
• scientific article; zbMATH DE number 1981929
• scientific article; zbMATH DE number 1497166
• Fast solutions to physical equilibrium and interpolation problems
• Accelerated enclosure methods for ordinary free boundary problems
• A fast algorithm to solve systems of nonlinear equations
• Fast iterative solutions of Riccati and Lyapunov equations

Cites work

• scientific article; zbMATH DE number 3963074 (Why is no real title available?)
• scientific article; zbMATH DE number 714516 (Why is no real title available?)
• scientific article; zbMATH DE number 1440908 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• $l_2 $-Solutions to Underdetermined Linear Systems
• A method of obtaining verified solutions for linear systems suited for Java
• Accuracy and Stability of Numerical Algorithms
• Computation of sharp rigorous componentwise error bounds for the approximate solutions of systems of linear equations
• Error bounds for approximate solutions of systems of equations
• Fast verification of solutions of matrix equations
• Improved Error Bounds for Underdetermined System Solvers
• Large-Scale Scientific Computing
• Optimal Backward Perturbation Bounds for Underdetermined Systems
• Solution of augmented linear systems using orthogonal factorizations
• The University of Florida sparse matrix collection

Cited in

(7)

• A heuristic verification of the degree of the approximate GCD of two univariate polynomials
• Improved Error Bounds for Underdetermined System Solvers
• Improved componentwise verified error bounds for least squares problems and underdetermined linear systems
• Enclosing solutions in least squares problems
• Componentwise enclosure for solutions of least squares problems and underdetermined systems
• Methods for solving underdetermined systems.
• Fast enclosure for the minimum norm least squares solution of the matrix equation AXB = C

Describes a project that uses

Uses Software

• INTLAB
• SparseMatrix
• mctoolbox
• VERSOFT

This page was built for publication: Fast enclosure for solutions in underdetermined systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989149)