Incremental norm estimation for dense and sparse matrices

DOI10.1023/A:1021946924741zbMath1010.65019OpenAlexW1547196823MaRDI QIDQ698566

Christof Vömel, Iain S. Duff

Publication date: 1 May 2003

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021946924741

zbMATH Keywords

numerical examplescondition numbermatrix normapproximate singular vectorsimplicit LU factorizationincremental estimatorsrank-revealingsparse triangular matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (2)

A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix ⋮ Approximating the extreme Ritz values and upper bounds for the \(A\)-norm of the error in CG

Uses Software

• testmatrix

This page was built for publication: Incremental norm estimation for dense and sparse matrices