اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Leja method revisited: backward error analysis for the matrix exponential
358
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The Leja method is a polynomial interpolation procedure that can be used to compute matrix functions. In particular, computing the action of the matrix exponential on a given vector is a typical application. This quantity is required, e.g., in exponential integrators. The Leja method essentially depends on three parameters: the scaling parameter, the location of the interpolation points, and the degree of interpolation. We present here a backward error analysis that allows us to determine these three parameters as a function of the prescribed accuracy. Additional aspects that are required for an efficient and reliable implementation are discussed. Numerical examples that illustrate the performance of our Matlab code are included.
قيم البحث
اقرأ أيضاً
We analyze different measures for the backward error of a set of numerical approximations for the roots of a polynomial. We focus mainly on the element-wise mixed backward error introduced by Mastronardi and Van Dooren, and the tropical backward erro
r introduced by Tisseur and Van Barel. We show that these measures are equivalent under suitable assumptions. We also show relations between these measures and the classical element-wise and norm-wise backward error measures.
We present a residual-based a posteriori error estimator for the hybrid high-order (HHO) method for the Stokes model problem. Both the proposed HHO method and error estimator are valid in two and three dimensions and support arbitrary approximation o
rders on fairly general meshes. The upper bound and lower bound of the error estimator are proved, in which proof, the key ingredient is a novel stabilizer employed in the discrete scheme. By using the given estimator, adaptive algorithm of HHO method is designed to solve model problem. Finally, the expected theoretical results are numerically demonstrated on a variety of meshes for model problem.
In this paper, we present a new full-discrete finite element method for the heat equation, and show the numerical stability of the method by verified computations. Since, in the error analysis, we use the constructive error estimates proposed ny Naka
o et. all in 2013, this work is considered as an extention of that paper. We emphasize that concerned scheme seems to be a quite normal Galerkin method and easy to implement for evolutionary equations comparing with previous one. In the constructive error estimates, we effectively use the numerical computations with guaranteed accuracy.
We present an error analysis and further numerical investigations of the Parameterized-Background Data-Weak (PBDW) formulation to variational Data Assimilation (state estimation), proposed in [Y Maday, AT Patera, JD Penn, M Yano, Int J Numer Meth Eng
, 102(5), 933-965]. The PBDW algorithm is a state estimation method involving reduced models. It aims at approximating an unknown function $u^{rm true}$ living in a high-dimensional Hilbert space from $M$ measurement observations given in the form $y_m = ell_m(u^{rm true}),, m=1,dots,M$, where $ell_m$ are linear functionals. The method approximates $u^{rm true}$ with $hat{u} = hat{z} + hat{eta}$. The emph{background} $hat{z}$ belongs to an $N$-dimensional linear space $mathcal{Z}_N$ built from reduced modelling of a parameterized mathematical model, and the emph{update} $hat{eta}$ belongs to the space $mathcal{U}_M$ spanned by the Riesz representers of $(ell_1,dots, ell_M)$. When the measurements are noisy {--- i.e., $y_m = ell_m(u^{rm true})+epsilon_m$ with $epsilon_m$ being a noise term --- } the classical PBDW formulation is not robust in the sense that, if $N$ increases, the reconstruction accuracy degrades. In this paper, we propose to address this issue with an extension of the classical formulation, {which consists in} searching for the background $hat{z}$ either on the whole $mathcal{Z}_N$ in the noise-free case, or on a well-chosen subset $mathcal{K}_N subset mathcal{Z}_N$ in presence of noise. The restriction to $mathcal{K}_N$ makes the reconstruction be nonlinear and is the key to make the algorithm significantly more robust against noise. We {further} present an emph{a priori} error and stability analysis, and we illustrate the efficiency of the approach on several numerical examples.
We consider the numerical analysis of the inchworm Monte Carlo method, which is proposed recently to tackle the numerical sign problem for open quantum systems. We focus on the growth of the numerical error with respect to the simulation time, for wh
ich the inchworm Monte Carlo method shows a flatter curve than the direct application of Monte Carlo method to the classical Dyson series. To better understand the underlying mechanism of the inchworm Monte Carlo method, we distinguish two types of exponential error growth, which are known as the numerical sign problem and the error amplification. The former is due to the fast growth of variance in the stochastic method, which can be observed from the Dyson series, and the latter comes from the evolution of the numerical solution. Our analysis demonstrates that the technique of partial resummation can be considered as a tool to balance these two types of error, and the inchwormMonte Carlo method is a successful case where the numerical sign problem is effectively suppressed by such means. We first demonstrate our idea in the context of ordinary differential equations, and then provide complete analysis for the inchworm Monte Carlo method. Several numerical experiments are carried out to verify our theoretical results.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
