Corpus ID: 236881303

Intra-Basis Multiplication of Polynomials Given in Various Polynomial Bases

@article{Karami2021IntraBasisMO,
  title={Intra-Basis Multiplication of Polynomials Given in Various Polynomial Bases},
  author={Saeed Karami and Morad Ahmadnasab and Mahmoud Hadizadeh and Amirhossein Amiraslani},
  journal={ArXiv},
  year={2021},
  volume={abs/2108.01558}
}
Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In this work, we present formulas and techniques for polynomial multiplications expressed in a variety of well-known polynomial bases without any change of basis. In particular, we take into consideration degree-graded polynomial bases including, but not limited… Expand

Figures and Tables from this paper

References

SHOWING 1-10 OF 41 REFERENCES
Algorithms for polynomials in Bernstein form
TLDR
Bernstein forms for various basic polynomial procedures are developed, and are found to be of similar complexity to their customary power forms, establishing the viability of systematic computation with the Bernstein form, avoiding the need for (numerically unstable) basis conversions. Expand
On Polynomial Multiplication in Chebyshev Basis
  • P. Giorgi
  • Mathematics, Computer Science
  • IEEE Transactions on Computers
  • 2012
TLDR
The reduction scheme does not rely on basis conversions and it is demonstrated that it is efficient in practice, and a linear time equivalence is shown between the polynomial multiplication problem under monomial basis and under Chebyshev basis. Expand
Division algorithms for Bernstein polynomials
TLDR
Three division algorithms are presented for univariate Bernstein polynomials: an algorithm for finding the quotient and remainder of two univariate polynmials, an algorithms for calculating the GCD of an arbitrary collection of univariatePolynomial, and an algorithm that converts each problem from the Bernstein basis to an equivalent problem in the monomial basis. Expand
Dividing polynomials when you only know their values
A recent paper by Amiraslani, Corless, Gonzalez-Vega and Shakoori studies polynomial algebra by values, without first converting to another basis such as the monomial basis. In this talk I expand onExpand
Differentiation matrices for univariate polynomials
Differentiation matrices are in wide use in numerical algorithms, although usually studied in an ad hoc manner. We collect here in this review paper elementary properties of differentiation matricesExpand
The Bézout matrix in the Lagrange basis
A recent paper by Amiraslani, Corless, Gonzalez-Vega and Shakoori studies polynomial algebra by values, without first converting to another basis such as the monomial basis. Their methodology isExpand
Generic Reductions for In-place Polynomial Multiplication
TLDR
This work provides a series of reductions starting with any linear-space multiplication algorithm, which yield in-place versions with the same asymptotic time complexity as the out-of-place version. Expand
Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis
TLDR
It is shown that these division algorithms for univariate polynomials represented with respect to Lagrange and Bernstein basis are quadratic in the degrees of their inputs, as in the power basis case. Expand
Differentiation matrices in polynomial bases
Explicit differentiation matrices in various polynomial bases are presented in this work. The idea is to avoid any change of basis in the process of polynomial differentiation. This article concernsExpand
General linearization formulae for products of continuous hypergeometric-type polynomials
The linearization of products of wavefunctions of exactly solvable potentials often reduces to the generalized linearization problem for hypergeometric polynomials (HPs) of a continuous variable,Expand
...
1
2
3
4
5
...