{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/69335"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/69335","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"On the Implementation and Performance of Iterative Methods for Computational Electromagnetics (Scattering, Moment-Method, Conjugate-Gradient)","abstract":"The numerical solution of electromagnetic scattering problems involves approximating an exact equation by a finite-dimensional matrix equation. The use of an iterative algorithm to solve the matrix equation sometimes results in a considerable savings in computer memory requirements. For a fixed amount of computer memory, this approach permits the analysis of scatterers that are an order of magnitude larger electrically.","abstract_html":"The numerical solution of electromagnetic scattering problems involves approximating an exact equation by a finite-dimensional matrix equation. The use of an iterative algorithm to solve the matrix equation sometimes results in a considerable savings in computer memory requirements. For a fixed amount of computer memory, this approach permits the analysis of scatterers that are an order of magnitude larger electrically.","abstract_has_math":false,"creators":["Peterson, Andrew Francis"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical Engineering","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-15T19:05:08Z","date_published":"2014-12-15T19:05:08Z","updated_at":"2026-07-22T22:26:00Z","subjects":["Engineering, Electronics and Electrical"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8610970"],"render_values":[{"text":"(UMI)AAI8610970","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/69335","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Peterson, Andrew Francis"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-15T19:05:08Z","10000-01-01","1986"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, Electronics and Electrical"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/69335","(UMI)AAI8610970"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The numerical solution of electromagnetic scattering problems involves approximating an exact equation by a finite-dimensional matrix equation. The use of an iterative algorithm to solve the matrix equation sometimes results in a considerable savings in computer memory requirements. For a fixed amount of computer memory, this approach permits the analysis of scatterers that are an order of magnitude larger electrically.","Iterative algorithms of the conjugate gradient class are examined and applied to a variety of typical electromagnetic scattering problems, in order to evaluate their performance in practice. In contrast with the simple iterative algorithms used in the past, which often diverged when applied to electromagnetics problems, these algorithms never diverge and usually converge at a quick rate.","Depending on the geometry of the scatterer under consideration, it may be possible to build symmetries into the matrix representation and effect the necessary storage reduction. Two distinct approaches for creating these symmetries are examined. An alternate procedure, which requires some of the matrix elements to be regenerated as needed by the iterative algorithm in use, does not rely on symmetries and is applicable to a larger set of geometries. Both procedures are applied to several scattering problems. Execution time comparisons show that the approaches based on symmetries are the most efficient, and that both procedures can be superior to noniterative techniques for large scatterers.","Made available in DSpace on 2014-12-15T19:05:08Z (GMT). No. of bitstreams: 1 8610970.pdf: 5187465 bytes, checksum: 81db8e37ab6b57f761f17007cb4e3c4b (MD5) Previous issue date: 1986","Embargo set by: Seth Robbins for item 69501 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","196 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986."]},{"key":"dc:title","label":"Title","values":["On the Implementation and Performance of Iterative Methods for Computational Electromagnetics (Scattering, Moment-Method, Conjugate-Gradient)"]}]}],"canonical_facts":{"dc:creator":["Peterson, Andrew Francis"],"dc:date":["2014-12-15T19:05:08Z","10000-01-01","1986"],"dc:description":["The numerical solution of electromagnetic scattering problems involves approximating an exact equation by a finite-dimensional matrix equation. The use of an iterative algorithm to solve the matrix equation sometimes results in a considerable savings in computer memory requirements. For a fixed amount of computer memory, this approach permits the analysis of scatterers that are an order of magnitude larger electrically.","Iterative algorithms of the conjugate gradient class are examined and applied to a variety of typical electromagnetic scattering problems, in order to evaluate their performance in practice. In contrast with the simple iterative algorithms used in the past, which often diverged when applied to electromagnetics problems, these algorithms never diverge and usually converge at a quick rate.","Depending on the geometry of the scatterer under consideration, it may be possible to build symmetries into the matrix representation and effect the necessary storage reduction. Two distinct approaches for creating these symmetries are examined. An alternate procedure, which requires some of the matrix elements to be regenerated as needed by the iterative algorithm in use, does not rely on symmetries and is applicable to a larger set of geometries. Both procedures are applied to several scattering problems. Execution time comparisons show that the approaches based on symmetries are the most efficient, and that both procedures can be superior to noniterative techniques for large scatterers.","Made available in DSpace on 2014-12-15T19:05:08Z (GMT). No. of bitstreams: 1 8610970.pdf: 5187465 bytes, checksum: 81db8e37ab6b57f761f17007cb4e3c4b (MD5) Previous issue date: 1986","Embargo set by: Seth Robbins for item 69501 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","196 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986."],"dc:identifier":["http://hdl.handle.net/2142/69335","(UMI)AAI8610970"],"dc:subject":["Engineering, Electronics and Electrical"],"dc:title":["On the Implementation and Performance of Iterative Methods for Computational Electromagnetics (Scattering, Moment-Method, Conjugate-Gradient)"],"dc:type":["text"],"thesis:degree_discipline":["Electrical Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:00Z"}