14 research outputs found

    Applicability of STWS Technique in Solving Linear System of Stiff Delay Differential Equations with Constant Delays

    Get PDF
    This paper presents the Single Term Walsh Series (STWS) technique to determine the numerical solution to stiff linear systems of delay differential equations (DDEs) with single and multiple constant delays. The applicability of this technique is demonstrated with examples of stiff delay systems. The discrete solutions obtained using the STWS technique is compared with their corresponding exact solutions

    Fluid Model Checking of Timed Properties

    Get PDF
    We address the problem of verifying timed properties of Markovian models of large populations of interacting agents, modelled as finite state automata. In particular, we focus on time-bounded properties of (random) individual agents specified by Deterministic Timed Automata (DTA) endowed with a single clock. Exploiting ideas from fluid approximation, we estimate the satisfaction probability of the DTA properties by reducing it to the computation of the transient probability of a subclass of Time-Inhomogeneous Markov Renewal Processes with exponentially and deterministically-timed transitions, and a small state space. For this subclass of models, we show how to derive a set of Delay Differential Equations (DDE), whose numerical solution provides a fast and accurate estimate of the satisfaction probability. In the paper, we also prove the asymptotic convergence of the approach, and exemplify the method on a simple epidemic spreading model. Finally, we also show how to construct a system of DDEs to efficiently approximate the average number of agents that satisfy the DTA specification

    Open issues in devising software for the numerical solution of implicit delay differential equations

    Get PDF
    AbstractWe consider initial value problems for systems of implicit delay differential equations of the formMyâ€Č(t)=f(t,y(t),y(α1(t,y(t))),
,y(αm(t,y(t)))),where M is a constant square matrix (with arbitrary rank) and αi(t,y(t))â©œt for all t and i.For a numerical treatment of this kind of problems, a software tool has been recently developed [6]; this code is called RADAR5 and is based on a suitable extension to delay equations of the 3-stage Radau IIA Runge–Kutta method.The aim of this work is that of illustrating some important topics which are being investigated in order to increase the efficiency of the code. They are mainly relevant to(i)the error control strategies in relation to derivative discontinuities arising in the solutions of delay equations;(ii)the integration of problems with unbounded delays (like the pantograph equation);(iii)the applications to problems with special structure (as those arising from spatial discretization of evolutions PDEs with delays).Several numerical examples will also be shown in order to illustrate some of the topics discussed in the paper

    Thermoacoustic instability - a dynamical system and time domain analysis

    Full text link
    This study focuses on the Rijke tube problem, which includes features relevant to the modeling of thermoacoustic coupling in reactive flows: a compact acoustic source, an empirical model for the heat source, and nonlinearities. This thermo-acoustic system features a complex dynamical behavior. In order to synthesize accurate time-series, we tackle this problem from a numerical point-of-view, and start by proposing a dedicated solver designed for dealing with the underlying stiffness, in particular, the retarded time and the discontinuity at the location of the heat source. Stability analysis is performed on the limit of low-amplitude disturbances by means of the projection method proposed by Jarlebring (2008), which alleviates the linearization with respect to the retarded time. The results are then compared to the analytical solution of the undamped system, and to Galerkin projection methods commonly used in this setting. This analysis provides insight into the consequences of the various assumptions and simplifications that justify the use of Galerkin expansions based on the eigenmodes of the unheated resonator. We illustrate that due to the presence of a discontinuity in the spatial domain, the eigenmodes in the heated case, predicted by using Galerkin expansion, show spurious oscillations resulting from the Gibbs phenomenon. By comparing the modes of the linear to that of the nonlinear regime, we are able to illustrate the mean-flow modulation and frequency switching. Finally, time-series in the fully nonlinear regime, where a limit cycle is established, are analyzed and dominant modes are extracted. The analysis of the saturated limit cycles shows the presence of higher frequency modes, which are linearly stable but become significant through nonlinear growth of the signal. This bimodal effect is not captured when the coupling between different frequencies is not accounted for.Comment: Submitted to Journal of Fluid Mechanic

    On parameter estimation for delay models with discontinuous right-hand sides

    Get PDF
    We study delay models with discontinuous right-hand side. Lack of smoothness in the solutions of such problems may have serious consequences for parameters estimation using gradient-based approaches. Additionally, it may cause ambiguities in the parameter determinability analysis applied on the parameter estimates. In order to overcome these difficulties, we suggest a standard regularization technique to make the model continuous. We prove the convergence of the solution of the regularized model to the solution of the original problem. As a consequence of that, parameter estimates inferred from the regularized model converge to the corresponding estimates of the original problem. We support our findings with numerical illustrations for simple test problems

    Efficient Implicit Runge-Kutta Methods for Fast-Responding Ligand-Gated Neuroreceptor Kinetic Models

    Get PDF
    Neurophysiological models of the brain typically utilize systems of ordinary differential equations to simulate single-cell electrodynamics. To accurately emulate neurological treatments and their physiological effects on neurodegenerative disease, models that incorporate biologically-inspired mechanisms, such as neurotransmitter signalling, are necessary. Additionally, applications that examine populations of neurons, such as multiscale models, can demand solving hundreds of millions of these systems at each simulation time step. Therefore, robust numerical solvers for biologically-inspired neuron models are vital. To address this requirement, we evaluate the numerical accuracy and computational efficiency of three L-stable implicit Runge-Kutta methods when solving kinetic models of the ligand-gated glutamate and gamma-aminobutyric acid (GABA) neurotransmitter receptors. Efficient implementations of each numerical method are discussed, and numerous performance metrics including accuracy, simulation time steps, execution speeds, Jacobian calculations, and LU factorizations are evaluated to identify appropriate strategies for solving these models. Comparisons to popular explicit methods are presented and highlight the advantages of the implicit methods. In addition, we show a machine-code compiled implicit Runge-Kutta method implementation that possesses exceptional accuracy and superior computational efficiency

    How effective and efficient are multiobjective evolutionary algorithms at hydrologic model calibration?

    Get PDF
    International audienceThis study provides a comprehensive assessment of state-of-the-art evolutionary multiobjective optimization (EMO) tools' relative effectiveness in calibrating hydrologic models. The relative computational efficiency, accuracy, and ease-of-use of the following EMO algorithms are tested: Epsilon Dominance Nondominated Sorted Genetic Algorithm-II (?-NSGAII), the Multiobjective Shuffled Complex Evolution Metropolis algorithm (MOSCEM-UA), and the Strength Pareto Evolutionary Algorithm 2 (SPEA2). This study uses three test cases to compare the algorithms' performances: (1) a standardized test function suite from the computer science literature, (2) a benchmark hydrologic calibration test case for the Leaf River near Collins, Mississippi, and (3) a computationally intensive integrated surface-subsurface model application in the Shale Hills watershed in Pennsylvania. One challenge and contribution of this work is the development of a methodology for comprehensively comparing EMO algorithms that have different search operators and randomization techniques. Overall, SPEA2 attained competitive to superior results for most of the problems tested in this study. The primary strengths of the SPEA2 algorithm lie in its search reliability and its diversity preservation operator. The biggest challenge in maximizing the performance of SPEA2 lies in specifying an effective archive size without a priori knowledge of the Pareto set. In practice, this would require significant trial-and-error analysis, which is problematic for more complex, computationally intensive calibration applications. ?-NSGAII appears to be superior to MOSCEM-UA and competitive with SPEA2 for hydrologic model calibration. ?-NSGAII's primary strength lies in its ease-of-use due to its dynamic population sizing and archiving which lead to rapid convergence to very high quality solutions with minimal user input. MOSCEM-UA is best suited for hydrologic model calibration applications that have small parameter sets and small model evaluation times. In general, it would be expected that MOSCEM-UA's performance would be met or exceeded by either SPEA2 or ?-NSGAII

    Implementing Radau IIA methods for stiff delay differential equations

    No full text
    This article discusses the numerical solution of a general class of delay differential equations, including stiff problems, differential-algebraic delay equations, and neutral problems. The delays can be state dependent, and they are allowed to become small and vanish during the integration. Difficulties encountered in the implementation of implicit Runge-Kutta methods are explained, and it is shown how they can be overcome. The performance of the resulting code -- RADAR5 -- is illustrated at several examples, and it is compared to existing programs
    corecore