Accurate solution of dense linear systems I: Algorithms in rounding to nearest

DOI10.1016/J.CAM.2012.10.010MaRDI QIDQ1932770zbMATH OpenOpenAlexFDO

Authors Siegfried M. Rump

Publication date 21 January 2013

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.2012.10.010

zbMATH Keywords

(extremely) ill-conditionederror analysiserror-free transformationlinear systemrigorous error boundsrounding to nearest

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22)

Recommendations

• Accurate solution of dense linear systems. II: Algorithms using directed rounding
• Accurate Sum and Dot Product
• scientific article; zbMATH DE number 1440903
• Iterative refinement for ill-conditioned linear systems
• Accelerating the solution of linear systems by iterative refinement in three precisions

Cited in

(8)

• Accurate solution of dense linear systems. II: Algorithms using directed rounding
• Verified partial eigenvalue computations using contour integrals for Hermitian generalized eigenproblems
• Verified numerical computations for large-scale linear systems.
• A fast and efficient algorithm for solving ill-conditioned linear systems
• Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?
• On the iterative refinement of the solution of ill-conditioned linear system of equations
• Verified eigenvalue and eigenvector computations using complex moments and the Rayleigh-Ritz procedure for generalized Hermitian eigenvalue problems
• Method for verifying solutions of sparse linear systems with general coefficients

Describes a project that uses

Uses Software

• Matlab
• BLAS
• MPFR
• ARPREC
• XBLAS
• INTLAB

This page was built for publication: Accurate solution of dense linear systems I: Algorithms in rounding to nearest

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