Approximation of positive matrices by transitive matrices (Q815227): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Consistency adjustments for pairwise comparison matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the optimal consistent approximation to pairwise comparison matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Max-algebra and pairwise comparison matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5550446 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3208805 / rank | |||
Normal rank | |||
Revision as of 10:26, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation of positive matrices by transitive matrices |
scientific article |
Statements
Approximation of positive matrices by transitive matrices (English)
0 references
16 February 2006
0 references
The paper describes an algorithm for the approximation of any elementwise positive matrix by a transitive one. The method is based on a Newton-Kantorovich algorithm for the approximation of symmetrically reciprocal positive matrices by transient ones. The paper contains numerical experiments and comparisons with other algorithms from the field.
0 references
transitive matrices
0 references
multiple stationary vectors
0 references
comparison of methods
0 references
Newton-Kantorovich algorithm
0 references
numerical experiments
0 references
