Fast verified solutions of linear systems
From MaRDI portal
Publication:849174
DOI10.1007/BF03186530zbMath1184.65046MaRDI QIDQ849174
Shin'ichi Oishi, Takeshi Ogita
Publication date: 25 February 2010
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jjiam/1265033777
algorithmsnumerical resultserror boundinterval arithmeticself-validating methodsverified numerical computationverified solutions of linear systems
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
An algorithm for automatically selecting a suitable verification method for linear systems ⋮ Verified computation for the Hermitian positive definite solution of the conjugate discrete-time algebraic Riccati equation ⋮ Verified partial eigenvalue computations using contour integrals for Hermitian generalized eigenproblems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Super-fast validated solution of linear systems
- On regular and singular interval systems
- Rounding-error and perturbation bounds for the Cholesky and \(LDL^ T\) factorizations
- A note on epsilon-inflation
- Fast and parallel interval arithmetic
- Fast verification of solutions of matrix equations
- Computation of sharp rigorous componentwise error bounds for the approximate solutions of systems of linear equations
- Grand challenges and scientific standards in interval analysis
- A simple derivation of the Hansen-Bliek-Rohn-Ning-Kearfott enclosure for linear interval equations
- An extended compact profile iterative method criterion for sparse \(H\)-matrices
- Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices
- Fast inclusion of interval matrix multiplication
- Verification of positive definiteness
- Gaussian elimination is not optimal
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Anatomy of high-performance matrix multiplication
- Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
- Error bounds for approximate solutions of systems of equations
- Interval Methods for Systems of Equations
- A Test for Existence of Solutions to Nonlinear Systems
- A Comparison of some Methods for Solving Linear Interval Equations
- Accuracy and Stability of Numerical Algorithms
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Tight Enclosures of Solutions of Linear Systems
- Numerical validation of solutions of saddle point matrix equations
- Accurate Sum and Dot Product
- Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation
This page was built for publication: Fast verified solutions of linear systems
