Newton's method and FFT trading
From MaRDI portal
Publication:979146
DOI10.1016/j.jsc.2010.03.005zbMath1192.13017MaRDI QIDQ979146
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
68W30: Symbolic computation and algebraic computation
13P99: Computational aspects and applications of commutative rings
13F25: Formal power series rings
Related Items
Relaxed algorithms for \(p\)-adic numbers, Relaxed Hensel lifting of triangular sets, Homotopy techniques for multiplication modulo triangular sets, Newton's method and FFT trading, A simple and fast algorithm for computing exponentials of power series, New algorithms for relaxed multiplication
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item