{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/69380"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/69380","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"The Performance of Preconditioned Iterative Methods in Computational Electromagnetics","abstract":"The numerical solution of electromagnetic scattering problems involves the projection of an exact equation onto a finite-dimensional space, and the solution of the resulting matrix equation. By using iterative algorithms, the analysis of scatterers that are an order of magnitude larger electrically may be feasible.","abstract_html":"The numerical solution of electromagnetic scattering problems involves the projection of an exact equation onto a finite-dimensional space, and the solution of the resulting matrix equation. By using iterative algorithms, the analysis of scatterers that are an order of magnitude larger electrically may be feasible.","abstract_has_math":false,"creators":["Smith, Charles Frederick"],"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:27Z","date_published":"2014-12-15T19:05:27Z","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)AAI8803202"],"render_values":[{"text":"(UMI)AAI8803202","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/69380","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Smith, Charles Frederick"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-15T19:05:27Z","10000-01-01","1987"]},{"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/69380","(UMI)AAI8803202"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The numerical solution of electromagnetic scattering problems involves the projection of an exact equation onto a finite-dimensional space, and the solution of the resulting matrix equation. By using iterative algorithms, the analysis of scatterers that are an order of magnitude larger electrically may be feasible.","Two approaches to achieving the solutions in less time are examined and applied to several typical electromagnetic scattering problems.","First, through extensions to the conjugate gradient and biconjugate gradient algorithms, multiple excitations for the same matrix can be simultaneously treated. Depending on the type of problem, the number of excitations, and the algorithm employed, substantial time savings may be achieved.","Second, the performance of preconditioning combined with the conjugate gradient, biconjugate gradient, and Chebyshev algorithms is evaluated for typical electromagnetic scattering problems. Preconditioners based on significant structural features of the matrix are able to reduce the overall execution time.","Made available in DSpace on 2014-12-15T19:05:27Z (GMT). No. of bitstreams: 1 8803202.pdf: 4757267 bytes, checksum: d9f4dcb8a7b954a226f82b5471ce4739 (MD5) Previous issue date: 1987","Embargo set by: Seth Robbins for item 69546 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","177 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987."]},{"key":"dc:title","label":"Title","values":["The Performance of Preconditioned Iterative Methods in Computational Electromagnetics"]}]}],"canonical_facts":{"dc:creator":["Smith, Charles Frederick"],"dc:date":["2014-12-15T19:05:27Z","10000-01-01","1987"],"dc:description":["The numerical solution of electromagnetic scattering problems involves the projection of an exact equation onto a finite-dimensional space, and the solution of the resulting matrix equation. By using iterative algorithms, the analysis of scatterers that are an order of magnitude larger electrically may be feasible.","Two approaches to achieving the solutions in less time are examined and applied to several typical electromagnetic scattering problems.","First, through extensions to the conjugate gradient and biconjugate gradient algorithms, multiple excitations for the same matrix can be simultaneously treated. Depending on the type of problem, the number of excitations, and the algorithm employed, substantial time savings may be achieved.","Second, the performance of preconditioning combined with the conjugate gradient, biconjugate gradient, and Chebyshev algorithms is evaluated for typical electromagnetic scattering problems. Preconditioners based on significant structural features of the matrix are able to reduce the overall execution time.","Made available in DSpace on 2014-12-15T19:05:27Z (GMT). No. of bitstreams: 1 8803202.pdf: 4757267 bytes, checksum: d9f4dcb8a7b954a226f82b5471ce4739 (MD5) Previous issue date: 1987","Embargo set by: Seth Robbins for item 69546 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","177 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987."],"dc:identifier":["http://hdl.handle.net/2142/69380","(UMI)AAI8803202"],"dc:subject":["Engineering, Electronics and Electrical"],"dc:title":["The Performance of Preconditioned Iterative Methods in Computational Electromagnetics"],"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"}