This function determines if a given point or interval box is associated to a singular solution for a given system. It uses the fact that a singular solution can be regularized via the deflation method (e.g. see "Newton's method with deflation for isolated singularities of polynomial systems" (2006). Caveat : Certification is done by a subsystem obtained from the deflation method. It may produce a false positive result probabilistically.
|
|
|
|
It is known that an isolated singular solution is regularized within finitely many steps by the iterated first order deflation (e.g. see "Newton's method with deflation for isolated singularities of polynomial systems" (2006)). A positive integer can be given as a number of iterations. If no number is given, it iterates until the solution is regularized (hence, it may not be terminated).
|
|
|
|
|
As it checks the regularity of a numerical point eventually, two strategies (alpha theory and interval arithmetic) can be used.
|
The object certifySingularSolution is a method function with options.