Numerical procedure for solving a minimization eigenvalue problem (Q1115097)
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 4086879
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Numerical procedure for solving a minimization eigenvalue problem |
scientific article; zbMATH DE number 4086879 |
Statements
Numerical procedure for solving a minimization eigenvalue problem (English)
0 references
1989
0 references
A numerical procedure for solving the left eigenvalue problem \(\lambda +L(k)=\min_ j[L(j)+K(j,k)],\) and its right counterpart, is described; K is a (known) real \(n\times n\) matrix. The first stage uses a modification of the procedure studied by \textit{R. M. Karp} [Discr. Math. 23, 309-311 (1978; Zbl 0386.05032)] and \textit{M. v. Golitschek} [Numer. Math. 39, 65- 84 (1982; Zbl 0541.65009)] for finding the minimum cyclic average \(\lambda\) of K along with a minimizing cycle. The second stage employs this information to generate L, by a very similar algorithm.
0 references
minimal cycles in directed graphs
0 references
eigenvalue problem in minimax algebras
0 references
graph algorithms
0 references
left eigenvalue problem
0 references
0.7285871505737305
0 references
0.7234212756156921
0 references
