On computing reciprocals of power series
From MaRDI portal
Publication:2265255
DOI10.1007/BF01436917zbMath0274.65009WikidataQ109691987 ScholiaQ109691987MaRDI QIDQ2265255
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)
Related Items (17)
On the number of multiplications needed to invert a monic power series over fields of characteristic two ⋮ A fast algorithm for computing the number of magic series ⋮ Cauchy index computation ⋮ Wiener-Hopf and spectral factorization of real polynomials by Newton's method ⋮ The complexity of bivariate power series arithmetic. ⋮ Fast computation of special resultants ⋮ Fast algorithms for computing isogenies between elliptic curves ⋮ Sylvester-Habicht sequences and fast Cauchy index computation ⋮ Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation ⋮ A method for calculating the reciprocal coefficients of function matrices ⋮ A survey of techniques in applied computational complexity ⋮ On the Periods of Generalized Fibonacci Recurrences ⋮ Chebyshev series expansion of inverse polynomials ⋮ Fast convolutions meet Montgomery ⋮ Fast arithmetic for triangular sets: from theory to practice ⋮ Variations on computing reciprocals of power series ⋮ Irregular primes to two billion
Cites Work
This page was built for publication: On computing reciprocals of power series