Search NASA⌕ Search

SEARCH · Search NASA

Results for “adaptive refinement”

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 NTRS2011

Cartesian Off-Body Grid Adaption for Viscous Time- Accurate Flow Simulation

An improved solution adaption capability has been implemented in the OVERFLOW overset grid CFD code. Building on the Cartesian off-body approach inherent in OVERFLOW and the original adaptive refinement method developed by Meakin, the new scheme provides for automated creation of multiple levels of finer Cartesian grids. Refinement can be based on the undivided second-difference of the flow solution variables, or on a specific flow quantity such as vorticity. Coupled with load-balancing and an inmemory solution interpolation procedure, the adaption process provides very good performance for time-accurate simulations on parallel compute platforms. A method of using refined, thin body-fitted grids combined with adaption in the off-body grids is presented, which maximizes the part of the domain subject to adaption. Two- and three-dimensional examples are used to illustrate the effectiveness and performance of the adaption scheme.

Buning, Pieter G.↗
NASA NTRS1981

F-8C adaptive control law refinement and software development

An explicit adaptive control algorithm based on maximum likelihood estimation of parameters was designed. To avoid iterative calculations, the algorithm uses parallel channels of Kalman filters operating at fixed locations in parameter space. This algorithm was implemented in NASA/DFRC's Remotely Augmented Vehicle (RAV) facility. Real-time sensor outputs (rate gyro, accelerometer, surface position) are telemetered to a ground computer which sends new gain values to an on-board system. Ground test data and flight records were used to establish design values of noise statistics and to verify the ground-based adaptive software.

Hartmann, G. L.↗
NASA NTRS2002

Progress in the Simulation of Steady and Time-Dependent Flows with 3D Parallel Unstructured Cartesian Methods

The proposed paper will present recent extensions in the development of an efficient Euler solver for adaptively-refined Cartesian meshes with embedded boundaries. The paper will focus on extensions of the basic method to include solution adaptation, time-dependent flow simulation, and arbitrary rigid domain motion. The parallel multilevel method makes use of on-the-fly parallel domain decomposition to achieve extremely good scalability on large numbers of processors, and is coupled with an automatic coarse mesh generation algorithm for efficient processing by a multigrid smoother. Numerical results are presented demonstrating parallel speed-ups of up to 435 on 512 processors. Solution-based adaptation may be keyed off truncation error estimates using tau-extrapolation or a variety of feature detection based refinement parameters. The multigrid method is extended to for time-dependent flows through the use of a dual-time approach. The extension to rigid domain motion uses an Arbitrary Lagrangian-Eulerlarian (ALE) formulation, and results will be presented for a variety of two- and three-dimensional example problems with both simple and complex geometry.

Aftosmis, M. J.↗
NASA NTRS1990

Generation and adaptation of 3-D unstructured grids for transient problems

Grid generation and adaptive refinement techniques suitable for the simulation of strongly unsteady flows past geometrically complex bodies in 3-D are described. The grids are generated using the advancing front technique. Emphasis is placed not to generate elements that are too small, as this would severely increase the cost of simulations with explicit flow solvers. The grids are adapted to an evolving flowfield using simple h-refinement. A grid change is performed every 5 to 10 timesteps, and only one level of refinement/coarsening is allowed per mesh change.

Loehner, Rainald↗
NASA NTRS1988

Adaptive p-version based finite element formulations for thermal modeling/analysis of structural configurations

Adaptive p-version based hierarchical finite element formulations in conjunction with a posteriori error estimation concepts are described with emphasis on applicability for thermal modeling/analysis of structural configurations. The basic concepts and formulations of hierarchical p-versiion finite element for thermal analysis are first described. A posteriori error estimation features are utililzed to steer the process of adaptive refinement. Several configurations comprised of one-dimensional structures are evaluated to validate the applicability of the proposed formulations and to demonstrate the potential of the p-version adaptive formulations for thermal modeling/analysis. The methodology offers potential and promises to be an attractive alternative to conventional finite element thermal modeling/analysis approaches.

Tamma, Kumar K.↗
DOE OSTI2022

A comprehensive study of non-adaptive and residual-based adaptive sampling for physics-informed neural networks

Physics-informed neural networks (PINNs) have shown to be effective tools for solving both forward and inverse problems of partial differential equations (PDEs). PINNs embed the PDEs into the loss of the neural network using automatic differentiation, and this PDE loss is evaluated at a set of scattered spatio-temporal points (called residual points). The location and distribution of these residual points are highly important to the performance of PINNs. However, in the existing studies on PINNs, only a few simple residual point sampling methods have mainly been used. Here, we present a comprehensive study of two categories of sampling for PINNs: non-adaptive uniform sampling and adaptive nonuniform sampling. We consider six uniform sampling methods, including (1) equispaced uniform grid, (2) uniformly random sampling, (3) Latin hypercube sampling, (4) Halton sequence, (5) Hammersley sequence, and (6) Sobol sequence. We also consider a resampling strategy for uniform sampling. To improve the sampling efficiency and the accuracy of PINNs, we propose two new residual-based adaptive sampling methods: residual-based adaptive distribution (RAD) and residual-based adaptive refinement with distribution (RAR-D), which dynamically improve the distribution of residual points based on the PDE residuals during training. Hence, we have considered a total of 10 different sampling methods, including six non-adaptive uniform sampling, uniform sampling with resampling, two proposed adaptive sampling, and an existing adaptive sampling. We extensively tested the performance of these sampling methods for four forward problems and two inverse problems in many setups. Our numerical results presented in this study are summarized from more than 6000 simulations of PINNs. Here, we show that the proposed adaptive sampling methods of RAD and RAR-D significantly improve the accuracy of PINNs with fewer residual points for both forward and inverse problems. Furthermore, the results obtained in this study can also be used as a practical guideline in choosing sampling methods.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1994

New multigrid approach for three-dimensional unstructured, adaptive grids

A new multigrid method with adaptive unstructured grids is presented. The three-dimensional Euler equations are solved on tetrahedral grids that are adaptively refined or coarsened locally. The multigrid method is employed to propagate the fine grid corrections more rapidly by redistributing the changes-in-time of the solution from the fine grid to the coarser grids to accelerate convergence. A new approach is employed that uses the parent cells of the fine grid cells in an adapted mesh to generate successively coaser levels of multigrid. This obviates the need for the generation of a sequence of independent, nonoverlapping grids as well as the relatively complicated operations that need to be performed to interpolate the solution and the residuals between the independent grids. The solver is an explicit, vertex-based, finite volume scheme that employs edge-based data structures and operations. Spatial discretization is of central-differencing type combined with a special upwind-like smoothing operators. Application cases include adaptive solutions obtained with multigrid acceleration for supersonic and subsonic flow over a bump in a channel, as well as transonic flow around the ONERA M6 wing. Two levels of multigrid resulted in reduction in the number of iterations by a factor of 5.

Parthasarathy, Vijayan↗
DOE OSTI2022

Adaptive Space-Time Methods for Large Scale Optimal Design

When modeling complex physical systems with advanced dynamics, such as shocks and singularities, many classic methods for solving partial differential equations can return inaccurate or unusable results. One way to resolve these complex dynamics is through r-adaptive refinement methods, in which a fixed number of mesh points are shifted to areas of high interest. The mesh refinement map can be found through the solution of the Monge-Ampére equation, a highly nonlinear partial differential equation. Due to its nonlinearity, the numerical solution of the Monge-Ampére equation is nontrivial and has previously required computationally expensive methods. In this report, we detail our novel optimization-based, multigrid-enabled solver for a low-order finite element approximation of the Monge-Ampére equation. This fast and scalable solver makes r-adaptive meshing more readily available for problems related to large-scale optimal design. Beyond mesh adaptivity, our report discusses additional applications where our fast solver for the Monge-Ampére equation could be easily applied.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

MOCMC: Method of Characteristics Moment Closure, a Numerical Method for Covariant Radiation Magnetohydrodynamics

In this work, we present a conservative numerical method for radiation magnetohydrodynamics with frequency-dependent full transport in stationary spacetimes. This method is stable and accurate for both large and small optical depths and radiation pressures. The radiation stress–energy tensor is evolved in flux-conservative form, and closed with a swarm of samples that each transport a multigroup representation of the invariant specific intensity along a null geodesic. In each zone, the enclosed samples are used to efficiently construct a Delaunay triangulation of the unit sphere in the comoving frame, which in turn is used to calculate the Eddington tensor, average source terms, and adaptively refine the sample swarm. Furthermore, radiation four-forces are evaluated in the moment sector in a semi-implicit fashion. The radiative transfer equation is solved in invariant form deterministically for each sample. Since each sample carries a discrete representation of the full spectrum, the cost of evaluating the transport operator is independent of the number of frequency groups, representing a significant reduction of algorithmic complexity for transport in frequency-dependent problems. The major approximation we make in this work is performing scattering in an angle-averaged way. Local adaptivity in samples also makes this scheme more amenable to nonuniform meshes than a traditional Monte Carlo method. We describe the method and present results on a suite of test problems. We find that Method of Characteristics Moment Closure converges at least as ~N -1 , rather than the canonical Monte Carlo N -1/2 , where N is the number of samples per zone.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1994

Thermocapillary motion of deformable drops

The thermocapillary motion of initially spherical drops/bubbles driven by a constant temperature gradient in an unbounded liquid medium is simulated numerically. Effects of convection of momentum and energy, as well as shape deformations, are addressed. The method used is based on interface tracking on a base cartesian grid, and uses a smeared color or indicator function for the determination of the surface topology. Quad-tree adaptive refinement of the cartesian grid is implemented to enhance the fidelity of the surface tracking. It is shown that convection of energy results in a slowing of the drop, as the isotherms get wrapped around the front of the drop. Shape deformation resulting from inertial effects affect the migration velocity. The physical results obtained are in agreement with the existing literature. Furthermore, remarks are made on the sensitivity of the calculated solutions to the smearing of the fluid properties. Analysis and simulations show that the migration velocity depends very strongly on the smearing of the interfacial force whereas it is rather insensitive to the smearing of other properties, hence the adaptive grid.

Haj-Hariri, Hossein↗
DOE OSTI2023

End-to-end GPU acceleration of low-order-refined preconditioning for high-order finite element discretizations

In this article, we present algorithms and implementations for the end-to-end GPU acceleration of matrix-free low-order-refined preconditioning of high-order finite element problems. The methods described here allow for the construction of effective preconditioners for high-order problems with optimal memory usage and computational complexity. The preconditioners are based on the construction of a spectrally equivalent low-order discretization on a refined mesh, which is then amenable to, for example, algebraic multigrid preconditioning. The constants of equivalence are independent of mesh size and polynomial degree. For vector finite element problems in H(curl) and H(div) (e.g., for electromagnetic or radiation diffusion problems), a specially constructed interpolation–histopolation basis is used to ensure fast convergence. Detailed performance studies are carried out to analyze the efficiency of the GPU algorithms. The kernel throughput of each of the main algorithmic components is measured, and the strong and weak parallel scalability of the methods is demonstrated. The different relative weighting and significance of the algorithmic components on GPUs and CPUs is discussed. Results on problems involving adaptively refined nonconforming meshes are shown, and the use of the preconditioners on a large-scale magnetic diffusion problem using all spaces of the finite element de Rham complex is illustrated.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1976

Maximum likelihood identifier refinements for F-8C adaptive control

Design refinement is described for baseline F-8C adaptive flight test control laws which consist of simplified quadratic-optimal model-following control structures in the pitch and lateral directional axes. The variable gains of both axes are adjusted adaptively by an explicit on-line maximum likelihood parameter identifier. The identifier, consisting of five parallel computing channels which evaluate the likelihood functions at discrete points in parameter space, operates in pitch only, using pitch rate, normal acceleration, and elevator position measurements.

Stein, G.↗
NASA NTRS2002

Multilevel Error Estimation and Adaptive h-Refinement for Cartesian Meshes with Embedded Boundaries

This paper presents the development of a mesh adaptation module for a multilevel Cartesian solver. While the module allows mesh refinement to be driven by a variety of different refinement parameters, a central feature in its design is the incorporation of a multilevel error estimator based upon direct estimates of the local truncation error using tau-extrapolation. This error indicator exploits the fact that in regions of uniform Cartesian mesh, the spatial operator is exactly the same on the fine and coarse grids, and local truncation error estimates can be constructed by evaluating the residual on the coarse grid of the restricted solution from the fine grid. A new strategy for adaptive h-refinement is also developed to prevent errors in smooth regions of the flow from being masked by shocks and other discontinuous features. For certain classes of error histograms, this strategy is optimal for achieving equidistribution of the refinement parameters on hierarchical meshes, and therefore ensures grid converged solutions will be achieved for appropriately chosen refinement parameters. The robustness and accuracy of the adaptation module is demonstrated using both simple model problems and complex three dimensional examples using meshes with from 10(exp 6), to 10(exp 7) cells.

Aftosmis, M. J.↗
DOE OSTI2026

Efficient Computation of Doppler-Broadened Elastic Scattering Kernel Moments Using Ladder-Operator Formulation

Anefficient routine for computing Legendre moments of the Doppler-broadened elastic scattering kernel, including resonance scattering effects, has been implemented in the ISOXML module of Griffin. Isotropic scattering in the center-of-mass system and the ideal gas model for target motion are assumed. A ladder-operator formulation is introduced to compute all Legendre moments from order 0 to N simultaneously, enabling near-linear scaling of computational cost with respect to the maximum Legendre order. A physics-based strategy for constructing outgoing energy grids has also been developed, in which a tailored base grid is combined with adaptive refinement to maintain accuracy while limiting the number of outgoing energy points. For energies between resonances, a constant cross-section model is employed to further reduce computational cost. In addition, a quantitative criterion is derived to determine isotope-wise cut-off incident energies based on a prescribed up-scattering probability coverage. For 238U, up to incident energies of approximately 75, 230, and 661 eV at 294, 900, and 2500 K (corresponding to a 2% up-scattering probability threshold), computation of P0 kernels requires 1–8 s and computation of P0–P5 kernels requires 0.4–4 min using a single thread, while maintaining 1–3% relative error in up-scattering probability. These results demonstrate that the proposed formulation enables accurate and computationally practical Doppler-broadened kernel generation for online multigroup cross-section production in Griffin.

Doppler-broadening↗
DOE OSTI2025

Magnetic mesh generation and field line reconstruction for scrape-off layer and divertor modeling in stellarators

The design of divertor targets and baffles for optimal heat and particle exhaust from magnetically confined fusion plasmas requires a combination of fast, low-fidelity models (such as EMC3-Lite (Feng 2022 Plasma Phys. Control. Fusion 64 125012)) for scoping studies and high-fidelity ones (such as EMC3-EIRENE (Feng et al 2014 Contrib. Plasma Phys. 54 426–31)) for verification. Both of those approaches benefit from a magnetic flux tube mesh for fast interpolation and mapping of field line segments (Feng et al 2005 Phys. Plasmas 12 052505). A new automated mesh generator for unstructured quadrilateral flux tubes with adaptive refinement is presented and integrated into FLARE (Frerichs 2024 Nucl. Fusion 64 106034). For HSX with an extended first wall, it is found that several layers of flux tubes can span the entire half field period before splitting is required. This is an advantage over the traditional setup of the EMC3-EIRENE mesh where careful construction of several sub- domains is required already for the much tighter present first wall. In particular, there is no longer the need to manually construct a suitable outer boundary for the mesh. The divide and conquer paradigm with unstructured mesh layout offers a powerful alternative for fast head load approximation that is suitable for integration into optimization workflows. Further examples for W7-X and CTH demonstrate the versatile application range.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

A deformation-dependent coupled Lagrangian/semi-Lagrangian meshfree hydromechanical formulation for landslide modeling

Abstract The numerical modelling of natural disasters such as landslides presents several challenges for conventional mesh-based methods such as the finite element method (FEM) due to the presence of numerically challenging phenomena such as severe material deformation and fragmentation. In contrast, meshfree methods such as the reproducing kernel particle method (RKPM) possess unique features conducive to modelling extreme events such as the absence of a structured mesh and the ease of adaptive refinement, among others. While the semi-Lagrangian reproducing kernel (SL-RK) shape functions of RKPM defined in the current configuration have proven to be effective in extreme event modelling, the computational cost for the re-evaluation of the shape functions at every time step is costly. In this work, a deformation-dependent coupling of the Lagrangian reproducing kernel (L-RK) and SL-RK approximations is proposed for the solution of a hydro-mechanical formulation for effective simulations of landslides. The ramp function is constructed based on an equivalent plastic strain as a deformation-dependent transition from L-RK shape functions to SL-RK ones as the deformation progresses. The particular focus of the paper will be on modelling seepage-induced landslides with a mixed $$u$$ u – $$p$$ p formulation to couple the solid and fluid phases. Examples are presented to examine the effectiveness of this coupled Lagrangian/semi-Lagrangian reproducing kernel (L–SL RK) formulation and to highlight its performance in landslide modelling.

Baek, Jonghyuk↗
DOE OSTI2022

NucMesh: nuclear reactor geometry creation and mesh generation module in NEMoSys

NucMesh is a parameterized geometry and mesh generator for nuclear reactors developed within the Nuclear Energy Modeling System NEMoSys at Illinois Rocstar. NEMoSys is a platform developed for mesh generation, adaptive refinement, and solution verification. NucMesh is implemented to be generalized and extensible with a robust computer aided design engine and multiple mesh generation algorithms for unstructured triangular, quad-dominant, and structured quadrilateral meshing. In this paper, we present the geometric and meshing features of NucMesh. Geometrically objects are constructed bottom-to-top and overlaps are addressed automatically. A sophisticated object tracking algorithm prevents data from being lost for segmented objects. We discuss the primitive objects of circle and polygons that constitute the module and show how they are used with example inputs. Arrays of primitives and arrays of arrays are utilized to build large assemblies of objects. The concept of saved objects is discussed to demonstrate how repetitive objects can be reused easily and augmented in place. Three dimensional meshes can be obtained through mesh extrusion where all materials and side sets are extended to three dimensions. We show that side sets can be defined nearly anywhere within the geometry and can then be applied to the mesh. Finally, example reactor meshes are demonstrated for the Idaho National Laboratory Advanced Test Reactor and Los Alamos National Lab Empire reactor, both of which use control drums that NucMesh handles easily. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

A Virtual Element Method for the Full MHD system

In this manuscript we present a novel discretization for the incompressible MHD system. Our approach follows the framework of the Virtual Element Method and offers two main advantages. The method can be implemented in unstructured meshes making it highly versatile and capable of handling a wide array of problems involving interfaces, free-boundaries or adaptive refinements on the mesh. The second advantage involves the divergence of the magnetic field, our approach guarantees that it remains solenoidal. We include a theoretical proof of the condition on the magnetic field as well as energy estimates and a well-posedness study. The latter sheds light as to the stability properties of the method.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗