An alternative algorithm for a sliding window ULV decomposition
DOI10.1007/S00607-005-0124-4zbMATH Open1089.65036OpenAlexW1985029944MaRDI QIDQ817013FDOQ817013
Authors: Hasan Erbay, Jesse L. Barlow 
Publication date: 2 March 2006
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-005-0124-4
Recommendations
- An Alternative Algorithm for the Refinement of ULV Decompositions
- scientific article; zbMATH DE number 782070
- An algorithm and stability theory for downdating the ULV decomposition
- A modified \(\mathcal{UV}\)-decomposition algorithm
- An efficient rank detection procedure for modifying the ULV decomposition
- Sliding Window Adaptive SVD Algorithms
- Computing ULV decomposition by divide conquer method
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Almost Sure Optimality of Sliding Window Lempel–Ziv Algorithm and Variants Revisited
- An approximate alternating linearization decomposition method
numerical examplesapproximate singular value decompositionlarge scale low rank matricesnorm and condition estimatestime varying signal processingULV decomposition
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- A Survey of Condition Number Estimation for Triangular Matrices
- Downdating the Singular Value Decomposition
- Experience with a Matrix Norm Estimator
- Title not available (Why is that?)
- Updating a Rank-Revealing ULV Decomposition
- Adaptive Lanczos methods for recursive condition estimation
- An efficient rank detection procedure for modifying the ULV decomposition
- A modified Gram--Schmidt-based downdating technique for ULV decompositions with applications to recursive TLS problems
- An algorithm and stability theory for downdating the ULV decomposition
- Title not available (Why is that?)
Cited In (8)
- Title not available (Why is that?)
- Computing ULV decomposition by divide conquer method
- An algorithm and stability theory for downdating the ULV decomposition
- An efficient algorithm for rank and subspace tracking
- Title not available (Why is that?)
- Modifiable low-rank approximation to a matrix
- Title not available (Why is that?)
- An Alternative Algorithm for the Refinement of ULV Decompositions
This page was built for publication: An alternative algorithm for a sliding window ULV decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817013)
