Robust incremental condition estimation
This paper presents an improved version of incremental condition estimation, a technique for tracking the extremal singular values of a triangular matrix as it is being constructed one column at a time. We present a new motivation for this estimation technique using orthogonal projections. The paper focuses on an implementation of this estimation scheme in an accurate and consistent fashion. In particular, we address the subtle numerical issues arising in the computation of the eigensystem of a symmetric rank-one perturbed diagonal 2 {times} 2 matrix. Experimental results show that the resulting scheme does a good job in estimating the extremal singular values of triangular matrices, independent of matrix size and matrix condition number, and that it performs qualitatively in the same fashion as some of the commonly used nonincremental condition estimation schemes.
Year of publication: |
2008-02-12
|
---|---|
Authors: | Bischof, C.H. ; Tang, P.T.P. |
Subject: | general and miscellaneous//mathematics, computing, and information science | MATRICES | SINGULARITY | FACTORIZATION | ALGORITHMS | EIGENVALUES |
Saved in:
Saved in favorites
Similar items by subject
-
Paardekooper, M.H.C., (1988)
-
Inexact Iterations for the Approximation of Eigenvalues and Eigenvectors
Smit, P., (1996)
-
AN APPLICATION OF GAME THEORY: FUNDING INTERDEPENDENT MC and A UPGRADE DECISIONS
B. G. SCOTT, (2008)
- More ...