Numerical nonlinear algebra
Numerical nonlinear algebra is a computational paradigm that uses numerical analysis to
study polynomial equations. Its origins were methods to solve systems of polynomial …
study polynomial equations. Its origins were methods to solve systems of polynomial …
Numerical homotopies from Khovanskii bases
We present numerical homotopy continuation algorithms for solving systems of equations on
a variety in the presence of a finite Khovanskii basis. These homotopies take advantage of …
a variety in the presence of a finite Khovanskii basis. These homotopies take advantage of …
Solving decomposable sparse systems
Améndola 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 …
family which exploits a recursive decomposition into smaller systems. A family of systems …
The distribution of the number of real solutions to the power flow equations
J Lindberg, A Zachariah, N Boston… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
In this paper we study the distributions of the number of real solutions to the power flow
equations over varying electrical parameters. We develop a new monodromy and parameter …
equations over varying electrical parameters. We develop a new monodromy and parameter …
Estimating Gaussian mixtures using sparse polynomial moment systems
The method of moments is a statistical technique for density estimation that solves a system
of moment equations to estimate the parameters of an unknown distribution. A fundamental …
of moment equations to estimate the parameters of an unknown distribution. A fundamental …
Galois groups in enumerative geometry and applications
As Jordan observed in 1870, just as univariate polynomials have Galois groups, so do
problems in enumerative geometry. Despite this pedigree, the study of Galois groups in …
problems in enumerative geometry. Despite this pedigree, the study of Galois groups in …
Exploiting symmetry in the power flow equations using monodromy
J Lindberg, N Boston, BC Lesieutre - ACM Communications in Computer …, 2021 - dl.acm.org
We propose solving the power flow equations using monodromy. We prove the variety under
consideration decomposes into trivial and nontrivial subvarieties and that the nontrivial …
consideration decomposes into trivial and nontrivial subvarieties and that the nontrivial …
Toric Varieties and Numerical Algorithms for Solving Polynomial Systems
EA Walker - 2022 - search.proquest.com
This work utilizes toric varieties for solving systems of equations. In particular, it includes two
numerical homotopy continuation algorithms for numerically solving systems of equations …
numerical homotopy continuation algorithms for numerically solving systems of equations …
Distributions of the number of solutions to the network power flow equations
A Zachariah, Z Charles, N Boston… - … Symposium on Circuits …, 2018 - ieeexplore.ieee.org
Operation and planning of electric grids involve the analysis of certain power flow equations,
which exhibit multiple solutions. One solution generally corresponds to a preferred operating …
which exhibit multiple solutions. One solution generally corresponds to a preferred operating …
Invariants of SDP exactness in quadratic programming
J Lindberg, JI Rodriguez - Journal of Symbolic Computation, 2024 - Elsevier
In this paper we study the Shor relaxation of quadratic programs by fixing a feasible set and
considering the space of objective functions for which the Shor relaxation is exact. We first …
considering the space of objective functions for which the Shor relaxation is exact. We first …