Eigenpair with the Largest Eigenvalue: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 34: Line 34:
[[File:Eigenvalues (Iterative Methods) - Eigenpair with the Largest Eigenvalue - Space.png|1000px]]
[[File:Eigenvalues (Iterative Methods) - Eigenpair with the Largest Eigenvalue - Space.png|1000px]]


== Space-Time Tradeoff Improvements ==  
== Time-Space Tradeoff ==  


[[File:Eigenvalues (Iterative Methods) - Eigenpair with the Largest Eigenvalue - Pareto Frontier.png|1000px]]
[[File:Eigenvalues (Iterative Methods) - Eigenpair with the Largest Eigenvalue - Pareto Frontier.png|1000px]]

Revision as of 14:44, 15 February 2023

Description

Given an $n \times n$ matrix $A$, find the eigenpair (eigenvalue and associated eigenvector) of $A$ with the largest eigenvalue.

Related Problems

Generalizations: Any Eigenpair

Related: All Eigenvalues, Any Eigenvalue, All Eigenpairs, Eigenpair closest to mu

Parameters

No parameters found.

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Power Iteration 1929 $O(n^{2})$ $O(n)$ Exact Deterministic Time

Time Complexity Graph

Eigenvalues (Iterative Methods) - Eigenpair with the Largest Eigenvalue - Time.png

Space Complexity Graph

Eigenvalues (Iterative Methods) - Eigenpair with the Largest Eigenvalue - Space.png

Time-Space Tradeoff

Eigenvalues (Iterative Methods) - Eigenpair with the Largest Eigenvalue - Pareto Frontier.png