Quantum-inspired algorithm for truncated total least squares solution

Cites Work

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

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