Abstract
A new method of checking the consistency of precedence matrices is demonstrated. The method is based on the theorem that a precedence matrix is consistent if and only if every principal submatrix has at least one zero row or zero column. Because this method recognizes inconsistencies in their implicit form whereas the conventional method recognized only explicit contradictions, a considerable saving in time and effort can be effected, since the process of making explicit all the implications of a precedence matrix particularly a larger one, is a tedious time-consuming operation.
- 1 EDW.~RD W. BAP~_~KIN, Precedence m~trices, University of California ~Ianagement Sciences Research Project, Research Report No. 26, Dccembcr, 1953.Google Scholar
- 2 A L. LI~INER, W. A. NOTZ, J. L. SMITH, AND 2~k. WEINBERG~R, Organizing a negwork of computers to meet deadlines, Proceedings of the Eastern Joint Computer Conference, December 9-13, 1957, Washington, D. C., pp 115-128Google Scholar
Index Terms
- A New Method of Checking the Consistency of Precedence Matrices
Recommendations
New breakdown-free variant of AINV method for nonsymmetric positive definite matrices
This paper proposes a new breakdown-free preconditioning technique, called SAINV-NS, of the AINV method of Benzi and Tuma for nonsymmetric positive definite matrices. The resulting preconditioner which is an incomplete factorization of the inverse of a ...
The Arnoldi Method for Normal Matrices
For large Hermitian matrices the preconditioned conjugate gradient algorithm and the Lanczos algorithm are the most important methods for solving linear systems and for computing eigenvalues. There are various generalizations to the nonsymmetric case ...
A new method for computing Moore-Penrose inverse matrices
The Moore-Penrose inverse of an arbitrary matrix (including singular and rectangular) has many applications in statistics, prediction theory, control system analysis, curve fitting and numerical analysis. In this paper, an algorithm based on the ...
Comments