✦ LIBER ✦

A simple formula to find the closest consistent matrix to a reciprocal matrix

✍ Scribed by Benítez, J.; Izquierdo, J.; Pérez-García, R.; Ramos-Martínez, E.

Book ID: 122195157
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 350 KB
Volume: 38
Category: Article
ISSN: 0307-904X
DOI: 10.1016/j.apm.2014.01.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A numerical procedure for finding the po

A numerical procedure for finding the positive definite matrix closest to a patterned matrix

✍ H. Hu; I. Olkin 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 380 KB

An algorithm to find the smallest possib

An algorithm to find the smallest possible values in a matrix to satisfy the M-matrix condition

✍ Yang, T.C. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 126 KB

Orthogonality to matrix subspaces, and a

Orthogonality to matrix subspaces, and a distance formula

✍ Grover, Priyanka 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 236 KB

On the Distance to the Closest Matrix wi

On the Distance to the Closest Matrix with Triple Zero Eigenvalue

✍ Kh. D. Ikramov; A. M. Nazari 📂 Article 📅 2003 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 144 KB

Computing a consistent approximation to

Computing a consistent approximation to a generalized pairwise comparisons matrix

✍ W.W. Koczkodaj; M. Orłowski 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 411 KB

Using fast matrix multiplication to find

Using fast matrix multiplication to find basic solutions

✍ Peter A. Beling; Nimrod Megiddo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 679 KB

We consider the problem of finding a basic solution to a system of linear constraints (in standard form) given a non-basic solution to the system. We show that the known arithmetic complexity bounds for this problem admit considerable improvement. Our technique, which is similar in spirit to that us