Efficient Implementation of Total FETI Solver for Graphic Processing Units Using Schur Complement
From MaRDI portal
Publication:2813290
DOI10.1007/978-3-319-40361-8_6zbMath1382.65006OpenAlexW2500566174MaRDI QIDQ2813290
Olaf Schenk, Tomáš Kozubek, Tomáš Brzobohatý, Alexandros Markopoulos, Wim Vanroose, Ondřej Meca, Lubomír Říha
Publication date: 23 June 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-40361-8_6
Parallel numerical computation (65Y05) Software, source code, etc. for problems pertaining to numerical analysis (65-04)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Cholesky decomposition of a positive semidefinite matrix with known kernel
- On large-scale generalized inverses in solving two-by-two block linear systems
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
- An Augmented Incomplete Factorization Approach for Computing the Schur Complement in Stochastic Optimization
- Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure
- Total FETI-an easier implementable variant of the FETI method for numerical solution of elliptic PDE
- An Unconventional Domain Decomposition Method for an Efficient Parallel Solution of Large-Scale Finite Element Systems
- On Large-Scale Diagonalization Techniques for the Anderson Model of Localization
This page was built for publication: Efficient Implementation of Total FETI Solver for Graphic Processing Units Using Schur Complement
