Efficient initials for computing maximal eigenpair (Q335562)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6647016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient initials for computing maximal eigenpair |
scientific article; zbMATH DE number 6647016 |
Statements
Efficient initials for computing maximal eigenpair (English)
0 references
2 November 2016
0 references
Efficient initials for an inverse iteration established algorithm for computing the maximal eigenpair of a class of real matrices are proposed. The initials introduced here avoid the collapse of the algorithm and are proven to be very efficient. These initials are based on analytic estimates of the maximal eigenvalue and a mimic of its eigenvector and are used by the authors in the study of stochastic stability speed. The same problem for computing the next to the maximal eigenpair is also studied and representative numerical examples are used to illustrate the effectiveness of the algorithms.
0 references
Perron-Frobenius theorem
0 references
power iteration
0 references
Rayleigh quotient iteration
0 references
efficient initial
0 references
tridiagonal matrix
0 references
\(Q\)-matrix
0 references
algorithm
0 references
maximal eigenpair
0 references
eigenvector
0 references
stochastic stability
0 references
numerical examples
0 references
0 references
0.8570240139961243
0 references
0.8238266110420227
0 references
0.8155736923217773
0 references
0.798639714717865
0 references
0.7897917628288269
0 references
