Sparse multivariate factorization by mean of a few bivariate factorizations

11/08/2016
by   Bernard Parisse, et al.
0

We describe an algorithm to factor sparse multivariate polynomials using O(d) bivariate factorizations where d is the number of variables. This algorithm is implemented in the Giac/Xcas computer algebra system.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2020

On Factor Left Prime Factorization Problems for Multivariate Polynomial Matrices

This paper is concerned with factor left prime factorization problems fo...
research
06/21/2021

Multivariate Power Series in Maple

We present MultivariatePowerSeries, a Maple library introduced in Maple ...
research
12/06/2017

Rings: an efficient Java/Scala library for polynomial rings

In this paper we briefly discuss Rings --- an efficient lightweight libr...
research
03/22/2021

A Succinct Multivariate Lazy Multivariate Tower AD for Weil Algebra Computation

We propose a functional implementation of Multivariate Tower Automatic D...
research
06/21/2020

Decoupling Shrinkage and Selection in Gaussian Linear Factor Analysis

Factor Analysis is a popular method for modeling dependence in multivari...
research
07/30/2012

Improving multivariate Horner schemes with Monte Carlo tree search

Optimizing the cost of evaluating a polynomial is a classic problem in c...
research
01/24/2020

Sparse Interpolation in Terms of Multivariate Chebyshev Polynomials

Sparse interpolation refers to the exact recovery of a function as a sho...

Please sign up or login with your details

Forgot password? Click here to reset