A scalable parallel factorization of finite element matrices with distributed Schur complements | Zendy

Maurer Daniel | Zendy; Wieners Christian | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

A scalable parallel factorization of finite element matrices with distributed Schur complements

Author(s) -

Maurer Daniel,

Wieners Christian

Publication year - 2016

Publication title -

numerical linear algebra with applications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.02

H-Index - 53

eISSN - 1099-1506

pISSN - 1070-5325

DOI - 10.1002/nla.2057

Subject(s) - factorization , scalability , finite element method , computer science , interface (matter) , mathematics , schur complement , parallel computing , element (criminal law) , distributed memory , algorithm , shared memory , structural engineering , eigenvalues and eigenvectors , physics , bubble , quantum mechanics , database , maximum bubble pressure method , law , political science , engineering

Summary We consider the parallel factorization of sparse finite element matrices on distributed memory machines. Our method is based on a nested dissection approach combined with a cyclic re‐distribution of the interface Schur complements. We present a detailed definition of the parallel method, and the well‐posedness and the complexity of the algorithm are analyzed. A lean and transparent functional interface to existing finite element software is defined, and the performance is demonstrated for several representative examples. Copyright © 2016 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research