Eigenpair closest to mu: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
(One intermediate revision by the same user not shown)
Line 12: Line 12:
== Parameters ==  
== Parameters ==  


No parameters found.
$n$: dimension of matrix


== Table of Algorithms ==  
== Table of Algorithms ==  
Line 35: Line 35:


[[File:Eigenvalues (Iterative Methods) - Eigenpair closest to mu - Time.png|1000px]]
[[File:Eigenvalues (Iterative Methods) - Eigenpair closest to mu - Time.png|1000px]]
== Space Complexity Graph ==
[[File:Eigenvalues (Iterative Methods) - Eigenpair closest to mu - Space.png|1000px]]
== Time-Space Tradeoff ==
[[File:Eigenvalues (Iterative Methods) - Eigenpair closest to mu - Pareto Frontier.png|1000px]]

Latest revision as of 09:08, 28 April 2023

Description

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

Related Problems

Generalizations: Any Eigenpair

Related: All Eigenvalues, Any Eigenvalue, All Eigenpairs, Eigenpair with the Largest Eigenvalue

Parameters

$n$: dimension of matrix

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Inverse iteration 1921 $O(n^{2})$ $O(n^{2})$ Exact Deterministic Time
LOBPCG algorithm 1948 $O(n^{2})$ $O(n)$? Exact Deterministic
Homotopy method 1992 $O(n^{2})$ $O(n^{2})$?? Exact Deterministic Time
Folded spectrum method 1934 $O(n^{2})$ $O(n)$? Exact Deterministic Time

Time Complexity Graph

Eigenvalues (Iterative Methods) - Eigenpair closest to mu - Time.png