On Stabilizing Matrices by Simple Row Operations
ResearchPublished 1965
ResearchPublished 1965
An affirmative answer is given to the following question: Let A be a nonsingular matrix. Are there matrices P and Q, each a product of diagonal and permutation matrices, such tha PAQ is stable; i.e., all of its eigenvalues have negative real part? This question arises in attempting to solve the equation Ax = b with an analog computer. The problem of finding a computationally practical method of doing what this Memorandum shows can be done remains open. An affirmative answer is given to the following question: Let A be a nonsingular matrix. Are there matrices P and Q, each a product of diagonal and permutation matrices, such that PAQ is stable; i.e., all of its eigenvalues have negative real part? This question arises in attempting to solve the equation Ax = b with an analog computer. The result is an existence theorem rather than an effective algorithm. The problem of finding a computationally practical method of doing what this Memorandum shows can be done remains open.
This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.