Reduced Rank Methods For Solving Least Squares Problems

Reduced Rank Methods for Solving Least Squares Problems

Low Rank Approximation

Data Approximation by Low-complexity Models details the theory, algorithms, and applications of structured low-rank approximation. Efficient local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. Much of the text is devoted to describing the applications of the theory including: system and control theory; signal processing; computer algebra for approximate factorization and common divisor computation; computer vision for image deblurring and segmentation; machine learning for information retrieval and clustering; bioinformatics for microarray data analysis; chemometrics for multivariate calibration; and psychometrics for factor analysis. Software implementation of the methods is given, making the theory directly applicable in practice. All numerical examples are included in demonstration files giving hands-on experience and exercises and MATLAB® examples assist in the assimilation of the theory.

Numerical Methods for Least Squares Problems, Second Edition

The method of least squares, discovered by Gauss in 1795, is a principal tool for reducing the influence of errors when fitting a mathematical model to given observations. Applications arise in many areas of science and engineering. The increased use of automatic data capturing frequently leads to large-scale least squares problems. Such problems can be solved by using recent developments in preconditioned iterative methods and in sparse QR factorization. The first edition of Numerical Methods for Least Squares Problems was the leading reference on the topic for many years. The updated second edition stands out compared to other books on this subject because it provides an in-depth and up-to-date treatment of direct and iterative methods for solving different types of least squares problems and for computing the singular value decomposition. It also is unique because it covers generalized, constrained, and nonlinear least squares problems as well as partial least squares and regularization methods for discrete ill-posed problems. The bibliography of over 1,100 historical and recent references provides a comprehensive survey of past and present research in the field. This book will be of interest to graduate students and researchers in applied mathematics and to researchers working with numerical linear algebra applications.