Symbolic computation of derivations using labelled trees

DOI10.1016/S0747-7171(10)80009-4zbMATH Open0762.68035MaRDI QIDQ1198243FDOQ1198243

Authors: Robert L. Grossman, Richard Gustavus Larson 

Publication date: 16 January 1993

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4143999
• scientific article; zbMATH DE number 4045963
• scientific article; zbMATH DE number 1263347
• scientific article; zbMATH DE number 4200621
• Solving nonlinear equations from higher order derivations in linear stages

zbMATH Keywords

algebra of treeslinear combinations of rooted laballed trees

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• On the structure of Hopf algebras
• The Parallel Evaluation of General Arithmetic Expressions
• Hopf-algebraic structure of families of trees
• Title not available (Why is that?)
• Solving nonlinear equations from higher order derivations in linear stages

Cited In (11)

• Diagrams in classical and semiclassical perturbation theory
• Title not available (Why is that?)
• Differential algebra structures on families of trees.
• Derivations of identities by symbolic computation
• Title not available (Why is that?)
• Numerical integration of ordinary differential equations on manifolds
• Bottom-Up derivatives of tree expressions
• Hopf-algebraic structure of combinatorial objects and differential operators
• Representing elements of the Weyl algebra by labeled trees
• On the combinatorics of the Hopf algebra of dissection diagrams
• An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees

This page was built for publication: Symbolic computation of derivations using labelled trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198243)