Adaptive Lanczos methods for recursive condition estimation
From MaRDI portal
Publication:1186619
DOI10.1007/BF02145580zbMath0794.65043MaRDI QIDQ1186619
Gene H. Golub, William R. Ferng, Robert J. Plemmons
Publication date: 28 June 1992
Published in: Numerical Algorithms (Search for Journal in Brave)
convergencenumerical experimentsLanczos methodcondition numbercovariance matrixrecursive least squaressingular valuessignal processingCholesky factor
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Related Items
Tracking the condition number for RLS in signal processing ⋮ Krylov-subspace methods for the Sylvester equation ⋮ An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition ⋮ Block RLS using row Householder reflections ⋮ Conference celebrating the 60th birthday of Robert J. Plemmons. Papers from the conference, Winston-Salem, NC, USA, January 1999 ⋮ Dedication to Robert J. Plemmons ⋮ An alternative algorithm for a sliding window ULV decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing
- Least squares modifications with inverse factorizations: Parallel implications
- Tracking the condition number for RLS in signal processing
- The behavior of eigenvalues and singular values under perturbations of restricted rank
- Rank-one modification of the symmetric eigenproblem
- Factorization methods for discrete sequential estimation
- Incremental Condition Estimation for Sparse Matrices
- A Survey of Condition Number Estimation for Triangular Matrices
- On the rate of growth of condition numbers for convolution matrices
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- Fast Adaptive Condition Estimation
- Square-root algorithms for least-squares estimation
- Methods for Modifying Matrix Factorizations
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Some Modified Matrix Eigenvalue Problems
- Recursive Least Squares on a Hypercube Multiprocessor Using the Covariance Factorization
- Updating the singular value decomposition