The calculation of linear least squares problems
From MaRDI portal
Recommendations
Cited in
(22)- A QR decomposition for matrix pencils
- Linear least squares problems involving fixed knots polynomial splines and their singularity study
- Solution of linear least squares via the ABS algorithm
- Solution of sparse rectangular systems using LSQR and Craig
- Stability of two direct methods for bidiagonalization and partial least squares
- Computing the conditioning of the components of a linear least-squares solution
- Estimating the Backward Error in LSQR
- QR versus Cholesky: a probabilistic analysis
- scientific article; zbMATH DE number 3876475 (Why is no real title available?)
- Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations
- Recent advances and new challenges in the use of the proper generalized decomposition for solving multidimensional models
- scientific article; zbMATH DE number 46532 (Why is no real title available?)
- scientific article; zbMATH DE number 549931 (Why is no real title available?)
- A Rank–One Reduction Formula and Its Applications to Matrix Factorizations
- Perturbation Analysis for Two-Sided (or Complete) Orthogonal Decompositions
- Fast discrete Fourier transform on generalized sparse grids
- An adaptive wavelet stochastic collocation method for irregular solutions of partial differential equations with random input data
- Distributed control of the stochastic Burgers equation with random input data
- Bayesian inverse problems for recovering coefficients of two scale elliptic equations
- A block coordinate descent linear least squares solver by quantile statistics
- An efficient LDU algorithm for the minimal least squares solution of linear systems
- Solving the linear least squares problem with very high relative accuracy
This page was built for publication: The calculation of linear least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5292938)
