✦ LIBER ✦

A globally convergent zero finding method

✍ Scribed by Toshio Suzuki; Tomohiro Suzuki

Book ID: 104329960
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 274 KB
Volume: 47
Category: Article
ISSN: 0362-546X
DOI: 10.1016/s0362-546x(01)00506-5

No coin nor oath required. For personal study only.

✦ Synopsis

A new zero finding method for algebraic equation, using the Fourier coefficient on a circle in the complex plane, is proposed. The proof of the main theorem which guarantees its global convergence is shown precisely. Some results of numerical experiments are given.

📜 SIMILAR VOLUMES

A globally convergent method for nonline

A globally convergent method for nonlinear programming

✍ S. P. Han 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 528 KB

Globally Convergent Cutting Plane Method

Globally Convergent Cutting Plane Method for

✍ Napsu Karmitsa; Mario Tanaka Filho; José Herskovits 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 561 KB

Globally Convergent Modification of the

Globally Convergent Modification of the Quickprop Method

✍ Michael N. Vrahatis; George D. Magoulas; Vassilis P. Plagianakos 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 116 KB

Globally convergent modified Perry’s con

Globally convergent modified Perry’s conjugate gradient method

✍ Ioannis E. Livieris; Panagiotis Pintelas 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 433 KB

A globally and superlinearly convergent

A globally and superlinearly convergent modified SQP-filter method

✍ Ke Su 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 203 KB

A globally convergent method for semi-in

A globally convergent method for semi-infinite linear programming

✍ H. Hu 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 541 KB

This paper presents a globally convergent method for solving a general semi-infinite linear programming problem. Some important features of this method include: It can solve a semi-infinite linear program having an unbounded feasible region. It requires an inexact solution to a nonlinear subproblem