𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Scalable Parallel Algorithm for Incomplete Factor Preconditioning

✍ Scribed by Hysom, David; Pothen, Alex

Book ID
121452215
Publisher
Society for Industrial and Applied Mathematics
Year
2001
Tongue
English
Weight
198 KB
Volume
22
Category
Article
ISSN
1064-8275

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Scalable Parallel Algorithms for FPT Pro
Scalable Parallel Algorithms for FPT Problems
✍ Faisal N. Abu-Khzam; Michael A. Langston; Pushkar Shanbhag; Christopher T. Symon πŸ“‚ Article πŸ“… 2006 πŸ› Springer 🌐 English βš– 255 KB
A multilevel block incomplete factorizat
A multilevel block incomplete factorization preconditioning
✍ Y. Notay πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 177 KB

Incomplete factorization preconditioners based on recursive red-black orderings have been shown efficient for discrete second order elliptic PDEs with isotropic coefficients. However, they suffer for some weakness in presence of anisotropy or grid stretching. Here we propose to combine these orderin

Scalable Parallel Algorithms for Geometr
Scalable Parallel Algorithms for Geometric Pattern Recognition
✍ Laurence Boxer; Russ Miller; Andrew Rau-Chaplin πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 203 KB

This paper considers a variety of geometric pattern recognition problems on input sets of size n using a coarse grained multicomputer model consisting of p processors with 0(nΓ‚p) local memory each (i.e., 0(nΓ‚p) memory cells of 3(log n) bits apiece), where the processors are connected to an arbitrary