The following pages link to (Q2934694):
Displaying 15 items.
- Computational complexity of solving polynomial differential equations over unbounded domains (Q264572) (← links)
- Algorithms for combinatorial structures: well-founded systems and Newton iterations (Q444909) (← links)
- Computing with D-algebraic power series (Q669617) (← links)
- A geometric index reduction method for implicit systems of differential algebraic equations (Q719759) (← links)
- Newton's method and FFT trading (Q979146) (← links)
- From implicit to recursive equations (Q2002150) (← links)
- On existence and uniqueness of formal power series solutions of algebraic ordinary differential equations (Q2113584) (← links)
- A generalization of the Boulier-Buchberger criterion for the computation of characteristic sets of differential ideals (Q2122135) (← links)
- Symbolic computations of first integrals for polynomial vector fields (Q2194771) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- New algorithms for relaxed multiplication (Q2469229) (← links)
- Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields (Q2792368) (← links)
- Computing Continuous-Time Markov Chains as Transformers of Unbounded Observables (Q2988378) (← links)
- Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability (Q6043379) (← links)
- Pure quadratization and solution of ordinary differential equations by probabilistic evolution theory with concurrent computation of coefficients using exact arithmetic (Q6189871) (← links)
