Computationally efficient orthogonalization for pairwise comparisons method
[EN] Orthogonalization is one of few mathematical methods conforming to mathematical standards for approximation. Finding a consistent PC matrix of a given an inconsistent PC matrix is the main goal of a pairwise comparisons method. We introduce an orthogonalization for pairwise comparisons matrix b...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2024 |
| País: | España |
| Institución: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/221506 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/221506 |
| Access Level: | acceso abierto |
| Palabra clave: | Pairwise comparison Orthogonalization Orthogonal basis Inner matrix product Approximation Group theory |
| Sumario: | [EN] Orthogonalization is one of few mathematical methods conforming to mathematical standards for approximation. Finding a consistent PC matrix of a given an inconsistent PC matrix is the main goal of a pairwise comparisons method. We introduce an orthogonalization for pairwise comparisons matrix based on a generalized Frobenius inner matrix product. The proposed theory is supported by numerous examples and visualizations. |
|---|