29 search results - page 1 / 6 » Improving Parallel Ordering of Sparse Matrices Using Genetic... |
APIN
2005
13 years 5 months ago
2005
In the direct solution of sparse symmetric and positive definite linear systems, finding an ordering of the matrix to minimize the height 1
SIAMSC
2010
12 years 12 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
SC
2003
ACM
13 years 10 months ago
2003
ACM
We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. W...
ISCC
2006
IEEE
13 years 11 months ago
2006
IEEE
Genetic Algorithms are very powerful search methods that are used in different optimization problems. Parallel versions of genetic algorithms are easily implemented and usually in...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations PDEs over a nite region. The process of obtaini...