IEEE Transactions on Antennas and Propagation · 2011 · 28 citations · 26 references
ComputingComputational EngineeringComputer ScienceComputational ElectromagneticsComputational MechanicsComputational Structural AnalysisConvergence AnalysisElectromagnetic Inverse ProblemsIterative SolversMatrix ComputationNumerical AnalysisNumerical Linear AlgebraCompressionImpedance MatrixLu DecompositionSingular Value DecompositionSparse Matrix ComputationSparse Matrix TechniquesSparse Representation CompressionSparse Signal Representation
The matrix decomposition algorithm (MDA) provides an efficient matrix-vector product for the iterative solution of the integral equation (IE) by a blockwise compression of the impedance matrix. The MDA with a singular value decomposition (SVD) recompression scheme, i.e., so-called MDA-SVD method, shows strong ability for the analysis of planar layered structures. However, iterative solution faces the problem of convergence rate. An efficient hierarchical ( <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</i> -) LU decomposition algorithm based on the <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</i> -matrix techniques is proposed to handle this problem. Exploiting the data-sparse representation of the MDA-SVD compressed impedance matrix, <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</i> -LU decomposition can be efficiently implemented by <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</i> -matrix arithmetic. <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</i> -matrix techniques provide a flexible way to control the accuracy of the approximate <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</i> -LU-factors. <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</i> -LU decomposition with low accuracy can be used as an efficient preconditioner for the iterative solver due to its low computational cost, while <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</i> -LU decomposition with high accuracy can be used as a direct solver for dealing with multiple right-hand-side (RHS) vector problems particularly. Numerical examples demonstrate that the proposed method is very robust for the analysis of various planar layered structures.
26
Field Computation by Moment Methods
D. S. Jones · The Computer Journal · 1969 · 3.5K citations · Full text