✦ LIBER ✦

Computing multivariate polynomials in parallel

✍ Scribed by L.G. Valiant

Book ID: 113162197
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 174 KB
Volume: 11
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(80)90033-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Parallel Evaluation of Multivaria

On the Parallel Evaluation of Multivariate Polynomials

✍ Hyafil, Laurent 📂 Article 📅 1979 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 359 KB

Algorithms for Computing Sparse Shifts f

Algorithms for Computing Sparse Shifts for Multivariate Polynomials

✍ Dima Yu. Grigoriev; Y. N. Lakshman 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 196 KB

Computational aspects of multivariate po

Computational aspects of multivariate polynomial interpolation

✍ Thomas Sauer 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 911 KB

Additive polynomial preconditioners for

Additive polynomial preconditioners for parallel computers

✍ Loyce M Adams; Elizabeth G Ong 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 998 KB

Linear recurring sequences for computing

Linear recurring sequences for computing the resultant of multivariate polynomials

✍ J. Llovet; R. Martínez; J.A. Jaén 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 584 KB

Using Schubert Basis to Compute with Mul

Using Schubert Basis to Compute with Multivariate Polynomials

✍ Axel Kohnert; Sébastien Veigneau 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Schubert polynomials are a linear basis of the ring of polynomials in x , . . . , x 1 n Ž with coefficients in y , . . . , y . We describe the multiplicative structure multiplica-1 n . tion by a single variable of this space. We also describe the structure of the ring as a free module of rank n! ov