Notes on computing minimal approximant bases

Challenges in Symbolic Computation Software

计算机科学;物理学

Arne Storjohann

Others  :  http://drops.dagstuhl.de/opus/volltexte/2006/776/pdf/06271.StorjohannArne.Paper.776.pdf
PID  :  6596

学科分类：计算机科学（综合）

来源: CEUR

【 摘 要 】

Let k be a field. The vector Hermite Pad´e approximation problem takes as input • N ∈ Z>0, the desired order of the approximant;• F = (f_1, . . . , f_m)T ∈k[x]~(m×s), a vector of truncated formal power series, say each f_i ∈ k[x]~(1×s) of degree bounded by N − 1;• n = (n_1, . . . , n_m) ∈ Z~m_[−1,N−1],a tuple of degree constraints with norm defined byknk := (n_1 + 1) + · · · + (n_m + 1).