Solving Polynomial Systems Equation by Equation
Andrew J. Sommese, Jan Verschelde, Charles W. Wampler
Abstract
By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure to intersect general solution sets. Of particular interest is the special case where one of the sets is defined by a single polynomial equation. This leads to an algorithm for finding a numerical representation of the solution set of a system of polynomial equations introducing the equations one-by-one. Preliminary computational experiments show this approach can exploit the special structure of a polynomial system, which improves the performance of the path following algorithms.
Create a lesson
Related papers
Neural Network Preconditioning: A Case Study for the Solution of the Parametric Helmholtz Equation
Luc Giraud, Carola Kruse, Paul Mycek et al.
On the cyclic limiting behavior of the restarted Arnoldi algorithm for real symmetric matrices with restart length s=2
Vance Faber, Jarek Liesen, Jörg Liesen et al.
An algebraic multiscale framework for two-level overlapping Schwarz preconditioners
Filipe Cumaru, Hadi Hajibeygi, Cornelis Vuik et al.
Stable Matrix-Free Q-less QR via Preconditioning and Randomization
Oleg Balabanov, Maksim Melnichenko, Michael W. Mahoney
High-order uniformly accurate fully discrete schemes with long time near-conservations for two nonlinear coupled dispersive models in the nonrelativistic regime
Lina Wang, Jiyong Li, Bin Wang
CLNO: Conservative Local Neural Operator for Compressible Flow Prediction
Buxuan Wang, Rongzu Li, Qingsong Zou