Refine
Year of publication
- 2004 (323) (remove)
Institute
- Fachbereich Medizintechnik und Technomathematik (85)
- Fachbereich Wirtschaftswissenschaften (37)
- Fachbereich Elektrotechnik und Informationstechnik (35)
- Fachbereich Energietechnik (35)
- INB - Institut für Nano- und Biotechnologien (35)
- IfB - Institut für Bioengineering (30)
- Fachbereich Maschinenbau und Mechatronik (24)
- Fachbereich Luft- und Raumfahrttechnik (23)
- Fachbereich Bauingenieurwesen (20)
- Fachbereich Chemie und Biotechnologie (15)
Language
- English (161)
- German (160)
- Portuguese (2)
Document Type
- Article (214)
- Conference Proceeding (37)
- Book (35)
- Lecture (6)
- Report (6)
- Part of a Book (5)
- Doctoral Thesis (4)
- Patent (4)
- Study Thesis (4)
- Other (3)
Keywords
- Bauingenieurwesen (4)
- Betriebswirtschaftslehre (4)
- Bologna-Prozess (4)
- CAD (4)
- ECTS (4)
- Filmregie (4)
- Finanzierung (4)
- Liquiditätspolitik (4)
- civil engineering (4)
- Aachen University of Applied Sciences (3)
Solar sails enable missions to the outer solar system and beyond, although the solar
radiation pressure decreases with the square of solar distance. For such missions, the solar sail may gain a large amount of energy by first making one or more close approaches to the sun. Within this paper, optimal trajectories for solar sail missions to the outer planets and into near interstellar space (200 AU) are presented. Thereby, it is shown that even near/medium-term solar sails with relatively moderate performance allow reasonable transfer times to the boundaries of the solar system.
This work is an attempt to answer the question: How to use convex programming in shakedown analysis of structures made of materials with temperature-dependent properties. Based on recently established shakedown theorems and formulations, a dual relationship between upper and lower bounds of the shakedown limit load is found, an algorithmfor shakedown analysis is proposed. While the original problem is neither convex nor concave, the algorithm presented here has the advantage of employing convex programming tools.