32 search results - page 1 / 7 » Newton's method and the Computational Complexity of the Fund... |
ENTCS
2008
13 years 4 months ago
2008
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
TYPES
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
MP
2006
13 years 4 months ago
2006
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
ENTCS
2006
13 years 4 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
CADE
2008
Springer
14 years 4 months ago
2008
Springer
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...