From implicit to recursive equations

DOI10.1007/s00200-018-0370-2zbMath1412.68308OpenAlexW2470493488WikidataQ129300707 ScholiaQ129300707MaRDI QIDQ2002150

Joris van der Hoeven

Publication date: 11 July 2019

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-018-0370-2

zbMATH Keywords

algorithmimplicit equationrelaxed power series

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Differential algebra (12H05) Formal power series rings (13F25)

Related Items (3)

Effective power series computations ⋮ Relaxed Hensel lifting of triangular sets ⋮ From implicit to recursive equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relaxed Hensel lifting of triangular sets
• A simple and fast online power series multiplication and its analysis
• Newton's method and FFT trading
• On fast multiplication of polynomials over arbitrary algebras
• Fast on-line integer multiplication
• Relax, but don't be too lazy
• From implicit to recursive equations
• New algorithms for relaxed multiplication
• Fast multiplication of large numbers
• Faster relaxed multiplication
• Fast Algorithms for Manipulating Formal Power Series
• Relaxed p-adic Hensel lifting for algebraic systems
• An Algorithm for the Machine Calculation of Complex Fourier Series

This page was built for publication: From implicit to recursive equations