Sparse Approximate Inverse Preconditioner With Parametric Sparsity Pattern Applied to the Macrobasis Function Methods

An efficient approach for the generation of sparse preconditioners, tailored for the application of macrobasis function methods, is described in this letter. The preconditioner is highly scalable and generated by the computing groups of rows that share a common sparsity pattern, calculated by using...

Full description

Saved in:
Bibliographic Details
Published in:IEEE antennas and wireless propagation letters 2018-05, Vol.17 (5), p.849-852
Main Authors: Delgado, Carlos, Catedra, Manuel Felipe
Format: Article
Language:English
Subjects:
Cavity resonators
Couplings
Electromagnetic analysis
Geometry
iterative methods
Method of moments
moment methods
numerical analysis
Shape
Sparse matrices
Zirconium
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An efficient approach for the generation of sparse preconditioners, tailored for the application of macrobasis function methods, is described in this letter. The preconditioner is highly scalable and generated by the computing groups of rows that share a common sparsity pattern, calculated by using a distance threshold between geometrical blocks that controls the amount of data to be considered. This approach is suitable for the analysis of very large and realistic problems, as shown in some test cases included. Due to the clustering nature of this technique, the preconditioners can be generated in a substantially lower amount of time than that required by conventional approaches.
ISSN:1536-1225
1548-5757
DOI:10.1109/LAWP.2018.2819085