Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

APIN
2005

favoriteEmaildiscussreport

87views more APIN 2005»

Improving Parallel Ordering of Sparse Matrices Using Genetic Algorithms

13 years 4 months ago

Improving Parallel Ordering of Sparse Matrices Using Genetic Algorithms

Download www.csie.nuk.edu.tw

In the direct solution of sparse symmetric and positive definite linear systems, finding an ordering of the matrix to minimize the height 1

Wen-Yang Lin

Real-time Traffic

APIN 2005 | Direct Solution | Positive Definite Linear | Sparse Symmetric |

claim paper

Related Content

» HypergraphBased Unsymmetric Nested Dissection Ordering for Sparse LU Factorization

» Parallel Multilevel Sparse Approximate Inverse Preconditioners in Large Sparse Matrix Comp...

» Dejong Function Optimization by Means of a Parallel Approach to Fuzzified Genetic Algorith...

» Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems

» Sparse MatrixVector multiplication on FPGAs

» Improving Performance of Hypermatrix Cholesky Factorization

» Toward Optimal Diffusion Matrices

» Taxon ordering in phylogenetic trees a workbench test

» Efficient Matrix Chain Ordering in Polylog Time

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2005
Where	APIN
Authors	Wen-Yang Lin

Comments (0)