Titlebook: Recent Advances in Iterative Methods; Gene Golub,Mitchell Luskin,Anne Greenbaum Conference proceedings 1994 Springer-Verlag New York, Inc.

不合

Incomplete Block Factorizations as Preconditioners for Sparse SPD Matrices,and the one in inverse free form) are considered and shown to give rise to SPD preconditioned under certain general assumptions on sparse approximations to pivot blocks. An implementation of CG iterations preconditioned with an IBF in inverse free form on a two-dimensional grid of processors is sugg

SEMI

Fecundity

Rational Krylov Algorithms for Nonsymmetric Eigenvalue Problems,anczos (or Araoldi) algorithm, in which several shifts are used in one run. It computes an orthogonal basis and a small Hessenberg pencil. The eigensolution of the Hessenberg pencil, gives Ritz approximations to the solution of the original pencil..Rational Krylov is the natural alternative when fac

領(lǐng)導(dǎo)權(quán)

脫離

陶器

On the Error Computation for Polynomial Based Iteration Methods,. The algorithms are based on the theory of modified moments and Gaussian quadrature. The proposed schemes are also applicable for other polynomial iteration schemes. Several examples, illustrating the performance of the described methods, are presented.

Dungeon

商業(yè)上

閑聊

A Two-Stage Iteration for Solving Nearly Completely Decomposable Markov Chains,tions with Rayleigh-Ritz refinements. Under natural regularity conditions, the composite iteration reduces the error by a factor proportional to the size of the coupling between aggregates, so that the more loosely the chain is coupled, the faster the convergence.

詞匯

Conference proceedings 1994l part of the 1991-92 IMA program on "Applied Linear Algebra. " Large systems of matrix equations arise frequently in applications and they have the prop- erty that they are sparse and/or structured. The purpose of this workshop was to bring together researchers in numerical analysis and various ap-