✦ LIBER ✦

Computing Connecting Orbits via an Improved Algorithm for Continuing Invariant Subspaces

✍ Scribed by Demmel, J. W.; Dieci, L.; Friedman, M. J.

Book ID: 118188245
Publisher: Society for Industrial and Applied Mathematics
Year: 2000
Tongue: English
Weight: 188 KB
Volume: 22
Category: Article
ISSN: 1064-8275
DOI: 10.1137/s1064827598344868

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved parallel algorithm for const

An improved parallel algorithm for constructing voronoi diagram on a mesh-connected computer

✍ Chang-Sung Jeong 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 455 KB

An improved algorithm for the computatio

An improved algorithm for the computation of structural invariants of a system pencil and related geometric aspects

✍ C. Oară; P. Van Dooren 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 696 KB

In this paper we propose a new recursive algorithm for computing the staircase form of a matrix pencil, and implicitly its Kronecker structure. The algorithm compares favorably to existing ones in terms of elegance, versatility, and complexity. In particular, the algorittun without any modification

[American Institute of Aeronautics and A

[American Institute of Aeronautics and Astronautics AIAA/AAS Astrodynamics Specialist Conference - Toronto, Ontario, Canada ()] AIAA/AAS Astrodynamics Specialist Conference - An Algorithm for Computing Optimal Earth Centered Orbit Transfers via Lunar Gravity Assist

✍ Mathur, Ravishankar; Ocampo, Cesar 📂 Article 📅 2010 🏛 American Institute of Aeronautics and Astronautics ⚖ 638 KB