𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A version of the Aitken accelerator for computer iteration

✍ Scribed by Bruce M. Irons; Robert C. Tuck

Publisher
John Wiley and Sons
Year
1969
Tongue
English
Weight
161 KB
Volume
1
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A unified framework for accelerating the
A unified framework for accelerating the convergence of iterative substructuring methods with Lagrange multipliers
✍ Charbel Farhat; Po-Shu Chen; Franck Risler; Francois-Xavier Roux πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 348 KB πŸ‘ 1 views

The FETI algorithms are a family of numerically scalable substructuring methods with Lagrange multipliers that have been designed for solving iteratively large-scale systems of equations arising from the ΓΏnite element discretization of structural engineering, solid mechanics, and structural dynamics

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)

Preconditioned minimum residual iteratio
Preconditioned minimum residual iteration for the h–p version of the coupled FEM/BEM with quasi-uniform meshes
✍ Norbert Heuer; Matthias Maischak; Ernst P. Stephan πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 121 KB

We propose and analyze efficient preconditioners for the minimum residual method to solve indefinite, symmetric systems of equations arising from the h-p version of finite element and boundary element coupling. According to the structure of the Galerkin matrix we study two-and three-block preconditi