2026-07-23T12:53:58Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:776 2024-03-06T11:06:57Z ddc:004 open_access

Notes on computing minimal approximant bases Storjohann, Arne Hermite Pade approximation minimal approximant bases We show how to transform the problem of computing solutions to a classical Hermite Pade approximation problem for an input vector of dimension $m imes 1$, arbitrary degree constraints $(n_1,n_2,ldots,n_m)$, and order $N := (n_1 + 1) + cdots + (n_m + 1) - 1$, to that of computing a minimal approximant basis for a matrix of dimension $O(m) imes O(m)$, uniform degree constraint $Theta(N/m)$, and order $Theta(N/m)$. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Arne Storjohann 2006 Is Part Of Dagstuhl Seminar Proceedings, Volume 6271, Challenges in Symbolic Computation Software (2006) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.06271.12 urn:nbn:de:0030-drops-7763 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06271.12 eng https://creativecommons.org/licenses/by/4.0/legalcode