Abstract
In this paper, an algorithm is proposed to find a discrete zero point of a function on the collection of integral points in the n-dimensional Euclidean space R (n). Starting with a given integral point, the algorithm generates a finite sequence of adjacent integral simplices of varying dimension and terminates with, under certain convergency conditions, a vertex, which yields a discrete zero point of the function under consideration.
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.
