scientific article

Nikolay Kyurkchiev, Andrei Andreev, Blagovest Sendov

Publication date: 2 April 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Complexity and performance of numerical algorithms (65Y20) Nonlinear algebraic or transcendental equations (65Hxx)

Related Items

Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros, On the numerical solution of the general kinetic ``\(K\)-angle reaction system, Some remarks on Dvorcuk's root-finding method, The behaviour of approximations of the SOR Weierstrass method, Initial approximations in Euler-Chebyshev's method, On the local convergence of Ehrlich method for numerical computation of polynomial zeros, Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros, On some methods for the simultaneous determination of polynomial zeros, Convergence of the two-point Weierstrass root-finding method, Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods, ON EFFICIENT FRACTIONAL CAPUTO-TYPE SIMULTANEOUS SCHEME FOR FINDING ALL ROOTS OF POLYNOMIAL EQUATIONS WITH BIOMEDICAL ENGINEERING APPLICATIONS, Relationships between different types of initial conditions for simultaneous root finding methods, Some families of two-step simultaneous methods for determining zeros of nonlinear equations, On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity, On using symmetric polynomials for constructing root finding methods, A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously, New bounds for roots of polynomials based on Fiedler companion matrices, Failure of convergence of the Newton-Weierstrass iterative method for simultaneous rootfinding of generalized polynomials, A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods, Computer visualization and dynamic study of new families of root-solvers, On a family of Weierstrass-type root-finding methods with accelerated convergence, A unified theory of cone metric spaces and its applications to the fixed point theory, Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra, Stability analysis of a bioreactor model for biodegradation of xenobiotics, On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros, General convergence theorems for iterative processes and applications to the Weierstrass root-finding method, What Monte Carlo models can do and cannot do efficiently?, A new block-diagonal preconditioner for a class of \(3\times 3\) block saddle point problems, Bounds for eigenvalues of matrix polynomials, Computer tools for the construction and analysis of some efficient root-finding simultaneous methods, On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously