Power algorithms for \((\max, +)\)- and bipartite \((\min,\max,+)\)-systems (Q1592446)
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 1553148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Power algorithms for \((\max, +)\)- and bipartite \((\min,\max,+)\)-systems |
scientific article; zbMATH DE number 1553148 |
Statements
Power algorithms for \((\max, +)\)- and bipartite \((\min,\max,+)\)-systems (English)
0 references
5 November 2001
0 references
The main result of the present paper is the presentation of alternative algorithms to compute the eigenvalue and associated eigenvectors of a \((\max,+)\)-system, or a bipartite \((\min,\max,+)\)-system that satisfies certain natural assumptions. The algorithms are illustrated by means of a simple example. The authors use an iterative approach to compute the eigenvalues and eigenvectors of discrete event systems. Their algorithms are compared with known power algorithms.
0 references
non-expansive mappings
0 references
monotonicity
0 references
eigenvalue
0 references
eigenvectors
0 references
\((\max,+)\)-system
0 references
iterative approach
0 references
discrete event systems
0 references
0.8289922475814819
0 references
0.811944842338562
0 references
0.8098003268241882
0 references
0.8008841276168823
0 references
