A Gröbner basis technique for Padé appro
✍
Patrick Fitzpatrick; John Flynn
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 381 KB
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 m