Abstract
A new inversion algorithm is proposed in this paper based on the resolvent matrix method. The basic steps in our algorithm involve partitioning the original matrix into smaller blocks and finding inverse of a sequence of matrices of small dimensions and matrix multiplications. This inversion algorithm has been applied to invert large general matrices. The efficiency of our algorithm has been compared to two standard inversion routines (NAG F01AAF and ESSL DGEICD, both vectorized). The inversion scheme presented has the versatility to allow for the sparseness and symmetry of the matrix.
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
