PARFES: A method for solving finite element linear equations on multi-core computers

Authors:
S. Fialko
Affiliations:
Department of Physics, Mathematics and Applied Computer Science, Cracow University of Technology, Kraków 31-155, Poland
Venue:
Advances in Engineering Software
Year:
2010

Citing 6
Cited 1

The evolution of the minimum degree ordering algorithm

SIAM Review
Applied numerical linear algebra

Applied numerical linear algebra
Computer Solution of Large Sparse Positive Definite

Computer Solution of Large Sparse Positive Definite
Two-level dynamic scheduling in PARDISO: improved scalability on shared memory multiprocessing systems

Parallel Computing - Parallel matrix algorithms and applications
The design of sparse direct solvers using object-oriented techniques

The design of sparse direct solvers using object-oriented techniques
Anatomy of high-performance matrix multiplication

ACM Transactions on Mathematical Software (TOMS)

A complete development process of finite element software for body-in-white structure with semi-rigid beams in .NET framework

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

The method suggested here is intended for solving sets of linear algebraic equations with symmetric sparse matrices. It is oriented at the usage in finite element analysis software operated on multi-core desktop computers. Algorithms of parallelization have been implemented which speed up the method intensively as more processors are added, both in the core memory mode and when using the hard disk storage. PARFES features a higher performance and speedup ability than the multi-frontal method do, because it requires a minimum amount of data transfers - actions that speed up poorly by parallelization available on multi-core desktop computers.