✦ LIBER ✦

The use of symplectic algorithm in the computation of Lyapunov characteristic numbers

✍ Scribed by Liao Xin-hao; Zhao Chang-yin; Liu Lin

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 206 KB
Volume: 17
Category: Article
ISSN: 0275-1062
DOI: 10.1016/0275-1062(93)90012-e

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the computation of the Lyapunov chara

On the computation of the Lyapunov characteristic numbers of the planar restricted three-body problem

✍ Zhao-hua Yi; W.H. Jefferys 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 409 KB

The relevance of connectance on the Lyap

The relevance of connectance on the Lyapunov characteristic exponents of products of symplectic random matrices

✍ Giovanni Paladin; Angelo Vulpiani 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 152 KB

Parallel algorithm for the computation o

Parallel algorithm for the computation of characteristic polynomials of chemical graphs

✍ P. Venuvanalingam; P. Thangavel 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB

A parallel algorithm is developed for the f i t time based on Frame's method to compute the characteristic polynomials of chemical graphs. This algorithm can handle all types of graphs: ordinary, weighted, directed, and signed. Our algorithm takes only linear time in the CRCW PRAM model with O(n9) p

A new algorithm for the computation of t

A new algorithm for the computation of the Lyapunov constants for some degenerated critical points

✍ Armengol Gasull; Joan Torregrosa 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 732 KB

On the maximality of the orthogonal grou

On the maximality of the orthogonal groups in the symplectic groups in characteristic two

✍ Roger H. Dye 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 French ⚖ 535 KB

On the computation of units and class nu

On the computation of units and class numbers by a generalization of Lagrange's algorithm

✍ Johannes Buchmann 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 926 KB