๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Symbolic computation using L-systems II: Extensions

โœ Scribed by Narendra S. Goel; Bo Shen

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
522 KB
Volume
69
Category
Article
ISSN
0096-3003

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Exact solutions of some systems of nonli
Exact solutions of some systems of nonlinear partial differential equations using symbolic computation
โœ Fu-Ding Xie; Ming Li; Yong Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 310 KB

In this paper, we present a solution method that utilizes symbolic computation to obtain exact traveling wave solutions of some systems of nonlinear partial differential equations. The solution method is demonstrated by obtaining solutions to the variant shallow water wave equations.

Using Rewriting Systems to Compute Left
Using Rewriting Systems to Compute Left Kan Extensions and Induced Actions of Categories
โœ Ronald Brown; Anne Heyworth ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 432 KB

The aim is to apply string-rewriting methods to compute left Kan extensions, or, equivalently, induced actions of monoids, categories, groups or groupoids. This allows rewriting methods to be applied to a greater range of situations and examples than before. The data for the rewriting is called a Ka

Computation of the normal forms for gene
Computation of the normal forms for general M-DOF systems using multiple time scales. Part II: non-autonomous systems
โœ Songhui Zhu; Pei Yu ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 834 KB

A perturbation technique has been developed in Part I to consider the computation of the normal forms for general multiple-degree-of-freedom autonomous systems. In this paper, the perturbation approach is extended to study general non-autonomous systems and is focused on systems with external forcin