An explicit sparse unsymmetric finite element solver
George A. Gravvanis, Elias A. Lipitakis · Communications in Numerical Methods in Engineering · 1996
A new class of explicit generalized approximate inverse finite element matrix algorithmic methods, based on the concept of LU-sparse factorization procedures, without inverting the decomposition factors, has recently been introduced. The large sparse unsymmetric coefficient matrix of irregular structure is factorized approximately and, in conjunction with approximate inverse matrix techniques, yields explicit preconditioned methods for the finite element (FE) and finite difference (FD) method. The numerical implementation of these algorithms is presented and Fortran subroutines for the efficient solution of the sparse unsymmetric linear systems are given.