𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for Computing Sparse Shifts for Multivariate Polynomials

✍ Scribed by Dima Yu. Grigoriev; Y. N. Lakshman

Publisher
Springer
Year
2000
Tongue
English
Weight
196 KB
Volume
11
Category
Article
ISSN
0938-1279

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