๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new algorithm for sparse interpolation of multivariate polynomials

โœ Scribed by Annie Cuyt; Wen-shin Lee

Book ID
108281486
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
386 KB
Volume
409
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Modular Algorithm for Sparse Multivariat
Modular Algorithm for Sparse Multivariate Polynomial Interpolationand its Parallel Implementation
โœ HIROKAZU MURAO; TETSURO FUJISE ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 885 KB

A new algorithm for sparse multivariate polynomial interpolation is presented. It is a multi-modular extension of the Ben-Or and Tiwari algorithm, and is designed to be a practical method to construct symbolic formulas from numeric data produced by vector or massively-parallel processors. The main i

Three new algorithms for multivariate po
Three new algorithms for multivariate polynomial GCD
โœ Tateaki Sasaki; Masayuki Suzuki ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 885 KB

Three new algorithms for multivariate polynomial GCD (greatest common divisor) are given. The first is to calculate a GrSbner basis with a certain term ordering. The second is to calculate the subresultant by treating the coefficients w.r.t, the main variable as truncated power series. The third is