An efficient algorithm for calculating taylor polynomials of implicit functions

John T. White, Edward Allen, Keshab Ganguly, Lawrence Schovanec

Research output: Contribution to journalArticlepeer-review


An iterative procedure is introduced which generates the Taylor expansion of an implicitly defined function f(x)∊R,x∊Rn, that satisfies an equation F(x,f(x)) = 0. In particular the mth iterate is precisely the mth degree Taylor polynomial of f(x). The algorithm is implemented by using a symbolic manipulation language. Examples are presented which illustrate the pertinent features of the method and the procedure is employed to solve some transcendental equations that arise in neutron transport calculations.

Original languageEnglish
Pages (from-to)137-145
Number of pages9
JournalInternational Journal of Computer Mathematics
Issue number3-4
StatePublished - Jan 1 1990


  • Implicit function
  • Taylor polynomials
  • contractive map
  • fixed point
  • neutron transport
  • symbolic processor


Dive into the research topics of 'An efficient algorithm for calculating taylor polynomials of implicit functions'. Together they form a unique fingerprint.

Cite this