Subresultants of (x-)^m and (x-)^n, Jacobi polynomials and complexity

DOI10.1016/J.JSC.2019.10.003MaRDI QIDQ2188990zbMATH OpenOpenAlexFDO

Authors Alin Bostan, Teresa Krick, Agnes Szanto, Marcelo Valdettaro

Publication date 15 June 2020

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

Full work available at URL https://arxiv.org/abs/1812.11789

zbMATH Keywords

algorithmscomplexityJacobi polynomialssubresultants

Mathematics Subject Classification ID

Solving polynomial systems; resultants (13P15) Toeplitz, Cauchy, and related matrices (15B05) Classical hypergeometric functions, ({}_2F_1) (33C05) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10) Symbolic computation and algebraic computation (68W30)

Abstract: In an earlier article together with Carlos D'Andrea [BDKSV2017], we described explicit expressions for the coefficients of the order-$d$ polynomial subresultant of $(x-alpha{)}^m$ and $$ with respect to Bernstein's set of polynomials $$, for $0led<minm,n$. The current paper further develops the study of these structured polynomials and shows that the coefficients of the subresultants of $(x-alpha{)}^m$ and $$ with respect to the monomial basis can be computed in linear arithmetic complexity, which is faster than for arbitrary polynomials. The result is obtained as a consequence of the amazing though seemingly unnoticed fact that these subresultants are scalar multiples of Jacobi polynomials up to an affine change of variables.

Recommendations

• scientific article; zbMATH DE number 3901165
• Sub-range Jacobi polynomials
• On the zeros of subrange Jacobi polynomials
• scientific article; zbMATH DE number 3935682
• scientific article; zbMATH DE number 404505
• Some recurrence relations for the Jacobi polynomials \(P_n^{(\alpha, \beta)} (x)\)
• On Jacobi Polynomials Of Several Variables
• Subalgebras of gc_N and Jacobi Polynomials
• scientific article; zbMATH DE number 6912213
• Resultants and discriminants of the multiplication polynomials of Jacobi elliptic functions

Cites work

• A note on Padé approximations and generalized hypergeometric functions
• A Padé family of iterations for the matrix sign function and related problems.
• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• Bigradients and the Problem of Routh and Hurwitz
• Computer Algebra of Polynomials and Rational Functions
• Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
• GFUN
• scientific article; zbMATH DE number 6530429 (Why is no real title available?)
• scientific article; zbMATH DE number 3922806 (Why is no real title available?)
• scientific article; zbMATH DE number 3493262 (Why is no real title available?)
• scientific article; zbMATH DE number 1253989 (Why is no real title available?)
• scientific article; zbMATH DE number 517393 (Why is no real title available?)
• scientific article; zbMATH DE number 3288161 (Why is no real title available?)
• scientific article; zbMATH DE number 3083637 (Why is no real title available?)
• Modern computer algebra
• On the complexity of the Lickteig-Roy subresultant algorithm
• Orthogonal Polynomials With Weight Function (1 - x)^α( l + x)^β + Mδ(x + 1) + Nδ(x - 1)
• Some results on computational complexity
• Subresultants and Reduced Polynomial Remainder Sequences
• Subresultants in multiple roots: an extremal case
• Subresultants revisited.
• Sylvester-Habicht sequences and fast Cauchy index computation
• The method of creative telescoping

Cited in

(3)

• Subresultant of Bernstein polynomials and its application in computing the parametric greatest common divisor
• Relations among multi-polynomial subresultants
• Computing the greatest common divisor of several parametric univariate polynomials via generalized subresultants

Describes a project that uses

Uses Software

• gfun

This page was built for publication: Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188990)