Computing of B-series by automatic differentiation
DOI10.3934/DCDS.2014.34.903zbMATH Open1278.65020OpenAlexW2086836210MaRDI QIDQ379767FDOQ379767
Authors: Ferenc A. Bartha, Hans Munthe-Kaas 
Publication date: 11 November 2013
Published in: Discrete and Continuous Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/dcds.2014.34.903
Recommendations
computational complexityalgorithmB-seriesautomatic differentiationrooted treeselementary differentialsmultivariate derivatives
Complexity and performance of numerical algorithms (65Y20) Numerical differentiation (65D25) Numerical methods for initial value problems involving ordinary differential equations (65L05)
Cites Work
- Algorithm 924
- A Software Package for the Numerical Integration of ODEs by Means of High-Order Taylor Methods
- Title not available (Why is that?)
- Validated numerics. A short introduction to rigorous computations.
- Pre-Lie algebras and the rooted trees operad
- An Algebraic Theory of Integration Methods
- Title not available (Why is that?)
- The Magnus expansion, trees and Knuth's rotation correspondence
- Graph drawing. 17th international symposium, GD 2009, Chicago, IL, USA, September 22--25, 2009. Revised papers
- Numerical integrators based on modified differential equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Evaluating higher derivative tensors by forward propagation of univariate Taylor series
Cited In (2)
Uses Software
This page was built for publication: Computing of B-series by automatic differentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q379767)
