✦ LIBER ✦

The Newton-Kantorovich regularized computing processes

✍ Scribed by L. Aleksandrov

Publisher: Elsevier Science
Year: 1971
Weight: 490 KB
Volume: 11
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(71)90098-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Newton-Kantorovich method

✍ L.S. Rakovshchik 📂 Article 📅 1968 🏛 Elsevier Science ⚖ 661 KB

A regularizing algorithm based on the ne

A regularizing algorithm based on the newton-kantorovich method for solving variational inequalities

✍ A.B. Bakushinskii 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 599 KB

Extending the Newton–Kantorovich hypothe

Extending the Newton–Kantorovich hypothesis for solving equations

✍ Ioannis K. Argyros; Saïd Hilout 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 378 KB

The famous Newton-Kantorovich hypothesis (Kantorovich and Akilov, 1982 [3], Argyros, 2007 [2], Argyros and Hilout, 2009 [7]) has been used for a long time as a sufficient condition for the convergence of Newton's method to a solution of an equation in connection with the Lipschitz continuity of the

A strengthened Newton-Kantorovich method

A strengthened Newton-Kantorovich method with approximation of the inverse operator

✍ V.M. Verzhbitskii; Z.V. Tsalyuk 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 357 KB

The computer generated symbolic approxim

The computer generated symbolic approximations to systems of nonlinear ode's by matrix annihilation and the Newton-Kantorovich method

✍ James N. Hanson 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 442 KB

The convergence of a Halley-Chebysheff-t

The convergence of a Halley-Chebysheff-type method under Newton-Kantorovich hypotheses

✍ Ioannis K. Argyros 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 269 KB