A direct method for the solution of sparse linear least squares problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4215266 (Why is no real title available?)
- scientific article; zbMATH DE number 46532 (Why is no real title available?)
- scientific article; zbMATH DE number 3633692 (Why is no real title available?)
- scientific article; zbMATH DE number 3220012 (Why is no real title available?)
- scientific article; zbMATH DE number 3309634 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
- A New Variant of Gaussian Elimination
- A Note on the Stability of Gaussian Elimination
- An algorithm for linear least squares problems with equality and nonnegativity constraints
- Condition numbers and equilibration of matrices
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- On computing certain elements of the inverse of a sparse matrix
- Solution of sparse linear least squares problems using Givens rotations
- The Direct Solution of the Discrete Poisson Equation on Irregular Regions
- The elimination form of the inverse and its application to linear programming
- The least squares problem and pseudo-inverses
Cited in
(19)- Class of optimization algorithms for the solution of large nonlinear programming problems. I
- Strong rank revealing LU factorizations
- A survey of direct methods for sparse linear systems
- Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Sparse linear problems and the least squares method
- An algorithmic approach for the analysis of extrapolated iterative schemes applied to least-squares problems
- Tensor methods for large sparse systems of nonlinear equations
- Perturbation analysis of saddle-point problems
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- Discrete least-squares finite element methods
- Rank and null space calculations using matrix decomposition without column interchanges
- The solution of large-scale least-squares problems on supercomputers
- Solution of sparse linear least squares problems using Givens rotations
- Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
- Comparison of two pivotal strategies in sparse plane rotations
- Solving large and sparse linear least-squares problems by conjugate gradient algorithms
- Solving large linear least squares problems with linear equality constraints
- Rank revealing \(LU\) factorizations
This page was built for publication: A direct method for the solution of sparse linear least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1157668)
