Analytical approximate solutions for a general class of nonlinear delay differential equations.
Ontology highlight
ABSTRACT:
SUBMITTER: Caruntu B
PROVIDER: S-EPMC4134833 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Biological regulatory systems, such as cell signaling networks, nervous systems and ecological webs, consist of complex dynamical interactions among many components. Network motif models focus on small sub-networks to provide quantitative insight into overall behavior. However, such models often overlook time delays either inherent to biological processes or associated with multi-step interactions. Here we systematically examine explicit-delay versions of the most common network motifs via delay differential equation (DDE) models, both analytically and numerically. We find many broadly applicable results, including parameter reduction versus canonical ordinary differential equation (ODE) models, analytical relations for converting between ODE and DDE models, criteria for when delays may be ignored, a complete phase space for autoregulation, universal behaviors of feedforward loops, a unified Hill-function logic framework, and conditions for oscillations and chaos. We conclude that explicit-delay modeling simplifies the phenomenology of many biological networks and may aid in discovering new functional motifs.
| S-EPMC7979834 | biostudies-literature
Project description:Parkinson's disease is a degenerative condition whose severity is assessed by clinical observations of motor behaviors. These are performed by a neurological specialist through subjective ratings of a variety of movements including 10-s bouts of repetitive finger-tapping movements. We present here an algorithmic rating of these movements which may be beneficial for uniformly assessing the progression of the disease. Finger-tapping movements were digitally recorded from Parkinson's patients and controls, obtaining one time series for every 10 s bout. A nonlinear delay differential equation, whose structure was selected using a genetic algorithm, was fitted to each time series and its coefficients were used as a six-dimensional numerical descriptor. The algorithm was applied to time-series from two different groups of Parkinson's patients and controls. The algorithmic scores compared favorably with the unified Parkinson's disease rating scale scores, at least when the latter adequately matched with ratings from the Hoehn and Yahr scale. Moreover, when the two sets of mean scores for all patients are compared, there is a strong (r = 0.785) and significant (p<0.0015) correlation between them.
| S-EPMC3292594 | biostudies-other
Project description:Nonlinear differential equations model diverse phenomena but are notoriously difficult to solve. While there has been extensive previous work on efficient quantum algorithms for linear differential equations, the linearity of quantum mechanics has limited analogous progress for the nonlinear case. Despite this obstacle, we develop a quantum algorithm for dissipative quadratic n-dimensional ordinary differential equations. Assuming [Formula: see text], where R is a parameter characterizing the ratio of the nonlinearity and forcing to the linear dissipation, this algorithm has complexity [Formula: see text], where T is the evolution time, ϵ is the allowed error, and q measures decay of the solution. This is an exponential improvement over the best previous quantum algorithms, whose complexity is exponential in T. While exponential decay precludes efficiency, driven equations can avoid this issue despite the presence of dissipation. Our algorithm uses the method of Carleman linearization, for which we give a convergence theorem. This method maps a system of nonlinear differential equations to an infinite-dimensional system of linear differential equations, which we discretize, truncate, and solve using the forward Euler method and the quantum linear system algorithm. We also provide a lower bound on the worst-case complexity of quantum algorithms for general quadratic differential equations, showing that the problem is intractable for [Formula: see text] Finally, we discuss potential applications, showing that the [Formula: see text] condition can be satisfied in realistic epidemiological models and giving numerical evidence that the method may describe a model of fluid dynamics even for larger values of R.
| S-EPMC8536387 | biostudies-literature
Project description:Time series analysis with nonlinear delay differential equations (DDEs) reveals nonlinear as well as spectral properties of the underlying dynamical system. Here, global DDE models were used to analyze 5 min data segments of electrocardiographic (ECG) recordings in order to capture distinguishing features for different heart conditions such as normal heart beat, congestive heart failure, and atrial fibrillation. The number of terms and delays in the model as well as the order of nonlinearity of the model have to be selected that are the most discriminative. The DDE model form that best separates the three classes of data was chosen by exhaustive search up to third order polynomials. Such an approach can provide deep insight into the nature of the data since linear terms of a DDE correspond to the main time-scales in the signal and the nonlinear terms in the DDE are related to nonlinear couplings between the harmonic signal parts. The DDEs were able to detect atrial fibrillation with an accuracy of 72%, congestive heart failure with an accuracy of 88%, and normal heart beat with an accuracy of 97% from 5 min of ECG, a much shorter time interval than required to achieve comparable performance with other methods.
| S-EPMC3710263 | biostudies-other
Project description:By using Krasnoselskii's fixed point theorem, we study the existence of at least one or two positive solutions to a system of fractional boundary value problems given by -D(0+)(ν1)y1(t) = λ1a1(t)f(y1(t), y2(t)), - D(0+)(ν2)y2(t) = λ2a2(t)g(y1(t), y2(t)), where D(0+)(ν) is the standard Riemann-Liouville fractional derivative, ν1, ν2 ∈ (n - 1, n] for n > 3 and n ∈ N, subject to the boundary conditions y1((i))(0) = 0 = y ((i))(0), for 0 ≤ i ≤ n - 2, and [D(0+)(α)y1(t)] t=1 = 0 = [D(0+ (α)y2(t)] t=1, for 1 ≤ α ≤ n - 2, or y1((i))(0) = 0 = y ((i))(0), for 0 ≤ i ≤ n - 2, and [D(0+)(α)y1(t)] t=1 = ϕ1(y1), [D(0+)(α)y2(t)] t=1 = ϕ2(y2), for 1 ≤ α ≤ n - 2, ϕ1, ϕ2 ∈ C([0,1], R). Our results are new and complement previously known results. As an application, we also give an example to demonstrate our result.
| S-EPMC3921945 | biostudies-other
Project description:We are concerned with the positive solutions of an algebraic system depending on a parameter [Formula: see text] and arising in economics. For [Formula: see text] we prove that the system has at least a solution. For [Formula: see text] we give three proofs of the existence and a proof of the uniqueness of the solution. Brouwer's theorem and inequalities involving convex functions are essential tools in our proofs.
| S-EPMC5539268 | biostudies-other
Project description:We study a kind of vector singular perturbed delay-differential equations. By using the methods of boundary function and fractional steps, we construct the formula of asymptotic expansion and confirm the interior layer at t = σ. Meanwhile, on the basis of functional analysis skill, the existence of the smooth solution and the uniform validity of the asymptotic expansion are proved.
| S-EPMC4032758 | biostudies-other
Project description:Delay is an important and ubiquitous aspect of many biochemical processes. For example, delay plays a central role in the dynamics of genetic regulatory networks as it stems from the sequential assembly of first mRNA and then protein. Genetic regulatory networks are therefore frequently modeled as stochastic birth-death processes with delay. Here, we examine the relationship between delay birth-death processes and their appropriate approximating delay chemical Langevin equations. We prove a quantitative bound on the error between the pathwise realizations of these two processes. Our results hold for both fixed delay and distributed delay. Simulations demonstrate that the delay chemical Langevin approximation is accurate even at moderate system sizes. It captures dynamical features such as the oscillatory behavior in negative feedback circuits, cross-correlations between nodes in a network, and spatial and temporal information in two commonly studied motifs of metastability in biochemical systems. Overall, these results provide a foundation for using delay stochastic differential equations to approximate the dynamics of birth-death processes with delay.
| S-EPMC4039735 | biostudies-other
Project description:In this paper, we present a formal quantification of uncertainty induced by numerical solutions of ordinary and partial differential equation models. Numerical solutions of differential equations contain inherent uncertainties due to the finite-dimensional approximation of an unknown and implicitly defined function. When statistically analysing models based on differential equations describing physical, or other naturally occurring, phenomena, it can be important to explicitly account for the uncertainty introduced by the numerical method. Doing so enables objective determination of this source of uncertainty, relative to other uncertainties, such as those caused by data contaminated with noise or model error induced by missing physical or inadequate descriptors. As ever larger scale mathematical models are being used in the sciences, often sacrificing complete resolution of the differential equation on the grids used, formally accounting for the uncertainty in the numerical method is becoming increasingly more important. This paper provides the formal means to incorporate this uncertainty in a statistical model and its subsequent analysis. We show that a wide variety of existing solvers can be randomised, inducing a probability measure over the solutions of such differential equations. These measures exhibit contraction to a Dirac measure around the true unknown solution, where the rates of convergence are consistent with the underlying deterministic numerical method. Furthermore, we employ the method of modified equations to demonstrate enhanced rates of convergence to stochastic perturbations of the original deterministic problem. Ordinary differential equations and elliptic partial differential equations are used to illustrate the approach to quantify uncertainty in both the statistical analysis of the forward and inverse problems.
| S-EPMC7089645 | biostudies-literature
Project description:We develop a point model of the cardiac myofilament (MF) to simulate a wide variety of experimental muscle characterizations including Force-Ca relations and twitches under isometric, isosarcometric, isotonic, and auxotonic conditions. Complex MF behaviors are difficult to model because spatial interactions cannot be directly implemented as ordinary differential equations. We therefore allow phenomenological approximations with careful consideration to the relationships with the underlying biophysical mechanisms. We describe new formulations that avoid mean-field approximations found in most existing MF models. To increase the scope and applicability of the model, we include length- and temperature-dependent effects that play important roles in MF responses. We have also included a representation of passive restoring forces to simulate isolated cell shortening protocols. Possessing both computational efficiency and the ability to simulate a wide variety of muscle responses, the MF representation is well suited for coupling to existing cardiac cell models of electrophysiology and Ca-handling mechanisms. To illustrate this suitability, the MF model is coupled to the Chicago rabbit cardiomyocyte model. The combined model generates realistic appearing action potentials, intracellular Ca transients, and cell shortening signals. The combined model also demonstrates that the feedback effects of force on Ca binding to troponin can modify the cytosolic Ca transient.
| S-EPMC2517033 | biostudies-literature