Complexity of Path-Following Methods for the Eigenvalue Problem

A unitarily invariant projective framework is introduced to analyze the complexity of path-following methods for the eigenvalue problem. A condition number, and its relation to the distance to ill-posedness, is given. A Newton map appropriate for this context is defined, and a version of Smale’s γ -...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Foundations of computational mathematics 2014-04, Vol.14 (2), p.185-236
1. Verfasser:	Armentano, Diego
Format:	Artikel
Sprache:	eng
Schlagworte:	Applications of Mathematics Complexity Computation Computer Science Economics Eigenvalues Foundations Functions, Inverse Homotopy theory Invariants Linear and Multilinear Algebras Math Applications in Computer Science Mathematical analysis Mathematical models Mathematical research Mathematics Mathematics and Statistics Matrix Theory Numerical Analysis Polynomials Texts Topological manifolds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!