Eigenpair closest to mu (Eigenvalues (Iterative Methods))

From Algorithm Wiki
Revision as of 10:21, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Eigenpair closest to mu (Eigenvalues (Iterative Methods))}} == 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 == No parameters found. == Table of Algorithms ==...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

No parameters found.

Table of Algorithms

Currently no algorithms in our database for the given problem.

Time Complexity graph

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

Space Complexity graph

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

Pareto Decades graph

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