Tellegen's principle into practice

Authors:
A. Bostan;G. Lecerf;É. Schost
Affiliations:
École polytechnique, Palaiseau, France;-;École polytechnique, Palaiseau, France
Venue:
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Year:
2003

Citing 13
Cited 24

Addition requirements for matrix and transposed matrix products

Journal of Algorithms
A deterministic algorithm for sparse multivariate polynomial interpolation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Solving systems of nonlinear polynomial equations faster

ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Interpolating polynomials from their values

Journal of Symbolic Computation - Special issue on computational algebraic complexity
A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
An FFT extension of the elliptic curve method of factorization

An FFT extension of the elliptic curve method of factorization
A new polynomial factorization algorithm and its implementation

Journal of Symbolic Computation
Modern computer algebra

Modern computer algebra
Efficient computation of minimal polynomials in algebraic extensions of finite fields

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Challenges of symbolic computation: my favorite open problems

Journal of Symbolic Computation
Improved Sparse Multivariate Polynomial Interpolation Algorithms

ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Relax, but don't be too lazy

Journal of Symbolic Computation
On the algebraic complexity of matrix multiplication.

On the algebraic complexity of matrix multiplication.

Complexity issues in bivariate polynomial factorization

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
On the complexities of multipoint evaluation and interpolation

Theoretical Computer Science
Multivariate power series multiplication

Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Polynomial evaluation and interpolation on special sets of points

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Change of order for bivariate triangular sets

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Lifting and recombination techniques for absolute factorization

Journal of Complexity
A fast hermite transform with applications to protein structure determination

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Power series composition and change of basis

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Solving structured linear systems with large displacement rank

Theoretical Computer Science
A fast Hermite transform

Theoretical Computer Science
Fast arithmetics in artin-schreier towers over finite fields

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Code Generation for Polynomial Multiplication

CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Polynomial evaluation and interpolation on special sets of points

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Fast computation of special resultants

Journal of Symbolic Computation
transalpyne: a language for automatic transposition

ACM Communications in Computer Algebra
transalpyne: a language for automatic transposition

ACM Communications in Computer Algebra
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation

Journal of Symbolic Computation
20 years of ECM

ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Fast arithmetics in Artin-Schreier towers over finite fields

Journal of Symbolic Computation
The Karatsuba integer middle product

Journal of Symbolic Computation
Fast Polynomial Factorization and Modular Composition

SIAM Journal on Computing
On the complexity of computing with zero-dimensional triangular sets

Journal of Symbolic Computation
On the bit-complexity of sparse polynomial and series multiplication

Journal of Symbolic Computation
Modular Composition Modulo Triangular Sets and Applications

Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

The transposition principle, also called Tellegen's principle, is a set of transformation rules for linear programs. Yet, though well known, it is not used systematically, and few practical implementations rely on it. In this article, we propose explicit transposed versions of polynomial multiplication and division but also new faster algorithms for multipoint evaluation, interpolation and their transposes. We report on their implementation in Shoup's NTL C++ library.