On the Theoretical and Practical Numerical Performance of Matrix-decomposition-based Fast Direct Solvers

Author(s):  
Xiao-Wei Huang ◽  
Xin-Qing Sheng
2003 ◽  
Vol 48 (3) ◽  
pp. 225-236
Author(s):  
Milan Práger

1992 ◽  
Vol 29 (1) ◽  
pp. 156-173 ◽  
Author(s):  
Bernard Bialecki ◽  
Graeme Fairweather ◽  
Karin R. Bennett

2017 ◽  
Vol 316 ◽  
pp. 586-605 ◽  
Author(s):  
Daniel Garcia ◽  
David Pardo ◽  
Lisandro Dalcin ◽  
Maciej Paszyński ◽  
Nathan Collier ◽  
...  

2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Han Guo ◽  
Jun Hu ◽  
Hanru Shao ◽  
Zaiping Nie

Hierarchical (H-) matrices method is a general mathematical framework providing a highly compact representation and efficient numerical arithmetic. When applied in integral-equation- (IE-) based computational electromagnetics,H-matrices can be regarded as a fast algorithm; therefore, both the CPU time and memory requirement are reduced significantly. Its kernel independent feature also makes it suitable for any kind of integral equation. To solveH-matrices system, Krylov iteration methods can be employed with appropriate preconditioners, and direct solvers based on the hierarchical structure ofH-matrices are also available along with high efficiency and accuracy, which is a unique advantage compared to other fast algorithms. In this paper, a novel sparse approximate inverse (SAI) preconditioner in multilevel fashion is proposed to accelerate the convergence rate of Krylov iterations for solvingH-matrices system in electromagnetic applications, and a group of parallel fast direct solvers are developed for dealing with multiple right-hand-side cases. Finally, numerical experiments are given to demonstrate the advantages of the proposed multilevel preconditioner compared to conventional “single level” preconditioners and the practicability of the fast direct solvers for arbitrary complex structures.


Sign in / Sign up

Export Citation Format

Share Document