The computation of the augmented electric field integral equation (A-EFIE) is accelerated by using the multilevel complex source beam (MLCSB) method. As an effective solution of the low-frequency problem, A-EFIE includes both current and charge as unknowns to avoid the imbalance between the vector potentials and the scalar potentials in the conventional EFIE. However, dense impedance submatrices are involved in the A-EFIE system, and the computational cost becomes extremely high for problems with a large number of unknowns. As an exact solution to Maxwell’s equations, the complex source beam (CSB) method can be well tailored for A-EFIE to accelerate the matrix-vector products in an iterative solver. Different from the commonly used multilevel fast multipole algorithm (MLFMA), the CSB method is free from the problem of low-frequency breakdown. In our implementation, the expansion operators of CSB are first derived for the vector potentials and the scalar potentials. Consequently, the aggregation and disaggregation operators are introduced to form a multilevel algorithm to reduce the computational complexity. The accuracy and efficiency of the proposed method are discussed in detail through a variety of numerical examples. It is observed that the numerical error of the MLCSB-AEFIE keeps constant for a broad frequency range, indicating the good stability and scalability of the proposed method.

In the design of chip carriers, appropriate analysis tools can shorten the overall production cycle and reduce costs. Among the functions to be performed by such computer‐aided engineering software tools are self and mutual capacitance calculations. Since the method of moments is slow when applied to large multi‐conductors systems, a fast approximate method, the average potential method (APM), can be employed for capacitance calculations. This paper describes the improved average potential method, which can further reduce the computational complexity and achieve more accuracy than the APM.

No abstract

This work presents a novel matrix compression algorithm to improve the computational efficiency of the nested complex source beam (NCSB) method. The algorithm is based on the application of the truncated singular value decomposition (TSVD) to the multilevel aggregation, translation, and disaggregation operations in NCSB. In our implementation, the aggregation/disaggregation matrices are solved by the truncated far-field matching, which is based on the directional far-field radiation property of the complex source beams (CSBs). Furthermore, the translation matrices are obtained according to the beam width of CSBs. Due to the high directivity of the radiation patterns of CSBs, all the far-field related interaction matrices are low-ranked. Therefore, TSVD can be employed and a new set of equivalent sources can be constructed by a linear combination of the original CSBs. It is proved that the radiation power of the new sources is proportional to the square of the corresponding singular values. This provides a theoretical guideline to drop the insignificant singular vectors in the calculation. In doing so, the efficiency of the original NCSB method can be much improved while a reasonably good accuracy is maintained. Several numerical tests are conducted to validate the proposed method.

No abstract