Fast verified solutions of linear systems
From MaRDI portal
Publication:849174
DOI10.1007/BF03186530zbMATH Open1184.65046MaRDI QIDQ849174FDOQ849174
Authors: Takeshi Ogita, Shin'ichi Oishi 
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
Recommendations
algorithmsnumerical resultserror boundinterval arithmeticself-validating methodsverified numerical computationverified solutions of linear systems
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Gaussian elimination is not optimal
- Interval Methods for Systems of Equations
- Accuracy and Stability of Numerical Algorithms
- A note on epsilon-inflation
- Anatomy of high-performance matrix multiplication
- Title not available (Why is that?)
- Super-fast validated solution of linear systems
- Title not available (Why is that?)
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Fast and parallel interval arithmetic
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Accurate Sum and Dot Product
- Rounding-error and perturbation bounds for the Cholesky and \(LDL^ T\) factorizations
- Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices
- Verification of positive definiteness
- Title not available (Why is that?)
- Fast verification of solutions of matrix equations
- Accurate floating-point summation. II: Sign, \(K\)-fold faithful and rounding to nearest
- Error bounds for approximate solutions of systems of equations
- A Test for Existence of Solutions to Nonlinear Systems
- Numerical validation of solutions of saddle point matrix equations
- Grand challenges and scientific standards in interval analysis
- A simple derivation of the Hansen-Bliek-Rohn-Ning-Kearfott enclosure for linear interval equations
- Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation
- A Comparison of some Methods for Solving Linear Interval Equations
- Computation of sharp rigorous componentwise error bounds for the approximate solutions of systems of linear equations
- Fast inclusion of interval matrix multiplication
- An extended compact profile iterative method criterion for sparse \(H\)-matrices
- On regular and singular interval systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tight enclosures of solutions of linear systems
Cited In (21)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast verification of solutions of matrix equations
- Title not available (Why is that?)
- Super-fast validated solution of linear systems
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- Parallel Processing and Applied Mathematics
- Tight enclosures of solutions of linear systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Refining and verifying the solution of a linear system
- An algorithm for automatically selecting a suitable verification method for linear systems
- A method of obtaining verified solutions for linear systems suited for Java
- Title not available (Why is that?)
- Verified partial eigenvalue computations using contour integrals for Hermitian generalized eigenproblems
- 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
- Validated Solutions of Saddle Point Linear Systems
- Verified computation for the Hermitian positive definite solution of the conjugate discrete-time algebraic Riccati equation
Uses Software
This page was built for publication: Fast verified solutions of linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q849174)
