Abstract
A two-step factorised sparse approximation inverse and symmetric successive over relaxation preconditioned conjugate gradient (CG) algorithm is proposed to solve the large system of linear equations resulted from the hierarchical implicit time-domain finite-element method (TDFEM). Convergence properties and CPU time of the proposed algorithm are compared with those of other preconditioned CG schemes. Numerical results demonstrate that the present approach is efficient for solving the large sparse system from hierarchical implicit TDFEM.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
