✦ LIBER ✦

Improving Parallel Ordering of Sparse Matrices Using Genetic Algorithms

✍ Scribed by Wen-Yang Lin

Book ID: 106347593
Publisher: Springer US
Year: 2005
Tongue: English
Weight: 215 KB
Volume: 23
Category: Article
ISSN: 0924-669X
DOI: 10.1007/s10489-005-4611-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Robust Ordering of Sparse Matrices using

Robust Ordering of Sparse Matrices using Multisection

✍ Ashcraft, Cleve; Liu, Joseph W. H. 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 303 KB

Finding Optimal Ordering of Sparse Matri

Finding Optimal Ordering of Sparse Matrices for Column-Oriented Parallel Cholesky Factorization

✍ Wen-Yang Lin 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 151 KB

Application of parallel genetic algorith

Application of parallel genetic algorithms to generation expansion planning using parallel processors

✍ Yoshikazu Fukuyama; Yoshiteru Ueki 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 857 KB

Using parallelization and hardware concu

Using parallelization and hardware concurrency to improve the performance of a genetic algorithm

✍ Vijay Tirumalai; Kenneth G. Ricks; Keith A. Woodbury 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 711 KB

Improving performance of linear algebra

Improving performance of linear algebra algorithms for dense matrices, using algorithmic prefetch

✍ Agarwal, R. C.; Gustavson, F. G.; Zubair, M. 📂 Article 📅 1994 🏛 IBM 🌐 English ⚖ 985 KB

A parallel algorithm for the partial eig

A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y-MP

✍ Giorgio Pini 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 482 KB

A parallel algorithm for the calculation of the p leftmost eigenpairs of large, sparse FE\_M. matrices is presented. Test problems are carried out on symmetric, positive definite matrices whose dimensions range from N = 222 to N = 4560. The method, which is intrinsically parallel, is based on the si