✦ LIBER ✦

Usability levels for sparse linear algebra components

✍ Scribed by M. Sosonkina; F. Liu; R. Bramley

Publisher: John Wiley and Sons
Year: 2008
Tongue: English
Weight: 368 KB
Volume: 20
Category: Article
ISSN: 1532-0626
DOI: 10.1002/cpe.1277

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Component-based iterative methods for sp

Component-based iterative methods for sparse linear systems

✍ J. Jones; M. Sosonkina; Y. Saad 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 230 KB 👁 1 views

Sub-linear Distributed Algorithms for Sp

Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components

✍ Ramakrishna Thurimella 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 295 KB

A certificate for the k connectivity k connectivity refers to both k-edge . connectivity and k-vertex connectivity unless explicitly stated otherwise of a graph Ž . O kn . We present a distributed algorithm for computing a sparse certificate for k Ž . Ž . connectivity. Let f n and g n be the distri

ARMS: an algebraic recursive multilevel

ARMS: an algebraic recursive multilevel solver for general sparse linear systems

✍ Y. Saad; B. Suchomel 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB

Diagonal threshold techniques in robust

Diagonal threshold techniques in robust multi-level ILU preconditioners for general sparse linear systems

✍ Yousef Saad; Jun Zhang 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB 👁 1 views

This paper introduces techniques based on diagonal threshold tolerance when developing multi-elimination and multi-level incomplete LU (ILUM) factorization preconditioners for solving general sparse linear systems. Existing heuristics solely based on the adjacency graph of the matrices have been use