A blackbox polynomial system solver on parallel shared memory computers
From MaRDI portal
Abstract: A numerical irreducible decomposition for a polynomial system provides representations for the irreducible factors of all positive dimensional solution sets of the system, separated from its isolated solutions. Homotopy continuation methods are applied to compute a numerical irreducible decomposition. Load balancing and pipelining are techniques in a parallel implementation on a computer with multicore processors. The application of the parallel algorithms is illustrated on solving the cyclic -roots problems, in particular for , and~12.
Recommendations
Cited in
(3)
This page was built for publication: A blackbox polynomial system solver on parallel shared memory computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1798336)