Quantum-inspired algorithm for truncated total least squares solution

DOI10.1016/J.CAM.2024.116042MaRDI QIDQ6582001zbMATH OpenFDO

Authors Qian Zuo, Yimin Wei, Hua Xiang

Publication date 1 August 2024

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

randomized algorithmstotal least squares problemstruncated total least squaresquantum-inspired algorithmsample model

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Basic linear algebra (15Axx) Numerical linear algebra (65Fxx)

Cites work

• scientific article; zbMATH DE number 3868512 (Why is no real title available?)
• scientific article; zbMATH DE number 51511 (Why is no real title available?)
• scientific article; zbMATH DE number 1734139 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
• A novel modified TRSVD method for large-scale linear discrete ill-posed problems
• A quantum-inspired classical algorithm for recommendation systems
• Algebraic relations between the total least squares and least squares problems with more than one solution
• An Analysis of the Total Least Squares Problem
• Computation of exponentials in transient data
• Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf die Theorie der Hohlraumstrahlung).
• Error estimates for linear systems with applications to regularization
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• Fast monte-carlo algorithms for finding low-rank approximations
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
• IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
• Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization
• Perturbation bounds for the Cholesky and QR factorizations
• Perturbation theory for pseudo-inverses
• Quantum random access memory
• Quantum regularized least squares solver with parameter estimate
• Randomized algorithms for large-scale inverse problems with general Tikhonov regularizations
• Randomized algorithms for total least squares problems
• Randomized core reduction for discrete ill-posed problem
• Regularization by Truncated Total Least Squares
• Regularization tools version \(4.0\) for matlab \(7.3\)
• Regularization with randomized SVD for large-scale discrete inverse problems
• Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning
• The Analysis for the Total Least Squares Problem with More Than One Solution
• The Lepskii principle revisited
• The Modified Truncated SVD Method for Regularization in General Form
• The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
• The use of monotonicity for choosing the regularization parameter in ill-posed problems
• Tikhonov regularization and randomized GSVD
• Use of the regularization method in non-linear problems

This page was built for publication: Quantum-inspired algorithm for truncated total least squares solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582001)