Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
