Numerical methods for least squares problems

DOI10.1137/1.9781611977950MaRDI QIDQ6575438zbMATH OpenFDO

Authors Åke Björck

Publication date 19 July 2024

Published in Other Titles in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611977950

zbMATH Keywords

bibliographyCholesky factorizationcondition numbersconjugate gradient methodsdirect methodsGaussian eliminationill-conditioned problemsiterative methodsiterative refinementmethod of least squaresmethod of normal equationsQR decompositionsingular value decompositionssparse problems

Mathematics Subject Classification ID

Factorization of matrices (15A23) Linear regression; mixed models (62J05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computational methods for sparse matrices (65F50) Numerical optimization and variational techniques (65K10)

Recommendations

• scientific article; zbMATH DE number 852536
• scientific article; zbMATH DE number 852525
• Least squares data fitting with applications
• scientific article; zbMATH DE number 46532
• Numerical Methods for Large Sparse Linear Least Squares Problems

Cited in

(16)

• The iterated Golub-Kahan-Tikhonov method
• Sparse identification and mathematical framework for analyzing metabolic-regulatory networks
• The influence of data-errors in two algorithms for emission CT
• Convergence analysis of fractional Tikhonov scheme in learning theory
• Solution of large linear discrete ill-posed problems by randomized block Krylov methods
• Block conjugate gradient methods with error norm estimates for least squares problems
• On global and local convergence of iterative linear quadratic optimization algorithms for discrete time nonlinear control
• Sparse linear least-squares problems
• Low-rank regularized convex-non-convex problems for image segmentation and completion
• A Unified Framework for Formalizing Matrix Decomposition Proofs
• An augmented Lagrangian algorithm for constrained nonlinear least-squares
• Randomized Krylov-Projected Iterated Tikhonov Regularization for Large-Scale Ill-posed Problems Under A Posteriori Stopping Rule
• The Refined Joint Bidiagonalization Method and an Implicitly Restarted Algorithm for Large GSVD Computations
• Minkowski tensors for point clouds and voxelized data: robust, asymptotically unbiased estimators
• A multi-step sketch-and-project solver for large sparse inconsistent linear systems: applications in signal and image processing
• Sampling, approximation, and interpolation of differential forms by admissible integral k-meshes

This page was built for publication: Numerical methods for least squares problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575438)