10 The total least squares problem
S Van Huffel, H Zha - 1993 - Elsevier
Publisher Summary The total least squares (TLS) method is one of the several linear
parameter estimation techniques that have been devised to compensate for data errors. One …
parameter estimation techniques that have been devised to compensate for data errors. One …
Least squares methods
Å Björck - Handbook of numerical analysis, 1990 - Elsevier
The linear least squares problem is a computational problem of primary importance in many
applications. Assume for example that one wants to fit a linear mathematical model to given …
applications. Assume for example that one wants to fit a linear mathematical model to given …
Randomized numerical linear algebra: Foundations and algorithms
PG Martinsson, JA Tropp - Acta Numerica, 2020 - cambridge.org
This survey describes probabilistic algorithms for linear algebraic computations, such as
factorizing matrices and solving linear systems. It focuses on techniques that have a proven …
factorizing matrices and solving linear systems. It focuses on techniques that have a proven …
Indexing by latent semantic analysis
A new method for automatic indexing and retrieval is described. The approach is to take
advantage of implicit higher‐order structure in the association of terms with documents …
advantage of implicit higher‐order structure in the association of terms with documents …
A solution to Plato's problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge.
TK Landauer, ST Dumais - Psychological review, 1997 - psycnet.apa.org
How do people know as much as they do with as little information as they get? The problem
takes many forms; learning vocabulary from text is an especially dramatic and convenient …
takes many forms; learning vocabulary from text is an especially dramatic and convenient …
Composition in distributional models of semantics
J Mitchell, M Lapata - Cognitive science, 2010 - Wiley Online Library
Vector‐based models of word meaning have become increasingly popular in cognitive
science. The appeal of these models lies in their ability to represent meaning simply by …
science. The appeal of these models lies in their ability to represent meaning simply by …
[图书][B] Numerical methods for least squares problems
Å Björck - 2024 - SIAM
Excerpt More than 25 years have passed since the first edition of this book was published in
1996. Least squares and least-norm problems have become more significant with every …
1996. Least squares and least-norm problems have become more significant with every …
Randomized block krylov methods for stronger and faster approximate singular value decomposition
Since being analyzed by Rokhlin, Szlam, and Tygert and popularized by Halko, Martinsson,
and Tropp, randomized Simultaneous Power Iteration has become the method of choice for …
and Tropp, randomized Simultaneous Power Iteration has become the method of choice for …
[HTML][HTML] The ubiquitous Kronecker product
CF Van Loan - Journal of computational and applied mathematics, 2000 - Elsevier
The Kronecker product has a rich and very pleasing algebra that supports a wide range of
fast, elegant, and practical algorithms. Several trends in scientific computing suggest that …
fast, elegant, and practical algorithms. Several trends in scientific computing suggest that …
[图书][B] Matrix Algorithms: Volume II: Eigensystems
GW Stewart - 2001 - SIAM
This book, Eigensystems, is the second volume in a projected five-volume series entitled
Matrix Algorithms. The first volume treated basic decompositions. The three following this …
Matrix Algorithms. The first volume treated basic decompositions. The three following this …