Partitioning and Fill Reducing Ordering Algorithm
I have created a set of partitioning algorithms that also produce the optimal fill reducing orderings (per partition/subdomain). Such algorithms are used in applications where the domain is split across processors (parallel processing), and then a direct method is used per subdomain to solve the linear system (LU type).
I am looking for applications to test the efficiency of the proposed algorithms.
These algorithms are based on the METIS package.
|All times are GMT -4. The time now is 10:52.|