A novel iterative scheme and its application to differential equations.
Ontology highlight
ABSTRACT:
SUBMITTER: Khan Y
PROVIDER: S-EPMC3976783 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Probability reigns in biology, with random molecular events dictating the fate of individual organisms, and propelling populations of species through evolution. In principle, the master probability equation provides the most complete model of probabilistic behavior in biomolecular networks. In practice, master equations describing complex reaction networks have remained unsolved for over 70 years. This practical challenge is a reason why master equations, for all their potential, have not inspired biological discovery. Herein, we present a closure scheme that solves the master probability equation of networks of chemical or biochemical reactions. We cast the master equation in terms of ordinary differential equations that describe the time evolution of probability distribution moments. We postulate that a finite number of moments capture all of the necessary information, and compute the probability distribution and higher-order moments by maximizing the information entropy of the system. An accurate order closure is selected, and the dynamic evolution of molecular populations is simulated. Comparison with kinetic Monte Carlo simulations, which merely sample the probability distribution, demonstrates this closure scheme is accurate for several small reaction networks. The importance of this result notwithstanding, a most striking finding is that the steady state of stochastic reaction networks can now be readily computed in a single-step calculation, without the need to simulate the evolution of the probability distribution in time.
| S-EPMC3761596 | biostudies-literature
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:On the level of the spiking activity, the integrate-and-fire neuron is one of the most commonly used descriptions of neural activity. A multitude of variants has been proposed to cope with the huge diversity of behaviors observed in biological nerve cells. The main appeal of this class of model is that it can be defined in terms of a hybrid model, where a set of mathematical equations describes the sub-threshold dynamics of the membrane potential and the generation of action potentials is often only added algorithmically without the shape of spikes being part of the equations. In contrast to more detailed biophysical models, this simple description of neuron models allows the routine simulation of large biological neuronal networks on standard hardware widely available in most laboratories these days. The time evolution of the relevant state variables is usually defined by a small set of ordinary differential equations (ODEs). A small number of evolution schemes for the corresponding systems of ODEs are commonly used for many neuron models, and form the basis of the neuron model implementations built into commonly used simulators like Brian, NEST and NEURON. However, an often neglected problem is that the implemented evolution schemes are only rarely selected through a structured process based on numerical criteria. This practice cannot guarantee accurate and stable solutions for the equations and the actual quality of the solution depends largely on the parametrization of the model. In this article, we give an overview of typical equations and state descriptions for the dynamics of the relevant variables in integrate-and-fire models. We then describe a formal mathematical process to automate the design or selection of a suitable evolution scheme for this large class of models. Finally, we present the reference implementation of our symbolic analysis toolbox for ODEs that can guide modelers during the implementation of custom neuron models.
| S-EPMC6186990 | biostudies-other
Project description:We present an algorithm to solve the linear response equations for Hartree-Fock, Density Functional Theory, and the Multiconfigurational Self-Consistent Field method that is both simple and efficient. The algorithm makes use of the well-established symmetric and antisymmetric combinations of trial vectors but further orthogonalizes them with respect to the scalar product induced by the response matrix. This leads to a standard, symmetric block eigenvalue problem in the expansion subspace that can be solved by diagonalizing a symmetric, positive definite matrix half the size of the expansion space. Numerical tests showed that the algorithm is robust and stable.
| S-EPMC10753806 | biostudies-literature
Project description:BackgroundEnsemble modeling aims to boost the forecasting performance by systematically integrating the predictive accuracy across individual models. Here we introduce a simple-yet-powerful ensemble methodology for forecasting the trajectory of dynamic growth processes that are defined by a system of non-linear differential equations with applications to infectious disease spread.MethodsWe propose and assess the performance of two ensemble modeling schemes with different parametric bootstrapping procedures for trajectory forecasting and uncertainty quantification. Specifically, we conduct sequential probabilistic forecasts to evaluate their forecasting performance using simple dynamical growth models with good track records including the Richards model, the generalized-logistic growth model, and the Gompertz model. We first test and verify the functionality of the method using simulated data from phenomenological models and a mechanistic transmission model. Next, the performance of the method is demonstrated using a diversity of epidemic datasets including scenario outbreak data of the Ebola Forecasting Challenge and real-world epidemic data outbreaks of including influenza, plague, Zika, and COVID-19.ResultsWe found that the ensemble method that randomly selects a model from the set of individual models for each time point of the trajectory of the epidemic frequently outcompeted the individual models as well as an alternative ensemble method based on the weighted combination of the individual models and yields broader and more realistic uncertainty bounds for the trajectory envelope, achieving not only better coverage rate of the 95% prediction interval but also improved mean interval scores across a diversity of epidemic datasets.ConclusionOur new methodology for ensemble forecasting outcompete component models and an alternative ensemble model that differ in how the variance is evaluated for the generation of the prediction intervals of the forecasts.
| S-EPMC7882252 | biostudies-literature
Project description:In this paper we prove that under mild conditions a nonautonomous Young differential equation possesses a unique solution which depends continuously on initial conditions. The proofs use estimates in p-variation norms, the construction of greedy sequence of times, and Gronwall-type lemma with the help of Shauder theorem of fixed points.
| S-EPMC6223767 | biostudies-literature
Project description:This work presents the novel Leal-polynomials (LP) for the approximation of nonlinear differential equations of different kind. The main characteristic of LPs is that they satisfy multiple expansion points and its derivatives as a mechanism to replicate behaviour of the nonlinear problem, giving more accuracy within the region of interest. Therefore, the main contribution of this work is that LP satisfies the successive derivatives in some specific points, resulting more accurate polynomials than Taylor expansion does for the same degree of their respective polynomials. Such characteristic makes of LPs a handy and powerful tool to approximate different kind of differential equations including: singular problems, initial condition and boundary-valued problems, equations with discontinuities, coupled differential equations, high-order equations, among others. Additionally, we show how the process to obtain the polynomials is straightforward and simple to implement; generating a compact, and easy to compute, expression. Even more, we present the process to approximate Gelfand's equation, an equation of an isothermal reaction, a model for chronic myelogenous leukemia, Thomas-Fermi equation, and a high order nonlinear differential equations with discontinuities getting, as result, accurate, fast and compact approximate solutions. In addition, we present the computational convergence and error studies for LPs resulting convergent polynomials and error tendency to zero as the order of LPs increases for all study cases. Finally, a study of CPU time shows that LPs require a few nano-seconds to be evaluated, which makes them suitable for intensive computing applications.
| S-EPMC7160581 | biostudies-literature
Project description:The paper deals with the oscillation of the first-order linear difference equation with deviating argument and nonnegative coefficients. New sufficient oscillation conditions, involving limsup, are given, which essentially improve all known results, based on an iterative technique. We illustrate the results and the improvement over other known oscillation criteria by examples, numerically solved in Matlab.
| S-EPMC5529606 | biostudies-other
Project description:RationaleConsiderable confusion exists regarding nomenclature, classification, and management of pediatric diffuse lung diseases due to the relative rarity and differences in the spectrum of disease between adults and young children.ObjectivesA multidisciplinary working group was formed to: (1) apply consensus terminology and diagnostic criteria for disorders presenting with diffuse lung disease in infancy; and (2) describe the distribution of disease entities, clinical features, and outcome in young children who currently undergo lung biopsy in North America.MethodsEleven centers provided pathologic material, clinical data, and imaging from all children less than 2 years of age who underwent lung biopsy for diffuse lung disease from 1999 to 2004.Measurements and main resultsMultidisciplinary review categorized 88% of 187 cases. Disorders more prevalent in infancy, including primary developmental and lung growth abnormalities, neuroendocrine cell hyperplasia of infancy, and surfactant-dysfunction disorders, constituted the majority of cases (60%). Lung growth disorders were often unsuspected clinically and under-recognized histologically. Cases with known surfactant mutations had characteristic pathologic features. Age at biopsy and clinical presentation varied among categories. Pulmonary hypertension, presence of a primary developmental abnormality, or ABCA3 mutation was associated with high mortality, while no deaths occurred in cases of pulmonary interstitial glycogenosis, or neuroendocrine cell hyperplasia of infancy.ConclusionsThis retrospective cohort study identifies a diverse spectrum of lung disorders, largely unique to young children. Application of a classification scheme grouped clinically distinct patients with variable age of biopsy and mortality. Standardized terminology and classification will enhance accurate description and diagnosis of these disorders.
| S-EPMC2176101 | biostudies-literature
Project description:We propose a sparse regression method capable of discovering the governing partial differential equation(s) of a given system by time series measurements in the spatial domain. The regression framework relies on sparsity-promoting techniques to select the nonlinear and partial derivative terms of the governing equations that most accurately represent the data, bypassing a combinatorially large search through all possible candidate models. The method balances model complexity and regression accuracy by selecting a parsimonious model via Pareto analysis. Time series measurements can be made in an Eulerian framework, where the sensors are fixed spatially, or in a Lagrangian framework, where the sensors move with the dynamics. The method is computationally efficient, robust, and demonstrated to work on a variety of canonical problems spanning a number of scientific domains including Navier-Stokes, the quantum harmonic oscillator, and the diffusion equation. Moreover, the method is capable of disambiguating between potentially nonunique dynamical terms by using multiple time series taken with different initial data. Thus, for a traveling wave, the method can distinguish between a linear wave equation and the Korteweg-de Vries equation, for instance. The method provides a promising new technique for discovering governing equations and physical laws in parameterized spatiotemporal systems, where first-principles derivations are intractable.
| S-EPMC5406137 | biostudies-literature