Afficher la notice abrégée

An hybrid direct-iterative solver based on the Schur complement approach

hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorGAIDAMOUR, Jérémie
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorHÉNON, Pascal
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierAlgorithms and high performance computing for grand challenge applications [SCALAPPLIX]
dc.contributor.authorROMAN, Jean
hal.structure.identifierUniversity of Minnesota [Twin Cities] [UMN]
hal.structure.identifierDepartment of Computer Science and Engineering [Minneapolis]
hal.structure.identifierInstitut d'Informatique et de Mathématiques Appliquées de Grenoble [IMAG]
dc.contributor.authorSAAD, Yousef
dc.date.accessioned2024-04-15T09:52:43Z
dc.date.available2024-04-15T09:52:43Z
dc.date.created2006
dc.date.conference2006-09
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198542
dc.description.abstractEnAn hybrid direct-iterative solver based on the Schur complement approach. The resolution of large sparse linear systems is often the most consuming step in scientific applications. Parallel sparse direct solver are now able to solve efficiently real-life three-dimensional problems having in the order of several millions of equations, but anyway they are limited by the memory requirement. On the other hand, the iterative methods require less memory, but they often fail to solve ill-conditioned systems. We propose an hybrid direct-iterative method which aims at bridging the gap between these two classes of method. The keypoint of our method is to defined an ordering and a partitioning of the unknowns that relies on a form of nested dissection ordering in which cross points in the separators play a special role. The subgraphs obtained by the nested dissection correspond to the unknowns that are eliminated using a direct method and the Schur complement system on the remaining of the unknowns (that correspond to the interface between the subdomains) is solved using an iterative method. This special ordering and partitioning allows the use of dense block algorithms both in the direct and iterative part of the solver and provides a high degree of parallelism to these algorithms. We also propose several algorithmic variants to solve the Schur complement system.
dc.language.isoen
dc.title.enAn hybrid direct-iterative solver based on the Schur complement approach
dc.typeCommunication dans un congrès
dc.subject.halInformatique [cs]/Calcul parallèle, distribué et partagé [cs.DC]
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.title8th Workshop of the ERCIM Working group
bordeaux.countryIT
bordeaux.conference.citySalerne
bordeaux.peerReviewedoui
hal.identifierhal-00353584
hal.version1
hal.invitednon
hal.proceedingsnon
hal.popularnon
hal.audienceNon spécifiée
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00353584v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=GAIDAMOUR,%20J%C3%A9r%C3%A9mie&H%C3%89NON,%20Pascal&ROMAN,%20Jean&SAAD,%20Yousef&rft.genre=unknown


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée