Copertina

Dissipative quadratizations of polynomial ODE systems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Cai, Yubo, Pogudin, Gleb
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Systems and Control Numerical Analysis Symbolic Computation
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Discovering Polynomial and Quadratic Structure in Nonlinear Ordinary Differential Equations
di: Kramer, Boris, et al.
Pubblicazione: (2025)

Quadratization of Autonomous Partial Differential Equations: Theory and Algorithms
di: Olivieri, Albani, et al.
Pubblicazione: (2026)

Support bound for differential elimination in polynomial dynamical systems
di: Mukhina, Yulia, et al.
Pubblicazione: (2025)

Simple generators of rational function fields
di: Demin, Alexander, et al.
Pubblicazione: (2026)

Projecting dynamical systems via a support bound
di: Mukhina, Yulia, et al.
Pubblicazione: (2025)

Persistent components in Canny's Generalized Characteristic Polynomial
di: Pogudin, Gleb
Pubblicazione: (2024)

On the dimension of the solution space of linear difference equations over the ring of infinite sequences
di: Abramov, Sergei, et al.
Pubblicazione: (2023)

The complexity of class polynomial computation via floating point approximations
di: Enge, Andreas
Pubblicazione: (2006)

Exact hierarchical reductions of dynamical models via linear transformations
di: Demin, Alexander, et al.
Pubblicazione: (2023)

Validated numerics for algebraic path tracking
di: Guillemot, Alexandre, et al.
Pubblicazione: (2024)

A Novel Approach to the Initial Value Problem with a complete validated algorithm
di: Zhang, Bingwei, et al.
Pubblicazione: (2025)

Groebner basis structure of ideal interpolation
di: Gong, Yihe, et al.
Pubblicazione: (2020)

A Basis-preserving Algorithm for Computing the Bezout Matrix of Newton Polynomials
di: Yang, Jing, et al.
Pubblicazione: (2024)

Effective Quadratic Error Bounds for Floating-Point Algorithms Computing the Hypotenuse Function
di: Muller, Jean-Michel, et al.
Pubblicazione: (2024)

Computing Clipped Products
di: Norman, Arthur C., et al.
Pubblicazione: (2024)

Strassen's algorithm is not optimally accurate
di: Dumas, Jean-Guillaume, et al.
Pubblicazione: (2024)

Towards automated generation of fast and accurate algorithms for recursive matrix multiplication
di: Dumas, Jean-Guillaume, et al.
Pubblicazione: (2025)

Structural Preprocessing Method for Nonlinear Differential-Algebraic Equations Using Linear Symbolic Matrices
di: Oki, Taihei, et al.
Pubblicazione: (2024)

Faster Gröbner bases for Lie derivatives of ODE systems via monomial orderings
di: Bessonov, Mariya, et al.
Pubblicazione: (2022)

Sparse Tensors and Subdivision Methods for Finding the Zero Set of Polynomial Equations
di: Moroz, Guillaume
Pubblicazione: (2024)

A Finite Expression Method for Solving High-Dimensional Committor Problems
di: Song, Zezheng, et al.
Pubblicazione: (2023)

Efficient Tensor Decomposition via Moment Matrix Extension
di: Shi, Bobby, et al.
Pubblicazione: (2025)

A Novel Algorithm for Representing Positive Semi-Definite Polynomials as Sums of Squares with Rational Coefficients
di: Zeng, Zhenbing, et al.
Pubblicazione: (2025)

On the Algorithmic Verification of Nonlinear Superposition for Systems of First Order Ordinary Differential Equations
di: Treumova, Veronika, et al.
Pubblicazione: (2024)

A Fast Algorithm for the Finite Expression Method in Learning Dynamics on Complex Networks
di: Song, Zezheng, et al.
Pubblicazione: (2024)

Algorithmic reduction of polynomially nonlinear PDE systems to parametric ODE systems
di: Deng, Siyuan, et al.
Pubblicazione: (2024)

Performance Comparison of Function Evaluation Methods
di: Liberti, Leo
Pubblicazione: (2002)

Trinomials and Deterministic Complexity Limits for Real Solving
di: Boniface, Emma, et al.
Pubblicazione: (2022)

A Faster Solution to Smale's 17th Problem I: Real Binomial Systems
di: Paouris, Grigoris, et al.
Pubblicazione: (2019)

Optimizing Logical Execution Time Model for Both Determinism and Low Latency
di: Wang, Sen, et al.
Pubblicazione: (2023)

Fast Symbolic Integer-Linear Spectra
di: Luntzel, Jonny, et al.
Pubblicazione: (2024)

Extrapolating Solution Paths of Polynomial Homotopies towards Singularities with PHCpack and phcpy
di: Verschelde, Jan, et al.
Pubblicazione: (2024)

Satire: Computing Rigorous Bounds for Floating-Point Rounding Error in Mixed-Precision Loop-Free Programs
di: Tirpankar, Tanmay, et al.
Pubblicazione: (2025)

Training Stiff Neural Ordinary Differential Equations with Explicit Exponential Integration Methods
di: Fronk, Colby, et al.
Pubblicazione: (2024)

Certificates for nonnegativity of multivariate integer polynomials under perturbations
di: Bender, Matías R, et al.
Pubblicazione: (2025)

Divide, Conquer and Verify: Improving Symbolic Execution Performance
di: Scherb, Christopher, et al.
Pubblicazione: (2023)

Handling Infinite Domain Parameters in Planning Through Best-First Search with Delayed Partial Expansions
di: Aso-Mollar, Ángel, et al.
Pubblicazione: (2025)

modelSolver: A Symbolic Model-Driven Solver for Power Network Simulation and Monitoring
di: Dzafic, Izudin, et al.
Pubblicazione: (2025)

Some Computational Tools for Solving a Selection of Problems in Control Theory
di: Demin, Alexander, et al.
Pubblicazione: (2025)

Combining Neural Networks and Symbolic Regression for Analytical Lyapunov Function Discovery
di: Feng, Jie, et al.
Pubblicazione: (2024)