Convergence for the numerical blow up time of a nonlinear ODE problem

碩士 === 國立中正大學 === 數學系應用數學研究所 === 106 === We consider the frst order nonlinear ODE blow-up problem u′(t)=G(u). Nakagawa [6] proposed a scheme with adaptively-defned temporal increment for the computation of the blow-up solutions. Later, an algorithm using uniform time mesh was proposed by Cho [3] for...

Full description

Bibliographic Details
Main Authors:	DU, BI-YI, 杜碧怡
Other Authors:	Cho, Chien-Hong
Format:	Others
Language:	en_US
Published:	2018
Online Access:	http://ndltd.ncl.edu.tw/handle/php9kh

id	ndltd-TW-106CCU00507006
record_format	oai_dc
spelling	ndltd-TW-106CCU005070062019-05-16T00:22:59Z http://ndltd.ncl.edu.tw/handle/php9kh Convergence for the numerical blow up time of a nonlinear ODE problem 非線性常微分方程數值爆炸時間的收斂性 DU, BI-YI 杜碧怡碩士國立中正大學數學系應用數學研究所 106 We consider the frst order nonlinear ODE blow-up problem u′(t)=G(u). Nakagawa [6] proposed a scheme with adaptively-defned temporal increment for the computation of the blow-up solutions. Later, an algorithm using uniform time mesh was proposed by Cho [3] for the computation of the numerical blow-up time. Nevertheless, these schemes are of order 1 in time variable so that the convergence order of the numerical blow-up time is also of order 1. In this presentation, we would like to consider a question as to can we have a higher convergence order if we use a higher order scheme for both methods to compute the blow-up time. Cho, Chien-Hong 卓建宏 2018 學位論文 ; thesis 20 en_US
collection	NDLTD
language	en_US
format	Others
sources	NDLTD
description	碩士 === 國立中正大學 === 數學系應用數學研究所 === 106 === We consider the frst order nonlinear ODE blow-up problem u′(t)=G(u). Nakagawa [6] proposed a scheme with adaptively-defned temporal increment for the computation of the blow-up solutions. Later, an algorithm using uniform time mesh was proposed by Cho [3] for the computation of the numerical blow-up time. Nevertheless, these schemes are of order 1 in time variable so that the convergence order of the numerical blow-up time is also of order 1. In this presentation, we would like to consider a question as to can we have a higher convergence order if we use a higher order scheme for both methods to compute the blow-up time.
author2	Cho, Chien-Hong
author_facet	Cho, Chien-Hong DU, BI-YI 杜碧怡
author	DU, BI-YI 杜碧怡
spellingShingle	DU, BI-YI 杜碧怡 Convergence for the numerical blow up time of a nonlinear ODE problem
author_sort	DU, BI-YI
title	Convergence for the numerical blow up time of a nonlinear ODE problem
title_short	Convergence for the numerical blow up time of a nonlinear ODE problem
title_full	Convergence for the numerical blow up time of a nonlinear ODE problem
title_fullStr	Convergence for the numerical blow up time of a nonlinear ODE problem
title_full_unstemmed	Convergence for the numerical blow up time of a nonlinear ODE problem
title_sort	convergence for the numerical blow up time of a nonlinear ode problem
publishDate	2018
url	http://ndltd.ncl.edu.tw/handle/php9kh
work_keys_str_mv	AT dubiyi convergenceforthenumericalblowuptimeofanonlinearodeproblem AT dùbìyí convergenceforthenumericalblowuptimeofanonlinearodeproblem AT dubiyi fēixiànxìngchángwēifēnfāngchéngshùzhíbàozhàshíjiāndeshōuliǎnxìng AT dùbìyí fēixiànxìngchángwēifēnfāngchéngshùzhíbàozhàshíjiāndeshōuliǎnxìng
_version_	1719165477076336640

Convergence for the numerical blow up time of a nonlinear ODE problem

Similar Items