A DIRECT SOLVER WITH O(N) COMPLEXITY FOR VARIABLE COEFFICIENT ELLIPTIC PDES DISCRETIZED VIA A HIGH-ORDER COMPOSITE SPECTRAL COLLOCATION METHOD

被引:37
作者
Gillman, A. [1 ]
Martinsson, P. G. [2 ]
机构
[1] Dartmouth Coll, Dept Math, Hanover, NH 03755 USA
[2] Univ Colorado, Dept Appl Math, Boulder, CO 80309 USA
基金
美国国家科学基金会;
关键词
fast direct solver; high-order discretization; multidomain spectral method; nested dissection; multifrontal method; structured matrix algebra; hierarchically block separable matrix; reduction to interface; Dirichlet-to-Neumann operator; Poincare-Steklov operator; INTEGRAL-EQUATIONS; ALGORITHM;
D O I
10.1137/130918988
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A numerical method for solving elliptic PDEs with variable coefficients on two-dimensional domains is presented. The method is based on high-order composite spectral approximations and is designed for problems with smooth solutions. The resulting system of linear equations is solved using a direct ( as opposed to iterative) solver that has optimal O(N) complexity for all stages of the computation when applied to problems with nonoscillatory solutions such as the Laplace and the Stokes equations. Numerical examples demonstrate that the scheme is capable of computing solutions with a relative accuracy of 10(-10) or better for challenging problems such as highly oscillatory Helmholtz problems and convection-dominated convection-diffusion equations. In terms of speed, it is demonstrated that a problem with a nonoscillatory solution that was discretized using 108 nodes can be solved in 115 minutes on a personal workstation with two quad-core 3.3 GHz CPUs. Since the solver is direct, and the "solution operator" fits in RAM, any solves beyond the first are very fast. In the example with 108 unknowns, solves require only 30 seconds.
引用
收藏
页码:A2023 / A2046
页数:24
相关论文
共 26 条
[1]  
[Anonymous], 2000, SIAM
[2]  
[Anonymous], 2011, THESIS U COLORADO BO
[3]   A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices [J].
Chandrasekaran, S ;
Gu, M .
NUMERISCHE MATHEMATIK, 2004, 96 (04) :723-731
[4]   A fast, direct algorithm for the Lippmann-Schwinger integral equation in two dimensions [J].
Chen, Y .
ADVANCES IN COMPUTATIONAL MATHEMATICS, 2002, 16 (2-3) :175-190
[5]  
Chen Y., 2013, ARXIV13022101
[6]   Algorithm 832: UMFPACK V4.3 - An unsymmetric-pattern multifrontal method [J].
Davis, TA .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2004, 30 (02) :196-199
[7]  
Duff IS., 1989, Direct methods for sparse matrices
[8]   NESTED DISSECTION OF A REGULAR FINITE-ELEMENT MESH [J].
GEORGE, A .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1973, 10 (02) :345-363
[9]   A direct solver with O(N) complexity for integral equations on one-dimensional domains [J].
Gillman, Adrianna ;
Young, Patrick M. ;
Martinsson, Per-Gunnar .
FRONTIERS OF MATHEMATICS IN CHINA, 2012, 7 (02) :217-247
[10]  
Greengard L, 2009, ACTA NUMER, V18, P243, DOI 10.1017/S0962492906410011