Deducing properties of ODEs from their discretization

04/13/2021

∙

We show that some hard to detect properties of quadratic ODEs (eg certain preserved integrals and measures) can be deduced more or less algorithmically from their Kahan discretization, using Darboux Polynomials (DPs). Somewhat similar results hold for ODEs of higher degree/order using certain other birational discretization methods.

READ FULL TEXT

Deducing properties of ODEs from their discretization

Analogues of Kahan's method for higher order equations of higher degree

An Empirical Study on Feature Discretization

Optimal conditions for connectedness of discretized sets

Uniform relations between the Gauss-Legendre nodes and weights

Using aromas to search for preserved measures and integrals in Kahan's method

Impact of Discretization Noise of the Dependent variable on Machine Learning Classifiers in Software Engineering

Discretization of a matrix in the problem of quadratic functional binary minimization

Deducing properties of ODEs from their discretization

Related Research

Analogues of Kahan's method for higher order equations of higher degree

An Empirical Study on Feature Discretization

Optimal conditions for connectedness of discretized sets

Uniform relations between the Gauss-Legendre nodes and weights

Using aromas to search for preserved measures and integrals in Kahan's method

Impact of Discretization Noise of the Dependent variable on Machine Learning Classifiers in Software Engineering

Discretization of a matrix in the problem of quadratic functional binary minimization