Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T08:08:38.356Z Has data issue: false hasContentIssue false

AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS

Published online by Cambridge University Press:  01 June 2008

IBRAHEEM ALOLYAN*
Affiliation:
Mathematics Department, College of Science, King Saud University, PO Box 2455, Riyadh 11451, Saudi Arabia (email: ialolyan05@yahoo.com)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Computing a zero of a continuous function is an old and extensively researched problem in numerical computation. In this paper, we present an efficient subdivision algorithm for finding all real roots of a function in multiple variables. This algorithm is based on a simple computationally verifiable necessity test for the existence of a root in any compact set. Both theoretical analysis and numerical simulations demonstrate that the algorithm is very efficient and reliable. Convergence is shown and numerical examples are presented.

Information

Type
Research Article
Copyright
Copyright © 2008 Australian Mathematical Society