Numerical Methods for Least Squares Problems - Couverture souple

Bj�rck, �ke

9781611977943: Numerical Methods for Least Squares Problems

Couverture souple

ISBN 10 : 1611977940 ISBN 13 : 9781611977943

Editeur : Society for Industrial & Applied Mathematics,U.S., 2024

Afficher les exemplaires de cette �dition comportant l?ISBN

0 D'occasion

2 Neuf

De EUR 81,04

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 a great number of areas in sciences 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 Problem was the leading reference on least squares problems for many years. The updated second edition stands out compared to other books on the topic 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;
covers generalized, constrained, and nonlinear least squares problems as well as partial least squares and regularization methods for discrete ill-posed problems; and
contains a bibliography with more than 1100 historical and recent references, providing a unique survey of past and present research in the field.

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.

� propos de l?auteur

�ke Bj�rck is a professor emeritus at Link�ping University, Sweden. He is the author of many research papers and books on numerical analysis and matrix computations. He served as managing editor of the journal BIT Numerical Mathematics from 1993 to 2003 and he is a Fellow of SIAM.

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.