Weighted graph based ordering techniques for preconditioned conjugate gradient methods | Zendy

Simon S. Clift | Zendy; Wei-Pai Tang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Weighted graph based ordering techniques for preconditioned conjugate gradient methods

Author(s) -

Simon S. Clift,

Wei-Pai Tang

Publication year - 1995

Publication title -

bit numerical mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.904

H-Index - 59

eISSN - 1572-9125

pISSN - 0006-3835

DOI - 10.1007/bf01732977

Subject(s) - conjugate gradient method , heuristic , mathematics , factorization , incomplete cholesky factorization , matrix (chemical analysis) , basis (linear algebra) , conjugate , graph , algorithm , mathematical optimization , combinatorics , sparse matrix , mathematical analysis , geometry , computational chemistry , chemistry , materials science , composite material , gaussian

We describe the basis for a matrix ordering heuristic for improving incompletefactorization for preconditioned conjugate gradient techniques applied to anisotropicPDE's. Several new matrix ordering techniques, derived from well-known algorithms incombinatorial graph theory, which attempt to implement this heuristic, are described.These ordering techniques are tested against a number of matrices arising from linearanisotropic PDE's, and compared with other matrix ordering techniques. A...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research