File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1029/96RS01364
- Scopus: eid_2-s2.0-0030243159
- WOS: WOS:A1996VK77200022
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Fast steepest descent path algorithm for analyzing scattering from two-dimensional objects
Title | Fast steepest descent path algorithm for analyzing scattering from two-dimensional objects |
---|---|
Authors | |
Issue Date | 1996 |
Citation | Radio Science, 1996, v. 31 n. 5, p. 1215-1224 How to Cite? |
Abstract | A novel algorithm for accelerating the iterative solution of integral equations governing scattering from surfaces is presented. The proposed fast steepest descent path algorithm (FASDPA) complements previously developed fast solvers, notably the fast multipole method (FMM) and the matrix decomposition algorithm (MDA). Whereas the computational complexity per iteration of a two-level FMM and MDA is O(N3/2), the FASDPA permits a matrix-vector multiplication in O(N4/3) operations. |
Persistent Identifier | http://hdl.handle.net/10722/182573 |
ISSN | 2023 Impact Factor: 1.6 2023 SCImago Journal Rankings: 0.468 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Michielssen, E | en_US |
dc.contributor.author | Chew, WC | en_US |
dc.date.accessioned | 2013-05-02T05:15:55Z | - |
dc.date.available | 2013-05-02T05:15:55Z | - |
dc.date.issued | 1996 | en_US |
dc.identifier.citation | Radio Science, 1996, v. 31 n. 5, p. 1215-1224 | en_US |
dc.identifier.issn | 0048-6604 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/182573 | - |
dc.description.abstract | A novel algorithm for accelerating the iterative solution of integral equations governing scattering from surfaces is presented. The proposed fast steepest descent path algorithm (FASDPA) complements previously developed fast solvers, notably the fast multipole method (FMM) and the matrix decomposition algorithm (MDA). Whereas the computational complexity per iteration of a two-level FMM and MDA is O(N3/2), the FASDPA permits a matrix-vector multiplication in O(N4/3) operations. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | Radio Science | en_US |
dc.title | Fast steepest descent path algorithm for analyzing scattering from two-dimensional objects | en_US |
dc.type | Article | en_US |
dc.identifier.email | Chew, WC: wcchew@hku.hk | en_US |
dc.identifier.authority | Chew, WC=rp00656 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1029/96RS01364 | en_US |
dc.identifier.scopus | eid_2-s2.0-0030243159 | en_US |
dc.identifier.volume | 31 | en_US |
dc.identifier.issue | 5 | en_US |
dc.identifier.spage | 1215 | en_US |
dc.identifier.epage | 1224 | en_US |
dc.identifier.isi | WOS:A1996VK77200022 | - |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Michielssen, E=7005196479 | en_US |
dc.identifier.scopusauthorid | Chew, WC=36014436300 | en_US |
dc.identifier.issnl | 0048-6604 | - |