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

Numerical Solution of the Time-Dependent Navier–Stokes Equation for Variable Density–Variable Viscosity. Part I

TL;DR: In this paper, the Navier-Stokes equation for variable density and variable viscosity is solved for the time-dependent Navier and Stokes equation with variable density.
Journal ArticleDOI

A note on the convergence of asynchronous greedy algorithm with relaxation in a multiclass queueing environment

TL;DR: This letter considers the convergence of an asynchronous greedy algorithm with relaxation for Nash equilibrium in a noncooperative multiclass queueing environment and proposes also some relaxation parameters such that the algorithm converges very fast.
Journal ArticleDOI

BEM computations using the fast multipole method in combination with higher order elements and the Galerkin method

TL;DR: A new approach to the adaptive multilevel fast multipole method in combination with higher order elements and the Galerkin method is presented, showing that very large static problems with complex geometrical configuration can be solved on a small computer.
Journal ArticleDOI

A "Look-around Lanczos" algorithm for solving a system of linear equations

TL;DR: The algorithms proposed use a method based on selecting well-conditioned pairs of neighbouring polynomials, and the method is equivalent to going round the blocks instead of going across them, as is done in the well-known look-ahead methods.
Journal Article

Preconditioning of nonsymmetric saddle point systems as arising in modelling of viscoelastic problems.

TL;DR: Preconditioning of nonsymmetric saddle point systems as arising in modelling of viscoelastic problems is treated as a discrete-time problem.