Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Petko D. Proinov"'
Autor:
Petko D. Proinov, Maria T. Vasileva
Publikováno v:
Mathematics, Vol 9, Iss 16, p 1855 (2021)
One of the famous third-order iterative methods for finding simultaneously all the zeros of a polynomial was introduced by Ehrlich in 1967. In this paper, we construct a new family of high-order iterative methods as a combination of Ehrlich’s itera
Externí odkaz:
https://doaj.org/article/08bd1d00477a4c43a2596d529ce5783b
Autor:
Petko D. Proinov, Milena D. Petkova
Publikováno v:
Mathematics, Vol 9, Iss 14, p 1640 (2021)
In this paper, we construct and study a new family of multi-point Ehrlich-type iterative methods for approximating all the zeros of a uni-variate polynomial simultaneously. The first member of this family is the two-point Ehrlich-type iterative metho
Externí odkaz:
https://doaj.org/article/d0c0c6a21c8341059dc458f97938ec5e
Autor:
Petko D. Proinov
Publikováno v:
Symmetry, Vol 13, Iss 3, p 371 (2021)
In this work, two broad classes of iteration functions in n-dimensional vector spaces are introduced. They are called iteration functions of the first and second kind at a fixed point of the corresponding iteration function. Two general local converg
Externí odkaz:
https://doaj.org/article/7639cce2051f4c039f1d86c9ac52efd3
Autor:
Petko D. Proinov, Maria T. Vasileva
Publikováno v:
Symmetry, Vol 12, Iss 11, p 1801 (2020)
In 1977, Nourein (Intern. J. Comput. Math. 6:3, 1977) constructed a fourth-order iterative method for finding all zeros of a polynomial simultaneously. This method is also known as Ehrlich’s method with Newton’s correction because it is obtained
Externí odkaz:
https://doaj.org/article/c1d3cfb4ba774e8eb46b8cd07b2ea55e
Autor:
Petko D. Proinov, Milena D. Petkova
Publikováno v:
INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2020.
Autor:
Petko D. Proinov, Maria T. Vasileva
Publikováno v:
INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2020.
Autor:
Maria T. Vasileva, Petko D. Proinov
Publikováno v:
Mathematics
Volume 9
Issue 16
Mathematics, Vol 9, Iss 1855, p 1855 (2021)
Volume 9
Issue 16
Mathematics, Vol 9, Iss 1855, p 1855 (2021)
One of the famous third-order iterative methods for finding simultaneously all the zeros of a polynomial was introduced by Ehrlich in 1967. In this paper, we construct a new family of high-order iterative methods as a combination of Ehrlich’s itera
Autor:
Maria T. Vasileva, Petko D. Proinov
Publikováno v:
Applied Mathematics and Computation. 361:202-214
In 1984, Kyurkchiev et al. constructed an infinite sequence of iterative methods for simultaneous approximation of polynomial zeros (with known multiplicity). The first member of this sequence of iterative methods is the famous root-finding method de
Autor:
Stoil I. Ivanov, Petko D. Proinov
Publikováno v:
Journal of Computational and Applied Mathematics. 357:56-70
In 1991, T. Sakurai, T. Torii and H. Sugiura presented a fourth-order iterative algorithm for finding all zeros of a polynomial simultaneously. In this paper, we provide a detailed convergence analysis (local and semilocal) of this method. The new re
Autor:
Petko D. Proinov, Milena Petkova
Publikováno v:
Mediterranean Journal of Mathematics. 17
Weierstrass (Sitzungsber Konigl Preuss Akad Wiss Berlin II:1085–1101, 1891) introduced his famous iterative method for numerical finding all zeros of a polynomial simultaneously. Kyurkchiev and Ivanov (Ann Univ Sofia Fac Math Mech 78:132–136, 198