Solution of sparse linear least squares problems using Givens rotations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3538731 (Why is no real title available?)
- scientific article; zbMATH DE number 3546670 (Why is no real title available?)
- scientific article; zbMATH DE number 3604265 (Why is no real title available?)
- A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
- A direct method for the solution of sparse linear least squares problems
- An Optimal Agorithm for Symbolic Factorization of Symmetric Matrices
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
- Least Squares Computations by Givens Transformations Without Square Roots
- Numerical methods for solving linear least squares problems
- Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
- The economical storage of plane rotations
- The least squares problem and pseudo-inverses
Cited in
(54)- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- Householder reflections versus Givens rotations in sparse orthogonal decomposition
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- Class of optimization algorithms for the solution of large nonlinear programming problems. I
- A survey of direct methods for sparse linear systems
- A hybrid algorithm for the solution of a single commodity spatial equilibrium model
- Linear algebra on high performance computers
- 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
- Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations
- Parallel \textit{QR} factorization of block-tridiagonal matrices
- Sparse QR factorization on a massively parallel computer
- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
- A note on the implementation of the accelerated successive orthogonal projections method for solving large scale linear feasibility problems
- Sparse linear problems and the least squares method
- Accuracy of preconditioned CG-type methods for least squares problems.
- Approximating sparse Hessian matrices using large-scale linear least squares
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
- Sparse matrices, and the estimation of variance components by likelihood methods
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- Optimal matrix approximants in structural identification
- Use of the Gibbs sampler to invert large, possibly sparse, positive definite matrices
- Rank and null space calculations using matrix decomposition without column interchanges
- Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A direct method for sparse least squares problems with lower and upper bounds
- Predicting the structure of sparse orthogonal factors
- The solution of large-scale least-squares problems on supercomputers
- An algorithm to compute a sparse basis of the null space
- Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
- Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
- Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
- Comparison of two pivotal strategies in sparse plane rotations
- A note on the computation of an orthonormal basis for the null space of a matrix
- Preconditioning techniques for nonsymmetric and indefinite linear systems
- A class of incomplete orthogonal factorization methods. II: Implemetation and results
- Solving combinatorial optimization problems using Karmarkar's algorithm
- Stability analysis of the method of seminormal equations for linear least squares problems
- Solving large and sparse linear least-squares problems by conjugate gradient algorithms
- A direct method for the solution of sparse linear least squares problems
- Approximation by cubic C^ 1-splines on arbitrary triangulations
- A parallel projection method for overdetermined nonlinear systems of equations
- Separators and structure prediction in sparse orthogonal factorization
- The projection method for solving nonlinear systems of equations under the most violated constraint control
- An algorithm for solving sparse nonlinear least squares problems
- Matrix enlarging methods and their application
- Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
- A pipelined Givens method for computing the QR factorization of a sparse matrix
- A decomposition method for solving a large-scale sparse system of linear equalities and inequalities by sequential quadratic programming
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems
- Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
- Combinatorial Aspects in Sparse Elimination Methods
This page was built for publication: Solution of sparse linear least squares problems using Givens rotations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152201)
