Methods for Topological Design of Conducting Networks
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
19th AIAA Non-Deterministic Approaches Conference, 2017
When solving partial differential equations (PDEs) with random inputs, it is often computationally inefficient to merely propagate samples of the input probability law (or an approximation thereof) because the input law may not accurately capture the behavior of critical system responses that depend on the PDE solution. To further complicate matters, in many applications it is critical to accurately approximate the “risk” associated with the statistical tails of the system responses, not just the statistical moments. In this paper, we develop an adaptive sampling and local reduced basis method for approximately solving PDEs with random inputs. Our method determines a set of parameter atoms and an associated (implicit) Voronoi partition of the parameter domain on which we build local reduced basis approximations of the PDE solution. In addition, we extend our adaptive sampling approach to accurately compute measures of risk evaluated at quantities of interest that depend on the PDE solution.
Abstract not provided.
Abstract not provided.
Engineering decisions are often formulated as optimization problems such as the optimal design or control of physical systems. In these applications, the resulting optimization problems are constrained by large-scale simulations involving systems of partial differential equations (PDEs), ordinary differential equations (ODEs), and differential algebraic equations (DAEs). In addition, critical components of these systems are fraught with uncertainty, including unverifiable modeling assumptions, unknown boundary and initial conditions, and uncertain coefficients. Typically, these components are estimated using noisy and incomplete data from a variety of sources (e.g., physical experiments). The lack of knowledge of the true underlying probabilistic characterization of model inputs motivates the need for optimal solutions that are robust to this uncertainty. In this report, we introduce a framework for handling "distributional" uncertainties in the context of simulation-based optimization. This includes a novel measure discretization technique that will lead to an adaptive optimization algorithm tailored to exploit the structures inherent to simulation- based optimization.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
In this report we formulate eigenvalue-based methods for model calibration using a PDE-constrained optimization framework. We derive the abstract optimization operators from first principles and implement these methods using Sierra-SD and the Rapid Optimization Library (ROL). To demon- strate this approach, we use experimental measurements and an inverse solution to compute the joint and elastic foam properties of a low-fidelity unit (LFU) model.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.