Citation
Abstract
Let N be a positive integer and Ao, ° least one positive. Define The problem is to compute z > 0 with a|2 - Ay be non-negative numbers with at k=0 This article gives a simple algorithm requiring [ (3/2) (In N /In 2)] + 8 evaluations of a polynomial of degree N + 1 and 6 evaluations of its derivative. This algorithm is required to optimize the DSN resource allocation process. k=0 £>0 — N N —N + DS Aykx* k=1
Details
- Volume
- X
- Published
- August 15, 1972
- Pages
- 110–112
- File Size
- 144.8 KB