Efficient Computation with Sparse and Dense Polynomials

Efficient Computation with Sparse and Dense Polynomials
Author :
Publisher :
Total Pages : 172
Release :
ISBN-10 : OCLC:827756585
ISBN-13 :
Rating : 4/5 ( Downloads)

Book Synopsis Efficient Computation with Sparse and Dense Polynomials by : Daniel Steven Roche

Download or read book Efficient Computation with Sparse and Dense Polynomials written by Daniel Steven Roche and published by . This book was released on 2011 with total page 172 pages. Available in PDF, EPUB and Kindle. Book excerpt: Computations with polynomials are at the heart of any computer algebra system and also have many applications in engineering, coding theory, and cryptography. Generally speaking, the low-level polynomial computations of interest can be classified as arithmetic operations, algebraic computations, and inverse symbolic problems. New algorithms are presented in all these areas which improve on the state of the art in both theoretical and practical performance. Traditionally, polynomials may be represented in a computer in one of two ways: as a "dense" array of all possible coefficients up to the polynomial's degree, or as a "sparse" list of coefficient-exponent tuples. In the latter case, zero terms are not explicitly written, giving a potentially more compact representation. In the area of arithmetic operations, new algorithms are presented for the multiplication of dense polynomials. These have the same asymptotic time cost of the fastest existing approaches, but reduce the intermediate storage required from linear in the size of the input to a constant amount. Two different algorithms for so-called "adaptive" multiplication are also presented which effectively provide a gradient between existing sparse and dense algorithms, giving a large improvement in many cases while never performing significantly worse than the best existing approaches. Algebraic computations on sparse polynomials are considered as well. The first known polynomial-time algorithm to detect when a sparse polynomial is a perfect power is presented, along with two different approaches to computing the perfect power factorization. Inverse symbolic problems are those for which the challenge is to compute a symbolic mathematical representation of a program or "black box". First, new algorithms are presented which improve the complexity of interpolation for sparse polynomials with coefficients in finite fields or approximate complex numbers. Second, the first polynomial-time algorithm for the more general problem of sparsest-shift interpolation is presented. The practical performance of all these algorithms is demonstrated with implementations in a high-performance library and compared to existing software and previous techniques.


Efficient Computation with Sparse and Dense Polynomials Related Books

Efficient Computation with Sparse and Dense Polynomials
Language: en
Pages: 172
Authors: Daniel Steven Roche
Categories:
Type: BOOK - Published: 2011 - Publisher:

DOWNLOAD EBOOK

Computations with polynomials are at the heart of any computer algebra system and also have many applications in engineering, coding theory, and cryptography. G
Efficient Algorithms for Computations with Sparse Polynomials
Language: en
Pages: 252
Authors: Seyed Mohammad Mahdi Javadi
Categories: Computational complexity
Type: BOOK - Published: 2011 - Publisher:

DOWNLOAD EBOOK

The problem of interpolating a sparse polynomial has always been one of the central objects of research in the area of computer algebra. It is the key part of m
Effective Polynomial Computation
Language: en
Pages: 364
Authors: Richard Zippel
Categories: Computers
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

Effective Polynomial Computation is an introduction to the algorithms of computer algebra. It discusses the basic algorithms for manipulating polynomials includ
Sparse Polynomial Approximation of High-Dimensional Functions
Language: en
Pages: 310
Authors: Ben Adcock
Categories: Mathematics
Type: BOOK - Published: 2022-02-16 - Publisher: SIAM

DOWNLOAD EBOOK

Over seventy years ago, Richard Bellman coined the term “the curse of dimensionality” to describe phenomena and computational challenges that arise in high
Computational Mathematics with SageMath
Language: en
Pages: 459
Authors: P. Zimmermann
Categories: Science
Type: BOOK - Published: 2018-12-10 - Publisher: SIAM

DOWNLOAD EBOOK

This fantastic and deep book about how to use Sage for learning and doing mathematics at all levels perfectly complements the existing Sage documentation. It is