Abstract
Given a system of linear equations with more equations than unknowns, we seek to determine that vector of unknowns which minimizes the norm of the residual of the system in the uniform sense. A method is presented which obtains this solution after a finite number of trial solutions have been examined in a sequence in which the residual norm decreases with each successive step. The implementation of the method exploits efficient matrix decomposition updating schemes resulting in reduced computation times when compared with a presently popular method.
Keywords
MathematicsResidualSystem of linear equationsNorm (philosophy)Linear systemComputationCoefficient matrixSequence (biology)Linear equationApplied mathematicsMatrix (chemical analysis)LU decompositionMatrix decompositionMathematical analysisAlgorithmEigenvalues and eigenvectors
Related Publications
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Preface 1. Introduction. Problems to be considered Characteristics of 'real-world' problems Finite-precision arithmetic and measurement of error Exercises 2. Nonlinear Problems ...
Technical note: Derivation of equivalent computing algorithms for genomic predictions and reliabilities of animal merit
Conventional prediction of dairy cattle merit involves setting up and solving linear equations with the number of unknowns being the number of animals, typically millions, multi...
Methods of conjugate gradients for solving linear systems
An iterative algorithm is given for solving a system Ax=k of n linear equations in n unknowns. The solution is given in n steps. It is shown that this method is a special case o...
For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution
Abstract We consider linear equations y = Φ x where y is a given vector in ℝ n and Φ is a given n × m matrix with n < m ≤ τ n , and we wish to solve for x ∈ ℝ m . We suppose ...
Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
The nuclear norm (sum of singular values) of a matrix is often used in convex heuristics for rank minimization problems in control, signal processing, and statistics. Such heuri...
Publication Info
- Year
- 1976
- Type
- article
- Volume
- 13
- Issue
- 3
- Pages
- 293-309
- Citations
- 20
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
20
OpenAlex
Cite This
Alan Cline
(1976).
A Descent Method for the Uniform Solution to Over-Determined Systems of Linear Equations.
SIAM Journal on Numerical Analysis
, 13
(3)
, 293-309.
https://doi.org/10.1137/0713027
Identifiers
- DOI
- 10.1137/0713027