File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Efficient iterative solver for the modes in a dielectric waveguide

TitleEfficient iterative solver for the modes in a dielectric waveguide
Authors
Issue Date1998
Citation
Ieee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1998, v. 3, p. 1492-1495 How to Cite?
AbstractTwo Krylov subspace-based methods are used to solve the sparse matrix generated by the finite difference formulation. The use of the bi-Lanczos algorithm allows this method to be computationally competitive with other approximate methods while the use of the finite difference formulation makes this method versatile enough to handle complicated waveguide structures. The BiCG-based algorithm reduces the storage requirements to O(N) and thus can handle problems with several hundred thousand unknowns. The speed of this algorithm is further enhanced by using a non-uniform grid in the solution space outside the dielectric waveguide. By using a non-uniform grid, the size of the artificial boundary is greatly increased which limits the error in the results.
Persistent Identifierhttp://hdl.handle.net/10722/182881
ISSN

 

DC FieldValueLanguage
dc.contributor.authorRadhakrishnan, Kaladharen_US
dc.contributor.authorChew, Weng Choen_US
dc.date.accessioned2013-05-02T05:17:30Z-
dc.date.available2013-05-02T05:17:30Z-
dc.date.issued1998en_US
dc.identifier.citationIeee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1998, v. 3, p. 1492-1495en_US
dc.identifier.issn0272-4693en_US
dc.identifier.urihttp://hdl.handle.net/10722/182881-
dc.description.abstractTwo Krylov subspace-based methods are used to solve the sparse matrix generated by the finite difference formulation. The use of the bi-Lanczos algorithm allows this method to be computationally competitive with other approximate methods while the use of the finite difference formulation makes this method versatile enough to handle complicated waveguide structures. The BiCG-based algorithm reduces the storage requirements to O(N) and thus can handle problems with several hundred thousand unknowns. The speed of this algorithm is further enhanced by using a non-uniform grid in the solution space outside the dielectric waveguide. By using a non-uniform grid, the size of the artificial boundary is greatly increased which limits the error in the results.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)en_US
dc.titleEfficient iterative solver for the modes in a dielectric waveguideen_US
dc.typeConference_Paperen_US
dc.identifier.emailChew, Weng Cho: wcchew@hku.hken_US
dc.identifier.authorityChew, Weng Cho=rp00656en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0031617591en_US
dc.identifier.volume3en_US
dc.identifier.spage1492en_US
dc.identifier.epage1495en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridRadhakrishnan, Kaladhar=7102259450en_US
dc.identifier.scopusauthoridChew, Weng Cho=36014436300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats