Recursive computation of the Frobenius-Padé approximants: theory, stability and conditioning

• Type: Academic Work
• Date: 2006

Authors

José M. A. Matos (Author) Other; Luís Tiago Paiva (Author) FEUP; Zélia da Rocha (Author) Other

Scientific classification

FOS: Natural sciences > Mathematics

CORDIS: Physical sciences > Mathematics > Applied mathematics

Associated Institutions

CMUP - CMUP - Centro de Matemática da Universidade do Porto

Other information

Abstract (EN): Frobenius-Padé́ is the name given to the class of rational approximants which, in the sense of Frobenius definition, generalizes the Padé approximation to the orthogonal series. New relations of recurrence are deduced involving the coefficients of the numerator, denominator and error series of four consecutive approximants belonging to two adjacent descendant diagonals of the Frobenius-Padé́ Table. Two algorithms for the recursive evaluation of Frobenius-Padé approximants are implemented in Fortran90 and Mathematica languages. The Fortran90 programmes were adapted in order to use the CADNA library to evaluate the cumulative effects of the computational errors and to consider only the digits that are correct in the results. We study the numerical stability and the conditioning computational issues of these approximants in an empiric sense, that is, the conclusions are based on the numerical results of a significant number of examples of different types.

Language: Portuguese

Type (Professor's evaluation): Scientific

Reference: 2006-14

No. of pages: 31