Abstract
only when necessary to avoid confusion, e.g.
Keywords
Eigenvalues and eigenvectorsConfusionMathematicsMatrix (chemical analysis)Calculus (dental)Applied mathematicsMathematical optimizationPhysicsMaterials scienceMedicinePsychologyPsychoanalysis
Related Publications
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understoo...
A Direct Formulation for Sparse PCA Using Semidefinite Programming
Given a covariance matrix, we consider the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the number o...
Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
In principle, the exponential of a matrix could be computed in many ways. Methods involving approximation theory, differential equations, the matrix eigenvalues, and the matrix ...
A new approach to variable metric algorithms
An approach to variable metric algorithms has been investigated in which the linear search sub-problem no longer becomes necessary. The property of quadratic termination has bee...
A spectral algorithm for envelope reduction of sparse matrices
Abstract The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelope‐reducing reordering is...
Publication Info
- Year
- 1951
- Type
- article
- Volume
- 9
- Issue
- 1
- Pages
- 17-29
- Citations
- 1749
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1749
OpenAlex
Cite This
Walter E. Arnoldi
(1951).
The principle of minimized iterations in the solution of the matrix eigenvalue problem.
Quarterly of Applied Mathematics
, 9
(1)
, 17-29.
https://doi.org/10.1090/qam/42792
Identifiers
- DOI
- 10.1090/qam/42792