Search NASA⌕ Search

SEARCH · Search NASA

Results for “Nonlinear approximation”

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 1,441 records · Page 80

Evaluation of Thermal Evolution Profiles and Estimation of Kinetic Parameters for Pyrolysis of Coal/Corn Stover Blends Using Thermogravimetric Analysis

The thermal evolution profiles and kinetic parameters for the pyrolysis of two Montana coals (DECS-38 subbituminous coal and DECS-25 lignite coal), one biomass sample (corn stover), and their blends (10%, 20%, and 30% by weight of corn stover) have been investigated at a heating rate of 5°C/min in an inert nitrogen atmosphere, using thermogravimetric analysis. The thermal evolution profiles of subbituminous coal and lignite coal display only one major peak over a wide temperature distribution, ~152–814°C and ~175–818°C, respectively, whereas the thermal decomposition profile for corn stover falls in a much narrower band than that of the coals, ~226–608°C. The nonlinearity in the evolution of volatile matter with increasing percentage of corn stover in the blends verifies the possibility of synergistic behavior in the blends with subbituminous coal where deviations from the predicted yield ranging between 2% and 7% were observed whereas very little deviations (1%–3%) from predicted yield were observed in blends with lignite indicating no significant interactions with corn stover. In addition, a single first-order reaction model using the Coats-Redfern approximation was utilized to predict the kinetic parameters of the pyrolysis reaction. The kinetic analysis indicated that each thermal evolution profile may be represented as a single first-order reaction. Three temperature regimes were identified for each of the coals while corn stover and the blends were analyzed using two and four temperature regimes, respectively.

Bhagavatula, Abhijit↗

A Surrogate-based Adaptive Sampling Approach for History Matching and Uncertainty Quantification

A critical procedure in reservoir simulations is history matching (or data assimilation in a broader sense), which calibrates model parameters such that the simulation results are consistent with field measurements, and hence improves the credibility of the predictions given by the simulations. Often there exist non-unique combinations of parameter values that all yield the simulation results matching the measurements. For such ill-posed history matching problems, Bayesian theorem provides a theoretical foundation to represent different solutions and to quantify the uncertainty with the posterior PDF. Lacking an analytical solution in most situations, the posterior PDF may be characterized with a sample of realizations, each representing a possible scenario. A novel sampling algorithm is presented here for the Bayesian solutions to history matching problems. We aim to deal with two commonly encountered issues: 1) as a result of the nonlinear input-output relationship in a reservoir model, the posterior distribution could be in a complex form, such as multimodal, which violates the Gaussian assumption required by most of the commonly used data assimilation approaches; 2) a typical sampling method requires intensive model evaluations and hence may cause unaffordable computational cost. In the developed algorithm, we use a Gaussian mixture model as the proposal distribution in the sampling process, which is simple but also flexible to approximate non-Gaussian distributions and is particularly efficient when the posterior is multimodal. Also, a Gaussian process is utilized as a surrogate model to speed up the sampling process. Furthermore, an iterative scheme of adaptive surrogate refinement and re-sampling ensures sampling accuracy while keeping the computational cost at a minimum level. The developed approach is demonstrated with an illustrative example and shows its capability in handling the above-mentioned issues. Multimodal posterior of the history matching problem is captured and are used to give a reliable production prediction with uncertainty quantification. The new algorithm reveals a great improvement in terms of computational efficiency comparing previously studied approaches for the sample problem.

Li, Weixuan↗

Mean Flow from Phase Averages in the 2D Boussinesq Equations

The atmosphere and ocean are described by highly oscillatory PDEs that challenge both our understanding of their dynamics and their numerical approximation. This paper presents a preliminary numerical study of one type of phase averaging applied to mean flows in the 2D Boussinesq equations that also has application to numerical methods. The phase averaging technique, well-known in dynamical systems theory, relies on a mapping using the exponential operator, and then an averaging over the phase. The exponential operator has connections to the Craya–Herring basis pioneered by Jack Herring to study the fluid dynamics of oscillatory, nonlinear fluid dynamics. In this paper, we perform numerical experiments to study the effect of this averaging technique on the time evolution of the solution. We explore its potential as a definition for mean flows. We also show that, as expected from theory, the phase-averaging method can reduce the magnitude of the time rate of change in the PDEs, making them potentially suitable for time stepping methods.

Wingate, Beth A.↗

Towards robust surrogate models: Benchmarking machine learning approaches to expediting phase field simulations of brittle fracture

Data-driven approaches have the potential to make modeling complex, nonlinear physical phenomena significantly more computationally tractable. For example, computational modeling of fracture is a core challenge where machine learning techniques have the potential to provide a much needed speedup that would enable progress in areas such as multi-scale modeling and uncertainty quantification. Currently, phase field modeling (PFM) of fracture is one such approach that offers a convenient variational formulation to model crack nucleation, branching and propagation. To date, machine learning techniques have shown promise in approximating PFM simulations. While standard fracture benchmarks represent realistic scenarios frequently observed in practice, they typically do not provide sufficiently challenging tests for data-driven methods. Here, to address this gap, we introduce a challenging dataset based on PFM simulations designed to benchmark and advance ML methods for fracture modeling. This dataset includes three energy decomposition methods, two boundary conditions, and 1000 random initial crack configurations for a total of 6000 simulations. Each sample contains 100 time steps capturing the temporal evolution of the crack field. Alongside this dataset, we also implement and evaluate Physics Informed Neural Networks (PINN), Fourier Neural Operators (FNO), and UNet models as baselines, and explore the impact of ensembling strategies on prediction accuracy. With this combination of our dataset and baseline models drawn from the literature we aim to provide a standardized and challenging benchmark for evaluating machine learning approaches to solid mechanics. Our results highlight both the promise and limitations of popular current models, and demonstrate the utility of this dataset as a testbed for advancing machine learning in fracture mechanics research.

Benchmark dataset↗

Validation of a Hybrid Domain Overlapping Coupling Between SAM and CFD Against the TALL-3D Transients

The System Thermal Hydraulics (STH) code SAM has been coupled to the Computational Fluid Dynamics (CFD) code Simcenter STAR-CCM+ utilizing a hybrid domain overlapping method with an explicit coupling in time. The coupling aims to extend the STH code’s applicability to scenarios where local momentum and energy transfers are important yet difficult for STH codes to capture, such as three-dimensional (3D) mixing. The coupling method’s numerical stability was verified in the past against two closed-loop configurations, and it was validated against a double T-junction experiment with 3D scalar mixing. In the present work, the coupling method is validated against the TALL-3D STH/CFD coupling benchmark facility. TALL-3D is a three-legged, liquid-metal facility with a large, pool-type enclosure (test section) that exhibits 3D flow effects to be modeled by a CFD code. The rest of the system exhibits approximately 1D behavior well-predicted by an STH code. First, the present STAR-CCM+ CFD model of the 3D test section is validated against experimental data. Then, the SAM-STARCCM+ coupled model is validated against six different TALL-3D steady states, including SAM standalone model results for comparison. Lastly, the SAM-STARCCM+ coupled model is validated against two TALL-3D transients, one exhibiting flow reversal in the test section and one exhibiting nonlinear, Limit Cycle Oscillations (LCO). For the first transient, the SAM-STARCCM+ coupled model properly predicts an increase in the test section’s inlet temperature during flow reversal, and this is not predicted by the SAM standalone model. Following flow reversal, the SAM-STARCCM+ coupled model better-predicts the initial flow recovery and following oscillations as the system approaches a final natural circulation state. For the second transient, no true final steady state is observed due to LCO. Neither the SAM-STARCCM+ coupled model nor the SAM standalone model can perfectly capture the experiment’s changing oscillation frequency during the transient. However, the SAM-STARCCM+ coupled model does reproduce the oscillatory feedback observed in the system. This is a significant achievement as the SAM-STARCCM+ coupled model only uses an explicit coupling in time, as opposed to a semi-implicit coupling. In comparison, previous STH/CFD coupling efforts of the TALL-3D facility required semi-implicit coupling to obtain similar results.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

On the Choice of a Distributed Basis Set in Calculations of Transition-Dipole Moments in the One-Determinant Approximation

The so-called “asymptotic projection technique” developed in previous papers of the authors is applied to the calculation of electronic transition-dipole moments (TDMs) in the one-determinant approximation between states of the same spin and spatial symmetry. The basic equations of the method and specific features of their application to a TDM calculation are briefly discussed. The attention focusses on the choice of a finite one-particle basis set. For this purpose, two possible algorithms for constructing distributed basis sets are proposed. In the first of them, the construction is based on minimization of the Hartree–Fock energy (E{sub HF}) with respect to nonlinear basis set parameters. In the second case, the parameters are determined by minimizing the functional E = E{sub HF} + E{sub MP2}, which includes the electron correlation through the second order of Møller–Plesset perturbation theory (Е{sub МР2}). On the whole, the results of calculations in both basis sets are in agreement with high-accuracy calculations performed by configuration interaction methods. The basis set adapted for E = E{sub HF} + E{sub MP2} significantly improves the accuracy as compared to the basis set of the first type.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A comprehensive and fair comparison of two neural operators (with practical extensions) based on $\mathrm{FAIR}$ data

Neural operators can learn nonlinear mappings between function spaces and offer a new simulation paradigm for real-time prediction of complex dynamics for realistic diverse applications as well as for system identification in science and engineering. Herein, we investigate the performance of two neural operators, which have shown promising results so far, and we develop new practical extensions that will make them more accurate and robust and importantly more suitable for industrial-complexity applications. The first neural operator, DeepONet, was published in 2019 (Lu et al., 2019), and its original architecture was based on the universal approximation theorem of Chen & Chen (1995). The second one, named Fourier Neural Operator or FNO, was published in 2020, and it is based on parameterizing the integral kernel in the Fourier space. DeepONet is represented by a summation of products of neural networks (NNs), corresponding to the branch NN for the input function and the trunk NN for the output function; both NNs are general architectures, e.g., the branch NN can be replaced with a CNN or a ResNet. According to Kovachki et al. (2021), FNO in its continuous form can be viewed conceptually as a DeepONet with a specific architecture of the branch NN and a trunk NN represented by a trigonometric basis. In order to compare FNO with DeepONet computationally for realistic setups, we develop several extensions of FNO that can deal with complex geometric domains as well as mappings where the input and output function spaces are of different dimensions. We also develop an extended DeepONet with special features that provide inductive bias and accelerate training, and we present a faster implementation of DeepONet with cost comparable to the computational cost of FNO, which is based on the Fast Fourier Transform. Here we consider 16 different benchmarks to demonstrate the relative performance of the two neural operators, including instability wave analysis in hypersonic boundary layers, prediction of the vorticity field of a flapping airfoil, porous media simulations in complex-geometry domains, etc. We follow the guiding principles of FAIR (Findability, Accessibility, Interoperability, and Reusability) for scientific data management and stewardship. The performance of DeepONet and FNO is comparable for relatively simple settings, but for complex geometries the performance of FNO deteriorates greatly. We also compare theoretically the two neural operators and obtain similar error estimates for DeepONet and FNO under the same regularity assumptions.

42 ENGINEERING↗

An Eulerian–Lagrangian Weighted Essentially Nonoscillatory scheme for nonlinear conservation laws

Here, we develop a formally high order Eulerian–Lagrangian Weighted Essentially Nonoscillatory (EL-WENO) finite volume scheme for nonlinear scalar conservation laws that combines ideas of Lagrangian traceline methods with WENO reconstructions. The particles within a grid element are transported in the manner of a standard Eulerian–Lagrangian (or semi-Lagrangian) scheme using a fixed velocity v. A flux correction computation accounts for particles that cross the v-traceline during the time step. If v = 0, the scheme reduces to an almost standard WENO5 scheme. The CFL condition is relaxed when v is chosen to approximate either the characteristic or particle velocity. Excellent numerical results are obtained using relatively long time steps. The v-traceback points can fall arbitrarily within the computational grid, and linear WENO weights may not exist for the point. A general WENO technique is described to reconstruct to any order the integral of a smooth function using averages defined over a general, nonuniform computational grid. Moreover, to high accuracy, local averages can also be reconstructed. By re-averaging the function to a uniform reconstruction grid that includes a point of interest, one can apply a standard WENO reconstruction to obtain a high order point value of the function.

97 MATHEMATICS AND COMPUTING↗

Measured and estimated performance of a fleet of shaded photovoltaic systems with string and module-level inverters

Shade obstructions can significantly impact the performance of photovoltaic (PV) systems. Although there are many models for partially shaded PV arrays, there is a lack of information available regarding their accuracy and uncertainty when compared with actual field performance. This work assesses the recorded performance of 46 residential PV systems, equipped with either string-level or module-level inverters, under a variety of shading conditions. We compare their energy production data to annual PV performance predictions, with a focus on the practical models developed here for National Renewable Energy Laboratory's system advisor model software. This includes assessment of shade extent on each PV system by using traditional onsite surveys and newer 3D obstruction modelling. The electrical impact of shade is modelled by either a nonlinear performance model or assumption of linear impact with shade extent, depending on the inverter type. When applied to the fleet of residential PV systems, performance is predicted with median annual bias errors of 2.5% or less, for systems with up to 20% estimated shading loss. The partial shade models are not found to add appreciable uncertainty to annual predictions of energy production for this fleet of systems but do introduce a monthly root-mean-square error of approximately 4%-9% due to seasonal effects. Here the use of a detailed 3D model results in similar or improved accuracy over site survey methods, indicating that, with proper description of shade obstructions, modelling of partially shaded PV arrays can be done completely remotely, potentially saving time and cost.

14 SOLAR ENERGY↗

Stability of Kuramoto networks subject to large and small fluctuations from heterogeneous and spatially correlated noise

Oscillatory networks subjected to noise are broadly used to model physical and technological systems. Due to their nonlinear coupling, such networks typically have multiple stable and unstable states that a network might visit due to noise. In this article, we focus on the assessment of fluctuations resulting from heterogeneous and spatially correlated noise inputs on Kuramoto model networks. We evaluate the typical, small fluctuations near synchronized states and connect the network variance to the overlap between stable modes of synchronization and the input noise covariance. Going beyond small to large fluctuations, we introduce the indicator mode approximation that projects the dynamics onto a single amplitude dimension. Such an approximation allows for estimating rates of fluctuations to saddle instabilities, resulting in phase slips between connected oscillators. Statistics for both regimes are quantified in terms of effective noise amplitudes that are compared and contrasted for several noise models. In conclusion, bridging the gap between small and large fluctuations, we show that a larger network variance does not necessarily lead to higher rates of large fluctuations.

42 ENGINEERING↗

Generation of 3.3-mJ, 2.45-µm, sub-2-cycle laser pulses via hollow-core fiber pulse compression

We demonstrate nonlinear compression of mid-infrared pulses from a Cr:ZnSe chirped-pulse amplifier using a gas-filled stretched hollow-core fiber followed by bulk-material compression. Starting from 90 fs, 2.45 µm pulses with 5.3 mJ energy, spectral broadening in the gas-filled capillary combined with optimized dispersion management enables compression to 15 fs, less than two optical cycles at 2.45 µm, with 3.3 mJ pulse energy, corresponding to a peak power of approximately 0.12 TW. The simplicity of the approach, based on a single hollow-core fiber stage and bulk dispersion compensation, makes it scalable to higher energies and establishes a robust route to mid-infrared drivers for high harmonic generation and attosecond applications.

Britton, Mathew [SLAC National Accelerator Laborat↗

Multiscale analysis in solids with unseparated scales: fine-scale recovery, error estimation, and coarse-scale adaptivity

There are several engineering applications in which the assumptions of homogenization and scale separation may be violated, in particular, for metallic structures constructed through additive manufacturing. Instead of resorting to direct numerical simulation of the macroscale system with an embedded fine scale, an alternative approach is to use an approximate macroscale constitutive model, but then estimate the model-form error using a posteriori error estimation techniques and subsequently adapt the macroscale model to reduce the error for a given boundary value problem and quantity of interest. Here, we investigate this approach to multiscale analysis in solids with unseparated scales using the example of an additively manufactured metallic structure consisting of a polycrystalline microstructure that is neither periodic nor statistically homogeneous. As a first step to the general nonlinear case, we focus here on linear elasticity in which each grain within the polycrystal is linear elastic but anisotropic.

42 ENGINEERING↗

Nested polynomial trends for the improvement of Gaussian process-based predictors

The role of simulation keeps increasing for the sensitivity analysis and the uncertainty quantification of complex systems. Such numerical procedures are generally based on the processing of a huge amount of code evaluations. When the computational cost associated with one particular evaluation of the code is high, such direct approaches based on the computer code only, are not affordable. Surrogate models have therefore to be introduced to interpolate the information given by a fixed set of code evaluations to the whole input space. When confronted to deterministic mappings, the Gaussian process regression (GPR), or kriging, presents a good compromise between complexity, efficiency and error control. Such a method considers the quantity of interest of the system as a particular realization of a Gaussian stochastic process, whose mean and covariance functions have to be identified from the available code evaluations. In this context, this work proposes an innovative parametrization of this mean function, which is based on the composition of two polynomials. This approach is particularly relevant for the approximation of strongly non linear quantities of interest from very little information. After presenting the theoretical basis of this method, this work compares its efficiency to alternative approaches on a series of examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Image charge interaction correction in charged-defect calculations

Charged-defect calculation using a periodic supercell is a significant class of problems in solid state physics. However, the finite supercell size induces an undesirable long-range image charge Coulomb interaction. Although a variety of methods have been proposed to eliminate such image Coulomb interaction, most of the previous schemes are based on a rough approximation of the defect charge screening. In this work, we present a rigorous derivation of the image charge interaction with a defect screening model where the use of a bulk macroscopic dielectric constant can be avoided. Here, we have verified this approach in comparison with a widely used approach for 12 different defects. Our correction scheme offers a much faster convergence concerning the supercell size for cases with considerable image charge interactions. In those cases, we also found that the nonlinear dielectric screening might play an important role. Our proposed defect screening model will also shed new light on understanding the defect screening properties and can be applied to other defect systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Optimization Methods for Large-Scale Machine Learning

Here this paper provides a review and commentary on the past, present, and future of numerical optimization algorithms in the context of machine learning applications. Through case studies on text classification and the training of deep neural networks, we discuss how optimization problems arise in machine learning and what makes them challenging. A major theme of our study is that large-scale machine learning represents a distinctive setting in which the stochastic gradient (SG) method has traditionally played a central role while conventional gradient-based nonlinear optimization techniques typically falter. Based on this viewpoint, we present a comprehensive theory of a straightforward, yet versatile SG algorithm, discuss its practical behavior, and highlight opportunities for designing algorithms with improved performance. This leads to a discussion about the next generation of optimization methods for large-scale machine learning, including an investigation of two main streams of research on techniques that diminish noise in the stochastic directions and methods that make use of second-order derivative approximations.

97 MATHEMATICS AND COMPUTING↗

Higher-order LaSDI: Reduced order modeling with multiple time derivatives

Solving complex partial differential equations (PDEs) is essential across scientific disciplines but often requires numerical models that can be prohibitively expensive in time-sensitive applications. Reduced-order models (ROMs) address this challenge by exploiting low-dimensional structure to create fast approximations. The Latent Space Dynamics Identification (LaSDI) framework has demonstrated success in learning ROMs for parameterized PDE families, but remains limited to first-order systems. Here, in this paper, we propose Higher-Order LaSDI (HLaSDI), which extends the LaSDI framework to PDEs with arbitrary order of time derivatives. This generalization significantly expands the applicability of LaSDI-based methods to systems previously outside their scope, including hyperbolic PDEs. We demonstrate HLaSDI’s accuracy and efficiency on several linear and nonlinear benchmark problems.

97 MATHEMATICS AND COMPUTING↗

Integration of graphical approaches into optimization-based design of multistage liquid extraction

We propose two optimization models for designing two liquid extraction systems: simple multistage liquid extractors and extractors with extract reflux. Both models are motivated by the concepts of the modified McCabe-Thiele graphical method for multistage extractor design. The operating and equilibrium curves in the McCabe-Thiele method are represented by material balances and piece-wise linearized thermodynamics properties. The use of piece-wise approximations improves computational tractability of both optimization models. In addition, we consider some extensions such as dilute systems, insoluble solvents, and non-ideal stages. In conclusion, the applicability of the proposed models is demonstrated with four illustrative examples.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Algorithms in Diffraction Profile Analysis

This chapter introduces several approaches to crystallographic structure refinement from diffraction profile data including the Rietveld method, global optimization methods, and Bayesian modeling. First, the Rietveld method and related nonlinear least squares approaches to analyzing diffraction profiles are briefly discussed. We then review the most common algorithms within global optimization as alternative methods of structure solution: grid search, simulated annealing, and genetic algorithms. As the Rietveld method is the standard tool for analyzing diffraction profile data, we catalogue its challenges and limitations. A Bayesian approach to diffraction profile analysis is presented as an alternative, along with several sampling algorithms including Gibbs sampling, variants of Metropolis sampling, Hamiltonian Monte Carlo, and approximate Bayesian computing. These sampling algorithms are applied to the fitting of a neutron diffraction profile from a National Institute of Standards and Technology silicon standard reference material, and their results are compared.

Singh, Susheela↗