In complex analysis, the winding number measures the number of times a path (counter-clockwise) winds around a point, while the Cauchy index can approximate how the path winds. We formalise this approximation in the Isabelle theorem prover, and provide a tactic to evaluate winding numbers through Cauchy indices. By further combining this approximation with the argument principle, we are able to make use of remainder sequences to effectively count the number of complex roots of a polynomial within some domains, such as a rectangular box and a half-plane
We define a generalization of the winding number of a piecewise C1 cycle in the complex plane which ...
We define a generalization of the winding number of a piecewise C1 cycle in the complex plane which ...
The author was supported by an EPSRC Standard Grant No. (EP/R015104/1) and a Leverhulme Trust Resear...
The winding number is one of the most basic invariants in topology. It measures the number of times ...
AbstractMany methods to compute the winding number of plane curves have been proposed, often with th...
Many problems in computer algebra and numerical analysis can be reduced to counting or approximating...
As verification efforts using interactive theorem proving grow, we are in need of certified algorith...
ABSTRACT. Sturm’s theorem (1829/35) provides an elegant algorithm to count and locate the real roots...
Consiglio Nazionale delle Ricerche (CNR). Biblioteca Centrale / CNR - Consiglio Nazionale delle Rich...
Many problems in computer algebra and numerical analysis can be reduced to counting or approximating...
The writhing number measures the global geometry of a closed space curve or knot. We show that this ...
Complex numbers, roots of a polynomial, Argument PrincipleIn the complex plane, consider the image o...
Complex numbers, roots of a polynomial, Argument PrincipleIn the complex plane, consider the image o...
The determination of roots of a function is a problem that manifests itself in almost every branch o...
The usual methods for root finding of polynomials are based on the iteration of a numerical formula ...
We define a generalization of the winding number of a piecewise C1 cycle in the complex plane which ...
We define a generalization of the winding number of a piecewise C1 cycle in the complex plane which ...
The author was supported by an EPSRC Standard Grant No. (EP/R015104/1) and a Leverhulme Trust Resear...
The winding number is one of the most basic invariants in topology. It measures the number of times ...
AbstractMany methods to compute the winding number of plane curves have been proposed, often with th...
Many problems in computer algebra and numerical analysis can be reduced to counting or approximating...
As verification efforts using interactive theorem proving grow, we are in need of certified algorith...
ABSTRACT. Sturm’s theorem (1829/35) provides an elegant algorithm to count and locate the real roots...
Consiglio Nazionale delle Ricerche (CNR). Biblioteca Centrale / CNR - Consiglio Nazionale delle Rich...
Many problems in computer algebra and numerical analysis can be reduced to counting or approximating...
The writhing number measures the global geometry of a closed space curve or knot. We show that this ...
Complex numbers, roots of a polynomial, Argument PrincipleIn the complex plane, consider the image o...
Complex numbers, roots of a polynomial, Argument PrincipleIn the complex plane, consider the image o...
The determination of roots of a function is a problem that manifests itself in almost every branch o...
The usual methods for root finding of polynomials are based on the iteration of a numerical formula ...
We define a generalization of the winding number of a piecewise C1 cycle in the complex plane which ...
We define a generalization of the winding number of a piecewise C1 cycle in the complex plane which ...
The author was supported by an EPSRC Standard Grant No. (EP/R015104/1) and a Leverhulme Trust Resear...