scientific article; zbMATH DE number 4043151
[For the entire collection see Zbl 0636.00016.] Two algorithms for singular value decomposition are studied in a unifying framework: the power method and the Chebyshev iteration method. They allow to compute adaptively the partial SVD (dominant, smallest or intermediate triplets) of matrices that are slowly time varying and perturbed by noise. The only routines used are matrix vector multiplication and orthogonalization procedures. Some original convergence expressions are derived and convergence rates of both methods are compared. Some backward error theorems permit the control of the convergence level with respect to the notes level.
- Canonical correlations and generalized SVD: Applications and new algorithms
- Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values
- Eigendecomposition versus singular value decomposition in adaptive array signal processing
- Structured total least squares and \(L_ 2\) approximation problems
- Convergences of adaptive block simultaneous iteration method for eigenstructure decomposition
- Background subtraction using adaptive singular value decomposition
- scientific article; zbMATH DE number 3886984 (Why is no real title available?)
- Gradient-Type Algorithms for Partial Singular Value Decomposition
- scientific article; zbMATH DE number 124018 (Why is no real title available?)
- scientific article; zbMATH DE number 125153 (Why is no real title available?)
- scientific article; zbMATH DE number 1545337 (Why is no real title available?)
- Conjugate decomposition and its applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780353)