Abstract:A straightforward semi-implicit finite-difference method approximating a system of conservation laws including a stiff relaxation term is analyzed. We show that the error, measured in L 1 , is bounded by O( √ ∆t) independent of the stiffness, where the time step ∆t represents the mesh size. As a simple corollary we obtain that solutions of the stiff system converge toward the solution of an equilibrium model at a rate of O(δ 1/3 ) in L 1 as the relaxation time δ tends to zero.
“…Most of these results deal with either large-time, nonlinear asymptotic stability or the zero relaxation limit for Cauchy problems. Tveito and Winther [18,26] provided an O( 1/3 )-rate of convergence for some relaxation systems with nonlinear convection arising in chromatography. Katsoulakis and Tzavaras [7] introduced a class of relaxation systems, the contractive relaxation systems, and established an O( √ ) error bound in the case that the equilibrium equation is a scalar multidimensional one.…”
Section: Introductionmentioning
confidence: 99%
“…Katsoulakis and Tzavaras [7] introduced a class of relaxation systems, the contractive relaxation systems, and established an O( √ ) error bound in the case that the equilibrium equation is a scalar multidimensional one. The approaches in [7,18,26] are based on the extensions of Kruzhkov and Kuznetzov-type error estimates [9]. Kurganov and Tadmor [8] studied convergence and error estimates for a class of relaxation systems, including (1.1) and the one arising in chromatography, and concluded an O( ) order of convergence for scalar convex conservation laws.…”
Abstract. We obtain sharp pointwise error estimates for relaxation approximation to scalar conservation laws with piecewise smooth solutions. We first prove that the first-order partial derivatives for the perturbation solutions are uniformly upper bounded (the so-called Lip + stability). A one-sided interpolation inequality between classical L 1 error estimates and Lip + stability bounds enables us to convert a global L 1 result into a (nonoptimal) local estimate. Optimal error bounds on the weighted error then follow from the maximum principle for weakly coupled hyperbolic systems. The main difficulties in obtaining the Lip + stability and the optimal pointwise errors are how to construct appropriate "difference functions" so that the maximum principle can be applied.
“…Most of these results deal with either large-time, nonlinear asymptotic stability or the zero relaxation limit for Cauchy problems. Tveito and Winther [18,26] provided an O( 1/3 )-rate of convergence for some relaxation systems with nonlinear convection arising in chromatography. Katsoulakis and Tzavaras [7] introduced a class of relaxation systems, the contractive relaxation systems, and established an O( √ ) error bound in the case that the equilibrium equation is a scalar multidimensional one.…”
Section: Introductionmentioning
confidence: 99%
“…Katsoulakis and Tzavaras [7] introduced a class of relaxation systems, the contractive relaxation systems, and established an O( √ ) error bound in the case that the equilibrium equation is a scalar multidimensional one. The approaches in [7,18,26] are based on the extensions of Kruzhkov and Kuznetzov-type error estimates [9]. Kurganov and Tadmor [8] studied convergence and error estimates for a class of relaxation systems, including (1.1) and the one arising in chromatography, and concluded an O( ) order of convergence for scalar convex conservation laws.…”
Abstract. We obtain sharp pointwise error estimates for relaxation approximation to scalar conservation laws with piecewise smooth solutions. We first prove that the first-order partial derivatives for the perturbation solutions are uniformly upper bounded (the so-called Lip + stability). A one-sided interpolation inequality between classical L 1 error estimates and Lip + stability bounds enables us to convert a global L 1 result into a (nonoptimal) local estimate. Optimal error bounds on the weighted error then follow from the maximum principle for weakly coupled hyperbolic systems. The main difficulties in obtaining the Lip + stability and the optimal pointwise errors are how to construct appropriate "difference functions" so that the maximum principle can be applied.
“…The approximation of the stiff case was recently studied by several authors (see [2], [6], [8], [13], [15], [17], [19], [25], and [26]), where different methods like asymptotic or splitting methods are used.…”
Abstract. We focus in this study on the convergence of a class of relaxation numerical schemes for hyperbolic scalar conservation laws including stiff source terms. Following Jin and Xin, we use as approximation of the scalar conservation law, a semi-linear hyperbolic system with a second stiff source term. This allows us to avoid the use of a Riemann solver in the construction of the numerical schemes. The convergence of the approximate solution toward a weak solution is established in the cases of first and second order accurate MUSCL relaxed methods.
“…The approximation of the stiff case was recently studied by several authors (see [2], [5], [7], [9], [10], [12], [16], [18], [19]), where different methods like asymptotic or splitting methods are used.…”
Abstract. We deal in this study with the convergence of a class of numerical schemes for scalar conservation laws including stiff source terms. We suppose that the source term is dissipative but it is not necessarily a Lipschitzian function. The convergence of the approximate solution towards the entropy solution is established for first and second order accurate MUSCL and for splitting semi-implicit methods.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.