The Geometry of Algorithms with Orthogonality Constraints
Explore this paper's citation graph
Summary
The theory proposed here provides a taxonomy for numerical linear algebra algorithms that provide a top level mathematical view of previously unrelated algorithms and developers of new algorithms and perturbation theories will benefit from the theory.
- Type
- article
- Published
- 1998-06-19
- Cited by
- 3,040
- References
- 96
- OpenAlex
- https://openalex.org/W2045512849
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:16632320
Keywords
Mathematics, Algorithm, Eigenvalues and eigenvectors, Conjugate gradient method, Orthogonality
References
- A Biographical Dictionary of Scientists
- Trace Minimization Algorithm for the Generalized Eigenvalue Problem
- A Minimization Method for the Solution of the Eigenproblem Arising in Structural Dynamics
- The Biographical dictionary of scientists, Mathematicians
- Adaptive spectral estimation by the conjugate gradient method
- Riemannian Geometry: A Modern Introduction
- Space-time clutter covariance matrix computation and interference subspace tracking
- Adaptive algorithms for estimating eigenvectors of correlation type matrices
- Lectures on finite precision computations
- Semi-Riemannian Geometry With Applications to Relativity
- Adaptive data orthogonalization
- A comprehensive introduction to differential geometry
- High-order reconstructions of the Ge(100) surface.
- Richtungsfelder und Fernparallelismus in n-dimensionalen Mannigfaltigkeiten
- Recursive updating the eigenvalue decomposition of a covariance matrix
- The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, sparse, symmetric matrix
- IMPROVING THE ACCURACY OF COMPUTED EIGENVALUES AND EIGENVECTORS
- The computation of Lagrange-multiplier estimates for constrained minimization
- A Jacobi-Davidson Iteration Method for Linear Eigenvalue Problems
- Fast subspace decomposition
Cited by
- Semidefinite and Cone Programming Bibliography/Comments
- Geometric Direct Search Algorithms for Image Registration
- SIFTing Through Scales
- Robust statistics over riemannian manifolds for computer vision
- Model Based Principal Component Analysis with Application to Functional Magnetic Resonance Imaging.
- Trust-region methods on Riemannian manifolds with applications in numerical linear algebra
- Low dimensional approximations: problems and algorithms
- Projection Based M-Estimators
- Differential geometry of matrix inversion
- Independent Component Analysis and Extensions with Noise and Time: A Bayesian Ying-Yang Learning Perspective
- On the Aggregation of Local Risk Models for Global Risk Management
- Neuromechanical Control Architectures of Arthropod Locomotion
- An orthogonal matrix optimization by Dual Cayley Parametrization Technique
- Approximate inference for determinantal point processes
- A Riemannian approach to large-scale constrained least-squares with symmetries
- Trust-region algorithms for the generalized symmetric eigenvalue problem
- Inner-outer Iterative Methods for Eigenvalue Problems - Convergence and Preconditioning
- Order in Complex Systems of Nonlinear Oscillators: Phase Locked Subspaces
- CRITICAL POINT ANALYSIS OF JOINT DIAGONALIZATION CRITERIA
- Statistical and Geometric Modeling of Spatio-Temporal Patterns for Video Understanding
Related papers
- Computation of dominant eigenvalues and eigenvectors: A comparative study of algorithms.
- Motivating the Concept of Eigenvectors via Cryptography.
- Elementary Linear Algebra
- Numerical methods for nonlinear two-parameter eigenvalue problems
- How well-conditioned can the eigenvalue problem be?
- Application of Maple in Teaching of Linear Algebra
- A perturbation‐based method for a parameter‐dependent nonlinear eigenvalue problem
- Accelerating eigenvector and pseudospectra computation using blocked multi-shift triangular solves
- Matricial computations: Classroom practice with a computer algebra system