Optimal monomial quadratization for ODE systems

DOI10.1007/978-3-030-79987-8_9MaRDI QIDQ2115847

Andrey Bychkov, G. A. Pogudin

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2103.08013

zbMATH Keywords

branch-and-bounddifferential equationsquadratization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items

Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs ⋮ On periodic approximate solutions of dynamical systems with quadratic right-hand side ⋮ A combinatorial study of async/await processes ⋮ Pure quadratization and solution of ordinary differential equations by probabilistic evolution theory with concurrent computation of coefficients using exact arithmetic

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some algorithmic results for [2-sumset covers]
• Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• On the number of edges of quadrilateral-free graphs
• On the complexity of quadratization for polynomial differential equations
• A Taylor series-based continuation method for solutions of dynamical systems
• Graphs without four-cycles
• On Finding Small 2-Generating Sets