A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
From MaRDI portal
Publication:4095774
DOI10.1093/imamat/17.3.267zbMath0329.65026OpenAlexW1980792329MaRDI QIDQ4095774
Publication date: 1976
Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imamat/17.3.267
Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05)
Related Items
Corrected sequential linear programming for sparse minimax optimization, Householder reflections versus Givens rotations in sparse orthogonal decomposition, A survey of the advances in the exploitation of the sparsity in the solution of large problems, Solving large and sparse linear least-squares problems by conjugate gradient algorithms, Sparse linear problems and the least squares method, Class of optimization algorithms for the solution of large nonlinear programming problems. I, Matrix enlarging methods and their application, Interpolation on a triangulated 3D surface, Nonlinear Iterative Hard Thresholding for Inverse Scattering, Solution of sparse linear least squares problems using Givens rotations, Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition, A combined direct-iterative approach for solving large scale singular and rectangular consistent systems of linear equations, A direct method for the solution of sparse linear least squares problems, Comparison of two pivotal strategies in sparse plane rotations, A survey of direct methods for sparse linear systems, Pivot selection and row ordering in Givens reduction on sparse matrices, Bibliography on the evaluation of numerical software, Unnamed Item, Stability analysis of the method of seminormal equations for linear least squares problems, Rank and null space calculations using matrix decomposition without column interchanges
