Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)
The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 3 of 80
Back to Result List

Massively Parallel Linearly-Implicit Extrapolation Algorithms as a Powerful Tool in Process Simulation.

Please always quote using this URN: urn:nbn:de:0297-zib-3127
  • We study the parallelization of linearly--implicit extrapolation codes for the solution of large scale PDE systems and differential algebraic equations on distributed memory machines. The main advantage of these algorithms is that they enable adapativity both in time and space. Additive Krylov--Schwarz methods yield high parallel perfomance for such extrapolation methods. Our approach combines a slightly overlapping domain decomposition together with a polynomial block Neumann preconditioner and a reduced system technique. Furthermore we get important advantages through the explicit computation of the matrix--products of the preconditioner and the matrix of the linear system. The parallel algorithms exhibit scalability up to 64 processors already for medium--sized test problems. We show that the codes are really efficient in large application systems for chemical engineering problems.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Metadaten
Author:Rainald Ehrig, Ulrich Nowak, Peter Deuflhard
Document Type:ZIB-Report
Date of first Publication:1997/09/25
Series (Serial Number):ZIB-Report (SC-97-43)
ZIB-Reportnumber:SC-97-43
Published in:Appeared in: E. H. D'Hollander, G. R. Joubert, F. J. Peters, U. Trottenberg (eds.), Advances in Parallel Computing, Vol. 12: Parallel Computing: Fundamentals, Applications and New Directions, Elsevier, pp.517-524 (1998)
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.