اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAlternating Energy Minimization Methods for Multi-term Matrix Equations
108
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We develop computational methods for approximating the solution of a linear multi-term matrix equation in low rank. We follow an alternating minimization framework, where the solution is represented as a product of two matrices, and approximations to each matrix are sought by solving certain minimization problems repeatedly. The solution methods we present are based on a rank-adaptive variant of alternating energy minimization methods that builds an approximation iteratively by successively computing a rank-one solution component at each step. We also develop efficient procedures to improve the accuracy of the low-rank approximate solutions computed using these successive rank-one update techniques. We explore the use of the methods with linear multi-term matrix equations that arise from stochastic Galerkin finite element discretizations of parameterized linear elliptic PDEs, and demonstrate their effectiveness with numerical studies.
قيم البحث
اقرأ أيضاً
It is well-known that a numerical method which is at the same time geometric structure-preserving and physical property-preserving cannot exist in general for Hamiltonian partial differential equations. In this paper, we present a novel class of para
metric multi-symplectic Runge-Kutta methods for Hamiltonian wave equations, which can also conserve energy simultaneously in a weaker sense with a suitable parameter. The existence of such a parameter, which enforces the energy-preserving property, is proved under certain assumptions on the fixed step sizes and the fixed initial condition. We compare the proposed method with the classical multi-symplectic Runge-Kutta method in numerical experiments, which shows the remarkable energy-preserving property of the proposed method and illustrate the validity of theoretical results.
In this paper, we present and study discontinuous Galerkin (DG) methods for one-dimensional multi-symplectic Hamiltonian partial differential equations. We particularly focus on semi-discrete schemes with spatial discretization only, and show that th
e proposed DG methods can simultaneously preserve the multi-symplectic structure and energy conservation with a general class of numerical fluxes, which includes the well-known central and alternating fluxes. Applications to the wave equation, the Benjamin-Bona-Mahony equation, the Camassa-Holm equation, the Korteweg-de Vries equation and the nonlinear Schrodinger equation are discussed. Some numerical results are provided to demonstrate the accuracy and long time behavior of the proposed methods. Numerically, we observe that certain choices of numerical fluxes in the discussed class may help achieve better accuracy compared with the commonly used ones including the central fluxes.
This paper investigates superconvergence properties of the local discontinuous Galerkin methods with generalized alternating fluxes for one-dimensional linear convection-diffusion equations. By the technique of constructing some special correction fu
nctions, we prove the $(2k+1)$th order superconvergence for the cell averages, and the numerical traces in the discrete $L^2$ norm. In addition, superconvergence of order $k+2$ and $k+1$ are obtained for the error and its derivative at generalized Radau points. All theoretical findings are confirmed by numerical experiments.
In this paper we consider sequential joint state and static parameter estimation given discrete time observations associated to a partially observed stochastic partial differential equation (SPDE). It is assumed that one can only estimate the hidden
state using a discretization of the model. In this context, it is known that the multi-index Monte Carlo (MIMC) method of [11] can be used to improve over direct Monte Carlo from the most precise discretizaton. However, in the context of interest, it cannot be directly applied, but rather must be used within another advanced method such as sequential Monte Carlo (SMC). We show how one can use the MIMC method by renormalizing the MI identity and approximating the resulting identity using the SMC$^2$ method of [5]. We prove that our approach can reduce the cost to obtain a given mean square error (MSE), relative to just using SMC$^2$ on the most precise discretization. We demonstrate this with some numerical examples.
This paper presents a novel semi-analytical collocation method to solve multi-term variable-order time fractional partial differential equations (VOTFPDEs). In the proposed method it employs the Fourier series expansion for spatial discretization, wh
ich transforms the original multi-term VOTFPDEs into a sequence of multi-term variable-order time fractional ordinary differential equations (VOTFODEs). Then these VOTFODEs can be solved by using the recent-developed backward substitution method. Several numerical examples verify the accuracy and efficiency of the proposed numerical approach in the solution of multi-term VOTFPDEs.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
