The Schur algorithm applied to the one-dimensional continuous inverse scattering problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, Y. | - |
dc.contributor.author | Chun, J. | - |
dc.contributor.author | Kim, T. | - |
dc.contributor.author | Bae, J. | - |
dc.date.accessioned | 2021-08-03T05:42:22Z | - |
dc.date.available | 2021-08-03T05:42:22Z | - |
dc.date.issued | 2013 | - |
dc.identifier.issn | 1053-587X | - |
dc.identifier.issn | 1941-0476 | - |
dc.identifier.uri | https://www.kriso.re.kr/sciwatch/handle/2021.sw.kriso/992 | - |
dc.description.abstract | The one-dimensional continuous inverse scattering problem can be solved by the Schur algorithm in the discrete-time domain using sampled scattering data. The sampling rate of the scattering data should be increased to reduce the discretization error, but the complexity of the Schur algorithm is proportional to the square of the sampling rate. To improve this tradeoff between the complexity and the accuracy, we propose a Schur algorithm with the Richardson extrapolation (SARE). The asymptotic expansion of the Schur algorithm, necessary for the Richardson extrapolation, is derived in powers of the discretization step, which shows that the accuracy order (with respect to the discretization step) of the Schur algorithm is 1. The accuracy order of the SARE with the N-step Richardson extrapolation is increased to N+1 with comparable complexity to the Schur algorithm. Therefore, the discretization error of the Schur algorithm can be decreased in a computationally efficient manner by the SARE. ? 1991-2012 IEEE. | - |
dc.format.extent | 10 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.title | The Schur algorithm applied to the one-dimensional continuous inverse scattering problem | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TSP.2013.2259487 | - |
dc.identifier.scopusid | 2-s2.0-84879045102 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Signal Processing, v.61, no.13, pp 3311 - 3320 | - |
dc.citation.title | IEEE Transactions on Signal Processing | - |
dc.citation.volume | 61 | - |
dc.citation.number | 13 | - |
dc.citation.startPage | 3311 | - |
dc.citation.endPage | 3320 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | sci | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Asymptotic expansion | - |
dc.subject.keywordPlus | Computationally efficient | - |
dc.subject.keywordPlus | Discrete-time domain | - |
dc.subject.keywordPlus | Discretization errors | - |
dc.subject.keywordPlus | Inverse scattering | - |
dc.subject.keywordPlus | Inverse scattering problems | - |
dc.subject.keywordPlus | Richardson extrapolation | - |
dc.subject.keywordPlus | Schur algorithms | - |
dc.subject.keywordPlus | Extrapolation | - |
dc.subject.keywordPlus | Reflection | - |
dc.subject.keywordPlus | Scattering | - |
dc.subject.keywordPlus | Algorithms | - |
dc.subject.keywordAuthor | Inverse scattering | - |
dc.subject.keywordAuthor | reflection coefficient | - |
dc.subject.keywordAuthor | Richardson extrapolation | - |
dc.subject.keywordAuthor | Schur algorithm | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(34103) 대전광역시 유성구 유성대로1312번길 32042-866-3114
COPYRIGHT 2021 BY KOREA RESEARCH INSTITUTE OF SHIPS & OCEAN ENGINEERING. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.