Abstract
We construct a parallel and explicit finite-element time-domain (FETD) algorithm for Maxwell's equations in simplicial meshes based on a mixed <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">E</i> - <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">B</i> discretization and a sparse approximation for the inverse mass matrix. The sparsity pattern of the approximate inverse is obtained from edge adjacency information, which is naturally encoded by the sparsity pattern of successive powers of the mass matrix. Each column of the approximate inverse is computed independently, allowing for different processors to be used with no communication costs and hence linear (ideal) speedup in parallel processors. The convergence of the approximate inverse matrix to the actual inverse (full) matrix is investigated numerically and shown to exhibit exponential convergence versus the density of the approximate inverse matrix. The resulting FETD time-stepping is explicit is the sense that it does not require a linear solve at every time step, akin to the finite-difference time-domain (FDTD) method.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
