About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of Symbolic Computation
Paper
An algorithm for solving parametric linear systems
Abstract
We present a theoretical foundation for studying parametric systems of linear equations and prove an efficient algorithm for identifying all parametric values (including degenerate cases) for which the system is consistent. The algorithm gives a small set of regimes where for each regime, the solutions of the specialized systems may be given uniformly. For homogeneous linear systems, or for systems where the right hand side Is arbitrary, this small set is irredundant. We discuss in detail practical issues concerning implementations, with particular emphasis on simplification of results, Examples are given based on a close implementation of the algorithm in SCRATCHPAD II. We also give a complexity analysis of the Gaussian elimination method and compare that with our algorithm. © 1992, Academic Press Limited. All rights reserved.