Motivated by multiplication of numerical univariate polynomials with various kinds of truncation we study corresponding bivariate problems A(x, y)•B(x, y) = C(x, y) in the algebraic setting with indeterminate coefficients over suitable ground fields, counting essential multiplications only. The rectangular case concerning factors A, B with entries xiyjfor i ≤ n, j≤ m, e. g. with m = n, has complexity (2n + 1)2. Here multiplication with single truncation, computing the product C(x,y) mod xn+1, or mod yn+1, seems still to have the same full multiplication complexity, as is well-known for the univariate case, while the double truncation case mod (x n+1, y n+1) admits the reduced upper bound 3n2 + 4n + 1, opposed to a lower bound of 2n2 + 4n + 1. We have a similar saving factor for thetriangular case with factors A, B of total degree n to be multiplied mod (xn+1,xny,…,yn+1). There remains the issue to find the exact complexities of these multiplication problems.
CITATION STYLE
Schönhage, A. (1995). Bivariate polynomial multiplication patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 948, pp. 70–81). Springer Verlag. https://doi.org/10.1007/3-540-60114-7_5
Mendeley helps you to discover research relevant for your work.