ISSN:
1572-9125
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract LetH be a polynomial inn〉1 variables over the fields of real or complex numbers. An algorithm is presented here for the simultaneous evaluation ofH and its first and second (F-) derivativesH′ andH″, or of any combination ofH,H′,H″. The evaluations ofH alone or ofH andH′ together are of the same order inn andd whered is the degree ofH, while the computation ofH,H′, andH″ isd times this order. The process takes account of the sparsity pattern ofH by using a tree structure induced by the nonzero coefficients. It also allows for simultaneous operation with several polynomials with the same sparsity pattern. The data structure for the method is rather simple in nature and can be adapted easily to specific types of polynomials. Several possible implementations and their complexity are discussed.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01933453
Permalink