An efficient algorithm for calculating taylor polynomials of implicit functions

DOI10.1080/00207169008803796MaRDI QIDQ4009708zbMATH OpenOpenAlexFDO

Authors John Thomas White, Keshab Ganguly, Lawrence Schovanec, Edward J. Allen

Publication date 27 September 1992

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169008803796

zbMATH Keywords

fixed pointiterative methodcontractive mapimplicit functionneutron transportTaylor polynomialssymbolic processor

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Transport processes in time-dependent statistical mechanics (82C70)

Recommendations

• Taylor polynomials of implicit functions, of inverse functions, and of solutions of ordinary differential equations
• Efficient computation of truncated power series: direct approach versus Newton's method
• scientific article; zbMATH DE number 1166269
• scientific article; zbMATH DE number 1145331
• scientific article; zbMATH DE number 3960857

Cited in

(3)

• Efficient computation of truncated power series: direct approach versus Newton's method
• Taylor expansion of implicit functions defined by linear equations of variables
• An efficient algorithm for the determination of force constants and displacements in numerical definitions of a large, general order Taylor series expansion

This page was built for publication: An efficient algorithm for calculating taylor polynomials of implicit functions

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