Result: Parallel FETI algorithms for mortars
Title:
Parallel FETI algorithms for mortars
Authors:
Source:
6th IMACS International Symposium on Iterative Methods in Scientific ComputingApplied numerical mathematics. 54(2):266-279
Publisher Information:
Amsterdam: Elsevier, 2005.
Publication Year:
2005
Physical Description:
print, 28 ref
Original Material:
INIST-CNRS
Subject Terms:
Mathematics, Mathématiques, Mechanics acoustics, Mécanique et acoustique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Analyse numérique. Calcul scientifique, Numerical analysis. Scientific computation, Méthodes de calcul scientifique (y compris calcul symbolique, calcul algébrique), Methods of scientific computing (including symbolic computation, algebraic computation), Algorithme parallèle, Parallel algorithm, Algoritmo paralelo, Analyse numérique, Numerical analysis, Análisis numérico, Mathématiques appliquées, Applied mathematics, Matemáticas aplicadas, Méthode discrétisation, Discretization method, Método discretización, Méthode élément fini, Finite element method, Método elemento finito, Méthode éléments joints, Mortar element method, Método elemento mortero, Parallélisation, Parallelization, Paralelisacíon, Performance algorithme, Algorithm performance, Resultado algoritmo, FETI, FETI method, Mortar finite elements, Parallel implementations
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Baruch College, City University of New York, 55 Lexington Avenue, Box B 6-230, New York, NY 10010, United States
Massachusetts Institute of Technology, 77 Massachusetts Avenue, Room 2-335, Cambridge, MA 02139, United States
Massachusetts Institute of Technology, 77 Massachusetts Avenue, Room 2-335, Cambridge, MA 02139, United States
ISSN:
0168-9274
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.16907338
Database:
PASCAL Archive
Further Information
We propose a new version of the FETI algorithm for mortar discretizations based on generalized coupling conditions across the interface. The new algorithm preserves the parallelization properties of, and has the same scalability properties as, the FETI method for continuous finite elements. We compare the numerical performance of the new algorithm with that of other FETI methods for mortars. When mortar conditions are required only on a small part of the interface, while continuity is required elsewhere, we show that the extra storage and extra computational effort required by the parallel algorithm is minimal.