In:
Communications of the ACM, Association for Computing Machinery (ACM), Vol. 12, No. 12 ( 1969-12), p. 675-677
Abstract:
The downhill method is a numerical method for solving complex equations ƒ( z ) = 0 on which the only restriction is that the function w = ƒ( z ) must be analytical. An introduction to this method is given and a critical review of relating literature is presented. Although in theory the method always converges, it is shown that a fundamental dilemma exists which may cause a breakdown in practical applications. To avoid this difficulty and to improve the rate of convergence toward a root, some modifications of the original method are proposed and a program (FORTRAN) based on the modified method is given in Algorithm 365. Some numerical examples are included.
Type of Medium:
Online Resource
ISSN:
0001-0782
,
1557-7317
DOI:
10.1145/363626.363636
Language:
English
Publisher:
Association for Computing Machinery (ACM)
Publication Date:
1969
detail.hit.zdb_id:
80254-2
detail.hit.zdb_id:
2004542-6
Permalink