12 research outputs found

    High order discretizations for spatial dependent SIR models

    Get PDF
    In this paper, an SIR model with spatial dependence is studied and results regarding its stability and numerical approximation are presented. We consider a generalization of the original Kermack and McKendrick model in which the size of the populations differs in space. The use of local spatial dependence yields a system of integro-differential equations. The uniqueness and qualitative properties of the continuous model are analyzed. Furthermore, different choices of spatial and temporal discretizations are employed, and step-size restrictions for population conservation, positivity, and monotonicity preservation of the discrete model are investigated. We provide sufficient conditions under which high order numerical schemes preserve the discrete properties of the model. Computational experiments verify the convergence and accuracy of the numerical methods.Comment: 33 pages, 5 figures, 3 table

    Strong stability preserving explicit Runge-Kutta methods of maximal effective order

    Full text link
    We apply the concept of effective order to strong stability preserving (SSP) explicit Runge-Kutta methods. Relative to classical Runge-Kutta methods, methods with an effective order of accuracy are designed to satisfy a relaxed set of order conditions, but yield higher order accuracy when composed with special starting and stopping methods. We show that this allows the construction of four-stage SSP methods with effective order four (such methods cannot have classical order four). However, we also prove that effective order five methods - like classical order five methods - require the use of non-positive weights and so cannot be SSP. By numerical optimization, we construct explicit SSP Runge-Kutta methods up to effective order four and establish the optimality of many of them. Numerical experiments demonstrate the validity of these methods in practice.Comment: 17 pages, 3 figures, 8 table

    Supplementary material: An energy-based finite-strain model for 3D heterostructured materials and its validation by curvature analysis

    No full text
    <p>This resource provides the Mathematica notebooks and computed data to reproduce the figures in the paper "<i>An energy-based finite-strain model for 3D heterostructured materials and its validation by curvature analysis"</i> by Y. Hadjimichael, Ch. Merdon, M. Liero, and P. Farrell.</p><p>It consists of two notebooks and accompanying data files. The data files contain curvature values obtained from simulations for bent heterostructured nanowires (consisting of two materials) and bimetallic beams.</p><p>The notebook **nanowire_curvature.nb** demonstrates how to obtain the curvature formulas described in Section 3 of the article. We use an energy-based approach and a kinetic framework to derive the analytic formula for the axial elastic strain on a cross-section, as shown in Figure 6a. It is shown that the two approaches are equivalent if the prestrain of the heterostructure is contained in the material that acts as a stressor. e also plot the curvature for various nanowires with respect to the stressor width. Furthermore, we compare the analytical results with the simulation data in Figure 8a.</p><p>The **bimetal_curvature.nb** file carries out a curvature analysis for the bimetallic beam. In addition, it determines the lattice mismatch required for the beam to bend at specific angles (see Figure 5). We can then compare the theoretical and numerical curvature values as we increase the lattice mismatch of the bimetallic beam. Figure 8b shows the curvature as a function of the lattice mismatch.</p><p>All figures mentioned above can be reproduced directly from the notebooks.</p><p>The notebooks are compatible with Mathematica version 13.2.1.0 and earlier releases.</p><p>This paper presents a comprehensive study of the intrinsic strain response of 3D heterostructures arising from lattice mismatch. Combining materials with different lattice constants induces strain, leading to the bending of these heterostructures. We propose a constitutive model for nonlinear elastic heterostructures such as bimetallic beams or nanowires that takes into account local prestrain within each distinct material region. The resulting system of partial differential equations (PDEs) in Lagrangian coordinates incorporates a nonlinear strain and a linear stress-strain relationship governed by Hooke's law. To validate our model, we apply it to bimetallic beams and hexagonal heteronanowires and perform numerical simulations using finite element methods (FEM). Our simulations examine how these structures undergo bending under varying material compositions and cross-sectional geometries. In order to assess the fidelity of the model and the accuracy of simulations, we compare the calculated curvature with analytically derived formulations. We derive these analytical expressions through an energy-based approach as well as a kinetic framework, adeptly accounting for the lattice constant mismatch present at each compound material of the heterostructures. The outcomes of our study yield valuable insights into the behavior of strained bent heterostructures. This is particularly significant as the strain has the potential to influence the electronic band structure, piezoelectricity, and the dynamics of charge carriers. </p&gt

    High order discretization methods for spatial-dependent SIR models

    Get PDF
    In this paper, an SIR model with spatial dependence is studied and results regarding its stability and numerical approximation are presented. We consider a generalization of the original Kermack and McKendrick model in which the size of the populations differs in space. The use of local spatial dependence yields a system of integro-differential equations. The uniqueness and qualitative properties of the continuous model are analyzed. Furthermore, different choices of spatial and temporal discretizations are employed, and step-size restrictions for population conservation, positivity, and monotonicity preservation of the discrete model are investigated. We provide sufficient conditions under which high order numerical schemes preserve the discrete properties of the model. Computational experiments verify the convergence and accuracy of the numerical methods

    Local error estimation and step size control in adaptive linear multistep methods

    Get PDF
    In a k-step adaptive linear multistep methods the coefficients depend on the k − 1 most recent step size ratios. In a similar way, both the actual and the estimated local error will depend on these step ratios. The classical error model has been the asymptotic model, chp+ 1y(p+ 1)(t), based on the constant step size analysis, where all past step sizes simultaneously go to zero. This does not reflect actual computations with multistep methods, where the step size control selects the next step, based on error information from previously accepted steps and the recent step size history. In variable step size implementations the error model must therefore be dynamic and include past step ratios, even in the asymptotic regime. In this paper we derive dynamic asymptotic models of the local error and its estimator, and show how to use dynamically compensated step size controllers that keep the asymptotic local error near a prescribed tolerance tol. The new error models enable the use of controllers with enhanced stability, producing more regular step size sequences. Numerical examples illustrate the impact of dynamically compensated control, and that the proper choice of error estimator affects efficiency

    Strong Stability Preserving Explicit Linear Multistep Methods with Variable Step Size

    No full text
    Strong stability preserving (SSP) methods are designed primarily for time integration of nonlinear hyperbolic PDEs, for which the permissible SSP step size varies from one step to the next. We develop the first SSP linear multistep methods (of order two and three) with variable step size, and prove their optimality, stability, and convergence. The choice of step size for multistep SSP methods is an interesting problem because the allowable step size depends on the SSP coefficient, which in turn depends on the chosen step sizes. The description of the methods includes an optimal step-size strategy. We prove sharp upper bounds on the allowable step size for explicit SSP linear multistep methods and show the existence of methods with arbitrarily high order of accuracy. The effectiveness of the methods is demonstrated through numerical examples
    corecore