roots of polynomials
Recently Published Documents


TOTAL DOCUMENTS

238
(FIVE YEARS 32)

H-INDEX

17
(FIVE YEARS 1)

2022 ◽  
Vol 69 (1) ◽  
pp. 1-70
Author(s):  
Mikkel Abrahamsen ◽  
Anna Adamaszek ◽  
Tillmann Miltzow

The Art Gallery Problem (AGP) is a classic problem in computational geometry, introduced in 1973 by Victor Klee. Given a simple polygon 풫 and an integer k , the goal is to decide if there exists a set G of k guards within 풫 such that every point p ∈ 풫 is seen by at least one guard g ∈ G . Each guard corresponds to a point in the polygon 풫, and we say that a guard g sees a point p if the line segment pg is contained in 풫. We prove that the AGP is ∃ ℝ-complete, implying that (1) any system of polynomial equations over the real numbers can be encoded as an instance of the AGP, and (2) the AGP is not in the complexity class NP unless NP = ∃ ℝ. As a corollary of our construction, we prove that for any real algebraic number α, there is an instance of the AGP where one of the coordinates of the guards equals α in any guard set of minimum cardinality. That rules out many natural geometric approaches to the problem, as it shows that any approach based on constructing a finite set of candidate points for placing guards has to include points with coordinates being roots of polynomials with arbitrary degree. As an illustration of our techniques, we show that for every compact semi-algebraic set S ⊆ [0, 1] 2 , there exists a polygon with corners at rational coordinates such that for every p ∈ [0, 1] 2 , there is a set of guards of minimum cardinality containing p if and only if p ∈ S . In the ∃ ℝ-hardness proof for the AGP, we introduce a new ∃ ℝ-complete problem ETR-INV. We believe that this problem is of independent interest, as it has already been used to obtain ∃ ℝ-hardness proofs for other problems.


2021 ◽  
Vol 60 (2) ◽  
pp. 145-165
Author(s):  
J. F. Knight ◽  
K. Lange
Keyword(s):  

2021 ◽  
Vol 40 (6) ◽  
Author(s):  
Eberhard Malkowsky ◽  
Gradimir V. Milovanović ◽  
Vladimir Rakočević ◽  
Orhan Tuğ

2021 ◽  
Author(s):  
Boris Obsieger

Textbook of several universities. 2nd edition. The color edition is also available at Glasstree Bookstore. It is recommended for students. The series of books Numerical Methods is written primarily for students at technical universities, but also as a useful handbook for engineers, PhD students and scientists. This volume introduces the reader into numeral systems and representation of numbers in digital computers. Possibly the most important part of this book are descriptions of differences between constant and random variables, related types of errors and error propagation. These topics are supplemented with various types of regression analyses. Finally, direct and iterative methods for finding roots of polynomials are explained. Practical application is supported by 77 examples and 13 algorithms. For reasons of simplicity, algorithms are written in pseudo-code, so they can easily be included in any computer program.


2021 ◽  
Vol 60 (2) ◽  
pp. 95-107
Author(s):  
J. F. Knight ◽  
K. Lange
Keyword(s):  

Author(s):  
Suchada Pongprasert ◽  
Kanyarat Chaengsisai ◽  
Wuttichai Kaewleamthong ◽  
Puttarawadee Sriphrom

Polynomials can be used to represent real-world situations, and their roots have real-world meanings when they are real numbers. The fundamental theorem of algebra tells us that every nonconstant polynomial p with complex coefficients has a complex root. However, no analogous result holds for guaranteeing that a real root exists to p if we restrict the coefficients to be real. Let n ≥ 1 and P n be the vector space of all polynomials of degree n or less with real coefficients. In this article, we give explicit forms of polynomials in P n such that all of their roots are real. Furthermore, we present explicit forms of linear transformations on P n which preserve real roots of polynomials in a certain subset of P n .


Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 317
Author(s):  
Diogo Freitas ◽  
Luiz Guerreiro Lopes ◽  
Fernando Morgado-Dias

Finding arbitrary roots of polynomials is a fundamental problem in various areas of science and engineering. A myriad of methods was suggested to address this problem, such as the sequential Newton’s method and the Durand–Kerner (D–K) simultaneous iterative method. The sequential iterative methods, on the one hand, need to use a deflation procedure in order to compute approximations to all the roots of a given polynomial, which can produce inaccurate results due to the accumulation of rounding errors. On the other hand, the simultaneous iterative methods require good initial guesses to converge. However, Artificial Neural Networks (ANNs) are widely known by their capacity to find complex mappings between the dependent and independent variables. In view of this, this paper aims to determine, based on comparative results, whether ANNs can be used to compute approximations to the real and complex roots of a given polynomial, as an alternative to simultaneous iterative algorithms like the D–K method. Although the results are very encouraging and demonstrate the viability and potentiality of the suggested approach, the ANNs were not able to surpass the accuracy of the D–K method. The results indicated, however, that the use of the approximations computed by the ANNs as the initial guesses for the D–K method can be beneficial to the accuracy of this method.


Information ◽  
2020 ◽  
Vol 11 (12) ◽  
pp. 585
Author(s):  
Beata Bajorska-Harapińska ◽  
Mariusz Pleszczyński ◽  
Michał Różański ◽  
Barbara Smoleń-Duda ◽  
Adrian Smuda  ◽  
...  

Undoubtedly, one of the most powerful applications that allow symbolic computations is Wolfram Mathematica. However, it turns out that sometimes Mathematica does not give the desired result despite its continuous improvement. Moreover, these gaps are not filled by many authors of books and tutorials. For example, our attempts to obtain a compact symbolic description of the roots of polynomials or coefficients of a polynomial with known roots using Mathematica have often failed and they still fail. Years of our work with theory, computations, and different kinds of applications in the area of polynomials indicate that an application ‘offering’ the user alternative methods of solving a given problem would be extremely useful. Such an application would be valuable not only for people who look for solutions to very specific problems but also for people who need different descriptions of solutions to known problems than those given by classical methods. Therefore, we propose the development of an application that would be not only a program doing calculations but also containing an interactive database about polynomials. In this paper, we present examples of methods and information which could be included in the described project.


Sign in / Sign up

Export Citation Format

Share Document