Approximation of positive matrices by transitive matrices
From MaRDI portal
comparison of methodsmultiple stationary vectorsNewton-Kantorovich algorithmnumerical experimentstransitive matrices
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.
Recommendations
- A method for approximating symmetrically reciprocal matrices by transitive matrices
- A probabilistic algorithm for finding the term rank of non-negative matrices
- Reciprocal matrices: properties and approximation by a transitive matrix
- Consistency adjustments for pairwise comparison matrices
- A new algorithm for constrained matrix least squares approximations
Cites work
- Consistency adjustments for pairwise comparison matrices
- scientific article; zbMATH DE number 3650737 (Why is no real title available?)
- scientific article; zbMATH DE number 3265848 (Why is no real title available?)
- Max-algebra and pairwise comparison matrices
- On the optimal consistent approximation to pairwise comparison matrices
Cited in
(4)
This page was built for publication: Approximation of positive matrices by transitive matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q815227)