Abstract
It has been known how to use computational fixed point theorems to verify existence and uniqueness of a true solution to a nonlinear system of equations within a small region about an approximate solution. This can, be done in O(n3) operations, where n is the number of equations and unknowns. However, these standard techniques are only valid if the Jacobi matrix for the system is nonsingular at the solution. In previous work and a dissertation (of Dian), we have shown, both theoretically and practically, that existence and multiplicity can be verified in a complex setting, and in the real setting for odd multiplicity, when the rank defect of the Jacobi matrix at an isolated solution is 1. Here, after reviewing work to date, we discuss the case of higher rank defect. In particular, it appears that p-dimensional searches are required if the rank defect is p, and that the work increases exponentially in p.
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.
