Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Noah S. Daleo"'
Publikováno v:
SYNASC
Minimizing the Euclidean distance (l2 -norm) from a given point to the solution set of a given system of polynomial equations can be accomplished via critical point techniques. This article extends critical point techniques to minimization with respe
Autor:
Noah S. Daleo, Jonathan D. Hauenstein
Publikováno v:
Journal of Symbolic Computation. 72:128-146
In numerical algebraic geometry, a witness point set W is a key object for performing numerical computations on a projective scheme X of pure dimension d 0 defined over C . If X is arithmetically Cohen-Macaulay, W can also be used to obtain informati
Publikováno v:
Portugaliae Mathematica. 73:71-90
In 2013, Abo and Wan studied the analogue of Waring's problem for systems of skew-symmetric forms and identified several defective systems. Of particular interest is when a certain secant variety of a Segre-Grassmann variety is expected to fill the n
Publikováno v:
Differential Geometry and its Applications
Differential Geometry and its Applications, Elsevier, 2017, 55, pp.78-105. ⟨10.1016/j.difgeo.2017.07.009⟩
Differential Geometry and its Applications, 2017, 55, pp.78-105. ⟨10.1016/j.difgeo.2017.07.009⟩
Differential Geometry and its Applications, Elsevier, 2017, 55, pp.78-105. ⟨10.1016/j.difgeo.2017.07.009⟩
Differential Geometry and its Applications, 2017, 55, pp.78-105. ⟨10.1016/j.difgeo.2017.07.009⟩
A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness sets via nume
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c75d22b10ae44a57354601a706af179
https://hal.inria.fr/hal-01250398/file/TensorDecomp_151215.pdf
https://hal.inria.fr/hal-01250398/file/TensorDecomp_151215.pdf
Autor:
Noah S. Daleo, Jonathan D. Hauenstein
Publikováno v:
Mathematical Aspects of Computer and Information Sciences ISBN: 9783319328584
MACIS
MACIS
Let $$X\subset {\mathbb P}^n$$ be a generically reduced projective scheme. A fundamental goal in computational algebraic geometry is to compute information about X even when defining equations for X are not known. We use numerical algebraic geometry
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d90efa2a6f1e014f227ffd44bb982902
https://doi.org/10.1007/978-3-319-32859-1_11
https://doi.org/10.1007/978-3-319-32859-1_11
When fixing a covariant gauge, most popularly the Landau gauge, on the lattice one encounters the Neuberger 0/0 problem which prevents one from formulating a Becchi--Rouet--Stora--Tyutin symmetry on the lattice. Following the interpretation of this p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::740ee0a5213e6dcd1c6e1632922773c1
http://arxiv.org/abs/1406.6678
http://arxiv.org/abs/1406.6678
Publikováno v:
Chaos: An Interdisciplinary Journal of Nonlinear Science. 25:053103
Finding equilibria of the finite size Kuramoto model amounts to solving a nonlinear system of equations, which is an important yet challenging problem. We translate this into an algebraic geometry problem and use numerical methods to find all of the