Numerical procedure for solving a minimization eigenvalue problem

DOI10.1007/BF01398916zbMath0664.65032MaRDI QIDQ1115097

Robert B. Griffiths, Luis Mario Floría

Publication date: 1989

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133371

zbMATH Keywords

graph algorithmseigenvalue problem in minimax algebrasleft eigenvalue problemminimal cycles in directed graphs

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Paths and cycles (05C38) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (4)

Modulated phases and upsilon points in a spin model with helical ordering ⋮ Maximum cycle-means of weighted digraphs ⋮ Uncertain dynamical systems defined by pseudomeasures ⋮ Estimates of the periodic points for nonexpansive operators

Cites Work

• Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones
• A characterization of the minimum cycle mean in a digraph
• Minimax algebra

This page was built for publication: Numerical procedure for solving a minimization eigenvalue problem