Abstract
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 of a very general method which also includes Gaussian elimination. These general algorithms are essentially algorithms for finding an n dimensional ellipsoid. Connections are made with the theory of orthogonal polynomials and continued fractions.
Keywords
Related Publications
Conjugate-Gradient Methods for Large-Scale Nonlinear Optimization.
Abstract : In this paper we discuss several recent conjugate-gradient type methods for solving large-scale nonlinear optimization problems. We demonstrate how the performance of...
A Descent Method for the Uniform Solution to Over-Determined Systems of Linear Equations
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 ...
Preconditioning of Truncated-Newton Methods
In this paper we discuss the use of truncated-Newton methods, a flexible class of iterative methods, in the solution of large-scale unconstrained minimization problems. At each ...
The Theory of Matrices
Volume 2: XI. Complex symmetric, skew-symmetric, and orthogonal matrices: 1. Some formulas for complex orthogonal and unitary matrices 2. Polar decomposition of a complex matrix...
Pegasos
We describe and analyze a simple and effective iterative algorithm for solving the optimization problem cast by Support Vector Machines (SVM). Our method alternates between stoc...
Publication Info
- Year
- 1952
- Type
- article
- Volume
- 49
- Issue
- 6
- Pages
- 409-409
- Citations
- 7835
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.6028/jres.049.044