Search Results

You are looking at 1 - 3 of 3 items for :

  • "Sparse solver" x
  • All content x
Clear All

The minimum degree ordering is one of the most widely used algorithms to preorder a symmetric sparse matrix prior to numerical factorization. There are number of variants which try to reduce the computational complexity of the original algorithm while maintaining a reasonable ordering quality. An in-house finite element solver is used to test several minimum degree algorithms to find the most suitable configuration for the use in the Finite Element Method. The results obtained and their assessments are presented along with the minimum degree ordering algorithms overview.

Restricted access

., Mandel J. Theoretical comparison of the FETI and algebraically partitioned FETI methods, and performance comparisons with a direct sparse solver, International Journal for Numerical Methods in Engineering Vol. 46, No. 4, 1999, pp. 501

Restricted access

always used. The “PARDISO/Parallel Direct Sparse Solver Interface’’ solver [ 57 ] was chosen for all our simulations, for solving large linear systems of equations on shared memory multiprocessors. 3.2 Computational air domain The FEM simulation of our

Open access