Title

System Analysis Polynomial Algorithms Optimized For Speed And Minimum Memory.

Abstract

Polynomial evaluation subroutines are the key to fast efficient dynamic system analysis programs. Yet, an examination of the latest software will reveal that the polynomial subroutines use the old standard techniques consisting of either a direct evaluation or Horner's method with complex arithmetic. This report contains new algorithms which are used to design subroutines that will execute in the order of 10-to-1 faster than most subroutines presently used.

Publication Date

1-1-1985

Publication Title

ASEE Annual Conference Proceedings

Volume

1

Number of Pages

60-66

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

Socpus ID

0021973072 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0021973072

This document is currently not available here.

Share

COinS