scispace - formally typeset
Open AccessBook

Iterative Solution Methods

Reads0
Chats0
TLDR
This paper presents a meta-analyses of matrix eigenvalues and condition numbers for preconditional matrices using the framework of the Perron-Frobenius theory for nonnegative matrices and some simple iterative methods.
Abstract
Preface Acknowledgements 1. Direct solution methods 2. Theory of matrix eigenvalues 3. Positive definite matrices, Schur complements, and generalized eigenvalue problems 4. Reducible and irreducible matrices and the Perron-Frobenius theory for nonnegative matrices 5. Basic iterative methods and their rates of convergence 6. M-matrices, convergent splittings, and the SOR method 7. Incomplete factorization preconditioning methods 8. Approximate matrix inverses and corresponding preconditioning methods 9. Block diagonal and Schur complement preconditionings 10. Estimates of eigenvalues and condition numbers for preconditional matrices 11. Conjugate gradient and Lanczos-type methods 12. Generalized conjugate gradient methods 13. The rate of convergence of the conjugate gradient method Appendices.

read more

Citations
More filters
Journal ArticleDOI

Application of Stochastic Finite Element Methods to Study the Sensitivity of ECG Forward Modeling to Organ Conductivity

TL;DR: This study has developed a systematic, stochastic approach to the analysis of sensitivity of the forward problem of electrocardiography to the parameter of inhomogeneous tissue conductivity and shows that a systematic study of sensitivity is not only easily feasible with the gPC-SG approach but can also provide valuable insight into characteristics of the specific simulation.
Journal ArticleDOI

Stokes flow around cylinders in a bounded two-dimensional domain using multipole-accelerated boundary element methods

TL;DR: The multipole technique is applied to both direct and indirect formulations and it is found that the indirect approach is sufficiently well-conditioned to allow the use of fast multipole methods.
Journal ArticleDOI

Two-level preconditioners for regularized inverse problems I: Theory

TL;DR: It is observed that for regularized ill-posed problems with relevant parameter values the additive Schwarz preconditioner significantly increases the condition number, and the multiplicative version greatly improves conditioning, much beyond the existing theoretical worst-case bounds.
Proceedings ArticleDOI

A fixed-neighbor, distributed algorithm for solving a linear algebraic equation

TL;DR: It is shown that for any nonsingular matrix A and any connected graph G, the proposed algorithm causes all agents' estimates to converge exponentially fast to the desired solution A-1b.
Journal ArticleDOI

An efficient diagonal preconditioner for finite element solution of Biot's consolidation equations

TL;DR: In this article, a robust generalized Jacobi (GJ) preconditioner was proposed for solving very large-scale Biot's finite element equations using the symmetric quasi-minimal residual method.