Skip to main content
SpringerLink
Log in

An algorithm for calculating indices in Fàa di Bruno's formula

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

This paper presents a fast algorithm for generating the-non zero indices used in Fàa di Bruno's formula for the higher order derivatives of compositions of functions. The application of this formula to the solution of functional equations and to some problems in queueing theory is indicated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Bibliography

  1. C. Fàa di Bruno,Théorie des Formes Binaires, Librairie Brero, Succr de P. Marietti, Turin, Italy, 1876.

    Google Scholar 

  2. E. M. Klimko and Marcel F. Neuts,The Single Server Queue in Discrete Time-Numerical Analysis II, Naval Research Logistics Quarterly, 1972. (To appear 1973).

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, Purdue University, 47907, Lafayette, Indiana, USA

    Eugene M. Klimko

Authors
  1. Eugene M. Klimko
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Klimko, E.M. An algorithm for calculating indices in Fàa di Bruno's formula. BIT 13, 38–49 (1973). https://doi.org/10.1007/BF01933522

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01933522

Keywords

Search

Navigation