Truncated LSQR for matrix least squares problems
From MaRDI portal
Cites work
- A fast randomized algorithm for overdetermined linear least-squares regression
- A low-rank in time approach to PDE-constrained optimization
- A matrix LSQR iterative method to solve matrix equation AXB=C
- A preconditioned low-rank CG method for parameter-dependent Lyapunov matrix equations.
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- A structure preserving FGMRES method for solving large Lyapunov equations
- An iterative algorithm for a least squares solution of a matrix equation
- Analysis of the Truncated Conjugate Gradient Method for Linear Matrix Equations
- Approximated least-squares solutions of a generalized Sylvester-transpose matrix equation via gradient-descent iterative algorithm
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Computational Methods for Linear Matrix Equations
- Distributed optimisation approach to least-squares solution of Sylvester equations
- Eigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case
- Factorization approach to structured low-rank approximation with applications
- Fast singular value decay for Lyapunov solutions with nonnormal coefficients
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 878984 (Why is no real title available?)
- Krylov subspace methods for linear systems with tensor product structure
- Krylov-subspace methods for the Sylvester equation
- Low-rank tensor Krylov subspace methods for parametrized linear systems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Matrices and indefinite scalar products
- Minimal residual methods for large scale Lyapunov equations
- On the convergence of Krylov methods with low-rank truncations
- On the eigenvalue decay of solutions to operator Lyapunov equations
- On the semidefinite B-Arnoldi method
- Optimal Kronecker product approximation of block Toeplitz matrices
- Randomized Gram-Schmidt process with application to GMRES
- Randomized numerical linear algebra: Foundations and algorithms
- Sketching as a tool for numerical linear algebra
- The loss of orthogonality in the Gram-Schmidt orthogonalization process
- The LSQR method for solving tensor least-squares problems
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Truncated low-rank methods for solving general linear matrix equations.
Cited in
(2)
This page was built for publication: Truncated LSQR for matrix least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969547)