Relax, but don't be too lazy

DOI10.1006/jsco.2002.0562zbMath1011.68189OpenAlexW2060801388MaRDI QIDQ1866999

Joris van der Hoeven

Publication date: 2 April 2003

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c8d2ec2d21ad19a63bb57fb697ca34d9896745c9

zbMATH Keywords

lazy algorithmsrelaxed algorithmszealous algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Formal power series rings (13F25)

Related Items (40)

Effective approximation of the solutions of algebraic equations ⋮ On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation ⋮ Formal desingularization of surfaces: The Jung method revisited ⋮ Computing solutions of linear Mahler equations ⋮ A Borel transform method for locating singularities of Taylor and Fourier series ⋮ Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) ⋮ Non-redundant random generation algorithms for weighted context-free grammars ⋮ Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability ⋮ Effective power series computations ⋮ Multi-point evaluation in higher dimensions ⋮ Meta-expansion of transseries ⋮ Guessing singular dependencies ⋮ On the Complexity of Multivariate Polynomial Division ⋮ Algorithms for combinatorial structures: well-founded systems and Newton iterations ⋮ Relaxed algorithms for \(p\)-adic numbers ⋮ Relaxed Hensel lifting of triangular sets ⋮ Effective analytic functions ⋮ Complexity bounds for zero-test algorithms ⋮ Around the numeric-symbolic computation of differential Galois groups ⋮ A simple and fast online power series multiplication and its analysis ⋮ Computing with D-algebraic power series ⋮ New algorithms for relaxed multiplication ⋮ From implicit to recursive equations ⋮ Controlled non-uniform random generation of decomposable structures ⋮ Newton's method and FFT trading ⋮ On the coefficients that arise from Laplace's method ⋮ Nature of complex singularities for the 2D Euler equation ⋮ A simple and fast algorithm for computing exponentials of power series ⋮ Modular composition via factorization ⋮ Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals ⋮ Fast multivariate multi-point evaluation revisited ⋮ Conformal mapping in linear time ⋮ On asymptotic extrapolation ⋮ Code Generation for Polynomial Multiplication ⋮ Lazy and Forgetful Polynomial Arithmetic and Applications ⋮ A fast algorithm for reversion of power series ⋮ Amortized multi-point evaluation of multivariate polynomials ⋮ On the complexity of skew arithmetic ⋮ Tracking -adic precision ⋮ Computations with effective real numbers

Uses Software

• gfun
• CS
• CABAL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• D-finite power series
• Differentiably finite power series
• Periodic oscillations of coefficients of power series that satisfy functional equations
• A holonomic systems approach to special functions identities
• Automatic average-case analysis of algorithms
• On fast multiplication of polynomials over arbitrary algebras
• Composing power series over a finite ring in essentially linear time
• A calculus for the random generation of labelled combinatorial structures
• On short multiplications and divisions
• Fast multiplication of large numbers
• An algorithm for division of powerseries
• The Cycle Construction
• On the Complexity of Composition and Generalized Composition of Power Series
• Computing with Formal Power Series
• All Algebraic Functions Can Be Computed Fast
• Fast Algorithms for Manipulating Formal Power Series
• GFUN
• An Algorithm for the Machine Calculation of Complex Fourier Series

This page was built for publication: Relax, but don't be too lazy