Pages that link to "Item:Q2807868"
From MaRDI portal
The following pages link to Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains (Q2807868):
Displaying 3 items.
- Computational complexity of solving polynomial differential equations over unbounded domains (Q264572) (← links)
- Computational bounds on polynomial differential equations (Q1036531) (← links)
- Polynomial interpolation and a priori bootstrap for computer-assisted proofs in nonlinear ODEs (Q1670296) (← links)