Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4977907 | Advances in Engineering Software | 2017 | 12 Pages |
Abstract
The presented speedups are asymptotic and they are reached for problems requiring high number of iterations (e.g., ill-conditioned problems, transient problems, contact problems). For problems which can be solved with under hundred iterations the local Schur complement method is not optimal. For these cases we have implemented sparse matrix processing using PARDISO also for the Xeon Phi accelerators.
Related Topics
Physical Sciences and Engineering
Computer Science
Software
Authors
Michal Merta, Lubomir Riha, Ondrej Meca, Alexandros Markopoulos, Tomas Brzobohaty, Tomas Kozubek, Vit Vondrak,