Accuracy Directly Controlled Fast Direct Solutions of General -Matrices and Its Application to Electrically Large Integral-Equation-Based Electromagnetic Analysis
arXiv:1703.06155 · doi:10.1109/TMTT.2017.2734090
Abstract
The dense matrix resulting from an integral equation (IE) based solution of Maxwell's equations can be compactly represented by an -matrix. Given a general dense -matrix, prevailing fast direct solutions involve approximations whose accuracy can only be indirectly controlled. In this work, we propose new accuracy-controlled direct solution algorithms, including both factorization and inversion, for solving general -matrices, which does not exist prior to this work. Different from existing direct solutions, where the cluster bases are kept unchanged in the solution procedure thus lacking explicit accuracy control, the proposed new algorithms update the cluster bases and their rank level by level based on prescribed accuracy, without increasing computational complexity. Zeros are also introduced level by level such that the size of the matrix blocks computed at each tree level is the rank at that level, and hence being small. The proposed new direct solution has been applied to solve electrically large volume IEs whose rank linearly grows with electric size. A complexity of in factorization and inversion time, and a complexity of in storage and solution time are both theoretically proven and numerically demonstrated. For constant-rank cases, the proposed direct solution has a strict complexity in both time and memory. Rapid direct solutions of millions of unknowns can be obtained on a single CPU core with directly controlled accuracy.
13 pages, 7 figures
References in corpus (1)
Cited by in corpus (6)
- A Butterfly-Accelerated Volume Integral Equation Solver for Broad Permittivity and Large-Scale Electromagnetic Analysis
- Limits to Quantum Gate Fidelity from Near-Field Thermal and Vacuum Fluctuations
- Computational Electromagnetics Meets Spin Qubits: Controlling Noise Effects in Quantum Sensing and Computing
- An inherently parallel H2-ULV factorization for solving dense linear systems on GPUs
- Computing the k-th Eigenvalue of Symmetric -Matrices
- Algebraic Inverse Fast Multipole Method: A fast direct solver that is better than HODLR based fast direct solver