scientific article; zbMATH DE number 1916891
zbMATH Open1022.65051MaRDI QIDQ4808034FDOQ4808034
Authors: Martin Berz, Kyoko Makino 
Publication date: 19 October 2003
Title of this publication is not available (Why is that?)
Recommendations
algorithmsglobal optimizationinterval analysisapproximation ordercomparison of methodsinclusion methodsvalidated computationsinversesinterval methodintegration of functionscentered formmean value formTaylor model methodsinterval polynomial methods
Numerical mathematical programming methods (65K05) Numerical quadrature and cubature formulas (65D32) Nonlinear ordinary differential equations and systems (34A34) General methods in interval analysis (65G40) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Stability and convergence of numerical methods for ordinary differential equations (65L20) Algorithms with automatic result verification (65G20)
Cited In (43)
- Effective approximation of the solutions of algebraic equations
- Rigorous integration of non-linear ordinary differential equations in Chebyshev basis
- Constrained polynomial zonotopes
- On the properties of Sard kernels and multiple error estimates for bounded linear functionals of bivariate functions with application to non-product cubature
- Taylor forms -- use and limits.
- A validated real function calculus
- Towards using exact real arithmetic for initial value problems
- An application of Taylor models to the Nakao method on ODEs
- Experiments with range computations using extrapolation
- A study of rigorous ODE integrators for multi-scale set-oriented computations
- Efficient and validated numerical evaluation of abelian integrals
- Automatic differentiation for Fourier series and the radii polynomial approach
- High-order parameterization of stable/unstable manifolds for long periodic orbits of maps
- Non-intrusive hybrid interval method for uncertain nonlinear systems using derivative information
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Shrink wrapping for Taylor models revisited
- Parameter range reduction from partial data in systems of differential algebraic equations
- Probability bounds analysis for nonlinear population ecology models
- Proving tight bounds on univariate expressions with elementary functions in Coq
- A Framework for the Numerical Computation and A Posteriori Verification of Invariant Objects of Evolution Equations
- Taylor models and floating-point arithmetic: proof that arithmetic operations are validated in COSY
- A generalization of \(p\)-boxes to affine arithmetic
- Chebyshev model arithmetic for factorable functions
- Efficient and accurate computation of upper bounds of approximation errors
- Reachability of Koopman Linearized Systems Using Random Fourier Feature Observables and Polynomial Zonotope Refinement
- Validated solutions of initial value problems for parametric ODEs
- A higher order method for input-affine uncertain systems
- Verified computations using Taylor models and their applications
- Verified solution method for population epidemiology models with uncertainty
- Towards global neural network abstractions with locally-exact reconstruction
- Enclosing Chebyshev expansions in linear time
- Computation of tight enclosures for Laplacian eigenvalues
- Computing the pessimism of inclusion functions
- Title not available (Why is that?)
- Improved validated bounds for Taylor coefficients and for Taylor remainder series
- Convergence analysis of Taylor models and McCormick-Taylor models
- Parameterization of invariant manifolds for periodic orbits. II: A posteriori analysis and computer assisted error bounds
- Effective bounds for P-recursive sequences
- Rigorous uniform approximation of D-finite functions using Chebyshev expansions
- Exploiting nonlinear invariants and path constraints to achieve tighter reachable set enclosures using differential inequalities
- Computing reachable sets of differential inclusions
- Set propagation in dynamical systems with generalised polynomial algebra and its computational complexity
- TMsim: an algorithmic tool for the parametric and worst-case simulation of systems with uncertainties
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808034)
