Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4945999 | Journal of Symbolic Computation | 2017 | 8 Pages |
Abstract
An efficient technique for finding numerical approximations of isolated solutions of polynomial systems with a particular structure is presented. This structure is quite specific but arises naturally, for example when computing the critical points of a symmetric polynomial energy function. An illustrative example from magnetism is presented, along with some timing comparisons.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Daniel J. Bates, Andrew J. Newell, Matthew E. Niemerg,