A Gröbner basis technique for Padé approximation

DOI10.1016/S0747-7171(08)80087-9zbMath0746.68045MaRDI QIDQ1190745

S. Singh

Publication date: 26 September 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

Gröbner basisPadé approximants

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Padé approximation (41A21)

Related Items (7)

Polynomial-division-based algorithms for computing linear recurrence relations ⋮ On the ideal associated to a linear code ⋮ Some remarks on Fitzpatrick and Flynn's Gröbner basis technique for Padé approximation. ⋮ Gröbner basis approach to list decoding of algebraic geometry codes ⋮ Gröbner bases and generalized Padé approximation ⋮ Algebraic structure of quasicyclic codes ⋮ Gröbner bases and combinatorics for binary codes

Cites Work

• Extension of the Berlekamp-Massey algorithm to N dimensions
• New constructive methods in classical ideal theory
• On the complexity of computing syzygies
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Gröbner basis technique for Padé approximation