Browse
Submit Data
Databases
API
Help

Dataset Information

13 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

A reliable algorithm to compute the approximate solution of KdV-type partial differential equations of order seven.

ABSTRACT: The approximate solution of KdV-type partial differential equations of order seven is presented. The algorithm based on one-dimensional Haar wavelet collocation method is adapted for this purpose. One-dimensional Haar wavelet collocation method is verified on Lax equation, Sawada-Kotera-Ito equation and Kaup-Kuperschmidt equation of order seven. The approximated results are displayed by means of tables (consisting point wise errors and maximum absolute errors) to measure the accuracy and proficiency of the scheme in a few number of grid points. Moreover, the approximate solutions and exact solutions are compared graphically, that represent a close match between the two solutions and confirm the adequate behavior of the proposed method.

SUBMITTER: Saleem S

PROVIDER: S-EPMC7822283 | biostudies-literature | 2021

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

A reliable algorithm to compute the approximate solution of KdV-type partial differential equations of order seven.

Saleem Sidra S Hussain Malik Zawwar MZ Aziz Imran I

PloS one 20210122 1

The approximate solution of KdV-type partial differential equations of order seven is presented. The algorithm based on one-dimensional Haar wavelet collocation method is adapted for this purpose. One-dimensional Haar wavelet collocation method is verified on Lax equation, Sawada-Kotera-Ito equation and Kaup-Kuperschmidt equation of order seven. The approximated results are displayed by means of tables (consisting point wise errors and maximum absolute errors) to measure the accuracy and profici ...[more]

PMID: 33481786

Similar Datasets

Learning the solution operator of parametric partial differential equations with physics-informed DeepONets.

Project description:Partial differential equations (PDEs) play a central role in the mathematical analysis and modeling of complex dynamic processes across all corners of science and engineering. Their solution often requires laborious analytical or computational tools, associated with a cost that is markedly amplified when different scenarios need to be investigated, for example, corresponding to different initial or boundary conditions, different inputs, etc. In this work, we introduce physics-informed DeepONets, a deep learning framework for learning the solution operator of arbitrary PDEs, even in the absence of any paired input-output training data. We illustrate the effectiveness of the proposed framework in rapidly predicting the solution of various types of parametric PDEs up to three orders of magnitude faster compared to conventional PDE solvers, setting a previously unexplored paradigm for modeling and simulation of nonlinear and nonequilibrium processes in science and engineering.

| S-EPMC8480920 | biostudies-literature

Data-driven discovery of partial differential equations.

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

Learning data-driven discretizations for partial differential equations.

Project description:The numerical solution of partial differential equations (PDEs) is challenging because of the need to resolve spatiotemporal features over wide length- and timescales. Often, it is computationally intractable to resolve the finest features in the solution. The only recourse is to use approximate coarse-grained representations, which aim to accurately represent long-wavelength dynamics while properly accounting for unresolved small-scale physics. Deriving such coarse-grained equations is notoriously difficult and often ad hoc. Here we introduce data-driven discretization, a method for learning optimized approximations to PDEs based on actual solutions to the known underlying equations. Our approach uses neural networks to estimate spatial derivatives, which are optimized end to end to best satisfy the equations on a low-resolution grid. The resulting numerical methods are remarkably accurate, allowing us to integrate in time a collection of nonlinear equations in 1 spatial dimension at resolutions 4× to 8× coarser than is possible with standard finite-difference methods.

| S-EPMC6681734 | biostudies-literature

Efficient quantum algorithm for dissipative nonlinear differential equations.

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

Learning partial differential equations via data discovery and sparse optimization.

Project description:We investigate the problem of learning an evolution equation directly from some given data. This work develops a learning algorithm to identify the terms in the underlying partial differential equations and to approximate the coefficients of the terms only using data. The algorithm uses sparse optimization in order to perform feature selection and parameter estimation. The features are data driven in the sense that they are constructed using nonlinear algebraic equations on the spatial derivatives of the data. Several numerical experiments show the proposed method's robustness to data noise and size, its ability to capture the true features of the data, and its capability of performing additional analytics. Examples include shock equations, pattern formation, fluid flow and turbulence, and oscillatory convection.

| S-EPMC5312119 | biostudies-literature

Learning emergent partial differential equations in a learned emergent space.

Project description:We propose an approach to learn effective evolution equations for large systems of interacting agents. This is demonstrated on two examples, a well-studied system of coupled normal form oscillators and a biologically motivated example of coupled Hodgkin-Huxley-like neurons. For such types of systems there is no obvious space coordinate in which to learn effective evolution laws in the form of partial differential equations. In our approach, we accomplish this by learning embedding coordinates from the time series data of the system using manifold learning as a first step. In these emergent coordinates, we then show how one can learn effective partial differential equations, using neural networks, that do not only reproduce the dynamics of the oscillator ensemble, but also capture the collective bifurcations when system parameters vary. The proposed approach thus integrates the automatic, data-driven extraction of emergent space coordinates parametrizing the agent dynamics, with machine-learning assisted identification of an emergent PDE description of the dynamics in this parametrization.

| S-EPMC9184577 | biostudies-literature

Analytical approximate solutions for a general class of nonlinear delay differential equations.

Project description:We use the polynomial least squares method (PLSM), which allows us to compute analytical approximate polynomial solutions for a very general class of strongly nonlinear delay differential equations. The method is tested by computing approximate solutions for several applications including the pantograph equations and a nonlinear time-delay model from biology. The accuracy of the method is illustrated by a comparison with approximate solutions previously computed using other methods.

| S-EPMC4134833 | biostudies-other

Fractional order differential equations for chronic liver cirrhosis with frequent hospitalization.

Project description:ObjectiveLiver cirrhosis, which is considered as the terminal stage of liver diseases, has become life-threatening among non-communicable diseases in the world. Viral hepatitis (hepatitis B and C) is the major risk factor for the development and progression of chronic liver cirrhosis. The asymptomatic stage of cirrhosis is considered as the compensated cirrhosis whereas the symptomatic stage is considered as decompensated cirrhosis. The latter stage is characterized by complex disorder affecting multiple systems of liver organ with frequent hospitalization. In this paper, we formulate system of fractional differential equations of chronic liver cirrhosis with frequent hospitalization to investigate the dynamics of the disease. The fundamental properties including the existence of positive solutions, positively invariant set, and biological feasibility are discussed. We used generalized mean value theorem to establish the existence of positive solutions. The Adams-type predictor-evaluate-corrector-evaluate approach is used to present the numerical scheme the fractional erder model.ResultsUsing the numerical scheme, we simulate the solutions of the fractional order model. The numerical simulations are carried out using MATLAB software to illustrate the analytic findings. The analysis reveals that the number of decompensated cirrhosis individuals decreases when the progression rate and the disease's past states are considered.

| S-EPMC9588237 | biostudies-literature

Approximate model of cooperative activation and crossbridge cycling in cardiac muscle using ordinary differential equations.

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

Generalising quantum imaginary time evolution to solve linear partial differential equations.

Project description:The quantum imaginary time evolution (QITE) methodology was developed to overcome a critical issue as regards non-unitarity in the implementation of imaginary time evolution on a quantum computer. QITE has since been used to approximate ground states of various physical systems. In this paper, we demonstrate a practical application of QITE as a quantum numerical solver for linear partial differential equations. Our algorithm takes inspiration from QITE in that the quantum state follows the same normalised trajectory in both algorithms. However, it is our QITE methodology's ability to track the scale of the state vector over time that allows our algorithm to solve differential equations. We demonstrate our methodology with numerical simulations and use it to solve the heat equation in one and two dimensions using six and ten qubits, respectively.

| S-EPMC11364816 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data