Results 1 to 10 of about 2,960 (152)
Unified Convergence Analysis of Chebyshev–Halley Methods for Multiple Polynomial Zeros
Mathematics, 2022 In this paper, we establish two local convergence theorems that provide initial conditions and error estimates to guarantee the Q-convergence of an extended version of Chebyshev–Halley family of iterative methods for multiple polynomial zeros due to ...
Stoil I. Ivanov
doaj +1 more source
Some inequalities for the polar derivative of some classes of polynomials [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2019 In this paper, we investigate an upper bound of the polar derivative of a polynomial of degree where zeros are in and the remaining zeros are outside where .
Nuttapong Arunrat +1 more
doaj +1 more source
Location of zeros of Wiener and distance polynomials. [PDF]
PLoS ONE, 2012 The geometry of polynomials explores geometrical relationships between the zeros and the coefficients of a polynomial. A classical problem in this theory is to locate the zeros of a given polynomial by determining disks in the complex plane in which all ...
Matthias Dehmer, Aleksandar Ilić
doaj +1 more source
A New Ehrlich-Type Sixth-Order Simultaneous Method for Polynomial Complex Zeros
Vetor, 2023 This paper presents a new iterative method for the simultaneous determination of simple polynomial zeros. The proposed method is obtained from the combination of the third-order Ehrlich iteration with an iterative correction derived from Li's fourth ...
Luiz Guerreiro Lopes +1 more
doaj +1 more source
Journal of Mathematics, 2022 In the paper, we study the upper bound estimation of the Lebesgue constant of the bivariate Lagrange interpolation polynomial based on the common zeros of product Chebyshev polynomials of the second kind on the square −1,12. And, we prove that the growth
Juan Liu, Laiyi Zhu
doaj +1 more source
Zero sets of univariate polynomials [PDF]
Transactions of the American Mathematical Society, 2010 Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion of distance from a point to a subset, more general than the usual one, that allows us to measure distances to ...
Lubarsky, Robert S., Richman, Fred
openaire +2 more sources
Polynomial automata: Zeroness and applications [PDF]
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017 We introduce a generalisation of weighted automata over a field, called polynomial automata, and we analyse the complexity of the Zeroness Problem in this model, that is, whether a given automaton outputs zero on all words. While this problem is non-primitive recursive in general, we highlight a subclass of polynomial automata for which the Zeroness ...
Benedikt, M +3 more
openaire +2 more sources
Configuration of Zeros of Isochronous Vector Fields of Degree 5
Complexity, 2021 In this paper, we give the algebraic conditions that a configuration of 5 points in the plane must satisfy in order to be the configuration of zeros of a polynomial isochronous vector field.
Julio Cesar Avila +2 more
doaj +1 more source
A condition for associativity of univariate resultants
Examples and Counterexamples, 2023 We provide a condition on the occurrences of variables in polynomials and show that it ensures associativity of univariate resultants in non-trivial cases.
D.A. Wolfram
doaj +1 more source
More zeros of krawtchouk polynomials [PDF]
Graphs and Combinatorics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Habsieger, Laurent, Stanton, Dennis
openaire +2 more sources