On computation of a power series root with arbitrary degree of convergence

DOI10.1007/BF03168551MaRDI QIDQ1002491zbMATH OpenFDO

Authors Takuya Kitamoto

Publication date 26 February 2009

Published in Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF03168551

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Recommendations

• Fast computation of the roots of polynomials over the ring of power series
• scientific article; zbMATH DE number 4037047
• Faster algorithms for the square root and reciprocal of power series
• Fast algorithms for elementary operations on complex power series
• scientific article; zbMATH DE number 953020

Cites work

• All Algebraic Functions Can Be Computed Fast
• Approximate eigenvalues, eigenvectors and inverse of a matrix with polynomial entries
• Hensel construction with an arbitrary degree of convergence
• scientific article; zbMATH DE number 3711281 (Why is no real title available?)
• On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives

Cited in

(7)

• The method of Gauss-Newton to compute power series solutions of polynomial homotopies
• Efficient computation of truncated power series: direct approach versus Newton's method
• scientific article; zbMATH DE number 4046963 (Why is no real title available?)
• EXTRAPOLATION OF POWER SERIES BY SELF-SIMILAR FACTOR AND ROOT APPROXIMANTS
• On the convergence of the power series algorithm
• Fast computation of the roots of polynomials over the ring of power series
• Newton's method and FFT trading

This page was built for publication: On computation of a power series root with arbitrary degree of convergence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1002491)