On computing reciprocals of power series
From MaRDI portal
Publication:2265255
DOI10.1007/BF01436917zbMATH Open0274.65009WikidataQ109691987 ScholiaQ109691987MaRDI QIDQ2265255FDOQ2265255
Authors: H. T. Kung
Publication date: 1974
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132275
Computation of special functions and constants, construction of tables (65D20) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05)
Cites Work
Cited In (17)
- Wiener-Hopf and spectral factorization of real polynomials by Newton's method
- The complexity of bivariate power series arithmetic.
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
- Fast convolutions meet Montgomery
- Variations on computing reciprocals of power series
- Sylvester-Habicht sequences and fast Cauchy index computation
- A fast algorithm for computing the number of magic series
- Cauchy index computation
- Chebyshev series expansion of inverse polynomials
- A survey of techniques in applied computational complexity
- On the number of multiplications needed to invert a monic power series over fields of characteristic two
- Fast algorithms for computing isogenies between elliptic curves
- Irregular primes to two billion
- On the Periods of Generalized Fibonacci Recurrences
- Fast computation of special resultants
- Fast arithmetic for triangular sets: from theory to practice
- A method for calculating the reciprocal coefficients of function matrices
This page was built for publication: On computing reciprocals of power series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2265255)