|
This article is cited in 3 scientific papers (total in 3 papers)
Berlekamp–Massey Algorithm, Continued Fractions, Padé Approximations, and Orthogonal Polynomials
S. B. Gashkova, I. B. Gashkovb a M. V. Lomonosov Moscow State University
b Karlstads University
Abstract:
The Berlekamp–Massey algorithm (further, the BMA) is interpreted as an algorithm for constructing Padé approximations to the Laurent series over an arbitrary field with singularity at infinity. It is shown that the BMA is an iterative procedure for constructing the sequence of polynomials orthogonal to the corresponding space of polynomials with respect to the inner product determined by the given series. The BMA is used to expand the exponential in continued fractions and calculate its Pade approximations.
Received: 16.02.2005
Citation:
S. B. Gashkov, I. B. Gashkov, “Berlekamp–Massey Algorithm, Continued Fractions, Padé Approximations, and Orthogonal Polynomials”, Mat. Zametki, 79:1 (2006), 45–59; Math. Notes, 79:1 (2006), 41–54
Linking options:
https://www.mathnet.ru/eng/mzm2673https://doi.org/10.4213/mzm2673 https://www.mathnet.ru/eng/mzm/v79/i1/p45
|
|