Usted se encuentra revisando un registro bibliográfico de la BDU Para conocer mas sobre la Base de Datos Unificada haga click en el ícono del home

Titulos:
Solving least squares problems / Charles L. Lawson, Richard J. Hanson
Idiomas:
eng
Lugar de Edición:
Philadelphia:
Editor:
SIAM,
Fecha de Edición:
c1995
Notas Formateada:
1.Introduction -- 2.Analysis of the least squares problem -- 3.Orthogonal decomposition by certain elementary orthogonal transformations -- 4.Orthogonal decomposition by singular value decomposition -- 5.Perturbation theorems for singular values -- 6.Bounds for the condition number of a triangular matrix -- 7.The pseudoinverse -- 8.Perturbation bounds for the pseudoinverse -- 9.Pertubation bounds for the solution of problem LS -- 10.Numerical computations using elementary orthogonal transformations -- 11.Computing the solution for the overdetermined of exactly determined full rank problem -- 12.Computation of the covariance matrix of the solution parameters -- 13.Computing of the covariance matrix of the solution parameters -- 14.Computing the solution for the undetermined full rank problem -- 14.Computing the solution for problem LS with possibly deficient pseudorank -- 15.Analysis of computing errors for householder transformations -- 16.Analysis of computing errors for the problem LS -- 17.Analysis of computing errors for the problem LS using mixed precision arithmetic -- 18.Computing of the singular value decomposition and the solution of problem LS -- 19.Other methods for least squares problems -- 20.Linear least squares with linear equality constraints using a basics of the null space -- 21.Linear least squares with linear equality constraints by direct elimination -- 22.Linear least squares with linear equality -- 23.Linear least squares with linear inequality constraints -- 24.Modifying a QR decomposition to add or remove column vectors -- 25.Practical analysis of least squares problems -- 26.Examples of some methods of analyzing a least squares problem -- 27.Modifying a QR decomposition to add or remove row vectors with application to sequential processing of problems having a large or banded coefficient matrix
Palabras clave:
MINIMOS CUADRADOS
Leader:
cam
Campo 003:
AR-BaIT
Campo 008:
270401t1995t xxu|||||||||||||||||eng||
Campo 040:
^aITBA^cITBA
Campo 041:
0 ^aeng
Campo 100:
1 ^aLawson, Charles L.^99726
Campo 245:
10^aSolving least squares problems /^cCharles L. Lawson, Richard J. Hanson
Campo 246:
Campo 260:
^aPhiladelphia:^bSIAM,^cc1995
Campo 300:
^axii, 337 p.
Campo 490:
1 ^aClassics in applied mathematics^v15
Campo 505:
0 ^a1.Introduction -- 2.Analysis of the least squares problem -- 3.Orthogonal decomposition by certain elementary orthogonal transformations -- 4.Orthogonal decomposition by singular value decomposition -- 5.Perturbation theorems for singular values -- 6.Bounds for the condition number of a triangular matrix -- 7.The pseudoinverse -- 8.Perturbation bounds for the pseudoinverse -- 9.Pertubation bounds for the solution of problem LS -- 10.Numerical computations using elementary orthogonal transformations -- 11.Computing the solution for the overdetermined of exactly determined full rank problem -- 12.Computation of the covariance matrix of the solution parameters -- 13.Computing of the covariance matrix of the solution parameters -- 14.Computing the solution for the undetermined full rank problem -- 14.Computing the solution for problem LS with possibly deficient pseudorank -- 15.Analysis of computing errors for householder transformations -- 16.Analysis of computing errors for the problem LS -- 17.Analysis of computing errors for the problem LS using mixed precision arithmetic -- 18.Computing of the singular value decomposition and the solution of problem LS -- 19.Other methods for least squares problems -- 20.Linear least squares with linear equality constraints using a basics of the null space -- 21.Linear least squares with linear equality constraints by direct elimination -- 22.Linear least squares with linear equality -- 23.Linear least squares with linear inequality constraints -- 24.Modifying a QR decomposition to add or remove column vectors -- 25.Practical analysis of least squares problems -- 26.Examples of some methods of analyzing a least squares problem -- 27.Modifying a QR decomposition to add or remove row vectors with application to sequential processing of problems having a large or banded coefficient matrix
Campo 650:
4^918756^aMINIMOS CUADRADOS
Campo 700:
1 ^aHanson, Richard J.^97736
Proveniencia:
^aInstituto Tecnológico Buenos Aires (ITBA) - Biblioteca
Seleccionar y guardar el registro Haga click en el botón del carrito
Institucion:
Instituto Tecnológico Buenos Aires (ITBA)
Dependencia:
Biblioteca

Compartir este registro en Redes Sociales

Seleccionar y guardar el registro Haga click en el botón del carrito