Representations and Parallel Computations for Rational Functions

DOI10.1137/0215030MaRDI QIDQ3735077zbMATH OpenOpenAlexFDO

Authors 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

Chinese remainder algorithmelementary symmetric functionsfast parallel algorithm for converting from one base representation to anotherinterpolationlinear equationsPadé approximationparallel processingparallelismpartial fraction decompositionsymbolic manipulationTaylor expansionunivariate rational functions

Mathematics Subject Classification ID

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

Recommendations

• Parallel algorithms for some algebraic operations on polynomial equations
• Parallel processors and systems for algebraic manipulation: current work
• scientific article; zbMATH DE number 47319
• A Direct Approach to the Parallel Evaluation of Rational Expressions with a Small Number of Processors
• Parallel multiplication and powering of polynomials

Cited in

(15)

• Specified precision polynomial root isolation is in NC
• Construction of parallel iterative programs in computer algebra systems
• Parallel computation and indefinite summation: A \(\|\text{MAPLE}\|\) application for the rational case
• 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
• Computing Sparse Representations of Systems of Rational Fractions
• scientific article; zbMATH DE number 4139290 (Why is no real title available?)
• Parallel processors and systems for algebraic manipulation: current work
• scientific article; zbMATH DE number 1254029 (Why is no real title available?)
• scientific article; zbMATH DE number 833674 (Why is no real title available?)
• An automatic parallelization framework for algebraic computation systems
• Parallel algorithms for matrix normal forms
• 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

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

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