Numerical procedure for solving a minimization eigenvalue problem (Q1115097): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimax algebra / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A characterization of the minimum cycle mean in a digraph / rank | |||
Normal rank | |||
Latest revision as of 13:05, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numerical procedure for solving a minimization eigenvalue problem |
scientific article |
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
