Abstract
An iterational method for simultaneously finding all the zeros of a certain generalized polynomial with respect to an arbitrary Chebyshev system, if the multiplicities of the zeros are given, is considered. The method is more general than the ones previously described, which relate only to algebraic, trigonometric, and exponential polynomials. Its quadratic convergence is established, and the method is realized on a computer.
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 callMore From: USSR Computational Mathematics and Mathematical Physics
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.
