SPARSE DIRECT SOLVER WITH FILL-IN OPTIMALIZATION

Abstract eng:
A symmetric sparse direct solver for finite element problems is presented. Solution of large systems can be very memory-demanding and timeconsuming process, and it may even be practically impossible if a classical frontal solver is used. The presented solver is based on LDLT factorization and uses various facilities to optimize solution calculations, in particular, optimal numbering scheme and efficient sparse matrix storage scheme. The solver is designed to work as an integral part of the computational system PMD.

• Export as: BibTeX | MARC | MARCXML | DC | EndNote | NLM | RefWorks
• Add to your basket