𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Gröbner basis technique for Padé approximation

✍ Scribed by Patrick Fitzpatrick; John Flynn

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
381 KB
Volume
13
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

We consider solving for a and b the congruence a ~ bh mod I, where a, b and h are (multivariable) polynomials and I is a polynomial ideal. This is a generalization of the well-known problem of Pad6 approximation of which decoding Hensel codes is a special case. We show how Gr~bner bases of modules may be used to generalize the Euclidean algorithm method of solution of the 1-variable problem.

📜 SIMILAR VOLUMES

Incomplete Gröbner basis as a preconditi
Incomplete Gröbner basis as a preconditioner for polynomial systems
✍ Yang Sun; Yu-Hui Tao; Feng-Shan Bai 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 446 KB

Precondition plays a critical role in the numerical methods for large and sparse linear systems. It is also true for nonlinear algebraic systems. In this paper incomplete Gröbner basis (IGB) is proposed as a preconditioner of homotopy methods for polynomial systems of equations, which transforms a d

A Fast Algorithm for Gröbner Basis Conve
A Fast Algorithm for Gröbner Basis Conversion and its Applications
✍ Quoc-Nam Tran 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 362 KB

The Gröbner walk method converts a Gröbner basis by partitioning the computation of the basis into several smaller computations following a path in the Gröbner fan of the ideal generated by the system of equations. The method works with ideals of zerodimension as well as positive dimension. Typicall

A Gröbner Basis Method for Modules over
A Gröbner Basis Method for Modules over Rings of Differential Operators
✍ Toshinori Oaku; Takeshi Shimoyama 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 683 KB

We study modules over the ring \(\mathcal{D}_{0}\) of differential operators with power series coeffcients. For \(\mathcal{D}_{0}\)-modules, we introduce a new notion of \(F\)-Gröbner basis and present an algorithmic method to compute it. Our method is more algebraic than that of Castro \((1986,1987