Method for verifying solutions of sparse linear systems with general coefficients
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1694910 (Why is no real title available?)
- scientific article; zbMATH DE number 714516 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 2015315 (Why is no real title available?)
- scientific article; zbMATH DE number 799193 (Why is no real title available?)
- scientific article; zbMATH DE number 1424515 (Why is no real title available?)
- scientific article; zbMATH DE number 1440908 (Why is no real title available?)
- A method of obtaining verified solutions for linear systems suited for Java
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Accuracy and Stability of Numerical Algorithms
- Accurate Symmetric Indefinite Linear Equation Solvers
- Accurate solution of dense linear systems I: Algorithms in rounding to nearest
- Accurate solution of dense linear systems. II: Algorithms using directed rounding
- Algorithm 837
- An algorithm for automatically selecting a suitable verification method for linear systems
- Error bounds for approximate solutions of systems of equations
- Fast computation of error bounds for all eigenpairs of a Hermitian and all singular pairs of a rectangular matrix with emphasis on eigen- and singular value clusters
- Fast verification of solutions of matrix equations
- Fast verified solutions of linear systems
- Grand challenges and scientific standards in interval analysis
- Iterative Refinement Implies Numerical Stability for Gaussian Elimination
- Iterative Refinement in Floating Point
- Lower bounds for the smallest singular values of generalized asymptotic diagonal dominant matrices
- Mixed precision algorithms in numerical linear algebra
- Modified error bounds for approximate solutions of dense linear systems
- On algorithms for permuting large entries to the diagonal of a sparse matrix
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Super-fast validated solution of linear systems
- The Theory of Composites
- Tight enclosures of solutions of linear systems
- Verification methods: rigorous results using floating-point arithmetic
- Verification of positive definiteness
- Verified numerical computations for large-scale linear systems.
This page was built for publication: Method for verifying solutions of sparse linear systems with general coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994123)
