.png){kind=icon}
Return
A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jcp.2013.10.030.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a fast algorithm for solutions to linear systems arising from three dimensional elliptic problems on a regular Cartesian mesh. We follow the approach of Schmitz and Ying (2012) on combining the nested dissection matrix factorization method with hierarchical matrices in two dimensions and extend it to the three dimensional case. A theoretical linear time complexity is derived and a more practical variant with slightly worse scaling is demonstrated. (C) 2013 Elsevier Inc. All rights reserved.
Keywords:
Elliptic equations
Fast algorithms
Nested dissection
Hierarchical matrices
Sparse matrix
Journal
IF:
3.8
Papers:
1.6W
Citations:
7.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more