Learn More
A new Fortran code, ESOLVE, is discussed for the exact solution of systems of linear equations with multiple-precision integer coefficients by congruence techniques. The code runs significantly faster than other codes which use congruential techniques. Test runs on two classes of problems reveal that the congruential method is competitive with the two-step(More)
For k + 1 power series a 0 (z); : : :; a k (z), we present a new iterative, look-ahead algorithm for numerically computing Pad e-Hermite systems and simultaneous Pad e systems along a diagonal of the associated Pad e tables. The algorithm computes the systems at all those points along the diagonal at which the associated striped Sylvester and mosaic(More)
DESCRIPTION Descriptions of the main algorithm, ESOLVE, and accompanying subroutines SUBBND, MRADIX, and FRADIX, together with experimental results, are given in [1]. ALGORITHM [Summary information and part of the listing is printed here. The complete listing is available from the ACM Algorithm Distribution Service (see inside back cover for order form), or(More)
tire 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(More)
, s~p~t~ in psrt v/t~s~c #~035 ABSTRACT 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 algor!thm for constructing these sequences is presented. It is shown that the cofactor sequence yields directly a sequence of Padd(More)
For a vector of k + 1 power series we introduce two new types of rational approximations, the weak Pad&Hermite form and the weak Pad&Hermite fraction. A recurrence relation is then presented which computes Pad&Hermite forms along with their weak counterparts along a sequence of perfect points in the Pad&Hermite table. The recurrence relation results in a(More)
In a recent paper Cabay et al. 1996a], the authors develop a fast, iterative, look-ahead algorithm for numerically computingPad e-Hermite systems and simultaneous Pad e systems along a diagonal of the associatedPad e tables. Included there is a detailed error analysis showing that the algorithm is weakly stable. In this paper, we describe a Fortran(More)
  • 1