In this paper, the author derives an
The Cable equation is one of the most fundamental equations for modeling neuronal dynamics. In this article, we consider a high order compact finite difference numerical solution for the fractional Cable equation, which is a generalization of the classical Cable equation by taking into account the anomalous diffusion in the movement of the ions in neuronal system. The resulting finite difference scheme is unconditionally stable and converges with the convergence order of
- PAR ID:
- 10060870
- Publisher / Repository:
- Wiley Blackwell (John Wiley & Sons)
- Date Published:
- Journal Name:
- Numerical Methods for Partial Differential Equations
- Volume:
- 34
- Issue:
- 6
- ISSN:
- 0749-159X
- Page Range / eLocation ID:
- p. 2237-2266
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
more » « less
‐superconvergence for the piecewise linear Ritz‐Galerkin finite element approximations for the second‐order elliptic equation equipped with Dirichlet boundary conditions. This superconvergence error estimate is established between the finite element solution and the usual Lagrange nodal point interpolation of the exact solution, and thus the superconvergence at the nodal points of each element. The result is based on a condition for the finite element partition characterized by the coefficient tensor and the usual shape functions on each element, called ‐equilateral assumption in this paper. Several examples are presented for the coefficient tensor and finite element triangulations which satisfy the conditions necessary for superconvergence. Some numerical experiments are conducted to confirm this new theory of superconvergence. -
more » « less
Abstract We prove that a WLD subspace of the space
consisting of all bounded, countably supported functions on a set Γ embeds isomorphically into if and only if it does not contain isometric copies of . Moreover, a subspace of is constructed that has an unconditional basis, does not embed into , and whose every weakly compact subset is separable (in particular, it cannot contain any isomorphic copies of ). -
more » « less
Abstract In this paper, we are interested in the following question: given an arbitrary Steiner triple system
on vertices and any 3‐uniform hypertree on vertices, is it necessary that contains as a subgraph provided ? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive. -
more » « less
Abstract Let
be the random directed graph on n vertices where each of thepossible arcs is present independently with probability p . A celebrated result of Frieze shows that ifthen typically has a directed Hamilton cycle, and this is best possible. In this paper, we obtain a strengthening of this result, showing that under the same condition, the number of directed Hamilton cycles in is typically . We also prove a hitting‐time version of this statement, showing that in the random directed graph process, as soon as every vertex has in‐/out‐degrees at least 1, there are typically directed Hamilton cycles. -
more » « less
Abstract It is proved that for every countable structure
and a computable successor ordinal α there is a countable structure which is ‐least among all countable structures such that is Σ‐definable in the αth jump . We also show that this result does not hold for the limit ordinal . Moreover, we prove that there is no countable structure with the degree spectrum for .
