Fraction-free Computation of Matrix Pad E Systems
نویسنده
چکیده
We present a fraction-free approach to the computation of matrix Pad e systems. The method relies on determining a modiied Schur complement for the coeecient matrices of the linear systems of equations that are associated to matrix Pad e approximation problems. By using this modiied Schur complement for these matrices we are able to obtain a hybrid fraction-free algorithm for their computation. The algorithm that is presented is general and requires no extra assumptions on its input. The algorithm is also fast in the sense that it is usually an order of magnitute faster than existing fraction-free methods for the corresponding problem.
منابع مشابه
Transpose-free Matrix Pad e Via Lanczos Method
A transpose-free two-sided nonsymmetric Lanczos method is developed for multiple starting vectors on both the left and right. The method is applied to the computation of the matrix Pad e approximation to a linear dynamical system. The result is a method which can be labeled Transpose-Free Matrix Pad e Via Lanczos. The method is mathematically equivalent to the two-sided methods, but avoids the ...
متن کاملFraction-free Computation of Catrix Padé Systems
We present a fraction-free approach to the computation of matrix Padé systems. The method relies on determining a modified Schur complement for the coefficient matrices of the linear systems of equations that are associated to matrix Padé approximation problems. By using this modified Schur complement for these matrices we are able to obtain a fast hybrid fraction-free algorithm for their compu...
متن کاملRecursiveness in Matrix Rational Interpolation Problems 1 2
We consider the problem of computing solutions to a variety of matrix rational interpolation problems. These include the partial realization problem for matrix power series and Newton-Pad e, Hermite-Pad e, Simultaneous Pad e, M-Pad e and multipoint Pad e approximation problems along with their matrix generalizations. A general recurrence relation is given for solving these problems. Unlike othe...
متن کاملMatrix Padé Fractions and Their Computation
For matrix power series with coefficients over a field, the notion of a matrix power series remainder sequence and its corresponding cofactor sequence are introduced and developed. An algorithm for constructing these sequences is presented. It is shown that the cofactor sequence yields directly a sequence of Pad6 fractions for a matrix power series represented as a quotient B(z)-lA(z). When B(z...
متن کاملFraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs
We present a new set of algorithms for computation of matrix rational interpolants and one-sided matrix greatest common divisors. Examples of these interpolants include Padé approximants, Newton–Padé, Hermite–Padé, and simultaneous Padé approximants, and more generally M-Padé approximants along with their matrix generalizations. The algorithms are fast and compute all solutions to a given probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997