Abstract
A general class of Newton algorithms on Graßmann and Lagrange-Graßmann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition on the choice of coordinate systems. Our result extends and unifies previous convergence results for Newton's method on a manifold. Using special choices of the coordinates, new numerical algorithms are derived for principal component analysis and invariant subspace computations with improved computational complexity properties.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.