arXiv subjects

Jiwei Zhang

Publications and source records attributed to Jiwei Zhang.

51 records · Page 3Linked to original sources

arXiv2020

Exact artificial boundary conditions of 1D semi-discretized peridynamics

The peridynamic theory reformulates the equations of continuum mechanics in terms of integro-differential equations instead of partial differential equations. It is not trivial to directly apply naive approach in artificial boundary conditions for continua to peridynamics modeling, because it usually involves semi-discretization scheme. In this paper, we present a new way to construct exact boundary conditions for semi-discretized peridynamics using kernel functions and recursive relations. Specially, kernel functions are used to characterize one single source are combined to construct the exact boundary conditions. The recursive relationships between the kernel functions are proposed, therefore the kernel functions can be computed through the ordinary differential system and integral system with high precision. The numerical results demonstrate that the boundary condition has high accuracy. The proposed method can be applied to modeling of wave propagation of other nonlocal theories and high dimensional cases.

cs.CE↗

arXiv2019

Generation of Optical Chirality Patterns with Plane Waves, Evanescent Waves and Surface Plasmon Waves

We systematically investigate the generation of optical chirality patterns by applying the superposition of two waves in three scenarios, namely plane waves in free space, evanescent waves of totally reflected light at dielectric interface and propagating surface plasmon waves on a metallic surface. In each scenario, the general analytical solution of the optical chirality pattern is derived for different polarization states and propagating directions of the two waves. The analytical solutions are verified by numerical simulations. Spatially structured optical chirality patterns can be generated in all scenarios if the incident polarization states and propagation directions are correctly chosen. Optical chirality enhancement can be obtained from the constructive interference of free-space circularly polarized light or enhanced evanescent waves of totally reflected light. Surface plasmon waves do not provide enhanced optical chirality unless the near-field intensity enhancement is sufficiently high. The structured optical chirality patterns may find applications in chirality sorting, chiral imaging and circular dichroism spectroscopy.

physics.optics↗

arXiv2019

Chiral Structured Illumination Microscopy

We propose a chiral imaging modality based on optical chirality engineering, fluorescence-detected circular dichroism and structured illumination microscopy. In this method, the optical chirality of the illumination is structured and the circular dichroism dependent fluorescence is detected. With image reconstruction, the spatial distribution of chiral domains can be obtained at sub-diffraction limited resolution. We theoretically demonstrate this method and discuss the feasibility using an optical chirality engineering approach based on far-field optics.

physics.optics↗

arXiv2019

A second-order scheme with nonuniform time steps for a linear reaction-sudiffusion problem

Stability and convergence of a time-weighted discrete scheme with nonuniform time steps are established for linear reaction-subdiffusion equations. The Caupto derivative is approximated at an offset point by using linear and quadratic polynomial interpolation. Our analysis relies on two tools: a discrete fractional Grönwall inequality and the global consistency analysis. The new consistency analysis makes use of an interpolation error formula for quadratic polynomials, which leads to a convolution-type bound for the local truncation error. To exploit these two tools, some theoretical properties of the discrete kernels in the numerical Caputo formula are crucial and we investigate them intensively in the nonuniform setting. Taking the initial singularity of the solution into account, we obtain a sharp error estimate on nonuniform time meshes. The fully discrete scheme generates a second-order accurate solution on the graded mesh provided a proper grading parameter is employed. An example is presented to show the sharpness of our analysis.

math.NA↗

arXiv2019

Unified Gas-kinetic Wave-Particle Methods III: Multiscale Photon Transport

In this paper, we extend the unified gas-kinetic wave-particle (UGKWP) method to the multiscale photon transport. In this method, the photon free streaming and scattering processes are treated in an un-splitting way. The duality descriptions, namely the simulation particle and distribution function, are utilized to describe the photon. By accurately recovering the governing equations of the unified gas-kinetic scheme (UGKS), the UGKWP preserves the multiscale dynamics of photon transport from optically thin to optically thick regime. In the optically thin regime, the UGKWP becomes a Monte Carlo type particle tracking method, while in the optically thick regime, the UGKWP becomes a diffusion equation solver. The local photon dynamics of the UGKWP, as well as the proportion of wave-described and particle-described photons are automatically adapted according to the numerical resolution and transport regime. Compared to the $S_n$ -type UGKS, the UGKWP requires less memory cost and does not suffer ray effect. Compared to the implicit Monte Carlo (IMC) method, the statistical noise of UGKWP is greatly reduced and computational efficiency is significantly improved in the optically thick regime. Several numerical examples covering all transport regimes from the optically thin to optically thick are computed to validate the accuracy and efficiency of the UGKWP method. In comparison to the $S_n$ -type UGKS and IMC method, the UGKWP method may have several-order-of-magnitude reduction in computational cost and memory requirement in solving some multsicale transport problems.

physics.comp-ph↗

arXiv2018

A discrete Grönwall inequality with application to numerical schemes for subdiffusion problems

We consider a class of numerical approximations to the Caputo fractional derivative. Our assumptions permit the use of nonuniform time steps, such as is appropriate for accurately resolving the behavior of a solution whose derivatives are singular at~$t=0$. The main result is a type of fractional Grönwall inequality and we illustrate its use by outlining some stability and convergence estimates of schemes for fractional reaction-subdiffusion problems. This approach extends earlier work that used the familiar L1 approximation to the Caputo fractional derivative, and will facilitate the analysis of higher order and linearized fast schemes.

math.NA↗

arXiv2018

Sharp $H^1$-norm error estimates of two time-stepping schemes for reaction-subdiffusion problems

Due to the intrinsically initial singularity of solution and the discrete convolution form in numerical Caputo derivatives, the traditional $H^1$-norm analysis (corresponding to the case for a classical diffusion equation) to the time approximations of a fractional subdiffusion problem always leads to suboptimal error estimates (a loss of time accuracy). To recover the theoretical accuracy in time, we propose an improved discrete Grönwall inequality and apply it to the well-known L1 formula and a fractional Crank-Nicolson scheme. With the help of a time-space error-splitting technique and the global consistency analysis, sharp $H^1$-norm error estimates of the two nonuniform approaches are established for a reaction-subdiffusion problems. Numerical experiments are included to confirm the sharpness of our analysis.

math.NA↗

arXiv2018

A Unified Gas-kinetic Particle Method for Multiscale Photon Transport

In this work, we present a unified gas-kinetic particle (UGKP) method for the simulation of multiscale photon transport. The multiscale nature of the particle method mainly comes from the recovery of the time evolution flux function in the unified gas-kinetic scheme (UGKS) through a coupled dynamic process of particle transport and collision. This practice improves the original operator splitting approach in the Monte Carlo method, such as the separated treatment of particle transport and collision. As a result, with the variation of the ratio between numerical time step and local photon's collision time, different transport physics can be fully captured in a single computation. In the diffusive limit, the UGKP method could recover the solution of the diffusion equation with the cell size and time step being much larger than the photon's mean free path and the mean collision time. In the free transport limit, it presents an exact particle tracking process as the original Monte Carlo method. In the transition regime, the weights of particle free transport and collision are determined by the ratio of local numerical time step to the photon's collision time. Several one-dimensional numerical examples covering all transport regimes from the optically thin to optically thick are computed to validate the accuracy and efficiency of the current scheme. In comparison with the $S_N$ discrete ordinate method, the UGKP method is based on particles and avoids the discretization of particle velocity space, which does not suffer from the ray effect.

physics.comp-ph↗

arXiv2018

Unconditional convergence of a fast two-level linearized algorithm for semilinear subdiffusion equations

A fast two-level linearized scheme with unequal time-steps is constructed and analyzed for an initial-boundary-value problem of semilinear subdiffusion equations. The two-level fast L1 formula of the Caputo derivative is derived based on the sum-of-exponentials technique. The resulting fast algorithm is computationally efficient in long-time simulations because it significantly reduces the computational cost $O(MN^2)$ and storage $O(MN)$ for the standard L1 formula to $O(MN\log N)$ and $O(M\log N)$, respectively, for $M$ grid points in space and $N$ levels in time. The nonuniform time mesh would be graded to handle the typical singularity of the solution near the time $t=0$, and Newton linearization is used to approximate the nonlinearity term. Our analysis relies on three tools: a new discrete fractional Grönwall inequality, a global consistency analysis and a discrete $H^2$ energy method. A sharp error estimate reflecting the regularity of solution is established without any restriction on the relative diameters of the temporal and spatial mesh sizes. Numerical examples are provided to demonstrate the effectiveness of our approach and the sharpness of error analysis.

math.NA↗

arXiv2018

Superconvergence Points of Integer and Fractional Derivatives of Special Hermite Interpolations and Its Applications in Solving FDEs

In this paper, we study convergence and superconvergence theory of integer and fractional derivatives of the one-point and the two-point Hermite interpolations. When considering the integer-order derivative, exponential decay of the error is proved, and superconvergence points are located, at which the convergence rates are $O(N^{-2})$ and $O(N^{-1.5})$, respectively, better than the global rate for the one-point and two-point interpolations. Here $N$ represents the degree of interpolation polynomial. It is proved that the $α$-th fractional derivative of $(u-u_N)$ with $k<α<k+1$, is bounded by its $(k+1)$-th derivative. Furthermore, the corresponding superconvergence points are predicted for fractional derivatives, and an eigenvalue method is proposed to calculate the superconvergence points for the Riemann-Liouville fractional derivative. In the application of the knowledge of superconvergence points to solve FDEs, we discover that a modified collocation method makes numerical solutions much more accurate than the traditional collocation method.

math.NA↗

arXiv2018

An Accurate and Efficient Algorithm for The Time-fractional Molecular Beam Epitaxy Model with Slope Selection

In this paper, we propose a time-fractional molecular beam epitaxy (MBE) model with slope selection and its efficient, accurate, full discrete, linear numerical approximation. The numerical scheme utilizes the fast algorithm for the Caputo fractional derivative operator in time discretization and Fourier spectral method in spatial discretization. Refinement tests are conducted to verify the $2-α$ order of time convergence, with $α\in (0, 1]$ the fractional order of derivative. Several numerical simulations are presented to demonstrate the accuracy and efficiency of our newly proposed scheme. By exploring the fast algorithm calculating the Caputo fractional derivative, our numerical scheme makes it practice for long time simulation of MBE coarsening, which is essential for MBE model in practice. With the proposed fractional MBE model, we observe that the scaling law for the energy decays as $ O(t^{-\fracα{3}})$ and the roughness increases as $O(t^{\fracα{3}})$, during the coarsening dynamics with random initial condition. That is to say, the coarsening rate of MBE model could be manipulated by the fractional order $α$, and it is linearly proportional to $α$. This is the first time in literature to report/discover such scaling correlation. It provides a potential application field for fractional differential equations. Besides, the numerical approximation strategy proposed in this paper can be readily applied to study many classes of time-fractional and high dimensional phase field models.

math.NA↗

arXiv2017

Cusps Enable Line Attractors for Neural Computation

Line attractors in neuronal networks have been suggested to be the basis of many brain functions, such as working memory, oculomotor control, head movement, locomotion, and sensory processing. In this paper, we make the connection between line attractors and pulse-gating in feedforward neuronal networks. In this context, because of their neutral stability along a one-dimensional manifold, line attractors are associated with a time-translational invariance that allows graded information to be propagated from one neuronal population to the next. To understand how pulse-gating manifests itself in a high-dimensional, non-linear, feedforward integrate-and-fire network, we use a Fokker-Planck approach to analyze system dynamics. We make a connection between pulse-gated propagation in the Fokker-Planck and population-averaged mean-field (firing rate) models, then identify an approximate line attractor in state space as the essential structure underlying graded information propagation. An analysis of the line attractor shows that it consists of three fixed points: a central saddle with an unstable manifold along the line and stable manifolds orthogonal to the line, which is surrounded on either side by stable fixed points. Along the manifold defined by the fixed points, slow dynamics give rise to a ghost. We show that this line attractor arises at a cusp catastrophe, where a fold bifurcation develops as a function of synaptic noise; and that the ghost dynamics near the fold of the cusp underly the robustness of the line attractor. Understanding the dynamical aspects of this cusp catastrophe allows us to show how line attractors can persist in biologically realistic neuronal networks and how the interplay of pulse gating, synaptic coupling and neuronal stochasticity can be used to enable attracting one-dimensional manifolds and thus, dynamically control the processing of graded information.

q-bio.NC↗

arXiv2016

Analysis of $L1$-Galerkin FEMs for time-fractional nonlinear parabolic problems

This paper is concerned with numerical solutions of time-fractional nonlinear parabolic problems by a class of $L1$-Galerkin finite element methods. The analysis of $L1$ methods for time-fractional nonlinear problems is limited mainly due to the lack of a fundamental Gronwall type inequality. In this paper, we establish such a fundamental inequality for the $L1$ approximation to the Caputo fractional derivative. In terms of the Gronwall type inequality, we provide optimal error estimates of several fully discrete linearized Galerkin finite element methods for nonlinear problems. The theoretical results are illustrated by applying our proposed methods to three examples: linear Fokker-Planck equation, nonlinear Huxley equation and Fisher equation.

math.NA↗

arXiv2015

Fast evaluation of the Caputo fractional derivative and its applications to fractional diffusion equations

We present an efficient algorithm for the evaluation of the Caputo fractional derivative $_0^C\!D_t^αf(t)$ of order $α\in (0,1)$, which can be expressed as a convolution of $f'(t)$ with the kernel $t^{-α}$. The algorithm is based on an efficient sum-of-exponentials approximation for the kernel $t^{-1-α}$ on the interval $[Δt, T]$ with a uniform absolute error $\varepsilon$, where the number of exponentials $N_{\text{exp}}$ needed is of the order $O\left(\log\frac{1}{\varepsilon}\left( \log\log\frac{1}{\varepsilon}+\log\frac{T}{Δt}\right) +\log\frac{1}{Δt}\left( \log\log\frac{1}{\varepsilon}+\log\frac{1}{Δt}\right) \right)$. As compared with the direct method, the resulting algorithm reduces the storage requirement from $O(N_T)$ to $O(N_{\text{exp}})$ and the overall computational cost from $O(N_T^2)$ to $O(N_TN_{\text{exp}})$ with $N_T$ the total number of time steps. Furthermore, when the fast evaluation scheme of the Caputo derivative is applied to solve the fractional diffusion equations, the resulting algorithm requires only $O(N_SN_{\text{exp}})$ storage and $O(N_SN_TN_{\text{exp}})$ work with $N_S$ the total number of points in space; whereas the direct methods require $O(N_SN_T$) storage and $O(N_SN_T^2)$ work. The complexity of both algorithms is nearly optimal since $N_{\text{exp}}$ is of the order $O(\log N_T)$ for $T\gg 1$ or $O(\log^2N_T)$ for $T\approx 1$ for fixed accuracy $\varepsilon$. We also present a detailed stability and error analysis of the new scheme for solving linear fractional diffusion equations. The performance of the new algorithm is illustrated via several numerical examples. Finally, the algorithm can be parallelized in a straightforward manner.

math.NA↗

arXiv2008

A unified approach to split absorbing boundary conditions for nonlinear Schrödinger equations

An efficient method is proposed for numerical solutions of nonlinear Schrödinger equations in an unbounded domain. Through approximating the kinetic energy term by a one-way equation and uniting it with the potential energy equation, absorbing boundary conditions are designed to truncate the unbounded domain, which are in nonlinear form and can perfectly absorb the waves outgoing from the truncated domain. We examine the stability of the induced initial boundary value problems defined on the computational domain with the boundary conditions by a normal mode analysis. Numerical examples are given to illustrate the stable and tractable advantages of the method.

math.NA↗