Representations and Parallel Computations for Rational Functions

DOI10.1137/0215030zbMath0599.68036OpenAlexW2150822066MaRDI QIDQ3735077

Joachim von zur Gathen

Publication date: 1986

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0215030

zbMATH Keywords

interpolationPadé approximationparallelismlinear equationsTaylor expansionparallel processingunivariate rational functionspartial fraction decompositionsymbolic manipulationelementary symmetric functionsChinese remainder algorithmfast parallel algorithm for converting from one base representation to another

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Approximation by rational functions (41A20)

Related Items (7)

Specified precision polynomial root isolation is in NC ⋮ Analysis of Euclidean algorithms for polynomials over finite fields ⋮ Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators ⋮ New techniques for the computation of linear recurrence coefficients ⋮ Depth-4 lower bounds, determinantal complexity: a unified approach ⋮ A quadratic lower bound for homogeneous algebraic branching programs ⋮ Parallel algorithms for matrix normal forms

This page was built for publication: Representations and Parallel Computations for Rational Functions