Sparse linear problems and the least squares method

DOI10.1007/BF01087548zbMath0656.65042OpenAlexW2019615598MaRDI QIDQ1110269

Khakim D. Ikramov

Publication date: 1987

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01087548

zbMATH Keywords

numerical resultscovariance matrixleast squares problemblock orthogonal methods

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09)

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of sparse linear least squares problems using Givens rotations
• Y12M. Solution of large and sparse systems of linear algebraic equations. Documentation of subroutines
• Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
• A direct method for the solution of sparse linear least squares problems
• Comparison of two pivotal strategies in sparse plane rotations
• Pivot selection and row ordering in Givens reduction on sparse matrices
• On systems of linear equations of the form \(A^tAx=b\); error analysis and certain consequences for structural applications
• Numerical methods for solving linear least squares problems
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• On Row and Column Orderings for Sparse Least Squares Problems
• Classification of the systems of ordinary differential equations and practical aspects in the numerical integration of large systems
• Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
• Partial pivoting strategies for symmetric gaussian elimination
• Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
• A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
• Algorithmic Aspects of Vertex Elimination on Graphs
• Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
• Algorithmic Aspects of Vertex Elimination on Directed Graphs
• Incomplete Nested Dissection for Solving n by n Grid Problems
• Iterative refinement of linear least squares solutions I
• Solving linear least squares problems by Gram-Schmidt orthogonalization
• The least squares problem and pseudo-inverses
• The Solution of Large Sparse Unsymmetric Systems of Linear Equations
• On the reduction of a symmetric matrix to tridiagonal form

This page was built for publication: Sparse linear problems and the least squares method