SEARCH · Search NASA

Results for “Method”

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.

SourceResearch connectionFrom yearThrough year

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

At least 505 records · Page 28

All sources NASA NTRS DOE OSTI

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 OSTI2026

Using Filter Methods to Guide Convergence for ADMM, with Applications to Nonnegative Matrix Factorization Problems

Nonconvex, nonlinear optimization problems arise naturally in parameter fitting and machine learning. While augmented Lagrangian methods have demonstrated robust convergence for classes of these problems, their convergence for block updates has been relatively unexplored outside of the context of the alternating direction method of multipliers (ADMM). ADMM has seen extensive use in these applications, but may exhibit uncertain convergence behavior in many practical nonconvex settings, and struggles with general nonlinear constraints. In contrast, filter methods have proved effective in enforcing convergence for sequential quadratic programming methods and interior point methods with feasibility criteria. We develop an ADMM-filter method for highly nonlinear and nonconvex problems. Here, we show convergence under mild assumptions for several types of coordinate descent schemes, and demonstrate our algorithm on nonnegative matrix factorization and completion problems in imaging and chemical spectrum analysis.

Nonconvex optimization↗

DOE OSTI2025

On High-Order/Low-Order and Micro-Macro Methods for Implicit Time-Stepping of the BGK Model

In this paper, a high-order/low-order (HOLO) method is combined with a micro-macro (MM) decomposition to accelerate iterative solvers in fully implicit time-stepping of the Bhatnagar–Gross–Krook (BGK) equation for gas dynamics. The MM formulation represents a kinetic distribution as the sum of a local Maxwellian and a perturbation. In highly collisional regimes, the perturbation away from initial and boundary layers is small and can be compressed to reduce the overall storage cost of the distribution. The convergence behavior of the MM methods, the usual HOLO method, and the standard source iteration method is analyzed on a linear BGK model. Both the HOLO and MM methods are implemented using a discontinuous Galerkin (DG) discretization in phase space, which naturally preserves the consistency between high- and low-order models required by the HOLO approach. Furthermore, the accuracy and performance of these methods are compared on the Sod shock tube problem and a sudden wall heating boundary layer problem. Overall, the results demonstrate the robustness of the MM and HOLO approaches and illustrate the compression benefits enabled by the MM formulation when the kinetic distribution is near equilibrium.

BGK model↗

DOE OSTI2025

A review of high order strong stability preserving two-derivative explicit, implicit, and IMEX methods

High order strong stability preserving time discretizations ensure the nonlinear non-inner-product strong stability properties of spatial discretizations suited for the stable simulation of hyperbolic PDEs in a wide variety of application areas including fluid dynamics, magnetohydrodynamics, semiconductor devices, electromagnetics, and astrophysics. Over the past decade multiderivative time-stepping have been increasingly used for the time-evolution hyperbolic PDEs, so that the strong stability properties of these methods have become important. In this work we review sufficient conditions for a two-derivative multistage method to preserve the strong stability properties of spatial discretizations in a forward Euler and different conditions on the second derivative. In particular we present the strong stability preserving theory for explicit and implicit two-derivative Runge–Kutta schemes, including a special condition on the second derivative under which these implicit methods may be unconditionally strong stability preserving. This special condition is natural for the stiff component of wide range of plasma physics problems, and can be useful in the context of strong stability preserving implicit-explicit multi-derivative Runge–Kutta schemes, where the time-step restriction is then independent of the stiff term. Lastly, we present the strong stability preserving theory for implicit-explicit multi-derivative general linear methods, and some novel second and third order methods where the time-step restriction is independent of the stiff term.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

A Methodology for the Analysis of Water Oxidation Electrocatalysts in the Absence of Limiting Current that Avoids the Pitfalls of Existing Methods

Water oxidation is an important reaction studied as a way to generate electrons from water, to promote water splitting and the formation of green hydrogen. When using electrodes to drive homogeneous water oxidation catalysis, cyclic voltammograms are analyzed to provide catalytic rate constants. There are two main methods, foot-of-the-wave analysis (FOWA) and limiting current analysis. FOWA relies on approximations inherent to analyzing water oxidation catalysis, such as determining the formal potential of the catalytic intermediate, E 0 cat . Limiting current methods are the optimal way to analyze catalyst performance but rely on observable limiting current, which is virtually never seen in water oxidation. To avoid those issues, a method is proposed for analyzing nonideal cyclic voltammetry waveshapes in water oxidation: by analyzing rate data across a large range of potentials, an optimal potential, E 0 cat , can be obtained, where catalytic current, i cat , is nearly independent of scan rate and has a linear dependency on buffer concentration. Here, the method is applied to four homogeneous water oxidation catalysts with prior extensive electrochemical elucidation, all of which lack an ideal, purely kinetic waveshape in cyclic voltammetry. Application of the method avoids the biases of the other methods cited for the kinetic analyses of water oxidation catalysts.

14 SOLAR ENERGY↗

DOE OSTI2025

Toward engineering lattice structures with the material point method (MPM)

This study examines the potential of two variants of the material point method—the generalized interpolation material point (GIMP) and dual domain material point (DDMP) methods—in developing a robust computational framework for engineering lattice structures under different loading conditions. The study begins with assessing the ability of the two methods in predicting elastic buckling phenomena using column geometries with and without initial geometric imperfections. The results indicate that both methods effectively capture buckling phenomena when initial geometric imperfections are introduced. After this verification step, we create several models of tetrahedral lattice structures with varying strut diameter and orientation and subject them to quasi-static loading. We then validate the numerical results using laboratory test results. The results show that, while both methods accurately predict load–displacement curves in the pre-buckling regime, their predictive capabilities diminish in the post-buckling regime. Through visual comparison between the numerical and experimental deformed shapes, it appears that the discrepancies between model and experimental results are attributed to initial geometric imperfections in the lattices that occurred during 3D printing. We then establish a second set of lattice models where different types of initial geometric imperfections are considered. The results from these models show that imperfections have a negligible influence in the pre-buckling regime but affect the behavior considerably in the post-buckling regime. As a final step in this work, we subject the lattice models to impact loading and employ hypothetical soft and stiff materials. These results show that the lattice stiffness, which depends on material stiffness, strut diameter, and orientation, significantly influences the ability of a lattice structure to resist impact. In particular, we find that a stiffer lattice (i.e., one made with a stiff material and thicker struts) is capable of absorbing more energy than a softer one during impact. Although material nonlinearities, inelasticity, and detailed contact formulations are not considered in this study, the findings obtained herein lay the groundwork for engineering lattice structures under extreme loading conditions through a simulation-driven framework based on particle-based methods.

97 MATHEMATICS AND COMPUTING↗

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 OSTI2026

Enhancing photoionization rate calculations in low-temperature plasmas using spectral methods

Photoionization plays a central role in the development of streamer discharges and other non-equilibrium plasma phenomena. It creates seed electrons, which are essential for positive streamer propagation, allowing the ionization front to move forward. Because of this, accurate modeling of photoionization is very important for predicting streamer behavior and plasma evolution. The photoionization process in air (N 2 – O 2 mixture) is often described by the Zheleznyak model (1982). This model is usually solved through Helmholtz-type equations that approximate the Zheleznyak photoionization model (Zheleznyak et al. 1982) as Partial Differential Equations (PDEs). Conventional numerical methods, such as the Finite Difference Method (FDM) or Finite Volume Method (FVM), are widely used to solve these equations. Although they are prevalent, the computational cost of these methods due to their need for matrix operations and iterative solver is demanding. To address this challenge, this work develops a spectral solver based on the Fast Fourier Transform (FFT) combined with Discrete Cosine Transform (DCT) and Discrete Sine Transform (DST) to calculate the photoionization rate efficiently in an axisymmetric cylindrical domain. This method naturally satisfies the boundary conditions used in the model and converts the PDE into algebraic ones in spectral space. Thus, avoids the need for iterative matrix solvers. When compared with FDM results, it is demonstrated that the new solver not only maintains accuracy, but also reduces the computational cost, showing a performance increase of approximately 100 compared to FDM over a wide range of problem sizes. The method is parallelized using Message Passing Interface (MPI) and has been integrated into a fluid plasma model for streamer simulation. Here, this FFT-based approach provides a fast and reliable alternative for calculating photoionization in fluid models, helping large-scale plasma simulations run faster and efficiently, and allows higher-resolution simulation without extra computational cost.

Axisymmetric system↗

DOE OSTI2026

Negative fluxes and cell-miss errors in the random ray method

The random ray method is a recently developed stochastic method for solving neutral particle transport problems based on the method of characteristics. Perhaps surprisingly for a characteristics-based method using flat sources, we note that the random ray method can produce negative fluxes which may be numerically troublesome in several situations. These occur most severely in fixed source problems where the source is in a region with a small cross section. Additionally, we briefly discuss another source of bias which can occur in similar situations, namely a ray missing a mesh with a strong source and small cross section, resulting in the entirety of the source being unphysically deposited locally. This paper describes the mechanism by which negative fluxes may occur and several different methods to mitigate their effects. These fixes are tested on an eigenvalue problem, a ‘fusion-like’ shielding problem, and a shielding problem featuring an adjoint calculation. Even when extremely coarse random ray quadratures are used such that 20%–30% of cells are missed during a given iteration, use of the preferred fix technique ensures local flux tally errors remain trivial (below 1%). The preferred fix is now the default option in SCONE and OpenMC.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2026

Feasibility Study on Implementing a Staggered-Grid Finite Volume Method for System Analysis Code Development Under the MOOSE Framework

Here, this work summarizes a feasibility study on testing numerical algorithms that are suitable and efficient for advanced system analysis code development under the mutli-physics framework, MOOSE. The key to the test bed is the implementation of high-order one-dimensional staggered-grid finite volume method (SG-FVM), and its direct interaction with the linear/nonlinear solver, PETSc. The test bed utilized a more flexible code structure to enable the finite volume method implementation and direct interacting with the solver package, instead of using the natively supported finite element method by the framework. Using a suite of selected test problems with different problem sizes and levels of complexity, the implemented SG-FVM demonstrated superior performance improvement against a direct finite element method implementation through MOOSE. On two computer systems, the speedup was observed to be significant, with at least one order of magnitude of solving time reduction. For a complex reactor model, transient simulation was performed using the newly developed finite volume method code, the results of which agree very well with the reference results from the finite element method code. Overall, this study demonstrates a successful feasibility study on the proposed numerical algorithms and software structure to support advanced system analysis tool development.

MOOSE↗

NASA NTRS1945

Graphical and analytical methods for the determination of a flow of a compressible fluid around an obstacle

Chaplygin introduced the hodograph method in the theory of compressible fluid flows and developed a method for constructing stream functions of such flows. This method, which has been extensively used in investigation of compressible fluid flows, is limited in certain respects. The expression for the stream function obtained in this manner can represent only certain types of flow patterns. In general, flow patterns obtained in this way cannot represent the whole flow around an obstacle, but only a part of such a flow, and therefore several expressions are needed in order to obtain the whole flow. On the other hand, in many instances it is important to have a single expression representing the whole flow. Recently Von Karman and Tsien constructed more general types of stream functions, but only by replacing the true pressure density relation by the linear pressure-specific volume relation so that their method is essential limited to flows the maximum Mach number of which is not too large. In a companion report the author derived a new formula for stream functions based on the true pressure density relation. It is not subject to the limitations of the Chaplygin method. In the present report this formula is employed to construct two-dimensional subsonic compressible fluid flows around a body similar in shape to a given symmetric obstacle. The methods described in the report are illustrated by numerical examples.

FLOW, COMPRESSIBLE-MEASUREMENT↗

NASA NTRS1994

Coupling equivalent plate and finite element formulations in multiple-method structural analyses

A coupled multiple-method analysis procedure for use late in conceptual design or early in preliminary design of aircraft structures is described. Using this method, aircraft wing structures are represented with equivalent plate models, and structural details such as engine/pylon structure, landing gear, or a 'stick' model of a fuselage are represented with beam finite element models. These two analysis methods are implemented in an integrated multiple-method formulation that involves the assembly and solution of a combined set of linear equations. The corresponding solution vector contains coefficients of the polynomials that describe the deflection of the wing and also the components of translations and rotations at the joints of the beam members. Two alternative approaches for coupling the methods are investigated; one using transition finite elements and the other using Lagrange multipliers. The coupled formulation is applied to the static analysis and vibration analysis of a conceptual design model of a fighter aircraft. The results from the coupled method are compared with corresponding results from an analysis in which the entire model is composed of finite elements.

VIBRATION ANALYSIS↗

NASA NTRS2017

Treatment of Overlapping Gaseous Absorption with the Correlated-k Method in Hot Jupiter and Brown Dwarf Atmosphere Models

The correlated-k method is frequently used to speed up radiation calculations in both one-dimensional and three-dimensional atmosphere models. An inherent difficulty with this method is how to treat overlapping absorption, i.e. absorption by more than one gas in a given spectral region. We have evaluated the applicability of three different methods in hot Jupiter and brown dwarf atmosphere models, all of which have been previously applied within models in the literature: (i) Random overlap, both with and without resorting and rebinning, (ii) equivalent extinction and (iii) pre-mixing of opacities, where (i) and (ii) combine k-coefficients for different gases to obtain k-coefficients for a mixture of gases, while (iii) calculates k-coefficients for a given mixture from the corresponding mixed line-by-line opacities. We find that the random overlap method is the most accurate and flexible of these treatments, and is fast enough to be used in one-dimensional models with resorting and rebinning. In three-dimensional models such as GCMs it is too slow, however, and equivalent extinction can provide a speed-up of at least a factor of three with only a minor loss of accuracy while at the same time retaining the flexibility gained by combining k-coefficients computed for each gas individually. Pre-mixed opacities are significantly less flexible, and we also find that particular care must be taken when using this method in order to to adequately resolve steep variations in composition at important chemical equilibrium boundaries. We use the random overlap method with resorting and rebinning in our one-dimensional atmosphere model and equivalent extinction in our GCM, which allows us to e.g. consistently treat the feedback of non-equilibrium chemistry on the total opacity and therefore the calculated P-T profiles in our models.

atmospheres↗

NASA NTRS2020

Assessing the Impacts of Two Averaging Methods on AIRS Level 3 Monthly Products and Multi-Year Monthly Means

The Atmospheric Infrared Sounder (AIRS) onboard NASA’s Aqua satellite provides more than 16 years of data. Its monthly gridded (Level 3) product has been widely used for climate research and applications. Since counts of successful soundings in a grid cell are used to derive monthly averages, this “Averaged By Observations (ABO)” approach effectively gives equal importance to all participating soundings within a month. It is conceivable, then, that days with more observations due to day-to-day orbit shift and regimes with better retrieval skills, will contribute disproportionately to the monthly average within a cell. Alternatively, the AIRS Level 3 monthly product can be produced through an "Averaged By Days (ABD)” approach, where the monthly mean in a grid cell is a simple average of the daily means. The effects of these averaging methods on the AIRS version 6 monthly product are assessed quantitatively using temperature and water vapor at surface and 500hPa. The ABO method results in a warmer (slightly colder) global mean temperature at surface (500hPa) and a drier global mean water vapor than ABD method. The AIRS multi-year monthly mean temperature and water vapor from both methods are also compared with the Modern-Era Retrospective analysis for Research and Applications – 2 (MERRA-2) product and evaluated with a simulation experiment, indicating the ABD method has less error and is more closely correlated with MERRA-2. In summary, the ABD method is recommended for future versions of the AIRS Level 3 monthly product and more data services supporting Level 3 aggregation are needed.

AIRS↗

NASA NTRSDate not supplied

Edge-Based Viscous Method for Mixed-Element Node-Centered Finite-Volume Solvers

A novel, efficient, edge-based viscous (EBV) discretization method has been recently developed, implemented in a practical, unstructured-grid, node-centered, finite-volume flow solver, and applied to viscous-kernel computations that include evaluations of meanflow viscous fluxes, turbulence-model and chemistry-model diffusion terms, and the corresponding Jacobian contributions. Initially, the EBV method had been implemented for tetrahedral grids and demonstrated multifold acceleration of all viscous-kernel computations. This paper presents an extension of the EBV method for mixed-element grids. In addition to the primal edges of a given mixed-element grid, virtual edges are introduced to connect cell nodes that are not connected by a primal edge. The EBV method uses an efficient loop over all (primal and virtual) edges and features a compact discretization stencil based on the nearest neighbors. This study verifies the EBV method and assesses its efficiency on mixed-element grids by comparing the EBV solution accuracy and iterative convergence with those of well-established solutions obtained using a cell-based viscous (CBV) discretization method. The EBV solver’s memory footprint is optimized and often smaller than the memory footprint of the CBV solver. A multifold speedup is demonstrated for all viscous-kernel computations resulting in significant reduction of the time to solutions for several benchmark mixed-element-grid computations, including simulations of a flow around NASA’s juncture-flow model and a hypersonic, chemically reacting flow around a blunt body.

CFD↗

NASA NTRSDate not supplied

Edge-Based Viscous Method for Mixed-Element Node-Centered Finite-Volume Solvers

Edge-based viscous method↗

DOE OSTI2024

Data‐driven variational method for discrepancy modeling: Dynamics with small‐strain nonlinear elasticity and viscoelasticity

Abstract The effective inclusion of a priori knowledge when embedding known data in physics‐based models of dynamical systems can ensure that the reconstructed model respects physical principles, while simultaneously improving the accuracy of the solution in the previously unseen regions of state space. This paper presents a physics‐constrained data‐driven discrepancy modeling method that variationally embeds known data in the modeling framework. The hierarchical structure of the method yields fine scale variational equations that facilitate the derivation of residuals which are comprised of the first‐principles theory and sensor‐based data from the dynamical system. The embedding of the sensor data via residual terms leads to discrepancy‐informed closure models that yield a method which is driven not only by boundary and initial conditions, but also by measurements that are taken at only a few observation points in the target system. Specifically, the data‐embedding term serves as residual‐based least‐squares loss function, thus retaining variational consistency. Another important relation arises from the interpretation of the stabilization tensor as a kernel function, thereby incorporating a priori knowledge of the problem and adding computational intelligence to the modeling framework. Numerical test cases show that when known data is taken into account, the data driven variational (DDV) method can correctly predict the system response in the presence of several types of discrepancies. Specifically, the damped solution and correct energy time histories are recovered by including known data in the undamped situation. Morlet wavelet analyses reveal that the surrogate problem with embedded data recovers the fundamental frequency band of the target system. The enhanced stability and accuracy of the DDV method is manifested via reconstructed displacement and velocity fields that yield time histories of strain and kinetic energies which match the target systems. The proposed DDV method also serves as a procedure for restoring eigenvalues and eigenvectors of a deficient dynamical system when known data is taken into account, as shown in the numerical test cases presented here.

Masud, Arif↗

DOE OSTI2026

Parallel-in-Time Solution of Allen-Cahn Equations by Integrating Operator Learning into the Parareal Method

While recent advances in deep learning have shown promising efficiency gains in solving time-dependent partial differential equations (PDEs), matching the accuracy of conventional numerical solvers still remains a challenge. One strategy to improve the accuracy of deep learning-based solutions for time-dependent PDEs is to use the learned model as the coarse propagator in the Parareal method and a traditional numerical method as the fine solver. However, successful integration of deep learning into the Parareal method requires consistency between the coarse and fine solvers, particularly for PDEs exhibiting rapid changes such as sharp transitions. Here, to ensure this consistency, we propose using convolutional neural networks (CNNs) to learn the fully discrete time-stepping operator defined by the same numerical scheme employed as the fine solver. We demonstrate the effectiveness of the proposed method in solving the classical and mass-conservative Allen–Cahn (AC) equations. Through iterative updates in the Parareal algorithm, our approach achieves a significant computational speedup compared to traditional fine solvers while converging to high-accuracy solutions. Our results highlight that the proposed hybrid Parareal algorithm effectively accelerates simulations, particularly when implemented on multiple GPUs, and converges to the desired accuracy in only a few iterations. Another advantage of our method is that the CNN model is trained on trajectory-based data generated from random initial conditions, such that the trained model can be used to solve the AC equations with various initial conditions without retraining. This work demonstrates the potential of integrating neural network methods into parallel-in-time frameworks for efficient and accurate simulations of time-dependent PDEs.

97 MATHEMATICS AND COMPUTING↗