Any Eigenpair (Eigenvalues (Iterative Methods))

From Algorithm Wiki
Revision as of 07:52, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Description

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

Related Problems

Subproblem: Any Eigenvalue, All Eigenpairs, Eigenpair with the Largest Eigenvalue, Eigenpair closest to mu

Related: All Eigenvalues, All Eigenpairs, Eigenpair with the Largest Eigenvalue, Eigenpair closest to mu

Parameters

$n$: dimension of matrix

Table of Algorithms

Currently no algorithms in our database for the given problem.