E E  516

Computational Methods in Electromagnetics

Iowa State University

Spring 2007

Time and Place: 1252 Howe Hall, Tuesday & Thursday, 2:10-3:30pm

Instructor:  Prof. Jiming Song

    Office: 2130 Coover Hall,                Phone: 515-294-8396   Fax:  515-294-8432
    Email: jisong@iastate.edu                Website:  home.eng.iastate.edu/~jisong/ee516

Office Hours: 11am-noon, Tuesday & Thursday, 2130 Coover Hall

Textbook, References, and Notes

• Textbook: Numerical Techniques in Electromagnetics, M. Sadiku, CRC Press, 2000.
• Finite Difference Time Domain Method for Electromagnetics, K. S. Kunz and R. J. Luebbers, CRC Press, 1993.
• Computational Electrodynamics: The finite-difference time-domain method, A. Taflove, Artech House, 1995, and A. Taflove and S. Hagness, Artech House, 2000
• Field Computation by Moment Methods, R. F. Harrington, Macmillan, New York, 1968.
• Computational Methods for Electromagnetics, A. F. Peterson, S. Ray, and R. Mittra, IEEE Press, 1998.
• Finite Element Methods in Electromagnetics, J. M. Jin, John Wiley, 1993 & 2002.
• Class notes

Homework, Projects for Coding and Reports, and Final Presentations: Homework assignments will be given about every week and are due about one or two weeks later. There will be NO exams. There will be several projects for coding and you will be required to write a journal quality paper on your last project and give a 10-minute presentation.

Tentative Course Schedule

1. Introduction and review of Maxwell's equations in time and frequency domain.
2. Finite Difference Time Domain (FDTD) Method
   • Partial differential equations (PDEs) and finite difference
   • 2 and 3 dimensions       ·   Boundary conditions and perfectly matched layers
3. Integral Equation Based Methods
   • Volume and Surface Equivalence          ·   Green's functions
   • Method of moments (MoM) and basis functions
   • 1, 2  and 3-D problems                        ·   Direct and iterative solvers
4. Finite Element Method
   • Variational methods and boundary value problems (BVPs)
   • Basis functions and formulation  ·     Static and dynamic
5. Introduction to Fast Algorithms 

Final Grade Breakdown:

·    Homework     ---------     30%                        ·  Projects and Presentations --      70%

If you have a documented disability and anticipate needing accommodations in this course, please make arrangements to meet with me soon. Please request that a Disability Resources staff send a SAAR form verifying your disability and specifying the accommodation you will need.