Fluid-structure interaction simulation of an inflatable aerodynamic tension-cone decelerator

Inflatable aerodynamic decelerators have potential advantages for planetary re-entry in robotic and human exploration missions. In this paper, we focus on an inflatable tension cone design that has potential advantages over other geometries. A computational fluid-structure interaction model of a tension cone is employed to investigate the behavior of the inflatable aeroshell at supersonic speeds for conditions matching recent experimental results. A parametric study is carried out to investigate the deflections of the tension cone as a function of inflation pressure of the torus at a Mach of 2.5. Comparison of the behavior of the structure, amplitude of deformations, and determined loads are reported. © 2010 by the American Institute of Aeronautics and Astronautics, Inc.

Probabilistic soil identification based on cone penetration tests

In geotechnical engineering, soil classification is an essential component in the design process. Field methods such as the cone penetration test (CPT) can be used as less expensive and faster alternatives to sample retrieval and testing. Unfortunately, current soil classification charts based on CPT data and laboratory measurements are too generic, and may not provide an accurate prediction of the soil type. A probabilistic approach is proposed here to update and modify soil identification charts based on site-specific CPT data. The probability that a soil is correctly classified is also estimated. The updated identification chart can be used for a more accurate prediction of the classification of the soil, and can account for prior information available before conducting the tests, site-specific data, and measurement errors. As an illustration, the proposed approach is implemented using CPT data from the Treporti Test Site (TTS) near Venice (Italy) and the National Geotechnical Experimentation Sites (NGES) at Texas A&M University. The applicability of the site-specific chart for other sites in Venice Lagoon is assessed using data from the Malamocco test site, approximately 20 km from TTS.

Low-rank optimization on the cone of positive semidefinite matrices

We propose an algorithm for solving optimization problems defined on a subset of the cone of symmetric positive semidefinite matrices. This algorithm relies on the factorization X = Y Y T , where the number of columns of Y fixes an upper bound on the rank of the positive semidefinite matrix X. It is thus very effective for solving problems that have a low-rank solution. The factorization X = Y Y T leads to a reformulation of the original problem as an optimization on a particular quotient manifold. The present paper discusses the geometry of that manifold and derives a second-order optimization method with guaranteed quadratic convergence. It furthermore provides some conditions on the rank of the factorization to ensure equivalence with the original problem. In contrast to existing methods, the proposed algorithm converges monotonically to the sought solution. Its numerical efficiency is evaluated on two applications: the maximal cut of a graph and the problem of sparse principal component analysis. © 2010 Society for Industrial and Applied Mathematics.