Abstract
This paper presents a fast direct solver for 3D discretized linear systems using the supernodal multifrontal method together with low-rank approximations. For linear systems arising from certain partial differential equations (PDEs) such as elliptic equations, during the Gaussian elimination of the matrices with Nested Dissection ordering, the fill-in of L and U factors loses its sparsity and contains dense blocks with low-rank property. Off-diagonal blocks can be efficiently approximated with low-rank matrices; diagonal blocks approximated with semiseparable structures called hierarchically semiseparable (HSS) representations. Matrix operations in the multifrontal method are performed in low-rank arithmetic. We present efficient way to organize the HSS structured operations along the elimination. To compress dense blocks into low-rank or HSS structures, we use effective cross approximation (CA) approach. We also use idea of adaptive balancing between robust arithmetic for computing the small dense blocks and low-rank matrix operations for handling with compressed ones while performing the Gaussian elimination. This new proposed solver can be essentially parallelized both on architecture with shared and distributed memory and can be used as effective preconditioner. To check efficient of our solver we compare it with Intel MKL PARDISO - the high performance direct solver. Memory and performance tests demonstrate up to 3 times performance and memory gain for the 3D problems with more than \(10^6\) unknowns. Therefore, proposed multifrontal HSS solver can solve large problems, which cannot be resolved by direct solvers because of large memory consumptions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
George, A.: Nested dissection of a regular finite elementmesh. SIAM J. Numer. Anal. 10(2), 345–363 (1973)
Chandrasekaran, S., Dewilde, P., Gu, M., Somasunderam, N.: On the numerical rank of the off-diagonal blocks of schur complements of discretized elliptic PDEs. Siam J. Matrix Anal. Appl. 31(5), 2261–2290 (2010)
Hackbusch, W.: A sparse matrix arithmetic based on H-matrices. part I: Introduction to H-matrices. Computing 62(2), 89–108 (1999)
Rjasanow, S.: Adaptive cross approximation of dense matrices. In: IABEM 2002, International Association for Boundary Element Methods, UT Austin, 28–30 May 2002
Le Borne, S., Grasedyck, L., Kriemann, R.: Domain-decomposition based H-LU preconditioners. In: Widlund, O.B., Keyes, D.E. (eds.) Domain Decomposition Methods in Science and Engineering XVI. LNCSE, vol. 55, pp. 667–674. Springer, Heidelberg (2007)
Xia, J.: Robust and efficient multifrontal solver for large discretized PDEs. In: Berry, M.W., Gallivan, K.A., Gallopoulos, E., Grama, A., Phillippe, B., Saad, Y., Saied, F. (eds.) High-Performance Scientific Computing, pp. 199–217. Springer, London (2012)
Wang, S., de Hoo, M.V., Xia, J., Li, X.S.: Massively parallel structured multifrontal solver for time-harmonic elastic waves in 3-D anisotropic media. Proc. Proj. Rev. Geo-Math. Imag. Group (Purdue Univ., West Lafayette IN) 1, 175–192 (2011)
Xia, J.: A robust inner-outer HSS preconditioner. Numer. Linear Algebra Appl. 00, 1 (2011)
Chandrasekaran, S., Gu, M., Li, X.S., Xia, J.: Some fast algorithms for hierarchically semiseparable matrices. Numer. Linear Algebra Appl. 17, 953–976 (2010)
Acknowledgements
The research described was partially supported by RFBR grants 14-01-31340, 14-05-31222, 14-05-00049.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Solovyev, S. (2015). Multifrontal Hierarchically Solver for 3D Discretized Elliptic Equations. In: Dimov, I., Faragó, I., Vulkov, L. (eds) Finite Difference Methods,Theory and Applications. FDM 2014. Lecture Notes in Computer Science(), vol 9045. Springer, Cham. https://doi.org/10.1007/978-3-319-20239-6_41
Download citation
DOI: https://doi.org/10.1007/978-3-319-20239-6_41
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20238-9
Online ISBN: 978-3-319-20239-6
eBook Packages: Computer ScienceComputer Science (R0)