A locally optimal rank revealing product decomposition
From MaRDI portal
Publication:2029861
DOI10.1016/j.laa.2021.01.007zbMath1470.65090OpenAlexW3127823554MaRDI QIDQ2029861
Publication date: 4 June 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2021.01.007
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- A randomized algorithm for the decomposition of matrices
- Perturbation of the SVD in the presence of small singular values
- An accurate product SVD algorithm
- 4SID: Subspace algorithms for the identification of combined deterministic-stochastic systems
- Riemannian geometry of Grassmann manifolds with a view on algorithmic computation
- Rank-constrained optimization and its applications
- Computing the SVD of a General Matrix Product/Quotient
- Updating a Generalized URV Decomposition
- A Grassmann--Rayleigh Quotient Iteration for Computing Invariant Subspaces
- Rank Decisions in Matrix Quotient Decompositions
- Accelerated Line-search and Trust-region Methods
- Computing the Singular Value Decomposition of a Product of Two Matrices
- On- and off-line identification of linear state-space models
- Subspace model identification Part 1. The output-error state-space model identification class of algorithms
- The Geometry of Algorithms with Orthogonality Constraints
- Computing rank-revealing QR factorizations of dense matrices
- Numerical Rank Deficiency in Matrix Products
- Cubically Convergent Iterations for Invariant Subspace Computation
- Perturbation bounds in connection with singular value decomposition
This page was built for publication: A locally optimal rank revealing product decomposition
