Newton's method and FFT trading

DOI10.1016/j.jsc.2010.03.005zbMath1192.13017MaRDI QIDQ979146

Joris van der Hoeven

Publication date: 25 June 2010

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2010.03.005

zbMATH Keywords

Newton's method; FFT; differential equation; power series

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

13P99: Computational aspects and applications of commutative rings

13F25: Formal power series rings

Related Items

Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability, Relaxed algorithms for \(p\)-adic numbers, Relaxed Hensel lifting of triangular sets, Homotopy techniques for multiplication modulo triangular sets, Computing with D-algebraic power series, Newton's method and FFT trading, A simple and fast algorithm for computing exponentials of power series, On the complexity of integer matrix multiplication, A probabilistic algorithm for verifying polynomial middle product in linear time, From implicit to recursive equations, New algorithms for relaxed multiplication

Uses Software

• Mathemagix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to multiply matrices faster
• Matrix multiplication via arithmetic progressions
• Newton's method and FFT trading
• The complexity of partial derivatives
• On fast multiplication of polynomials over arbitrary algebras
• Fast modular transforms
• Variations on computing reciprocals of power series
• Relax, but don't be too lazy
• The middle product algorithm. I: Speeding up the division and square root of power series
• Polynomial evaluation and interpolation on special sets of points
• On effective analytic continuation
• New algorithms for relaxed multiplication
• Gaussian elimination is not optimal
• Fast multiplication of large numbers
• Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
• The probability to select the correct model using likelihood-ratio based criteria in choosing between two nested models of which the more extended one is true
• A long note on Mulders' short product
• Inter-reciprocity applied to electrical networks
• Fast Algorithms for Manipulating Formal Power Series
• The truncated fourier transform and applications
• An Algorithm for the Machine Calculation of Complex Fourier Series