References

S. M. Rump. Fast and Parallel Interval Arithmetic. BIT Numerical Mathematics 39, 534–554 (1999). ↩¹

N. Revol and P. Théveny. Parallel Implementation of Interval Matrix Multiplication. Reliable Computing 19, 91 (2013). ↩¹

S. Miyajima. Fast enclosure for solutions of Sylvester equations. Linear Algebra and its Applications 439, 856–878 (2013). ↩¹ ↩² ↩³ ↩⁴

S. Oishi. Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation. Linear Algebra and its Applications 324, 133–146 (2001). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

S. Miyajima. Fast enclosure for all eigenvalues in generalized eigenvalue problems. Journal of Computational and Applied Mathematics 233, 2994–3004 (2010). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶ ↩¹⁷ ↩¹⁸ ↩¹⁹

T. Ogita and K. Aishima. Iterative refinement for singular value decomposition based on matrix multiplication. Journal of Computational and Applied Mathematics 369, 112512 (2020). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

Z. Bujanović, D. Kressner and C. Schröder. Iterative refinement of Schur decompositions. Numerical Algorithms 92, 247–267 (2023). Published online in 2022; preprint arXiv:2203.10879. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹²

S. M. Rump and S. Oishi. A note on Oishi's lower bound for the smallest singular value of linearized Galerkin equations. Japan Journal of Industrial and Applied Mathematics 41, 1097–1104 (2024). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶

S. Oishi. Lower bounds for the smallest singular values of generalized asymptotic diagonal dominant matrices. Japan Journal of Industrial and Applied Mathematics 40, 1569–1585 (2023). ↩¹

S. M. Rump. Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse. BIT Numerical Mathematics 51, 367–384 (2011). ↩¹ ↩²

T. Ogita, S. M. Rump and S. Oishi. Accurate Sum and Dot Product. SIAM Journal on Scientific Computing 26, 1955–1988 (2005). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵

D. E. Knuth. The Art of Computer Programming, Volume 2: Seminumerical Algorithms (Addison-Wesley, 1997). ↩¹

T. J. Dekker. A floating-point technique for extending the available precision. Numerische Mathematik 18, 224–242 (1971). ↩¹

N. J. Higham. Accuracy and Stability of Numerical Algorithms. Second Edition (Society for Industrial and Applied Mathematics, Philadelphia, PA, 2002). ↩¹

S. M. Rump and T. Ogita. Verified Error Bounds for Matrix Decompositions. SIAM Journal on Matrix Analysis and Applications 45, 2155–2183 (2024). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵

M. Lange and S. M. Rump. Accurate floating-point matrix residuals, manuscript ("This manuscript is for review purposes only") (2026). ↩¹ ↩² ↩³ ↩⁴ ↩⁵

N. Brisebarre, J.-M. Muller and J. Picot. Testing the Sharpness of Known Error Bounds on the Fast Fourier Transform. In: 2023 IEEE 30th Symposium on Computer Arithmetic (ARITH) (Portland, Oregon, USA, Sep 2023); pp. 89–92. HAL Id: hal-04092770v2. ↩¹ ↩² ↩³

Y. Yamamoto, Y. Nakatsukasa, Y. Yanagisawa and T. Fukaya. Roundoff error analysis of the CholeskyQR2 algorithm. Electronic Transactions on Numerical Analysis 44, 306–326 (2015). ↩¹

S. M. Rump and M. Lange. 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. Journal of Computational and Applied Mathematics 434, 115332 (2023). Zbl 1517.65025. ↩¹ ↩² ↩³

N. J. Higham. Computing the Polar Decomposition—with Applications. SIAM Journal on Scientific and Statistical Computing 7, 1160–1174 (1986). ↩¹

N. J. Higham. Functions of Matrices: Theory and Computation (Philadelphia, PA: SIAM, 2008). Chapter 8 covers the polar decomposition. ↩¹

Y. Nakatsukasa, Z. Bai and F. Gygi. Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition. SIAM Journal on Matrix Analysis and Applications 31, 2700–2720 (2010). QDWH algorithm for polar decomposition. ↩¹

S. Miyajima. Verified bounds for all the singular values of matrix. Japan Journal of Industrial and Applied Mathematics 31, 513–539 (2014). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸

D. G. Feingold and R. S. Varga. Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem. Pacific Journal of Mathematics 12, 1241–1250 (1962). ↩¹

S. Miyajima. Fast Enclosure for All Eigenvalues and Invariant Subspaces in Generalized Eigenvalue Problems. SIAM Journal on Matrix Analysis and Applications 35, 1205–1225 (2014). ↩¹ ↩² ↩³ ↩⁴

J. Horáček. Interval linear and nonlinear systems. Doctoral thesis, Charles University, Department of Applied Mathematics, Prague (2019). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷

R. S. Varga. Geršgorin and His Circles (Springer Berlin Heidelberg, 2004). ↩¹ ↩² ↩³

S. M. Rump. Verification methods: Rigorous results using floating-point arithmetic. Acta Numerica 19, 287–449 (2010). ↩¹ ↩² ↩³

R. Krawczyk. Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken. Computing 4, 187–201 (1969). ↩¹

R. H. Bartels and G. W. Stewart. Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]. Communications of the ACM 15, 820–826 (1972). ↩¹

S. M. Rump. Verified Error Bounds for All Eigenvalues and Eigenvectors of a Matrix. SIAM Journal on Matrix Analysis and Applications 43, 1736–1754 (2022). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶

T. Yamamoto. Error bounds for computed eigenvalues and eigenvectors. II. Numerische Mathematik 40, 201–206 (1982). Complex matrices and pairs, with one coordinate held fixed in place of the Euclidean normalisation; Theorem 1 carries the discriminant and the enclosure radius that certify_eigenpair uses. ↩¹ ↩²

T. Yamamoto. Error bounds for computed eigenvalues and eigenvectors. Numerische Mathematik 34, 189–199 (1980). The eigenpair problem written as a nonlinear system, with an existence theorem for its zeros applied to it; real matrices and real pairs. ↩¹ ↩²

T. Ogita and K. Aishima. Iterative refinement for symmetric eigenvalue decomposition. Japan Journal of Industrial and Applied Mathematics 35, 1007–1035 (2018). Algorithm 1: RefSyEv. ↩¹ ↩² ↩³

M. Brühl. A curve tracing algorithm for computing the pseudospectrum. BIT Numerical Mathematics 36, 441–454 (1996). Zbl 0861.65034. ↩¹

P. Theveny. Numerical quality and high performance in interval linear algebra on multi-core processors (École normale supérieure de Lyon, 2014). ↩¹

S. Miyajima. Numerical enclosure for each eigenvalue in generalized eigenvalue problem. Journal of Computational and Applied Mathematics 236, 2545–2552 (2012).

J. H. Wilkinson. Rounding Errors in Algebraic Processes (Prentice-Hall, 1963). Classic text on rounding error analysis.

E. Carson and N. J. Higham. A New Analysis of Iterative Refinement and its Application to Accurate Solution of Ill-Conditioned Sparse Linear Systems. SIAM Journal on Scientific Computing 39, A2834–A2856 (2017). Mixed precision iterative refinement.