Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. A direct parallel sparse matrix solver
 
research article

A direct parallel sparse matrix solver

Tran, T. M.  
•
Gruber, R.  
•
Appert, K.  
Show more
1996
Computer Physics Communications

The direct sparse matrix solver is based on a domain decomposition technique to achieve data and work parallelization. Geometries that have long and thin structures are specially efficiently tractable with this solver, provided that they can be decomposed mainly in one direction. Due to the separation of the algorithm into a factorization stage and a solution stage, time-dependent problems with a constant coefficient matrix are particularly well suited for this solver. The parallelization performances obtained on a Gray T3D show that the method scales up to at least 256 processors.

  • Details
  • Metrics
Type
research article
DOI
10.1016/0010-4655(96)00007-0
Author(s)
Tran, T. M.  
Gruber, R.  
Appert, K.  
Wuthrich, S.
Date Issued

1996

Published in
Computer Physics Communications
Volume

96

Issue

2-3

Start page

118

End page

128

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
CRPP  
SPC  
Available on Infoscience
April 16, 2008
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/21364
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés