𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convergence acceleration of iterative sequences. the case of scf iteration

✍ Scribed by Péter Pulay

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
529 KB
Volume
73
Category
Article
ISSN
0009-2614

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Accelerating the Convergence of Nonli
On Accelerating the Convergence of Nonlinear Iterative Algorithms
✍ D.W. Black; A.P. Rothmayer 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 505 KB

The underlying theory of vector sequence extrapolation methods for linear and nonlinear problems is examined. It is shown that nonlinearity limits savings in total number of iterations to \(50 \%\) for strongly nonlinear problems when linear-based extrapolation methods are used. In support of this c

A Comparative Study on Methods for Conve
A Comparative Study on Methods for Convergence Acceleration of Iterative Vector Sequences
✍ V. Eyert 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 396 KB

We discuss several methods for accelerating the convergence of the iterative solution of nonlinear equation systems commonly in tion they are solved by iteration (for a more detailed deuse and point to interrelations between them. In particular we invesscription see Ref. [9] and references therein)

Convergent sequences of iterated H-line
Convergent sequences of iterated H-line graphs
✍ Gary Chartrand; Heather Gavlas; Michelle Schultz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 629 KB

For a connected graph H of order at least 3, the H-line graph HL(G) of a graph G is defined as that graph whose vertices are the edges of G and where two vertices of HL(G) are adjacent if and only if the corresponding edges of G are adjacent and belong to a common copy of H. For k >~ 2, the kth ite

Convergence of sequences of iterated tri
Convergence of sequences of iterated triangular line graphs
✍ David Dorrough 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 333 KB

The triangular line graph T(G) of a graph G is the graph with vertex set E(G), with two distinct vertices e and f of T(G) adjacent if and only if the edges e and f belong to a common copy ofK 3 in G. For n/> 1, the nth iterated triangular line graph T"(G) of a graph G is defined as T(T n-I(G)), wher