Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
NASA NTRS2019

Adjoint-Based Anisotropic Mesh Adaptation for a Stabilized Finite-Element Flow Solver

An adjoint solver is implemented in the FUN3D stabilized finite-element flow solver. The adjoint solution is used to generate anisotropic, adapted meshes to control error in scalar out- put functionals, such as lift or drag coefficient. The inviscid and turbulent adjoints are verified with a finite-difference derivative approximation and can be used in design optimization in addition to mesh adaptation. The adjoint capability represents an extension of previous research using the FUN3D stabilized finite-element capability with metric-based mesh adaptation and interpolation-based error estimates to generate highly anisotropic adapted meshes for turbulent flows. In the present work, a metric-based approach is again utilized, where the adjoint and the primal solutions both contribute to the generation of a metric tensor field that is subsequently used to produce the required anisotropic mesh for each adaptation cycle. Adaptive results are then shown for an inviscid supersonic flow over a diamond airfoil, inviscid transonic flow over the ONERA M6 wing, and viscous laminar flow over the NACA 0012 airfoil, all using drag force as the output functional. Adjoint-based adaptation is compared with a multiscale solution-based approach that controls the L norm of Mach number interpolation error to demonstrate the effectiveness and effciency of the adjoint-based adaptive mesh technology.

Balan, Aravind↗
DOE OSTI2023

High-Order Mesh hr-adaptivity for Surface Fitting to Implicit Geometries

We present an ℎ𝑟-adaptivity framework for morphing a given mesh to fit a target surface prescribed as the zero isocontour of a discrete function. In this framework, high-order meshing is posed as a variational minimization problem that depends on the mesh quality prescribed via the target matrix optimization paradigm (TMOP) and position of a subset of mesh nodes with respect to the target surface. The proposed formulation ensures that the variational problem is converged and mesh quality degradation near the surface is limited, even when the mesh topology is incompatible with the target surface. Additionally, a mesh subset-based approach and ℎ-refinement is introduced to efficiently increase fitting accuracy while reducing the computational cost of the mesh morphing problem. The ℎ𝑟-adaptivity technique extends to different element types in two- and three-dimensions, and can be used in existing finite element and spectral element frameworks to obtain high-order body-fitted meshes. Various numerical experiments demonstrate the robustness and accuracy of the fitting approach for problems of practical interest such as Lagrangian hydrodynamics and topology optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

LDRD Report: Topological Design Optimization of Convolutes in Next Generation Pulsed Power Devices.

This LDRD project was developed around the ambitious goal of applying PDE-constrained opti- mization approaches to design Z-machine components whose performance is governed by elec- tromagnetic and plasma models. This report documents the results of this LDRD project. Our differentiating approach was to use topology optimization methods developed for structural design and extend them for application to electromagnetic systems pertinent to the Z-machine. To achieve this objective a suite of optimization algorithms were implemented in the ROL library part of the Trilinos framework. These methods were applied to standalone demonstration problems and the Drekar multi-physics research application. Out of this exploration a new augmented Lagrangian approach to structural design problems was developed. We demonstrate that this approach has favorable mesh-independent performance. Both the final design and the algorithmic performance were independent of the size of the mesh. In addition, topology optimization formulations for the design of conducting networks were developed and demonstrated. Of note, this formulation was used to develop a design for the inner magnetically insulated transmission line on the Z-machine. The resulting electromagnetic device is compared with theoretically postulated designs.

42 ENGINEERING↗
DOE OSTI2013

A Parallel Ghosting Algorithm for The Flexible Distributed Mesh Database

Critical to the scalability of parallel adaptive simulations are parallel control functions including load balancing, reduced inter-process communication and optimal data decomposition. In distributed meshes, many mesh-based applications frequently access neighborhood information for computational purposes which must be transmitted efficiently to avoid parallel performance degradation when the neighbors are on different processors. This article presents a parallel algorithm of creating and deleting data copies, referred to as ghost copies, which localize neighborhood data for computation purposes while minimizing inter-process communication. The key characteristics of the algorithm are: (1) It can create ghost copies of any permissible topological order in a 1D, 2D or 3D mesh based on selected adjacencies. (2) It exploits neighborhood communication patterns during the ghost creation process thus eliminating all-to-all communication. (3) For applications that need neighbors of neighbors, the algorithm can create n number of ghost layers up to a point where the whole partitioned mesh can be ghosted. Strong and weak scaling results are presented for the IBM BG/P and Cray XE6 architectures up to a core count of 32,768 processors. The algorithm also leads to scalable results when used in a parallel super-convergent patch recovery error estimator, an application that frequently accesses neighborhood data to carry out computation.

Mubarak, Misbah↗
DOE OSTI2025

Efficient shallow Ritz method for 1D diffusion problems

This paper studies the shallow Ritz method for solving the one-dimensional diffusion problem. It is shown that the shallow Ritz method improves the order of approximation dramatically for non-smooth problems. To realize this optimal or nearly optimal order of the shallow Ritz approximation, we develop a damped block Newton (dBN) method that alternates between updates of the linear and non-linear parameters. Per each iteration, the linear and the non-linear parameters are updated by exact inversion and one step of a modified, damped Newton method applied to a reduced non-linear system, respectively. The computational cost of each dBN iteration is $\mathcal{O}$(n). Starting with the non-linear parameters as a uniform partition of the interval, numerical experiments show that the dBN is capable of efficiently moving mesh points to nearly optimal locations. In conclusion, to improve the efficiency of the dBN further, we propose an adaptive damped block Newton (AdBN) method by combining the dBN with the adaptive neuron enhancement (ANE) method [28].

Diffusion problems↗
DOE OSTI2022

Sequential Decision Making (SDM) for Mesh Refinement and Model Selection in Multiscale, Multi-Physics Applications

Intelligent automation and decision support are needed to enhance computational efficiency and robustness in multiscale and multi-physics problems, including materials science, manufacturing, and climate and weather modeling. Current scientific computing approaches for enabling decisions by scientists fail to explore the role of learning, reasoning, and probabilistic planning. Often these decisions are not performed in real-time during the computation but are made prior to the start of the computation, which must be interrupted in order to make changes to the prior choices. Such interruptions at different stages of the computation increase the total computing time and the need for a human expert to frequently monitor the results. State of art scientific computing methods consist of rule-based algorithms that cannot automatically adapt to a dynamically changing computing environment. The development of a Sequential Decision Making (SDM) framework will automate scientific computing by optimizing the policies for mesh refinement, time-stepping, model and algorithm selection, resource allocation, and pre and post-processing. Our agent SDM framework for scientific computing will consist of data-driven learning (Classifier), automated reasoning (contextual knowledge), and probabilistic planning (Reinforcement Learning). In this project, we focused on three problems to demonstrate our SDM framework on a set of ordinary and partial differential equations. Classification of Lorenz system regions using Feed-Forward Neural Networks examined learning in the SDM framework. On the other hand, reasoning and planning in the SDM framework were used in two problems: adaptive time-stepping for nonlinear ODEs using on-policy RL algorithms, and adaptive mesh refinement for 2-D PDEs using off-policy RL algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Shape optimization using a NURBS-based interface-enriched generalized FEM

This study presents a gradient-based shape optimization over a fixed mesh using a non-uniform rational B-splines-based interface-enriched generalized finite element method, applicable to multi-material structures. In the proposed method, non-uniform rational B-splines are used to parameterize the design geometry precisely and compactly by a small number of design variables. An analytical shape sensitivity analysis is developed to compute derivatives of the objective and constraint functions with respect to the design variables. Subtle but important new terms involve the sensitivity of shape functions and their spatial derivatives. As a result, verification and illustrative problems are solved to demonstrate the precision and capability of the method.

42 ENGINEERING↗
DOE OSTI2023

Yet another parameter-free shape optimization method

The use of node coordinates as design variables in shape optimization offers a larger design space than computer-aided design (CAD)-based shape parameterizations. It also allows for the optimization of legacy designs, i.e., a finite element mesh from an existing design can be readily optimized to meet new performance requirements without involving a CAD model. However, it is well known that the node coordinate parameterization method is fraught with numerical difficulties, which makes it impractical to use. This has led to several of “parameter-free” shape optimization methods that seek the advantages and avoid the pitfalls of the naïve node coordinate parameterization method. These methods come in two main varieties: sensitivity filtering (or gradient smoothing) and consistent filtering. The latter is analogous to the density filter method used in topology optimization (TO). In this work, we use the PDE filter from TO and energy-based filters to implement consistent shape optimization filtering schemes easily and efficiently. Numerical experiments demonstrate that consistent methods are more robust than sensitivity filtering methods.

42 ENGINEERING↗
DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

DISTRI: Distributed Multi-Facility HPC Simulator (DISTRI) v2.1

DISTRI is an advanced network simulator designed for multi-facility computational infrastructures with agentic behavior. It simulates HPC facilities where computational resources act as autonomous agents, making intelligent decisions about job scheduling, load balancing, and resource allocation. The simulator focuses on developing and testing decentralized algorithms that promote resilience and efficiency in multi-facility environments. Key Features: - Agentic Resource Behavior: Processors and DTNs act as autonomous agents with decision-making capabilities - Pheromone-Based Load Balancing: Decentralized load balancing inspired by ant colony optimization - Dual Topology Support: Mesh (normal operations) and Dumbell (network testing) topologies - Comprehensive TCP Simulation: Realistic TCP implementations with multiple congestion control algorithms - Failure Resilience Testing: Processor failure simulation with automatic job reassignment - Extensive Visualization: Detailed performance analysis and metrics collection - Research-Ready: Designed for algorithm development and benchmarking

Bez, Jean Luca [Lawrence Berkeley National Laborat↗
NASA NTRS1985

Spline Curves, Wire Frames and Bvalue

The methods that were developed for wire-frame design are described. The principal tools for control of a curve during interactive design are mathematical ducks. The simplest of these devices is an analog of the draftsman's lead weight that he uses to control a mechanical spline also create Ducks for controlling differential and integral properties of curves were created. Other methods presented include: constructing the end of a Bezier polygon to gain quick and reasonably confident control of the end tangent vector, end curvature and end torsion; keeping the magnitude of unwanted curvature oscillations within tolerance; constructing the railroad curves that appear in many engineering design problems; and controlling the frame to minimize errors at mesh points and to optimize the shapes of the curve elements.

Smith, L.↗
NASA NTRS1996

Simulation Software

Various NASA Small Business Innovation Research grants from Marshall Space Flight Center, Langley Research Center and Ames Research Center were used to develop the 'kernel' of COMCO's modeling and simulation software, the PHLEX finite element code. NASA needed it to model designs of flight vehicles; one of many customized commercial applications is UNISIM, a PHLEX-based code for analyzing underground flows in oil reservoirs for Texaco, Inc. COMCO's products simulate a computational mechanics problem, estimate the solution's error and produce the optimal hp-adapted mesh for the accuracy the user chooses. The system is also used as a research or training tool in universities and in mechanical design in industrial corporations.

Source record↗
NASA NTRS2020

FUN3D Manual: 13.7

This manual describes the installation and execution of FUN3D version 13.7, including optional dependent packages. FUN3D is a suite of computational fluid dynamics simulation and design tools that uses mixed-element unstructured grids in a large number of formats, including structured multiblock and overset grid systems. A discretely-exact adjoint solver may be used for formal design optimization, error estimation, and mesh adaptation. FUN3D also offers a reacting, real-gas capability and provides GPU acceleration of many common simulation options.

FUN3D↗
NASA NTRS2022

FUN3D Manual: 14.0

This manual describes the installation and execution of FUN3D version 14.0,including optional dependent packages. FUN3D is a suite of computational fluid dynamics simulation and design tools that uses mixed-element unstructured grids in a large number of formats, including structured multiblock and overset grid systems. A discretely-exact adjoint solver may be used for for-mal design optimization, error estimation, and mesh adaptation. FUN3D also offers a reacting, real-gas capability and provides GPU acceleration of many common simulation options.1

William K Anderson↗
NASA NTRS2023

FUN3D Manual: 14.0.2

This manual describes the installation and execution of FUN3D version 14.0.2, including optional dependent packages. FUN3D is a suite of computational fluid dynamics simulation and design tools that uses mixed-element unstructured grids in a large number of formats, including structured multiblock and overset grid systems. A discretely-exact adjoint solver may be used for formal design optimization, error estimation, and mesh adaptation. FUN3D also offers a reacting, real-gas capability and provides GPU acceleration of many common simulation options.

William K Anderson↗
NASA NTRS2024

FUN3D Manual: 14.1

This manual describes the installation and execution of FUN3D version 14.1, including optional dependent packages. FUN3D is a suite of computational fluid dynamics simulation and design tools that uses mixed-element unstructured grids in a large number of formats, including structured multiblock and overset grid systems. A discretely-exact adjoint solver may be used for formal design optimization, error estimation, and mesh adaptation. FUN3D also offers a reacting, real-gas capability and provides GPU acceleration of many common simulation options.

William K Anderson↗
DOE OSTI2022

Analysis of cell-based diffusion acceleration for the slice balance approach

In this work, we perform analysis on the use of cell-based diffusion acceleration methodologies to accelerate the convergence of transport solutions discretized with the slice balance approach (SBA) on unstructured polygonal grids.We investigated both linear diffusion synthetic acceleration (DSA) and non linear diffusion acceleration (NDA), including its partial-current variant (pNDA). DSA and NDA were both shown to diverge for intermediate ranges of mesh optical thicknesses. However, pNDA and Krylov methods like GMRES and Broyden stabilized the acceleration schemes, including problems with degenerate cells formed by mesh refinement. (author)

42 ENGINEERING↗