skip to main content


Title: Temporal Second-Order Finite Difference Schemes for Variable-Order Time-Fractional Wave Equations
Award ID(s):
2012291
NSF-PAR ID:
10354294
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
SIAM Journal on Numerical Analysis
Volume:
60
Issue:
1
ISSN:
0036-1429
Page Range / eLocation ID:
104 to 132
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    Abstract Variable-order space-fractional diffusion equations provide very competitive modeling capabilities of challenging phenomena, including anomalously superdiffusive transport of solutes in heterogeneous porous media, long-range spatial interactions and other applications, as well as eliminating the nonphysical boundary layers of the solutions to their constant-order analogues.In this paper, we prove the uniqueness of determining the variable fractional order of the homogeneous Dirichlet boundary-value problem of the one-sided linear variable-order space-fractional diffusion equation with some observed values of the unknown solutions near the boundary of the spatial domain.We base on the analysis to develop a spectral-Galerkin Levenberg–Marquardt method and a finite difference Levenberg–Marquardt method to numerically invert the variable order.We carry out numerical experiments to investigate the numerical performance of these methods. 
    more » « less
  2. In this paper, we study the properties of path metrics of an entanglement path for a given entanglement swapping order of the path. We show how to efficiently compute the path metrics of an entanglement path for any given swapping order. We show that different entanglement swapping orders for the same path can lead to different expected throughputs. A key finding is that the binary operator corresponding to entanglement swapping along a path is not associative. We further show that the problem of computing an s-t path with maximum expected throughput under any entanglement swapping order does not have the subpath optimality property, which is a key property most path finding algorithms such as Dijkstra’s algorithm rely on. We use extensive simulations to validate our theoretical findings. 
    more » « less