Numerical procedure for solving a minimization eigenvalue problem
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.
- Estimates of the periodic points for nonexpansive operators
- Modulated phases and upsilon points in a spin model with helical ordering
- Maximum cycle-means of weighted digraphs
- scientific article; zbMATH DE number 5847291 (Why is no real title available?)
- Uncertain dynamical systems defined by pseudomeasures
- scientific article; zbMATH DE number 5221528 (Why is no real title available?)
This page was built for publication: Numerical procedure for solving a minimization eigenvalue problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115097)