Search

We formulate a simple susceptible‐infectious‐recovery (SIR) model to describe the spread of the coronavirus under strict social restrictions. The transmission rate in this model is exponentially decreasing with time. We find a formula for basic reproduction function and estimate the maximum number of daily infected individuals. We fit the model to induced death data in Italy, United States, Germany, France, India, Spain, and China over the period from the first reported death to August 7, 2020. We notice that the model has excellent fit to the disease death data in these countries. We estimate the model's parameters in each of these countries with 95% confidence intervals. We order the strength of social restrictions in these countries using the exponential rate. We estimate the time needed to reduce the basic reproduction function to one unit and use it to order the quality of social restrictions in these countries. The social restriction in China was the strictest and the most effective and in India was the weakest and the least effective. Policy‐makers may apply the Chinese successful social restriction experiment and avoid the Indian unsuccessful one. [ FROM AUTHOR] Copyright of Mathematical Methods in the Applied Sciences is the property of John Wiley & Sons, Inc. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full . (Copyright applies to all s.)

In the current article, we aim to study in detail a novel coronavirus (2019-nCoV or COVID-19) mathematical model for different aspects under Caputo fractional derivative. First, from analysis point of view, existence is necessary to be investigated for any applied problem. Therefore, we used fixed point theorem's due to Banach's and Schaefer's to establish some sufficient results regarding existence and uniqueness of the solution to the proposed model. On the other hand, stability is important in respect of approximate solution, so we have developed condition sufficient for the stability of Ulam-Hyers and their different types for the considered system. In addition, the model has also been considered for semianalytical solution via Laplace Adomian decomposition method (LADM). On Matlab, by taking some real data about Pakistan, we graph the obtained results. In the last of the manuscript, a detail discussion and brief conclusion are provided.

COVID-19 pandemic has affected all aspects of people's lives and disrupted the economy. Forecasting the number of cases infected with this virus can help authorities make accurate decisions on the interventions that must be implemented to control the pandemic. Investigation of the studies on COVID-19 forecasting indicates that various techniques such as statistical, mathematical, and machine and deep learning have been utilized. Although deep learning models have shown promising results in this context, their performance can be improved using auxiliary features. Therefore, in this study, we propose two hybrid deep learning methods that utilize the statistical features as auxiliary inputs and associate them with their main input. Specifically, we design a hybrid method of the multihead attention mechanism and the statistical features (ATT_FE) and a combined method of convolutional neural network and the statistical features (CNN_FE) and apply them to COVID-19 data of 10 countries with the highest number of confirmed cases. The results of experiments indicate that the hybrid models outperform their conventional counterparts in terms of performance measures. The experiments also demonstrate the superiority of the hybrid ATT_FE method over the long short-term memory model.

The study of the dynamics of the size of a population via mathematical modelling is a problem of interest and widely studied. Traditionally, continuous deterministic methods based on differential equations have been used to deal with this problem. However discrete versions of some models are also available and sometimes more adequate. In this paper, we randomize the Pielou logistic equation in order to include the inherent uncertainty in modelling. Taking advantage of the method of transformation of random variables, we provide a full probabilistic description to the randomized Pielou logistic model via the computation of the probability density functions of the solution stochastic process, the steady state and the time until a certain level of population is reached. The theoretical results are illustrated by means of two examples, the first one consists of a numerical experiment and the second one shows an application to study the diffusion of a technology using real data.

This paper studies a new preconditioning technique for sparse systems arising from discretized partial differential equations in computational fluid dynamics problems. This preconditioning technique exploits the multilevel sequentially semiseparable (MSSS) structure of the system matrix. MSSS matrix computations give a data-sparse way to approximate the LU factorization of a sparse matrix from discretized partial differential equations in linear computational complexity with respect to the problem size. In contrast to the standard block diagonal and block upper-triangular preconditioners, we exploit the global MSSS structure of the 2×2 block system from the discretized Stokes equation and linearized Navier-Stokes equation. This avoids approximating the Schur complement explicitly, which is a big advantage over standard block preconditioners. Through numerical experiments on standard computational fluid dynamics benchmark problems in Incompressible Flow and Iterative Solver Software, we show the performance of the MSSS preconditioners. They indicate that the global MSSS preconditioner not only yields mesh size independent convergence but also gives viscosity parameter and Reynolds number independent convergence. Compared with the algebraic multigrid (AMG) method and the geometric multigrid (GMG) method for block preconditioners, the MSSS preconditioning technique is more robust than both the AMG method and GMG method, and considerably faster than the AMG method. Copyright © 2015 John Wiley & Sons, Ltd.

In this paper, we generalize Fueter's theorem to the higher spin setting. To do so, we consider an alternative proof for the celebrated theorem that uses the Fischer decomposition. This decomposition is then extended to spaces of polynomials that depend on wedge variables, after which we can finish the proof of our higher spin Fueter theorem.

In this paper, we investigate a class of pseudo-parabolic equations. Such equations model two-phase flow in porous media where dynamic effects are included in the capillary pressure. The existence and uniqueness of a weak solution are proved, and error estimates for an Euler implicit time discretization are obtained. Copyright © 2011 John Wiley & Sons, Ltd.

In this paper a two-dimensional solute transport model is considered to simulate the leaching of copper ore tailing using sulfuric acid as the leaching agent. The mathematical model consists in a system of differential equations: two diffusion–convection-reaction equations with Neumann boundary conditions, and one ordinary differential equation. The numerical scheme consists in a combination of finite volume and finite element methods. A Godunov scheme is used for the convection term and an P1-FEM for the diffusion term. The convergence analysis is based on standard compactness results in L2. Some numerical examples illustrate the effectiveness of the scheme. Copyright © 2009 John Wiley & Sons, Ltd.

Appell sequences in Clifford analysis are defined as polynomial families on which the Heisenberg algebra acts through a raising and a lowering operator satisfying the canonical Heisenberg relation. Recently, these sequences have gained new interest, as they are connected to the topic of special functions (such as harmonic or monogenic Gegenbauer polynomials) and branching rules for certain irreducible representations of the spin group. In this paper, we will explain how Jacobi polynomials appear quite naturally in the setting of Appell sequences related to certain branching problems. Copyright (c) 2013 John Wiley & Sons, Ltd.

In this paper, we investigate Poincare type inequalities for the functions having zero mean value on the whole boundary of a Lipschitz domain or on a measurable part of the boundary. We find exact and easily computable constants in these inequalities for some basic domains (rectangles, cubes, and right triangles) and discuss applications of the inequalities to quantitative analysis of partial differential equations. Copyright © 2014 John Wiley & Sons, Ltd.