Name
Abstract | ||
|---|---|---|
In this poster we present the results of [10]. We consider the problem of finding the common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. We propose a general algebraic framework to find the solutions and to compute the structure of the quotient ring R/I from the cokernel of a resultant map. This leads to what we call Truncated Normal Forms (TNFs). Algorithms for generic dense and sparse systems follow from the classical resultant constructions. In the presented framework, the concept of a border basis is generalized by relaxing the conditions on the set of basis elements. This allows for algorithms to adapt the choice of basis in order to enhance the numerical stability. We present such an algorithm. The numerical experiments show that the methods allow to compute all zeros of challenging systems (high degree, with a large number of solutions) in small dimensions with high accuracy.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3313880.3313888 | ACM Communications in Computer Algebra |
Field | DocType | Volume |
Truncated normal distribution,Discrete mathematics,Polynomial,Mathematics | Journal | 52 |
Issue | ISSN | Citations |
3 | 1932-2240 | 0 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Simon Telen | 1 | 0 | 1.01 |
| Bernard Mourrain | 2 | 1074 | 113.70 |
| Marc Van Barel | 3 | 294 | 45.82 |