Fast verification of solutions of matrix equations
DOI10.1007/S002110100310zbMATH Open0999.65015OpenAlexW2077793630MaRDI QIDQ1348935FDOQ1348935
Authors: Shin'ichi Oishi, Siegfried M. Rump
Publication date: 21 May 2002
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110100310
Recommendations
- Fast verified solutions of linear systems
- Remarks on Verified Inclusions for the Solution of Systems of Linear Equations
- scientific article; zbMATH DE number 1206063
- Computation of sharp rigorous componentwise error bounds for the approximate solutions of systems of linear equations
- scientific article; zbMATH DE number 2015315
Gaussian eliminationpreconditioninglinear systemsfast algorithmsnonsingularity\(LU\)-decompositionresult verificationdirected roundingunderflowrigorous error boundsfloating point analysis
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of matrix norms, conditioning, scaling (65F35) Algorithms with automatic result verification (65G20)
Cited In (31)
- Nonsingularity, positive definiteness, and positive invertibility under fixed-point data rounding.
- Title not available (Why is that?)
- Fast inclusion of interval matrix multiplication
- Remarks on Verified Inclusions for the Solution of Systems of Linear Equations
- Direct methods for linear systems with inexact input data
- Numerical verification methods for spherical \(t\)-designs
- On verified numerical computations in convex programming
- Title not available (Why is that?)
- Super-fast validated solution of linear systems
- Rigorous numerics for localized patterns to the quintic Swift-Hohenberg equation
- Fast interval matrix multiplication
- Verified eigenvalue and eigenvector computations using complex moments and the Rayleigh-Ritz procedure for generalized Hermitian eigenvalue problems
- A sharp error bound of the approximate solutions for saddle point linear systems
- Tight and efficient enclosure of matrix multiplication by using optimized BLAS.
- Title not available (Why is that?)
- Convergence of Rump's method for computing the Moore-Penrose inverse.
- Verified numerical computations for large-scale linear systems.
- An algorithm for automatically selecting a suitable verification method for linear systems
- Fast algorithms for floating-point interval matrix multiplication
- Verification May be Better than Estimation
- Fast verified solutions of linear systems
- Fast enclosure for solutions in underdetermined systems
- A method of obtaining verified solutions for linear systems suited for Java
- Title not available (Why is that?)
- Modified error bounds for approximate solutions of dense linear systems
- Computation of sharp rigorous componentwise error bounds for the approximate solutions of systems of linear equations
- A method for verifying the accuracy of numerical solutions of symmetric saddle point linear systems
- Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation
- Error-free computer solution of certain system of linear equations
- Validated Solutions of Saddle Point Linear Systems
- Fast enclosure for solutions of Sylvester equations
Uses Software
This page was built for publication: Fast verification of solutions of matrix equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348935)