The Geometry of Algorithms with Orthogonality Constraints
Alan Edelman, T. A. Arias, Steven T. Smith
Abstract
In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue problems, electronic structures computations, and signal processing. In addition to the new algorithms, we show how the geometrical framework gives penetrating new insights allowing us to create, understand, and compare algorithms. The theory proposed here provides a taxonomy for numerical linear algebra algorithms that provide a top level mathematical view of previously unrelated algorithms. It is our hope that developers of new algorithms and perturbation theories will benefit from the theory, methods, and examples in this paper.
Create a lesson
Related papers
Discovering like a scientist: Literature-informed dimensionless learning for physical closure of data-driven equations
Hao Xu, Tianhao Wu, Dongxiao Zhang
Identifying the Shear Piezoelectric Coefficient using Physics-Informed Neural Networks under Exact Boundary and Initial Constraints
Suhas Suresh Bharadwaj
Fracture-Bench: A Controlled Benchmark Suite for Machine Learning Surrogates in Phase-Field Fracture Mechanics
Meenu Krishnan U., Maryam Hakimzadeh, Indrashish Saha et al.
Noise-resilient collective order through temporal memory in self-propelled particles
Mihir Durve, Sauro Succi, Antonio Celani
Site-orbit masked twin-branch Transformer for symmetry-constrained crystal generation
Junchi Liu, Haoran Si, Luo Yan et al.
Maximal correlation and optimal transformations of probability distributions in tensor-train format: a variational algorithm
Kayo Kinjo, Jun Ohkubo