We apply a family of iterative methods to the problem of extracting the \(n\)th root of a positive number \(R\), that is, to solve the nonlinear equation \(t^{n}-R=0\). For each value of \(n\) we obtain the method in the family for which the highest order of convergence is reached.
✦ LIBER ✦
A Third-Order Representation of the λμ-Calculus
✍ Scribed by Andreas Abel
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 376 KB
- Volume
- 58
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Calculus of nth roots and third order it
✍
J.M. Gutiérrez; M.A. Hernández; M.A. Salanova
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 187 KB
Direct determination of the third order
✍
Leila S. Balloomal; Lobna M. Salah; Gilbert Amat
📂
Article
📅
1988
🏛
Elsevier Science
🌐
English
⚖ 395 KB
A semantic characterization of the well-
✍
Thomas Forster
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 901 KB
Faithful π-nets.: A graphical representa
✍
Gabriel Ciobanu; Mihai Rotaru
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 976 KB
Starting from the -nets de ned by Milner, we present a graphical formalism called faithful -nets. The aim of these nets is to provide a graphical form to the systems with dynamically changing con gurations. The faithful -nets correspond precisely to the -calculus. The paper gives two fully abstract
Vector logics: The matrix-vector represe
✍
Eduardo Mizraji
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 405 KB
Structural completeness of the first-ord
✍
W. A. Pogorzelski; T. Prucnal
📂
Article
📅
1975
🏛
John Wiley and Sons
🌐
English
⚖ 427 KB
1. The problem of structural conipleteness of a logical system is formulated as the qiicstion about derivability in this system of all permissible and structural rules (cf. [lo]).