Optimal monomial quadratization for ODE systems
From MaRDI portal
Publication:2115847
DOI10.1007/978-3-030-79987-8_9MaRDI QIDQ2115847FDOQ2115847
Authors: Andrey Bychkov, Gleb Pogudin 
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2103.08013
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- On the complexity of quadratization for polynomial differential equations
- Title not available (Why is that?)
- A Taylor series-based continuation method for solutions of dynamical systems
- On the number of edges of quadrilateral-free graphs
- Title not available (Why is that?)
- Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
- Some algorithmic results for [2]-sumset covers
- On Finding Small 2-Generating Sets
- Graphs without four-cycles
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
Cited In (7)
- Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs
- A combinatorial study of async/await processes
- On periodic approximate solutions of dynamical systems with quadratic right-hand side
- Optimal monomial quadratization for ODE systems
- Design of quadrature rules for Müntz and Müntz-logarithmic polynomials using monomial transformation
- Pure quadratization and solution of ordinary differential equations by probabilistic evolution theory with concurrent computation of coefficients using exact arithmetic
- Title not available (Why is that?)
Uses Software
This page was built for publication: Optimal monomial quadratization for ODE systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115847)
