Search NASA⌕ Search

SEARCH · Search NASA

Results for “finite element problems”

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 901 records · Page 50
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Efforts to stabilize composite localization elements

Localization finite elements seek to provide a robust framework for modeling ductile failure. They utilize the same constitutive model as the bulk material through the introduction of a length scale in a specialized deformation gradient that regularizes displacement discontinuity. Similar to many other elements, localization elements exhibit locking and associated pressure oscillations under incompressible plastic flow, which is a critical issue when attempting to model pressure-driven damage evolution. These issues can be drastically improved through what are essentially reduced integration techniques for the Jacobian and pressure, but there seem to be pressure-related instabilities that persist and are specific to localization elements. This memo summarizes recent efforts to mitigate and understand this problem, mostly for the 12-node composite wedge localization element in particular. At this point, it remains unclear whether the pressure fields within any localization element can be sufficiently stabilized in order to properly model failures that include softening or fracture.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Improvements to the Modeling of the TREAT Reactor and Experiments

This paper summarizes the latest improvements and lessons learned from the modeling and simulation of the transient test reactor at Idaho National Laboratory using the MAM- MOTH reactor physics application. MAMMOTH is a MOOSE-based, Finite Element Method application that specializes in the analysis of the spatial dynamics behavior of nuclear reactors. Since early 2018 several transient tests have been conducted at TREAT, thus providing the opportunity to apply and benchmark modern modeling and simulation tools. MAMMOTH was used to provide predictions of the power coupling factor between the core and the experiment for various experiments. Even though the power coupling factor predictions agree very well with the experimental data, within the bounds of the experimental uncertainty, one shortcoming was the underprediction of the total energy deposited in the core and in the experiment. Determination of the sources for this discrepancy are ongoing, but several key problems have been identified and resolved, thus providing valuable insights for future research. This paper discusses several of these lessons learned. First, the heat capacity data for the TREAT fuel has some significant problems due to limitations of the measurement techniques used circa 1960s. The sensitivity of the peak power and the total energy deposition to various representations of the heat capacity is approximately 5%. Second, the effects of the biological shield and thermal column on the modeling of the core are non-negligible, since they affect the mean generation time and the effective reflection of neutrons back into the core, which is suspected to be important during the core heat up. Matching the reactor period resolves the fact that the reduced spatial domain used in the MAMMOTH model underpredicts the mean generation time. The neutron reflection from these regions is marginally improved with the use of an albedo boundary condition. Third, modeling of the control rod movement with a multi-scheme method is introduced and its current limitations are exposed. Fourth, we explore the effects of using a homogenized model with Superhomogenization equivalence and how that differs from fully heterogeneous simulations. Finally, the energy condensation effects for this graphite core are significant. Solutions with 10 and 26 energy groups show the benefits of using a finer coarse group structure.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2016

The NonConforming Virtual Element Method for the Stokes Equations

In this paper, we present the nonconforming virtual element method (VEM) for the numerical approximation of velocity and pressure in the steady Stokes problem. The pressure is approximated using discontinuous piecewise polynomials, while each component of the velocity is approximated using the nonconforming virtual element space. On each mesh element the local virtual space contains the space of polynomials of up to a given degree, plus suitable nonpolynomial functions. The virtual element functions are implicitly defined as the solution of local Poisson problems with polynomial Neumann boundary conditions. As typical in VEM approaches, the explicit evaluation of the non-polynomial functions is not required. This approach makes it possible to construct nonconforming (virtual) spaces for any polynomial degree regardless of the parity, for two- and three-dimensional problems, and for meshes with very general polygonal and polyhedral elements. We show that the nonconforming VEM is inf-sup stable and establish optimal a priori error estimates for the velocity and pressure approximations. Finally, numerical examples confirm the convergence analysis and the effectiveness of the method in providing high-order accurate approximations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Modal characteristics of structures considering dynamic soil-structure interaction effects

The modal characteristics of structures are usually computed disregarding any interaction with the soil. Here, a finite element-perfectly matched layers model is presented to compute the modal characteristics of 2D and 3D coupled soil-structure systems while taking fully into account dynamic soil-structure interaction. The methodology can facilitate the interpretation of experimentally identified modal characteristics by assessing the importance of dynamic soil-structure interaction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

MolSym : A Python package for handling symmetry in molecular quantum chemistry

A consideration of the point group symmetry of molecules is often advantageous from a computational efficiency standpoint and sometimes necessary for the correct treatment of chemical physics problems. Many modern electronic structure software packages include a treatment of symmetry, but these are sometimes incomplete or unusable outside of that program’s environment. Therefore, we have developed the MolSym package for handling molecular symmetry and its associated functionalities to provide a platform for including symmetry in the implementation and development of other methods. Features include point group detection, molecule symmetrization, arbitrary generation of symmetry element sets and character tables, and symmetry adapted linear combinations of real spherical harmonic basis functions, Cartesian displacement coordinates, and internal coordinates. We present some of the advantages of using molecular symmetry as achieved by MolSym, particularly with respect to Hartree–Fock theory, and the reduction of finite difference displacements in gradient/Hessian computations. Furthermore, this package is designed to be easily integrated into other software development efforts and may be extended to further symmetry applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

High Performance Computing Tools to Advance Materials Joining Technology

In this project, an in-house HPC finite element code was developed with novel computational schemes that provided fast and high-fidelity simulation capability for welding processes and allied manufacturing processes such as metal additive manufacturing processes. Benchmark comparison confirmed that, for the testing cases studied, the newly developed in-house code resulted in increases in computational speed in the ranges of 100x to 1000x depending on the size and complexity of the testing cases, when compared to today’s commercial welding process simulation tools. As demonstrated by the selected examples in this report, the breakthrough increases in computational simulation speeds achieved by the in-house HPC code means that high fidelity simulations of certain complex welding problems that would require months even years of computational time with today’s commercial code could be solved in two to three days. Similar order of magnitudes of reduction in computational times for metal additive manufacturing process were also achieved.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Performance Improvement of the Linear System Solver for CMFD Acceleration in PROTEUS-MOC

The PROTEUS code developed under the DOE NEAMS program is a high-fidelity capable whole core transports solver based on unstructured finite element meshes [1]. PROTEUS includes three distinct transport solvers: SN, MOC and NODAL. Among them, the PROTEUS-MOC is the 3D method of characteristics (MOC) solver for extruded geometries. In order to accelerate the convergence of 3D MOC calculation, the CMFD acceleration method was implemented in PROTEUS-MOC [2]. For solving the CMFD linear system, the unpreconditioned GMRES algorithm was used in the previous work [3, 4] for implementing the CMFD scheme because of low computation cost of coarse mesh calculations. In the performance tests, we found that the overhead of the CMFD acceleration became non-negligible as the condition number of the CMFD linear system and the size of problem increase. This indicated that the CMFD overhead should be reduced in the preconditioning technique in order to improve the computational performance. In this work, the performance of CMFD acceleration was notably improved by developing and implementing the new formulation of CMFD linear system and preconditioning technique.

Jung, Yeon Sang↗
DOE OSTI2024

An Efficient Numerical Algorithm for Solving Coupled Time-Dependent Ginzburg-Landau Equation for Superconductivity and Elasticity

A decoupled finite element algorithm is developed for simulating the vortex dynamics on an elastic superconductor which couples the time-dependent Ginzburg- Landau equation with the complex-valued superconducting order parameter and the vector-valued magnetic potential, and the elasticity equation. We present an iterative algorithm for the decoupled system arising from the time and spatial discretization using a combination of preconditioner, algebraic multigrid method (AMG) and preconditioned conjugate gradient method (PCG). The iterative algorithm allows us to perform large-scale three-dimensional simulations of mesoscale pattern formation during superconducting phase transitions with arbitrary elastic boundary conditions. Here, the performance and efficiency of the algorithm are numerically verified by several benchmark problems, exhibiting up to two orders of magnitude improvement depending on the scale of discrete system compared to the exact solver.

Efficiency↗
DOE OSTI2020

A non-orthogonal variational quantum eigensolver

Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H4 and the π-system of hexatriene (C6H8).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Least-Squares PN Formulation of the Transport Equation Using Self-Adjoint-Angular-Flux Consistent Boundary Conditions.

In this paper, we study the Least-Squares (LS) PN form of the transport equation compatible with voids in the context of Continuous Finite Element Methods (CFEM).We first deriveweakly imposed boundary conditions which make the LS weak formulation equivalent to the Self-Adjoint Angular Flux (SAAF) variational formulation with a void treatment, in the particular case of constant cross-sections and a uniform mesh. We then implement this method in Rattlesnake with the Multiphysics Object Oriented Simulation Environment (MOOSE) framework using a spherical harmonics (PN) expansion to discretize in angle. We test our implementation using the Method of Manufactured Solutions (MMS) and find the expected convergence behavior both in angle and space. Lastly, we investigate the impact of the global non-conservation of LS by comparing the method with SAAF on a heterogeneous test problem.

Least-Squares↗
DOE OSTI2022

Simulating Atmospheric Boundary Layer Turbulence with Nek5000/RS

We present large-eddy-simulation (LES) modeling approaches for the simulation of atmospheric boundary layer turbulence that are of direct relevance to wind energy production. In this report, we study a GABLS benchmark problem using high-order spectral element code Nek5000/RS, which is supported under the DOE’s Exascale Computing Project (ECP) Center for Efficient Exascale Discretizations (CEED) project, targeting application simulations on various acceleration-device based exascale computing platforms [1, 2]. We demonstrate our newly developed subgrid-scale (SGS) models based on high-pass filter (HPF), mean-field eddy viscosity (MFEV), and Smagorinsky (SMG) with no-slip and traction boundary conditions, provided with low-order statistics, convergence and turbulent structure analysis. The model fidelity and scaling performance of Nek5000/RS on DOE’s leadership computing platforms in comparison to those of AMR-Wind, a block-structured second-order finite-volume code with adaptive-mesh-refinement capabilities, are discussed in [3].

17 WIND ENERGY↗
DOE OSTI2024

Review of recent activities with MOOSE, an open-source finite element & finite volume multi-fidelity simulation framework

Modeling and simulation are an increasing part of engineering. This is undoubtedly driven by the high costs of constructing experimental facilities, but also enabled by the exponential increase in computing powers over the last decades, which allows computational models to be closer than ever to reality. One of the main drivers for the development of MOOSE is supporting advanced nuclear reactor simulations. A challenging aspect of modeling advanced nuclear reactors is the plurality of physics involved, including neutronics, thermal hydraulics and fuel performance. These physics are all coupled to some extent and are generally solved in a sequential but iterative fashion. The United States (U.S.) national laboratories have been developing MOOSE, an open source multiphysics framework since its inception at the Idaho National Laboratory (INL) in 2008. This framework enables seamless coupling of multiphysics simulations and facilitates the implementation of new physics and material governing laws. It is continuously expanded with novel numerical methods and new pre-implemented physics module. Numerous applications, developed within the Department of Energy (DOE) laboratories, academia, and industry, including outside of nuclear engineering, have been developed to study specialized physics problems. International collaborations are welcome on this open-source modeling and simulation project.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

Improvements to a class of hybrid methods for radiation transport: Nyström reconstruction and defect correction methods

In this study, two modifications are introduced for improving the accuracy, versatility, and robustness of a class of hybrid methods for radiation transport. In general, such methods are constructed by splitting the radiative flux into collided and uncollided components to which low- and high-resolution angular approximations are applied, respectively. In this work we focus on discrete ordinates discretizations of high and low order. The first modification we introduce changes the way in which the collided component is mapped into the uncollided component at the end of each time step in a simulation. The new mapping is a Nyström-type reconstruction that is applicable to arbitrary discrete ordinates quadratures, is guaranteed to preserve positivity of the solution provided that all ordinate weights are positive, is significantly more accurate than previous methods, and can be readily extended to other discretizations such as moment methods, finite element methods, and diffusion approximations. The second modification leverages integral deferred correction (IDC) to iteratively correct for the splitting error introduced by the inconsistency in angular discretization between the collided and uncollided components, in addition to improving the accuracy of the low-order temporal error that is treated by traditional IDC methods. Numerical tests in one- and two-dimensional geometries are used to demonstrate the increased accuracy and efficiency of the proposed modifications. It is found that the two techniques combined yield methods with solution accuracy and memory requirements comparable to that of monolithic discrete ordinates methods while reducing runtime by as much as a factor of between two and ten, depending on the problem.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2016

Least-Squares PN Formulation of the Transport Equation Using Self-Adjoint-Angular-Flux Consistent Boundary Conditions

In this paper, we study the Least-Squares (LS) PN form of the transport equation compatible with voids [1] in the context of Continuous Finite Element Methods (CFEM).We first deriveweakly imposed boundary conditions which make the LS weak formulation equivalent to the Self-Adjoint Angular Flux (SAAF) variational formulation with a void treatment [2], in the particular case of constant cross-sections and a uniform mesh. We then implement this method in Rattlesnake with the Multiphysics Object Oriented Simulation Environment (MOOSE) framework [3] using a spherical harmonics (PN) expansion to discretize in angle. We test our implementation using the Method of Manufactured Solutions (MMS) and find the expected convergence behavior both in angle and space. Lastly, we investigate the impact of the global non-conservation of LS by comparing the method with SAAF on a heterogeneous test problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Polynomial range estimation as a troubled-cell indicator for high-order methods

Two troubled-cell indicators based on polynomial range estimation methods are used to flag cells that may violate positivity constraints. One method uses interval extension, and the second uses the range enclosure property of the Bernstein polynomial basis. Furthermore, both methods reduce compute time for the positivity preserver by limiting its application to a subset of cells. The Bernstein polynomial method remains effective as the problem dimensionality increases. Interval extension applied to the internal energy equation permits the use of the troubled-cell indicators for rational functions, though performance suffers compared to directly applying the indicators to polynomial functions.

42 ENGINEERING↗
DOE OSTI2025

A Performance Portable, Fully Implicit Landau Collision Operator with Batched Linear Solvers

Modern accelerators use hierarchical parallel programming models that enable massive multithreading within a processing element (PE), with multiple PEs per device driven by traditional processes. Batching is a technique for exposing PE-level parallelism in algorithms that have traditionally run on MPI processes or multiple threads within a single process. Opportunities for batching arise in, for example, kinetic discretizations of magnetized plasmas where collisions are advanced in velocity space at each spatial point independently. This paper builds on previous work on a high-performance, fully nonlinear, Landau collision operator by batching the linear solver, as well as batching the spatial point problems and adding new support for multiple grids for multiscale, multispecies problems. An anisotropic relaxation verification test that agrees well with previously published results and analytical models is presented. The performance results from NVIDIA A100 and AMD MI250X nodes are presented with hardware utilization analysis for each architecture. Finally, the entire implicit Landau operator time advance is implemented in Kokkos for performance portability, running entirely on the device and is available in the PETSc numerical library.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Specular reflection treatment for the 3D radiative transfer equation solved with the discrete ordinates method

The contribution of this paper relies in the development of numerical algorithms for the mathematical treatment of specular reflection on borders when dealing with the numerical solution of radiative transfer problems. The radiative transfer equation being integro-differential, the discrete ordinates method allows to write down a set of semi-discrete equations in which weights are to be calculated. The calculation of these weights is well known to be based on either a quadrature or on angular discretization, making the use of such method straightforward for the state equation. Also, the diffuse contribution of reflection on borders is usually well taken into account. However, the calculation of accurate partition ratio coefficients is much more tricky for the specular condition applied on arbitrary geometrical borders. This paper presents algorithms that calculate analytically partition ratio coefficients needed in numerical treatments. The developed algorithms, combined with a decentered finite element scheme, are validated with the help of comparisons with analytical solutions before being applied on complex geometries.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Reduced basis approximations of parameterized dynamical partial differential equations via neural networks

Projection-based reduced order models are effective at approximating parameter-dependent differential equations that are parametrically separable. When parametric separability is not satisfied, which occurs in both linear and nonlinear problems, projection-based methods fail to adequately reduce the computational complexity. Devising alternative reduced order models is crucial for obtaining efficient and accurate approximations to expensive high-fidelity models. In this work, we develop a timestepping procedure for dynamical parameter-dependent problems, in which a neural-network is trained to propagate the coefficients of a reduced basis expansion. This results in an online stage with a computational cost independent of the size of the underlying problem. Here, we demonstrate our method on several parabolic partial differential equations, including a problem that is not parametrically separable.

97 MATHEMATICS AND COMPUTING↗