Advantages of modal decomposition for efficient scaling of parallel FDTD computations

DOI10.1002/JNM.795zbMATH Open1245.78017OpenAlexW2051291584MaRDI QIDQ2889641FDOQ2889641

Authors: Dmitry A. Gorodetsky, Philip A. Wilsey 

Publication date: 8 June 2012

Published in: International Journal of Numerical Modelling (Search for Journal in Brave)

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

Recommendations

• scientific article; zbMATH DE number 2087846
• Parallel Processing and Applied Mathematics
• The modelling of the FDTD method based on graph theory
• scientific article; zbMATH DE number 1329544
• An optimized calculation method for 3D-FDTD parallelization

zbMATH Keywords

matrix decompositiondesign automationFDTD methodsreduced order systems

Mathematics Subject Classification ID

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

Cites Work

• LAPACK Users' Guide
• Title not available (Why is that?)
• Numerical solution of initial boundary value problems involving maxwell's equations in isotropic media
• Title not available (Why is that?)
• Title not available (Why is that?)
• Block reduction of matrices to condensed forms for eigenvalue computations
• An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
• Progress in the numerical solution of the nonsymmetric eigenvalue problem

Cited In (3)

• Implementing Efficient Array Traversing for FDTD-lumped Element Cosimulation
• Parallel Processing and Applied Mathematics
• Title not available (Why is that?)

Uses Software

• LAPACK

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889641)