Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Jose Israel Rodriguez"'
Publikováno v:
Journal of Software for Algebra and Geometry. 11:53-59
The Macaulay2 package DecomposableSparseSystems implements methods for studying and numerically solving decomposable sparse polynomial systems. We describe the structure of decomposable sparse systems and explain how the methods in this package may b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df8173c500512c630d3ea317dde229bb
https://doi.org/10.2140/jsag.2021.11.53
https://doi.org/10.2140/jsag.2021.11.53
Publikováno v:
ACM Communications in Computer Algebra. 54:44-48
The Macaulay2 [5] package AlgebraicOptimization implements methods for determining the algebraic degree of an optimization problem. We describe the structure of an algebraic optimization problem and explain how the methods in this package may be used
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a43f00494705a59c2c50b5f7f05aedc0
https://doi.org/10.1145/3427218.3427222
https://doi.org/10.1145/3427218.3427222
Publikováno v:
Advances in Geometry. 20:297-318
In the field of numerical algebraic geometry, positive-dimensional solution sets of systems of polynomial equations are described by witness sets. In this paper, we define multiprojective witness sets which encode the multidegree information of an ir
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a02b94f0abae7bdf39133438b9f164c
https://doi.org/10.1515/advgeom-2020-0006
https://doi.org/10.1515/advgeom-2020-0006
Publikováno v:
ACM Communications in Computer Algebra. 52:108-111
We introduce homogenized funtf (finite tight unit norm frames) varieties and study the degrees of their coordinate projections. These varieties compactify the affine funtf variety differently from the projectivizations studied in [12]. However, each
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c0f2ac67bbd8d736f2652814715bd7b
https://doi.org/10.1145/3313880.3313896
https://doi.org/10.1145/3313880.3313896
Amendola et al. proposed a method for solving systems of polynomial equations lying in a family which exploits a recursive decomposition into smaller systems. A family of systems admits such a decomposition if and only if the corresponding Galois gro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea7f6d6b4bb6b5e6f5312ab68096d190
http://arxiv.org/abs/2001.04228
http://arxiv.org/abs/2001.04228
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030521998
ICMS
ICMS
We develop a numerical nonlinear algebra approach for computing the Euler characteristic of an affine variety. Our approach is to relate Euler characteristics of a smooth affine variety with the number of critical points using Morse theory. In genera
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94e04db8b45a546e289adc0665208bdb
https://doi.org/10.1007/978-3-030-52200-1_5
https://doi.org/10.1007/978-3-030-52200-1_5
Let $X$ be a complex affine variety in $\mathbb{C}^N$, and let $f:\mathbb{C}^N\to \mathbb{C}$ be a polynomial function whose restriction to $X$ is nonconstant. For $g:\mathbb{C}^N \to \mathbb{C}$ a general linear function, we study the limiting behav
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f6eea7856bf443ff7fd67bc56b5f6d80
Publikováno v:
Foundations of Computational Mathematics. 18:867-890
The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the group, but ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4022fb57d6dda5515f1fc2c1afe4edfe
https://doi.org/10.1007/s10208-017-9356-x
https://doi.org/10.1007/s10208-017-9356-x
Autor:
Emil Horobeź, Jose Israel Rodriguez
Publikováno v:
Journal of Symbolic Computation. 79:99-107
For general data, the number of complex solutions to the likelihood equations is constant and this number is called the (maximum likelihood) ML-degree of the model. In this article, we describe the special locus of data for which the likelihood equat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0eb5079abe3bf260e5a344b371de50c9
https://doi.org/10.1016/j.jsc.2016.08.007
https://doi.org/10.1016/j.jsc.2016.08.007
We give a positive answer to a conjecture of Aluffi-Harris on the computation of the Euclidean distance degree of a possibly singular projective variety in terms of the local Euler obstruction function.
10 pages. Key words: Euclidean distance de
10 pages. Key words: Euclidean distance de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::165652285f2d5fff4e7ad475723a1bff
http://arxiv.org/abs/1901.05550
http://arxiv.org/abs/1901.05550