Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA well-conditioned direct PinT algorithm for first- and second-order evolutionary equations
195
0
0.0
(
0
)
Added by
Jun Liu
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper, we propose a direct parallel-in-time (PinT) algorithm for time-dependent problems with first- or second-order derivative. We use a second-order boundary value method as the time integrator that leads to a tridiagonal time discretization matrix. Instead of solving the corresponding all-at-once system iteratively, we diagonalize the time discretization matrix, which yields a direct parallel implementation across all time levels. A crucial issue on this methodology is how the condition number of the eigenvector matrix $V$ grows as $n$ is increased, where $n$ is the number of time levels. A large condition number leads to large roundoff error in the diagonalization procedure, which could seriously pollute the numerical accuracy. Based on a novel connection between the characteristic equation and the Chebyshev polynomials, we present explicit formulas for computing $V$ and $V^{-1}$, by which we prove that $mathrm{Cond}_2(V)=mathcal{O}(n^{2})$. This implies that the diagonalization process is well-conditioned and the roundoff error only increases moderately as $n$ grows and thus, compared to other direct PinT algorithms, a much larger $n$ can be used to yield satisfactory parallelism. Numerical results on parallel machine are given to support our findings, where over 60 times speedup is achieved with 256 cores.
rate research
Read More
We formulate a well-posedness and approximation theory for a class of generalised saddle point problems. In this way we develop an approach to a class of fourth order elliptic partial differential equations using the idea of splitting into coupled second order equations. Our main motivation is to treat certain fourth order surface equations arising in the modelling of biomembranes but the approach may be applied more generally. In particular, we are interested in equations with non-smooth right hand sides and operators which have non-trivial kernels.The theory for well posedness and approximation is presented in an abstract setting. Several examples are described together with some numerical experiments.
In this paper, we focus on designing a well-conditioned Glarkin spectral methods for solving a two-sided fractional diffusion equations with drift, in which the fractional operators are defined neither in Riemann-Liouville nor Caputo sense, and its physical meaning is clear. Based on the image spaces of Riemann-Liouville fractional integral operators on $L_p([a,b])$ space discussed in our previous work, after a step by step deduction, three kinds of Galerkin spectral formulations are proposed, the final obtained corresponding scheme of which shows to be well-conditioned---the condition number of the stiff matrix can be reduced from $O(N^{2alpha})$ to $O(N^{alpha})$, where $N$ is the degree of the polynomials used in the approximation. Another point is that the obtained schemes can also be applied successfully to approximate fractional Laplacian with generalized homogeneous boundary conditions, whose fractional order $alphain(0,2)$, not only having to be limited to $alphain(1,2)$. Several numerical experiments demonstrate the effectiveness of the derived schemes. Besides, based on the numerical results, we can observe the behavior of mean first exit time, an interesting quantity that can provide us with a further understanding about the mechanism of abnormal diffusion.
We present a second-order ensemble method based on a blended three-step backward differentiation formula (BDF) timestepping scheme to compute an ensemble of Navier-Stokes equations. Compared with the only existing second-order ensemble method that combines the two-step BDF timestepping scheme and a special explicit second-order Adams-Bashforth treatment of the advection term, this method is more accurate with nominal increase in computational cost. We give comprehensive stability and error analysis for the method. Numerical examples are also provided to verify theoretical results and demonstrate the improved accuracy of the method.
In this paper, we develop a well-balanced oscillation-free discontinuous Galerkin (OFDG) method for solving the shallow water equations with a non-flat bottom topography. One notable feature of the constructed scheme is the well-balanced property, which preserves exactly the hydrostatic equilibrium solutions up to machine error. Another feature is the non-oscillatory property, which is very important in the numerical simulation when there exist some shock discontinuities. To control the spurious oscillations, we construct an OFDG method with an extra damping term to the existing well-balanced DG schemes proposed in [Y. Xing and C.-W. Shu, CICP, 1(2006), 100-134.]. With a careful construction of the damping term, the proposed method achieves both the well-balanced property and non-oscillatory property simultaneously without compromising any order of accuracy. We also present a detailed procedure for the construction and a theoretical analysis for the preservation of the well-balancedness property. Extensive numerical experiments including one- and two-dimensional space demonstrate that the proposed methods possess the desired properties without sacrificing any order of accuracy.
We develop a one step matrix method in order to obtain approximate solutions of first order systems and non-linear ordinary differential equations, reducible to first order systems. We find a sequence of such solutions that converge to the exact solution. We study the precision, in terms of the local error, of the method by applying it to different well known examples. The advantage of the method over others widely used lies on the simplicity of its implementation.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
