scientific article; zbMATH DE number 2151179

zbMATH Open1072.68649MaRDI QIDQ4660643FDOQ4660643

Éric Schost, Grégoire Lecerf, Alin Bostan

Publication date: 4 April 2005

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 6698765
• transalpyne: a language for automatic transposition
• Tellegen's principle, non-minimal realization of systems and inversion of polynomial Vandermonde matrices
• Code Generation for Polynomial Multiplication
• The truncated fourier transform and applications

zbMATH Keywords

interpolationcomputer algebrapolynomial evaluationTellegen's principletransposition principle

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Nonnumerical algorithms (68W05)

Cited In (33)

• Amortized multi-point evaluation of multivariate polynomials
• Multilinear polynomial systems: root isolation and bit complexity
• Fast Hermite interpolation and evaluation over finite fields of characteristic two
• A fast Hermite transform
• Accelerated tower arithmetic
• Fast computation of generic bivariate resultants
• Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
• Code Generation for Polynomial Multiplication
• On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms
• Modular composition modulo triangular sets and applications
• The Karatsuba integer middle product
• Fast arithmetics in Artin-Schreier towers over finite fields
• On the complexities of multipoint evaluation and interpolation
• Deformation techniques for sparse systems
• Fast convolutions meet Montgomery
• Modular composition via factorization
• Bivariate polynomial reduction and elimination ideal over finite fields
• Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications
• Polynomial evaluation and interpolation on special sets of points
• Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
• Fast conversion algorithms for orthogonal polynomials
• A probabilistic algorithm for verifying polynomial middle product in linear time
• Fast amortized multi-point evaluation
• Elimination ideal and bivariate resultant over finite fields
• New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
• Lifting and recombination techniques for absolute factorization
• A simple and fast online power series multiplication and its analysis
• Faster algorithms for the square root and reciprocal of power series
• Fast multivariate multi-point evaluation revisited
• Fast interpolation of multivariate polynomials with sparse exponents
• Fast computation of special resultants
• Irregular primes to 163 million
• Solving structured linear systems with large displacement rank

Uses Software

• NTL

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4660643)