Symbolic polynomial operations with APL

  • Authors:
  • A. J. Surkan

  • Affiliations:
  • IBM Thomas J. Watson Research Center, Yorktown Heights, New York

  • Venue:
  • IBM Journal of Research and Development
  • Year:
  • 1969

Quantified Score

Hi-index 0.00

Visualization

Abstract

A recursive calculation of polynomial coefficients is used to demonstrate how functions performing polynomial algebra and differentiation may be written concisely in Iverson notation and executed by an on-line, time-sharing implementation of APL. These functions will operate on symbolic polynomials with constant coefficients and display in a superscripted format results having up to 116 variables.