RUS  ENG
Full version
JOURNALS // Matematicheskie Zametki // Archive

Mat. Zametki, 2006 Volume 79, Issue 1, Pages 45–59 (Mi mzm2673)

This article is cited 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.

UDC: 517.51

Received: 16.02.2005

DOI: 10.4213/mzm2673


 English version:
Mathematical Notes, 2006, 79:1, 41–54

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024