The LSQR method for solving tensor least-squares problems
DOI10.1553/etna_vol55s92zbMath1477.65067OpenAlexW3212392389MaRDI QIDQ2055520
Asmaa Khouia, Hassane Sadok, Abdeslem Hafid Bentbib
Publication date: 1 December 2021
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://etna.mcs.kent.edu/volumes/2021-2030/vol55/abstract.php?vol=55&pages=92-111
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Multilinear algebra, tensor calculus (15A69)
Related Items (2)
Uses Software
Cites Work
- Tensor Decompositions and Applications
- Krylov subspace projection method for Sylvester tensor equation with low rank right-hand side
- Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
- Fundamental tensor operations for large-scale data analysis using tensor network formats
- Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Tensor rank is NP-complete
- Deblurring Images
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- A Multilinear Singular Value Decomposition
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The LSQR method for solving tensor least-squares problems
