In the present paper a natural extension of the Cholesky factorization, adapted to the peculiar matrix-structure of the solving system of Symmetric Galerkin Boundary Element Methods is presented. The implementation is described in some detail and preliminary timing figures are given, showing that the proposed approach is considerably faster than the Bunch-Kaufman factorization for non-definite matrices. Thread-based parallelism is exploited to show the scalability of the algorithm on moderately parallel shared memory multiprocessors.

Efficient implementation of a generalized Cholesky factorization for Symmetric Galerkin Boundary Element Methods

MICCOLI, STEFANO
2003

Abstract

In the present paper a natural extension of the Cholesky factorization, adapted to the peculiar matrix-structure of the solving system of Symmetric Galerkin Boundary Element Methods is presented. The implementation is described in some detail and preliminary timing figures are given, showing that the proposed approach is considerably faster than the Bunch-Kaufman factorization for non-definite matrices. Thread-based parallelism is exploited to show the scalability of the algorithm on moderately parallel shared memory multiprocessors.
File in questo prodotto:
File Dimensione Formato  
art%3A10.1007%2Fs00466-003-0493-5.pdf

Accesso riservato

Descrizione: Article version of record
: Publisher’s version
Dimensione 316.93 kB
Formato Adobe PDF
316.93 kB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11311/254137
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 1
social impact