Browsing Mathematics by Title
Now showing items 6281 of 195

Finite Difference Method for TwoSided SpaceFractional Partial Differential EquationsFinite difference methods for solving twosided spacefractional partial differential equations are studied. The spacefractional derivatives are the lefthanded and righthanded RiemannLiouville fractional derivatives which are expressed by using Hadamard finitepart integrals. The Hadamard finitepart integrals are approximated by using piecewise quadratic interpolation polynomials and a numerical approximation scheme of the spacefractional derivative with convergence order O(Δx^(3−α )),10 , where Δt,Δx denote the time and space step sizes, respectively. Numerical examples are presented and compared with the exact analytical solution for its order of convergence.

A finite element method for time fractional partial differential equationsThis article considers the finite element method for time fractional differential equations.

Finitetime blowup of a nonlocal stochastic parabolic problemThe main aim of the current work is the study of the conditions under which (finitetime) blowup of a nonlocal stochastic parabolic problem occurs. We first establish the existence and uniqueness of the localintime weak solution for such problem. The first part of the manuscript deals with the investigation of the conditions which guarantee the occurrence of noiseinduced blowup. In the second part we first prove the $C^{1}$spatial regularity of the solution. Then, based on this regularity result, and using a strong positivity result we derive, for first in the literature of SPDEs, a Hopf's type boundary value point lemma. The preceding results together with Kaplan's eigenfunction method are then employed to provide a (nonlocal) drift term induced blowup result. In the last part of the paper, we present a method which provides an upper bound of the probability of (nonlocal) drift term induced blowup.

Fixed point theroms and their application  discrete Volterra applicationsThe existence of solutions of nonlinear discrete Volterra equations is established. We define discrete Volterra operators on normed spaces of infinite sequences of finitedimensional vectors, and present some of their basic properties (continuity, boundedness, and representation). The treatment relies upon the use of coordinate functions, and the existence results are obtained using fixed point theorems for discrete Volterra operators on infinitedimensional spaces based on fixed point theorems of Schauder, Rothe, and Altman, and Banach’s contraction mapping theorem, for finitedimensional spaces.

Fourier spectral methods for some linear stochastic spacefractional partial differential equationsFourier spectral methods for solving some linear stochastic spacefractional partial differential equations perturbed by spacetime white noises in onedimensional case are introduced and analyzed. The spacefractional derivative is defined by using the eigenvalues and eigenfunctions of Laplacian subject to some boundary conditions. We approximate the spacetime white noise by using piecewise constant functions and obtain the approximated stochastic spacefractional partial differential equations. The approximated stochastic spacefractional partial differential equations are then solved by using Fourier spectral methods. Error estimates in $L^{2}$ norm are obtained. Numerical examples are given.

Fourier spectral methods for stochastic space fractional partial differential equations driven by special additive noisesFourier spectral methods for solving stochastic space fractional partial differential equations driven by special additive noises in onedimensional case are introduced and analyzed. The space fractional derivative is defined by using the eigenvalues and eigenfunctions of Laplacian subject to some boundary conditions. The spacetime noise is approximated by the piecewise constant functions in the time direction and by some appropriate approximations in the space direction. The approximated stochastic space fractional partial differential equations are then solved by using Fourier spectral methods. For the linear problem, we obtain the precise error estimates in the $L_{2}$ norm and find the relations between the error bounds and the fractional powers. For the nonlinear problem, we introduce the numerical algorithms and MATLAB codes based on the FFT transforms. Our numerical algorithms can be adapted easily to solve other stochastic space fractional partial differential equations with multiplicative noises. Numerical examples for the semilinear stochastic space fractional partial differential equations are given.

Fractional boundary value problems: Analysis and numerical methodsThis journal article discusses nonlinear boundary value problems.

Fractional pennes' bioheat equation: Theoretical and numerical studiesIn this work we provide a new mathematical model for the Pennes’ bioheat equation, assuming a fractional time derivative of single order. Alternative versions of the bioheat equation are studied and discussed, to take into account the temperaturedependent variability in the tissue perfusion, and both finite and infinite speed of heat propagation. The proposed bio heat model is solved numerically using an implicit finite difference scheme that we prove to be convergent and stable. The numerical method proposed can be applied to general reaction diffusion equations, with a variable diffusion coefficient. The results obtained with the single order fractional model, are compared with the original models that use classical derivatives.

Gcodes over Formal Power Series Rings and Finite Chain RingsIn this work, we define $G$codes over the infinite ring $R_\infty$ as ideals in the group ring $R_\infty G$. We show that the dual of a $G$code is again a $G$code in this setting. We study the projections and lifts of $G$codes over the finite chain rings and over the formal power series rings respectively. We extend known results of constructing $\gamma$adic codes over $R_\infty$ to $\gamma$adic $G$codes over the same ring. We also study $G$codes over principal ideal rings.

GCodes, selfdual GCodes and reversible GCodes over the Ring Bj,kIn this work, we study a new family of rings, Bj,k, whose base field is the finite field Fpr . We study the structure of this family of rings and show that each member of the family is a commutative Frobenius ring. We define a Gray map for the new family of rings, study Gcodes, selfdual Gcodes, and reversible Gcodes over this family. In particular, we show that the projection of a Gcode over Bj,k to a code over Bl,m is also a Gcode and the image under the Gray map of a selfdual Gcode is also a selfdual Gcode when the characteristic of the base field is 2. Moreover, we show that the image of a reversible Gcode under the Gray map is also a reversible G2j+kcode. The Gray images of these codes are shown to have a rich automorphism group which arises from the algebraic structure of the rings and the groups. Finally, we show that quasiG codes, which are the images of Gcodes under the Gray map, are also Gscodes for some s.

Galerkin methods for a Schroedingertype equation with a dynamical boundary condition in two dimensionsIn this paper, we consider a twodimensional Schodingertype equation with a dynamical boundary condition. This model describes the longrange sound propagation in naval environments of variable rigid bottom topography. Our choice for a regular enough finite element approximation is motivated by the dynamical condition and therefore, consists of a cubic splines implicit Galerkin method in space. Furthermore, we apply a CrankNicolson time stepping for the evolutionary variable. We prove existence and stability of the semidiscrete and fully discrete solution.

A geneticalgorithm approach to simulating human immunodeficiency virus evolution reveals the strong impact of multiply infected cells and recombinationIt has been previously shown that the majority of human immunodeficiency virus type 1 (HIV1)infected splenocytes can harbour multiple, divergent proviruses with a copy number ranging from one to eight. This implies that, besides point mutations, recombination should be considered as an important mechanism in the evolution of HIV within an infected host. To explore in detail the possible contributions of multiinfection and recombination to HIV evolution, the effects of major microscopic parameters of HIV replication (i.e. the pointmutation rate, the crossover number, the recombination rate and the provirus copy number) on macroscopic characteristics (such as the Hamming distance and the abundance of npoint mutants) have been simulated in silico. Simulations predict that multiple provirus copies per infected cell and recombination act in synergy to speed up the development of sequence diversity. Point mutations can be fixed for some time without fitness selection. The time needed for the selection of multiple mutations with increased fitness is highly variable, supporting the view that stochastic processes may contribute substantially to the kinetics of HIV variation in vivo.

Group Rings, GCodes and Constructions of SelfDual and Formally SelfDual CodesWe describe Gcodes, which are codes that are ideals in a group ring, where the ring is a finite commutative Frobenius ring and G is an arbitrary finite group. We prove that the dual of a Gcode is also a Gcode. We give constructions of selfdual and formally selfdual codes in this setting and we improve the existing construction given in [13] by showing that one of the conditions given in the theorem is unnecessary and, moreover, it restricts the number of selfdual codes obtained by the construction. We show that several of the standard constructions of selfdual codes are found within our general framework. We prove that our constructed codes must have an automorphism group that contains G as a subgroup. We also prove that a common construction technique for producing selfdual codes cannot produce the putative [72, 36, 16] Type II code. Additionally, we show precisely which groups can be used to construct the extremal Type II codes over length 24 and 48. We define quasiG codes and give a construction of these codes.

Halanaytype theory in the context of evolutionary equations with timelagWe consider extensions and modifications of a theory due to Halanay, and the context in which such results may be applied. Our emphasis is on a mathematical framework for Halanaytype analysis of problems with time lag and simulations using discrete versions or numerical formulae. We present selected (linear and nonlinear, discrete and continuous) results of Halanay type that can be used in the study of systems of evolutionary equations with various types of delayed argument, and the relevance and application of our results is illustrated, by reference to delaydifferential equations, difference equations, and methods.

High order algorithms for numerical solution of fractional differential equationsIn this paper, two novel high order numerical algorithms are proposed for solving fractional differential equations where the fractional derivative is considered in the Caputo sense. The total domain is discretized into a set of small subdomains and then the unknown functions are approximated using the piecewise Lagrange interpolation polynomial of degree three and degree four. The detailed error analysis is presented, and it is analytically proven that the proposed algorithms are of orders 4 and 5. The stability of the algorithms is rigorously established and the stability region is also achieved. Numerical examples are provided to check the theoretical results and illustrate the efficiency and applicability of the novel algorithms.

A high order numerical method for solving nonlinear fractional differential equation with nonuniform meshesWe introduce a highorder numerical method for solving nonlinear fractional differential equation with nonuniform meshes. We first transform the fractional nonlinear differential equation into the equivalent Volterra integral equation. Then we approximate the integral by using the quadratic interpolation polynomials. On the first subinterval $[t_{0}, t_{1}]$, we approximate the integral with the quadratic interpolation polynomials defined on the nodes $t_{0}, t_{1}, t_{2}$ and in the other subinterval $[t_{j}, t_{j+1}], j=1, 2, \dots N1$, we approximate the integral with the quadratic interpolation polynomials defined on the nodes $t_{j1}, t_{j}, t_{j+1}$. A highorder numerical method is obtained. Then we apply this numerical method with the nonuniform meshes with the step size $\tau_{j}= t_{j+1} t_{j}= (j+1) \mu$ where $\mu= \frac{2T}{N (N+1)}$. Numerical results show that this method with the nonuniform meshes has the higher convergence order than the standard numerical methods obtained by using the rectangle and the trapzoid rules with the same nonuniform meshes.

HighOrder Numerical Methods for Solving Time Fractional Partial Differential EquationsIn this paper we introduce a new numerical method for solving time fractional partial differential equation. The time discretization is based on Diethelm’s method where the Hadamard finitepart integral is approximated by using the piecewise quadratic interpolation polynomials. The space discretization is based on the standard finite element method. The error estimates with the convergence order O(τ^(3−α) +h^2 ),0

A highorder scheme to approximate the Caputo fractional derivative and its application to solve the fractional diffusion wave equationA new highorder finite difference scheme to approximate the Caputo fractional derivative $\frac{1}{2} \big ( \, _{0}^{C}D^{\alpha}_{t}f(t_{k})+ \, _{0}^{C}D^{\alpha}_{t}f(t_{k1}) \big ), k=1, 2, \dots, N, $ with the convergence order $O(\Delta t^{4\alpha}), \, \alpha\in(1,2)$ is obtained when $f^{\prime \prime \prime} (t_{0})=0$, where $\Delta t$ denotes the time step size. Based on this scheme we introduce a finite difference method for solving fractional diffusion wave equation with the convergence order $O(\Delta t^{4\alpha} + h^2)$, where $h$ denotes the space step size. Numerical examples are given to show that the numerical results are consistent with the theoretical results.

A higher order numerical method for time fractional partial differential equations with nonsmooth dataGao et al. (2014) introduced a numerical scheme to approximate the Caputo fractional derivative with the convergence rate $O(k^{3\alpha}), 0< \alpha <1$ by directly approximating the integerorder derivative with some finite difference quotients in the definition of the Caputo fractional derivative, see also Lv and Xu (2016), where $k$ is the time step size. Under the assumption that the solution of the time fractional partial differential equation is sufficiently smooth, Lv and Xu (2016) proved by using energy method that the corresponding numerical method for solving time fractional partial differential equation has the convergence rate $O(k^{3\alpha}), 0< \alpha <1$ uniformly with respect to the time variable $t$. However, in general the solution of the time fractional partial differential equation has low regularity and in this case the numerical method fails to have the convergence rate $O(k^{3 \alpha}), 0 < \alpha <1$ uniformly with respect to the time variable $t$. In this paper, we first obtain a similar approximation scheme to the RiemannLiouville fractional derivative with the convergence rate $O(k^{3 \alpha}), 0 < \alpha <1$ as in Gao \et \cite{gaosunzha} (2014) by approximating the Hadamard finitepart integral with the piecewise quadratic interpolation polynomials. Based on this scheme, we introduce a time discretization scheme to approximate the time fractional partial differential equation and show by using Laplace transform methods that the time discretization scheme has the convergence rate $O(k^{3 \alpha}), 0 < \alpha <1$ for any fixed $t_{n}>0$ for smooth and nonsmooth data in both homogeneous and inhomogeneous cases. Numerical examples are given to show that the theoretical results are consistent with the numerical results.

Higher order numerical methods for solving fractional differential equationsIn this paper we introduce higher order numerical methods for solving fractional differential equations. We use two approaches to this problem. The first approach is based on a direct discretisation of the fractional differential operator: we obtain a numerical method for solving a linear fractional differential equation with order 0 < α < 1. The order of convergence of the numerical method is O(h^(3−α)). Our second approach is based on discretisation of the integral form of the fractional differential equation and we obtain a fractional Adamstype method for a nonlinear fractional differential equation of any order α >0. The order of convergence of the numerical method is O(h^3) for α ≥ 1 and O(h^(1+2α)) for 0 < α ≤ 1 for sufficiently smooth solutions. Numerical examples are given to show that the numerical results are consistent with the theoretical results.