𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Superlinearly convergent PCG algorithms for some nonsymmetric elliptic systems

✍ Scribed by J. Karátson; T. Kurics


Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
211 KB
Volume
212
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis


A preconditioned conjugate gradient method is applied to finite element discretizations of some nonsymmetric elliptic systems. Mesh independent superlinear convergence is proved, which is an extension of a similar earlier result from a single equation to systems. The proposed preconditioning method involves decoupled preconditioners, which yields small and parallelizable auxiliary problems.


📜 SIMILAR VOLUMES


A mesh independent superlinear algorithm
✍ I. Antal; J. Karátson 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 326 KB

The numerical solution of nonlinear elliptic transport systems is considered. An outer-inner (damped inexact Newton plus PCG type) iteration is proposed for the finite element discretization of the problem, and mesh independent superlinear convergence is proved for both the outer and inner iteration

Convergence analysis of superoptimal PCG
✍ Seak-Weng Vong; Wei Wang; Xiao-Qing Jin 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 177 KB

Recently, Lu and Hurvich [Y. Lu, C. Hurvich, On the complexity of the preconditioned conjugate gradient algorithm for solving toeplitz systems with a Fisher-Hartwig singularity, SIAM J. Matrix Anal. Appl. 27 (2005) 638-653] used the preconditioned conjugate gradient method with the optimal circulant

A superlinearly convergent constrained m
✍ B. Rustem 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 729 KB

In the presence of rival models of the same economic system, an optimal policy can be computed that takes account of the existence of all the models. A min-max, worst-case design, problem is formulated and subsequently restated as an alternative min-max problem. A numerical example of this approach