✦ LIBER ✦

A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering

✍ Scribed by George Karypis; Vipin Kumar

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 1009 KB
Volume: 48
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1997.1403

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Serial and Parallel Algorithms for (k,2)

Serial and Parallel Algorithms for (k,2)-Partite Graphs

✍ J.A. Ellis; M. Matamontero; H. Muller 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 693 KB

We introduce a class of layered graphs which we call \((k, 2)\) partite and which we argue are an interesting class because of several important applications. We show that testing for \((k, 2)\) partiteness can be done efficiently both on sequential and parallel machines, by showing that membership

Minimal triangulation of a graph and opt

Minimal triangulation of a graph and optimal pivoting order in a sparse matrix

✍ Tatsuo Ohtsuki; Lap Kit Cheung; Toshio Fujisawa 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 596 KB

Parallelism, Preprocessing, and Reachabi

Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs

✍ P.N. Klein 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 602 KB

The problem of reachability in a directed graph has resisted attempts at efficient parallelization. Only for fairly dense graphs can we efficiently achieve significant parallel speedups, using known methods. We describe a technique allowing significant parallel speedup even for moderately sparse gra

Parallel sparse matrix vector multiply s

Parallel sparse matrix vector multiply software for matrices with data locality

✍ TUMINARO, RAY S.; SHADID, JOHN N.; HUTCHINSON, SCOTT A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 339 KB

In this paper we describe general software utilities for performing unstructured sparse matrixvector multiplications on distributed-memory message-passing computers. The matrix-vector multiply comprises an important kernel in the solution of large sparse linear systems by iterative methods. Our focu

Linear combination of Lanczos vectors: A

Linear combination of Lanczos vectors: A storage-efficient algorithm for sparse matrix eigenvector computations

✍ T. Koslowski; W. Von Niessen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 634 KB

We present a storage-efficient and robust algorithm for the computation of eigenvectors of large sparse symmetrical matrices using a Lanczos scheme. The algorithm is based upon a linear combination of Lanczos vectors (LCLV) with a variable iteration depth. A simple method is given to determine the i

A novel parallel algorithm for large-sca

A novel parallel algorithm for large-scale Fock matrix construction with small locally distributed memory architectures: RT parallel algorithm

✍ Hajime Takashima; So Yamada; Shigeru Obara; Kunihiro Kitamura; Shinjiro Inabata; 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 1 views

## Abstract We developed a novel parallel algorithm for large‐scale Fock matrix calculation with small locally distributed memory architectures, and named it the “__RT__ parallel algorithm.” The __RT__ parallel algorithm actively involves the concept of integral screening, which is indispensable fo