Abstract

Many methods for finding a multiple zero $x^ * $ of a function f are based on transforming f to a function T for which $x^ * $ is a simple zero. We give and analyze a general transformation which includes as special cases three transformations given in the literature. Newton-like methods for solving $T(x) = 0$ are examined and we perform comparative computational tests. The class of methods considered is shown to be of limited practical value.

Full Text
Paper version not known

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 call

Disclaimer: 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.