Advantages of modal decomposition for efficient scaling of parallel FDTD computations

DOI10.1002/jnm.795zbMath1245.78017OpenAlexW2051291584MaRDI QIDQ2889641

Philip A. Wilsey, Dmitry A. Gorodetsky

Publication date: 8 June 2012

Published in: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jnm.795

zbMATH Keywords

matrix decompositiondesign automationFDTD methodsreduced order systems

Mathematics Subject Classification ID

Finite difference methods applied to problems in optics and electromagnetic theory (78M20) Parallel numerical computation (65Y05) Antennas, waveguides in optics and electromagnetic theory (78A50)

Uses Software

• LAPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
• Block reduction of matrices to condensed forms for eigenvalue computations
• Numerical solution of initial boundary value problems involving maxwell's equations in isotropic media
• LAPACK Users' Guide
• Progress in the numerical solution of the nonsymmetric eigenvalue problem

This page was built for publication: Advantages of modal decomposition for efficient scaling of parallel FDTD computations