3 citations · 3 across the 3 of their papers we have counts for
4 papers
Low-Memory Numerical Certification
Paul Breiding, Taylor Brysiewicz, David K. Johnson
We introduce a low-memory framework for certifying numerical solutions to polynomial systems which uses solution iterators and spatial partitioning trees to reduce memory requireme…
A counterexample to Fermi isospectral rigidity for two dimensional discrete periodic Schrödinger operators
Taylor Brysiewicz, Matthew Faust, Wencai Liu
Using numerical certification, we prove the existence of a nontrivial real-valued two dimensional periodic potential whose associated discrete Schrödinger operator is Fermi isospec…
Decomposable sparse polynomial systems
Taylor Brysiewicz, Jose Israel Rodriguez, Frank Sottile +1
The Macaulay2 package DecomposableSparseSystems implements methods for studying and numerically solving decomposable sparse polynomial systems. We describe the structure of decompo…
Solving Decomposable Sparse Systems
Taylor Brysiewicz, Jose Israel Rodriguez, Frank Sottile +1
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 a…