An embedded formula of the Chebyshev collocation method for stiff problems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Piao, Xiangfan | - |
dc.contributor.author | Bu, Sunyoung | - |
dc.contributor.author | Kim, Dojin | - |
dc.contributor.author | Kim, Philsu | - |
dc.date.available | 2020-07-10T04:41:18Z | - |
dc.date.created | 2020-07-06 | - |
dc.date.issued | 2017-12-15 | - |
dc.identifier.issn | 0021-9991 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/4889 | - |
dc.description.abstract | In this study, we have developed an embedded formula of the Chebyshev collocation method for stiff problems, based on the zeros of the generalized Chebyshev polynomials. A new strategy for the embedded formula, using a pair of methods to estimate the local truncation error, as performed in traditional embedded Runge-Kutta schemes, is proposed. The method is performed in such a way that not only the stability region of the embedded formula can be widened, but by allowing the usage of larger time step sizes, the total computational costs can also be reduced. In terms of concrete convergence and stability analysis, the constructed algorithm turns out to have an 8th order convergence and it exhibits A-stability. Through several numerical experimental results, we have demonstrated that the proposed method is numerically more efficient, compared to several existing implicit methods. (C) 2017 Elsevier Inc. All rights reserved. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.subject | ORDINARY DIFFERENTIAL-EQUATIONS | - |
dc.subject | INITIAL-VALUE PROBLEMS | - |
dc.subject | RUNGE-KUTTA METHODS | - |
dc.subject | ONE-STEP METHODS | - |
dc.subject | QUADRATURE | - |
dc.subject | INTERPOLATION | - |
dc.subject | INTEGRALS | - |
dc.title | An embedded formula of the Chebyshev collocation method for stiff problems | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Bu, Sunyoung | - |
dc.identifier.doi | 10.1016/j.jcp.2017.09.046 | - |
dc.identifier.scopusid | 2-s2.0-85030453210 | - |
dc.identifier.wosid | 000415304900019 | - |
dc.identifier.bibliographicCitation | JOURNAL OF COMPUTATIONAL PHYSICS, v.351, pp.376 - 391 | - |
dc.relation.isPartOf | JOURNAL OF COMPUTATIONAL PHYSICS | - |
dc.citation.title | JOURNAL OF COMPUTATIONAL PHYSICS | - |
dc.citation.volume | 351 | - |
dc.citation.startPage | 376 | - |
dc.citation.endPage | 391 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Physics | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Physics, Mathematical | - |
dc.subject.keywordPlus | ORDINARY DIFFERENTIAL-EQUATIONS | - |
dc.subject.keywordPlus | INITIAL-VALUE PROBLEMS | - |
dc.subject.keywordPlus | RUNGE-KUTTA METHODS | - |
dc.subject.keywordPlus | ONE-STEP METHODS | - |
dc.subject.keywordPlus | QUADRATURE | - |
dc.subject.keywordPlus | INTERPOLATION | - |
dc.subject.keywordPlus | INTEGRALS | - |
dc.subject.keywordAuthor | Generalized Chebyshev polynomial | - |
dc.subject.keywordAuthor | Collocation method | - |
dc.subject.keywordAuthor | Embedded formula | - |
dc.subject.keywordAuthor | Stiff initial value problem | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
94, Wausan-ro, Mapo-gu, Seoul, 04066, Korea02-320-1314
COPYRIGHT 2020 HONGIK UNIVERSITY. 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.