Tchebychef-like method for the simultaneous finding zeros of analytic functions

DOI10.1016/0898-1221(96)00033-8zbMath0864.65027OpenAlexW2079693418MaRDI QIDQ1921210

Miodrag S. Petković, Slobodan B. Tričković

Publication date: 3 June 1997

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(96)00033-8

zbMATH Keywords

convergencenumerical examplezerosnumerical stabilityanalytic functionsasynchronous implementationChebyshev iterative method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calculating polynomial zeros on a local memory parallel computer
• Asynchronous polynomial zero-finding algorithms
• Finding the roots of a polynomial on an MIMD multicomputer
• On the simultaneous determination of zeros of analytic or sectionally analytic functions
• Higher-order iterative methods for approximating zeros of analytic functions
• A class of simultaneous methods for the zeros of analytic functions
• Weierstrass formula and zero-finding methods
• A generalization of the Siewert–Burniston method for the determination of zeros of analytic functions
• Asynchronous Iterative Methods for Multiprocessors

This page was built for publication: Tchebychef-like method for the simultaneous finding zeros of analytic functions