179 research outputs found
Error estimates of numerical methods for the nonlinear Dirac equation in the nonrelativistic limit regime
We present several numerical methods and establish their error estimates for
the discretization of the nonlinear Dirac equation in the nonrelativistic limit
regime, involving a small dimensionless parameter which is
inversely proportional to the speed of light. In this limit regime, the
solution is highly oscillatory in time, i.e. there are propagating waves with
wavelength and in time and space, respectively. We
begin with the conservative Crank-Nicolson finite difference (CNFD) method and
establish rigorously its error estimate which depends explicitly on the mesh
size and time step as well as the small parameter . Based on the error bound, in order to obtain `correct' numerical solutions
in the nonrelativistic limit regime, i.e. , the CNFD method
requests the -scalability: and
. Then we propose and analyze two numerical methods
for the discretization of the nonlinear Dirac equation by using the Fourier
spectral discretization for spatial derivatives combined with the exponential
wave integrator and time-splitting technique for temporal derivatives,
respectively. Rigorous error bounds for the two numerical methods show that
their -scalability is improved to and
when compared with the CNFD method. Extensive
numerical results are reported to confirm our error estimates.Comment: 35 pages. 1 figure. arXiv admin note: substantial text overlap with
arXiv:1504.0288
A uniformly accurate (UA) multiscale time integrator pseudospectral method for the Dirac equation in the nonrelativistic limit regime
We propose and rigourously analyze a multiscale time integrator Fourier
pseudospectral (MTI-FP) method for the Dirac equation with a dimensionless
parameter which is inversely proportional to the speed of
light. In the nonrelativistic limit regime, i.e. , the
solution exhibits highly oscillatory propagating waves with wavelength
and in time and space, respectively. Due to the rapid
temporal oscillation, it is quite challenging in designing and analyzing
numerical methods with uniform error bounds in . We
present the MTI-FP method based on properly adopting a multiscale decomposition
of the solution of the Dirac equation and applying the exponential wave
integrator with appropriate numerical quadratures. By a careful study of the
error propagation and using the energy method, we establish two independent
error estimates via two different mathematical approaches as
and ,
where is the mesh size, is the time step and depends on the
regularity of the solution. These two error bounds immediately imply that the
MTI-FP method converges uniformly and optimally in space with exponential
convergence rate if the solution is smooth, and uniformly in time with linear
convergence rate at for all and optimally with
quadratic convergence rate at in the regimes when either
or . Numerical results are
reported to demonstrate that our error estimates are optimal and sharp.
Finally, the MTI-FP method is applied to study numerically the convergence
rates of the solution of the Dirac equation to those of its limiting models
when .Comment: 25 pages, 1 figur
Numerical methods and comparison for the Dirac equation in the nonrelativistic limit regime
We analyze rigorously error estimates and compare numerically
spatial/temporal resolution of various numerical methods for the discretization
of the Dirac equation in the nonrelativistic limit regime, involving a small
dimensionless parameter which is inversely proportional to
the speed of light. In this limit regime, the solution is highly oscillatory in
time, i.e. there are propagating waves with wavelength and
in time and space, respectively. We begin with several frequently used
finite difference time domain (FDTD) methods and obtain rigorously their error
estimates in the nonrelativistic limit regime by paying particular attention to
how error bounds depend explicitly on mesh size and time step as
well as the small parameter . Based on the error bounds, in order
to obtain `correct' numerical solutions in the nonrelativistic limit regime,
i.e. , the FDTD methods share the same
-scalability on time step: . Then we
propose and analyze two numerical methods for the discretization of the Dirac
equation by using the Fourier spectral discretization for spatial derivatives
combined with the exponential wave integrator and time-splitting technique for
temporal derivatives, respectively. Rigorous error bounds for the two numerical
methods show that their -scalability on time step is improved to
when . Extensive numerical results
are reported to support our error estimates.Comment: 34 pages, 2 figures. arXiv admin note: substantial text overlap with
arXiv:1511.0119
STORM-GAN: Spatio-Temporal Meta-GAN for Cross-City Estimation of Human Mobility Responses to COVID-19
Human mobility estimation is crucial during the COVID-19 pandemic due to its
significant guidance for policymakers to make non-pharmaceutical interventions.
While deep learning approaches outperform conventional estimation techniques on
tasks with abundant training data, the continuously evolving pandemic poses a
significant challenge to solving this problem due to data nonstationarity,
limited observations, and complex social contexts. Prior works on mobility
estimation either focus on a single city or lack the ability to model the
spatio-temporal dependencies across cities and time periods. To address these
issues, we make the first attempt to tackle the cross-city human mobility
estimation problem through a deep meta-generative framework. We propose a
Spatio-Temporal Meta-Generative Adversarial Network (STORM-GAN) model that
estimates dynamic human mobility responses under a set of social and policy
conditions related to COVID-19. Facilitated by a novel spatio-temporal
task-based graph (STTG) embedding, STORM-GAN is capable of learning shared
knowledge from a spatio-temporal distribution of estimation tasks and quickly
adapting to new cities and time periods with limited training samples. The STTG
embedding component is designed to capture the similarities among cities to
mitigate cross-task heterogeneity. Experimental results on real-world data show
that the proposed approach can greatly improve estimation performance and
out-perform baselines.Comment: Accepted at the 22nd IEEE International Conference on Data Mining
(ICDM 2022) Full Pape
Representing Volumetric Videos as Dynamic MLP Maps
This paper introduces a novel representation of volumetric videos for
real-time view synthesis of dynamic scenes. Recent advances in neural scene
representations demonstrate their remarkable capability to model and render
complex static scenes, but extending them to represent dynamic scenes is not
straightforward due to their slow rendering speed or high storage cost. To
solve this problem, our key idea is to represent the radiance field of each
frame as a set of shallow MLP networks whose parameters are stored in 2D grids,
called MLP maps, and dynamically predicted by a 2D CNN decoder shared by all
frames. Representing 3D scenes with shallow MLPs significantly improves the
rendering speed, while dynamically predicting MLP parameters with a shared 2D
CNN instead of explicitly storing them leads to low storage cost. Experiments
show that the proposed approach achieves state-of-the-art rendering quality on
the NHR and ZJU-MoCap datasets, while being efficient for real-time rendering
with a speed of 41.7 fps for images on an RTX 3090 GPU. The
code is available at https://zju3dv.github.io/mlp_maps/.Comment: Accepted to CVPR 2023. The first two authors contributed equally to
this paper. Project page: https://zju3dv.github.io/mlp_maps
Reconstructing Turbulent Flows Using Physics-Aware Spatio-Temporal Dynamics and Test-Time Refinement
Simulating turbulence is critical for many societally important applications
in aerospace engineering, environmental science, the energy industry, and
biomedicine. Large eddy simulation (LES) has been widely used as an alternative
to direct numerical simulation (DNS) for simulating turbulent flows due to its
reduced computational cost. However, LES is unable to capture all of the scales
of turbulent transport accurately. Reconstructing DNS from low-resolution LES
is critical for many scientific and engineering disciplines, but it poses many
challenges to existing super-resolution methods due to the spatio-temporal
complexity of turbulent flows. In this work, we propose a new physics-guided
neural network for reconstructing the sequential DNS from low-resolution LES
data. The proposed method leverages the partial differential equation that
underlies the flow dynamics in the design of spatio-temporal model
architecture. A degradation-based refinement method is also developed to
enforce physical constraints and further reduce the accumulated reconstruction
errors over long periods. The results on two different types of turbulent flow
data confirm the superiority of the proposed method in reconstructing the
high-resolution DNS data and preserving the physical characteristics of flow
transport.Comment: 19 page
- …