Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time
adaptive step-size controlcomplexitydifferential algebraic equationsinitial value problemsTaylor seriesTaylor series method
Implicit ordinary differential equations, differential-algebraic equations (34A09) Numerical methods for initial value problems involving ordinary differential equations (65L05) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50) Numerical methods for differential-algebraic equations (65L80) Complexity and performance of numerical algorithms (65Y20)
It is shown that the cost to solve initial value problems (IVPs) for semi-explicit index-1 differential-algebraic equations (DAEs) is polynomial in the number of bits of accuracy. The results extend that of previous results which showed the cost of solving IVP for ordinary differential equations is polynomial in the number of bits of accuracy. This cost is obtained for an algorithm based on the Taylor series method for solving differential algebraic equations developed by \textit{J. D. Pryce} [ibid. 19, No. 1--4, 195--211 (1998; Zbl 0921.34014); BIT 41, No. 2, 364--394 (2001; Zbl 0989.34005)]. The analysis assumes that the functions defining the DAE are piecewise analytic. This is the key assumption, allowing the use of arbitrary order methods. The results of the standard theory of information-based complexity give exponential cost for solving ordinary differential equations, being based on a different model.
- Numerical solution of differential-algebraic equations with index-2
- On the numerical solution of differential--algebraic equations with index-2
- Fast algorithms for polynomial solutions of linear differential equations
- Computation of all polynomial solutions of a class of nonlinear differential equations
- scientific article; zbMATH DE number 2099473
- Publication:3031846
- Numerical solution of differential-algebraic equations of arbitrary index with Riemann-Liouville derivative
- Computational bounds on polynomial differential equations
- Problems of computer algebra involved in the search for polynomial solutions of linear differential and difference equations
- A new error-control for initial value solvers
- A new view of the computational complexity of IVP for ODE
- A simple structural analysis method for DAEs
- An elementary solution of a minimax problem arising in algorithms for automatic mesh selection
- Automatic control and adaptive time-stepping
- Continuous numerical methods for ODEs with defect control
- Fast Multiple-Precision Evaluation of Elementary Functions
- scientific article; zbMATH DE number 50395 (Why is no real title available?)
- scientific article; zbMATH DE number 50734 (Why is no real title available?)
- scientific article; zbMATH DE number 688057 (Why is no real title available?)
- scientific article; zbMATH DE number 3999169 (Why is no real title available?)
- Introduction to Numerical Continuation Methods
- Solving differential-algebraic equations by Taylor series. I: Computing Taylor coefficients
- Solving high-index DAEs by Taylor series
- Solving Index-1 DAEs in MATLAB and Simulink
- Solving ODEs and DDEs with residual control
- Solving Ordinary Differential Equations Using Taylor Series
- Some recent advances in validated methods for IVPs for ODEs
- Implicit Riquier bases for PDAE and their semi-discretizations
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- Computing real witness points of positive dimensional polynomial systems
- Polynomial cost for solving IVP for high-index DAE
- Adaptivity and computational complexity in the numerical solution of ODEs
This page was built for publication: Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492797)
