Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mesh Optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

Level-set topology optimization with PDE generated conformal meshes

This paper presents a level-set topology optimization approach that uses conformal meshes for the analysis of the displacement field. The structure’s boundary is represented by the iso-contour of a level-set field discretized on a fixed background design mesh. The conformal mesh is updated for each design iteration via a PDE based mesh morphing process that identifies the set of facets in the background mesh that are homeomorphic to the boundary and relaxes the homeomorphic mesh to conform to the structure’s boundary and ensure high element quality. The conformal mesh allows for a more accurate computation of the response versus density and some level-set based methods which interpolate material properties using the volume fraction. Numerical examples illustrate the proposed approach by optimizing linear-elastic two- and three-dimensional structures, wherein insight into the performance of the mesh morphing process is provided. The examples also highlight the scalability of the approach.

42 ENGINEERING↗

Advancing the STS Neutron Moderator Design with an Automated Optimization Workflow and Unstructured Mesh Modeling

With the Second Target Station approaching its final design phase, a detailed neutronics evaluation of its critical components is necessary. Optimizing the dimensions of the two cold-source moderators that are at the heart of this facility presents a multi-objective optimization problem for which an accurate geometric description is crucial. We have applied a fully automated optimization workflow in which a detailed unstructured mesh geometry is automatically generated with Attila4MC, starting from a parametrized CREO geometry followed by preprocessing with SpaceClaim. With this geometry, a MCNP run is performed to calculate the brightness metrics, which are subsequently provided to the optimization algorithm in DAKOTA that provides new parameters and drives the optimization loop until convergence. In this paper, we show the results of the analysis that are used for the final design of the cylindrical and tube moderator. The optimization simulations provide a refinement to and confirmation of the conclusions of the previous design iteration. Additional to the optimization, a sensitivity study is performed to study the effect of minor geometry changes, which is important for the final engineering design. In conclusion, with these studies, we demonstrate that the automated workflow and high-fidelity unstructured mesh modeling are efficient tools for a thorough design evaluation.

DAKOTA↗

Mesh independency in topology optimization

The topology optimization community has regularly employed optimization algorithms from the operations research community. However, these algorithms are implemented in the sequence space l2 instead of the proper function space where the design variable resides. In this software, we benchmark the mesh independent implementation of pyMMAopt with three common problems in topology optimization. We show how the volume fraction variable discretization on non-uniform meshes affects the convergence of l2 based optimization algorithms and how pyMMAopt successfully achieves mesh independent convergence.

Salazar De Troya, Miguel↗

A comparison of mesh morphing methods for shape optimization.

The ability to automatically morph an existing mesh to conform to geometry modifications is a necessary capability to enable rapid prototyping of design variations. This paper compares six methods for morphing hexahedral and tetrahedral meshes, including the previously published FEMWARP and LBWARP methods as well as four new methods. Element quality and performance results show that different methods are superior on different models. We recommend that designers of applications that use mesh morphing consider both the FEMWARP and a linear simplex based method.

99 GENERAL AND MISCELLANEOUS↗

Adaptive mesh refinement in stress-constrained topology optimization

We present a topology structural optimization framework with adaptive mesh refinement and stress-constraints. Finite element approximation and geometry representation benefit from such refinement by enabling more accurate stress field predictions and greater resolution of the optimal structural boundaries. We combine a volume fraction filter to impose a minimum design feature size, the RAMP penalization to generate “black-and-white designs” and a RAMP-like stress definition to resolve the “stress singularity problem.” Regions with stress concentrations dominate the optimized design. As such, rigorous simulations are required to accurately approximate the stress field. To achieve this goal, we invoke a threshold operation and mesh refinement during the optimization. We do so in an optimal fashion, by applying adaptive mesh refinement techniques that use error indicators to refine and coarsen the mesh as needed. In this way, we obtain more accurate simulations and greater resolution of the design domain. We present results in two dimensions to demonstrate the efficiency of our method.

97 MATHEMATICS AND COMPUTING↗

Unstructured Primal-Dual Mesh Improvement: Target Matrix Optimization Paradigm (Final Technical Report)

The work performed at Dihedral LLC supported the collaboration via two research topics: (1) Hodge-Optimized Triangulations and (2) Target-Matrix Opti-mization Paradigm. Because the project was focused on primal-dual meshes, attention in TMOP was partially confined to linear element triangle meshes in the plane and their duals. However, a lot of our results extend to other element types.

97 MATHEMATICS AND COMPUTING↗

Adaptive anisotropic meshing for steady convection-dominated problems

Obtaining accurate solutions for convection–diffusion equations is challenging due to the presence of layers when convection dominates the diffusion. To solve this problem, we design an adaptive meshing algorithm which optimizes the alignment of anisotropic meshes with the numerical solution. Three main ingredients are used. First, the streamline upwind Petrov–Galerkin method is used to produce a stabilized solution. Second, an adapted metric tensor is computed from the approximate solution. Third, optimized anisotropic meshes are generated from the computed metric tensor by an anisotropic centroidal Voronoi tessellation algorithm. Our algorithm is tested on a variety of two-dimensional examples and the results shows that the algorithm is robust in detecting layers and efficient in avoiding non-physical oscillations in the numerical approximation.

97 MATHEMATICS AND COMPUTING↗

Variable-fidelity multipoint aerodynamic shape optimization with output-based adapted meshes

This work presents a method to control the discretization error in multipoint aerodynamic shape optimization using output-based adapted meshes. The meshes are adapted via adjoint-based error estimates, taking into account both the objective and constraint output errors. A multi-fidelity optimization framework is then developed by taking advantage of the variable fidelity offered by adaptive meshes. The objective functional and its sensitivity at each design point (operating condition) are first evaluated on the same initial coarse mesh, which is then subsequently adapted for each design point individually as the shape optimization proceeds. The effort to set up the optimization is minimal since the initial mesh can be fairly coarse and easy to generate. As the shape approaches the optimal design, the mesh at each design point becomes finer, in regions necessary for that particular operating condition. The multi-fidelity framework is tightly coupled with the objective error estimation to ensure the optimization accuracy at each fidelity. Computational savings arise from a reduction of the mesh size when the design is far from optimal and avoiding an exhaustive search on low-fidelity meshes. The proposed method is demonstrated on multipoint drag minimization problems of a transonic airfoil with lift and area constraints. Improved accuracy and efficiency are shown compared to traditional fixed-fidelity optimization with a fixed computational mesh.

42 ENGINEERING↗

Topology-Aware Performance Optimization and Modeling of Adaptive Mesh Refinement Codes for Exascale

Here, we introduce a topology-aware performance optimization and modeling workflow for AMR simulation that includes two new modeling tools, ProgrAMR and Mota Mapper, which interface with the BoxLib AMR framework and the SSTmacro network simulator. ProgrAMR allows us to generate and model the execution of task dependency graphs from high-level specifications of AMR-based applications, which we demonstrate by analyzing two example AMR-based multigrid solvers with varying degrees of asynchrony. Mota Mapper generates multiobjective, network topology-aware box mappings, which we apply to optimize the data layout for the example multigrid solvers. While the sensitivity of these solvers to layout and execution strategy appears to be modest for balanced scenarios, the impact of better mapping algorithms can be significant when performance is highly constrained by network hop latency. Furthermore, we show that network latency in the multigrid bottom solve is the main contributing factor preventing good scaling on exascale-class machines.

97 MATHEMATICS AND COMPUTING↗

Branch Flow Model: Relaxations and Convexification-Part I

We propose a branch flow model for the analysis and optimization of mesh as well as radial networks. The model leads to a new approach to solving optimal power flow (OPF) that consists of two relaxation steps. The first step eliminates the voltage and current angles and the second step approximates the resulting problem by a conic program that can be solved efficiently. For radial networks, we prove that both relaxation steps are always exact, provided there are no upper bounds on loads. For mesh networks, the conic relaxation is always exact but the angle relaxation may not be exact, and we provide a simple way to determine if a relaxed solution is globally optimal. We propose convexification of mesh networks using phase shifters so that OPF for the convexified network can always be solved efficiently for an optimal solution. We prove that convexification requires phase shifters only outside a spanning tree of the network and their placement depends only on network topology, not on power flows, generation, loads, or operating constraints. Part I introduces our branch flow model, explains the two relaxation steps, and proves the conditions for exact relaxation. Part II describes convexification of mesh networks, and presents simulation results.

Farivar, M↗

Branch Flow Model: Relaxations and Convexification-Part II

We propose a branch flow model for the analysis and optimization of mesh as well as radial networks. The model leads to a new approach to solving optimal power flow (OPF) that consists of two relaxation steps. The first step eliminates the voltage and current angles and the second step approximates the resulting problem by a conic program that can be solved efficiently. For radial networks, we prove that both relaxation steps are always exact, provided there are no upper bounds on loads. For mesh networks, the conic relaxation is always exact but the angle relaxation may not be exact, and we provide a simple way to determine if a relaxed solution is globally optimal. We propose convexification of mesh networks using phase shifters so that OPF for the convexified network can always be solved efficiently for an optimal solution. We prove that convexification requires phase shifters only outside a spanning tree of the network and their placement depends only on network topology, not on power flows, generation, loads, or operating constraints. Part I introduces our branch flow model, explains the two relaxation steps, and proves the conditions for exact relaxation. Part II describes convexification of mesh networks, and presents simulation results.

Farivar, M↗

Coordination of Behind-the-Meter Energy Storage and Building Loads: Optimization with Deep Learning Models*

With the increasing penetration of renewable energy systems and energy storage systems in buildings, it is critical to optimize system operation. In this paper, we develop an optimization strategy to minimize the operation cost as well as maintain indoor thermal comfort, for a building integrated with battery and PV. A Recurrent Neural Network (RNN) is used to predict building thermal load and zone temperatures. A black-box optimization algorithm known as nonlinear optimization by mesh adaptive direct search (NOMADS) is employed in simulation to provide look-ahead optimal battery dispatch and zone temperature set-point schedules so that the operation cost is minimized. Field data collected from a medium sized office building at Pacific Northwest National Laboratory (PNNL) integrated with Photovoltaic (PV) system model and battery storage system model is used to demonstrate the proposed methodology. Compared with rule based methods, the optimization strategy obtained a lower cost of operation while satisfying comfort constraints.

Chen, Yimin↗

A dual mesh method with adaptivity for stress-constrained topology optimization

This paper is concerned with the topological optimization of elastic structures, with the goal of minimizing the compliance and/or mass of the structure, subject to a stress constraint. It is well known that depending upon the geometry and the loading conditions, the stress field can exhibit singularities, if these singularities are not adequately resolved, the topological optimization process will be ineffective. For computational efficiency, adaptive mesh refinement is required to adequately resolve the stress field. This poses a challenge for the traditional Solid Isotropic Material with Penalization (SIMP) method that employs a one-to-one correspondence between the finite element mesh and the optimization design variables because as the mesh is refined, the optimization process must somehow be re-started with a new set of design variables. The proposed solution here is a dual mesh approach, one finite element mesh defines the material distribution, a second finite element mesh is used for the computation of the displacement and stress fields. This allows for stress-based adaptive mesh refinement without modifying the definition of the optimization design variables. A second benefit of this dual mesh approach is that there is no need to apply a filter to the design variables to enforce a length scale, instead the length scale is determined by the design mesh. This reduces the number of design variables and allows the designer to apply spatially varying length scale if desired. The efficacy of this dual mesh approach is established via several stress-constrained topology optimization problems.

36 MATERIALS SCIENCE↗