The down-hill method by Ward is a numerical method for determining a complex root of ƒ(z) = 0 and suitable for machine computation [1]. It is based on a theorem that W(z) = |Re(ƒ)| + |Im(ƒ)| (1) has minimum value, actually zero, at and only at a root of ƒ and seeks to minimize W by non-random walk from a starting point over the complex plane.
Triangular walk pattern for the down-hill method of solving a transcendental equation
The Latest from CACM
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More
Join the Discussion (0)
Become a Member or Sign In to Post a Comment