Search NASA⌕ Search

SEARCH · Search NASA

Results for “standard problem”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1981

Remarks on nonstandard least-squares problems

It is shown that after treating a least-squares problem in the standard fashion, the imposition of stochastic restrictions on certain parameters can be accomplished essentially by inverting a matrix of an order no larger than the total number of restricted parameters, and that generally there is an explicit term for correcting the unrestricted to the restricted solution. In addition, any known type of nonstandard least-squares adjustment problem can be reduced to an equivalent standard linear problem, that is, one in which there is exactly one observation per condition equation and in which the observations are not correlated.

Eichhorn, H.↗
DOE OSTI2020

NSFnets (Navier-Stokes flow nets): Physics-informed neural networks for the incompressible Navier-Stokes equations

In the last 50 years there has been a tremendous progress in solving numerically the Navier-Stokes equations using finite differences, finite elements, spectral, and even meshless methods. Yet, in many real cases, we still cannot incorporate seamlessly (multi-fidelity) data into existing algorithms, and for industrial-complexity applications the mesh generation is time consuming and still an art. Moreover, solving ill-posed problems (e.g., lacking boundary conditions) or inverse problems is often prohibitively expensive and requires different formulations and new computer codes. Here, we employ physics-informed neural networks (PINNs), encoding the governing equations directly into the deep neural network via automatic differentiation, to overcome some of the aforementioned limitations for simulating incompressible laminar and turbulent flows. We develop the Navier-Stokes flow nets (NSFnets) by considering two different mathematical formulations of the Navier-Stokes equations: the velocity-pressure (VP) formulation and the vorticity-velocity (VV) formulation. Since this is a new approach, we first select some standard benchmark problems to assess the accuracy, convergence rate, computational cost and flexibility of NSFnets; analytical solutions and direct numerical simulation (DNS) databases provide proper initial and boundary conditions for the NSFnet simulations. The spatial and temporal coordinates are the inputs of the NSFnets, while the instantaneous velocity and pressure fields are the outputs for the VP-NSFnet, and the instantaneous velocity and vorticity fields are the outputs for the VV-NSFnet. This is unsupervised learning and, hence, no labeled data are required beyond boundary and initial conditions and the fluid properties. The residuals of the VP or VV governing equations, together with the initial and boundary conditions, are embedded into the loss function of the NSFnets. No data is provided for the pressure to the VP-NSFnet, which is a hidden state and is obtained via the incompressibility constraint without extra computational cost. Unlike the traditional numerical methods, NSFnets inherit the properties of neural networks (NNs), hence the total error is composed of the approximation, the optimization, and the generalization errors. Here, we empirically attempt to quantify these errors by varying the sampling (“residual”) points, the iterative solvers, and the size of the NN architecture. For the laminar flow solutions, we show that both the VP and the VV formulations are comparable in accuracy but their best performance corresponds to different NN architectures. The initial convergence rate is fast but the error eventually saturates to a plateau due to the dominance of the optimization error. For the turbulent channel flow, we show that NSFnets can sustain turbulence at , but due to expensive training we only consider part of the channel domain and enforce velocity boundary conditions on the subdomain boundaries provided by the DNS data base. We also perform a systematic study on the weights used in the loss function for balancing the data and physics components, and investigate a new way of computing the weights dynamically to accelerate training and enhance accuracy. In the last part, we demonstrate how NSFnets should be used in practice, namely for ill-posed problems with incomplete or noisy boundary conditions as well as for inverse problems. We obtain reasonably accurate solutions for such cases as well without the need to change the NSFnets and at the same computational cost as in the forward well-posed problems. As a result, we also present a simple example of transfer learning that will aid in accelerating the training of NSFnets for different parameter settings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Galerkin v. least-squares Petrov–Galerkin projection in nonlinear model reduction

Least-squares Petrov–Galerkin (LSPG) model-reduction techniques such as the Gauss–Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible flow problems where standard Galerkin techniques have failed. Furthermore, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform optimal projection associated with residual minimization at the time-continuous level, while LSPG techniques do so at the time-discrete level. This work provides a detailed theoretical and computational comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge–Kutta schemes. We present a number of new findings, including conditions under which the LSPG ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and computationally that decreasing the time step does not necessarily decrease the error for the LSPG ROM; instead, the time step should be ‘matched’ to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible-flow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the LSPG reduced-order model by an order of magnitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Galerkin v. discrete-optimal projection in nonlinear model reduction

Discrete-optimal model-reduction techniques such as the Gauss{Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible ow problems where standard Galerkin techniques have failed. However, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform projection at the time-continuous level, while discrete-optimal techniques do so at the time-discrete level. This work provides a detailed theoretical and experimental comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge{Kutta schemes. We present a number of new ndings, including conditions under which the discrete-optimal ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and experimentally that decreasing the time step does not necessarily decrease the error for the discrete-optimal ROM; instead, the time step should be `matched' to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible- ow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the discrete-optimal reduced-order model by an order of magnitude.

CFD↗
DOE OSTI2015

Accelerating Asymptotically Exact MCMC for Computationally Intensive Models via Local Approximations

We construct a new framework for accelerating Markov chain Monte Carlo in posterior sampling problems where standard methods are limited by the computational cost of the likelihood, or of numerical models embedded therein. Our approach introduces local approximations of these models into the Metropolis–Hastings kernel, borrowing ideas from deterministic approximation theory, optimization, and experimental design. Previous efforts at integrating approximate models into inference typically sacrifice either the sampler’s exactness or efficiency; our work seeks to address these limitations by exploiting useful convergence characteristics of local approximations. We prove the ergodicity of our approximate Markov chain, showing that it samples asymptotically from the exact posterior distribution of interest. We describe variations of the algorithm that employ either local polynomial approximations or local Gaussian process regressors. Our theoretical results reinforce the key observation underlying this article: when the likelihood has some local regularity, the number of model evaluations per Markov chain Monte Carlo (MCMC) step can be greatly reduced without biasing the Monte Carlo average. Numerical experiments demonstrate multiple order-of-magnitude reductions in the number of forward model evaluations used in representative ordinary differential equation (ODE) and partial differential equation (PDE) inference problems, with both synthetic and real data. Supplementary materials for this article are available online.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Chapter 10.3: Reliability and Durability of PV Modules

Each year the world invests tens of billions of dollars or euros in PV systems with the expectation that these systems will last approximately 25 years. Although the disciplines of reliability, quality, and service life prediction have been well established for numerous products, a full understanding of these is currently challenging for PV modules because the desired service lifetimes are decades, preventing direct verification of lifetime predictions. A number of excellent reviews can be found in the literature summarizing the types of failures that are commonly observed for PV modules. This chapter discusses key failure/degradation mechanisms selected to highlight how the kinetics of failure rates can and cannot be confidently predicted. For EVA-encapsulated modules, corrosion is observed to follow delamination, which then allows water droplets to directly contact the metallization. Extended test protocols such as Qualification Plus were created to address the known problems while standards groups update standard tests through the consensus process.

14 SOLAR ENERGY↗
DOE OSTI2019

A Semi-Lagrangian Spectral Method for the Vlasov–Poisson System Based on Fourier, Legendre and Hermite Polynomials

In this study, we apply a semi-Lagrangian spectral method for the Vlasov–Poisson system, previously designed for periodic Fourier discretizations, by implementing Legendre polynomials and Hermite functions in the approximation of the distribution function with respect to the velocity variable. We discuss second-order accurate-in-time schemes, obtained by coupling spectral techniques in the space–velocity domain with a BDF time-stepping scheme. The resulting method possesses good conservation properties, which have been assessed by a series of numerical tests conducted on some standard benchmark problems including the two-stream instability and the Landau damping test cases. In the Hermite case, we also investigate the numerical behavior in dependence of a scaling parameter in the Gaussian weight. Confirming previous results from the literature, our experiments for different representative values of this parameter, indicate that a proper choice may significantly impact on accuracy, thus suggesting that suitable strategies should be developed to automatically update the parameter during the time-advancing procedure.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Shape invariant potentials in higher dimensions

In this paper we investigate the shape invariance property of a potential in one dimension. We show that a simple ansatz allows us to reconstruct all the known shape invariant potentials in one dimension. This ansatz can be easily extended to arrive at a large class of new shape invariant potentials in arbitrary dimensions. A reformulation of the shape invariance property and possible generalizations are proposed. These may lead to an important extension of the shape invariance property to Hamiltonians that are related to standard potential problems via space time transformations, which are found useful in path integral formulation of quantum mechanics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Separable physics-informed DeepONet: Breaking the curse of dimensionality in physics-informed machine learning

The deep operator network (DeepONet) has shown remarkable potential in solving partial differential equations (PDEs) by mapping between infinite-dimensional function spaces using labeled datasets. However, in scenarios lacking labeled data, the physics-informed DeepONet (PI-DeepONet) approach, which utilizes the residual loss of the governing PDE to optimize the network parameters, faces significant computational challenges, particularly due to the curse of dimensionality. This limitation has hindered its application to high-dimensional problems, making even standard 3D spatial with 1D temporal problems computationally prohibitive. Additionally, the computational requirement increases exponentially with the discretization density of the domain. Here, to address these challenges and enhance scalability for high-dimensional PDEs, we introduce the Separable physics-informed DeepONet (Sep-PI-DeepONet). This framework employs a factorization technique, utilizing sub-networks for individual one-dimensional coordinates, thereby reducing the number of forward passes and the size of the Jacobian matrix required for gradient computations. By incorporating forward-mode automatic differentiation (AD), we further optimize computational efficiency, achieving linear scaling of computational cost with discretization density and dimensionality, making our approach highly suitable for high-dimensional PDEs. We demonstrate the effectiveness of Sep-PI-DeepONet through three benchmark PDE models: the viscous Burgers’ equation, Biot’s consolidation theory, and a parameterized heat equation. Our framework maintains accuracy comparable to the conventional PI-DeepONet while reducing training time by two orders of magnitude. Notably, for the heat equation solved as a 4D problem, the conventional PI-DeepONet was computationally infeasible (estimated 289.35 h), while the Sep-PI-DeepONet completed training in just 2.5 h. These results underscore the potential of Sep-PI-DeepONet in efficiently solving complex, high-dimensional PDEs, marking a significant advancement in physics-informed machine learning.

Neural operator↗
DOE OSTI2016

A Legendre–Fourier spectral method with exact conservation laws for the Vlasov–Poisson system

In this study, we present the design and implementation of an L 2 -stable spectral method for the discretization of the Vlasov–Poisson model of a collisionless plasma in one space and velocity dimension. The velocity and space dependence of the Vlasov equation are resolved through a truncated spectral expansion based on Legendre and Fourier basis functions, respectively. The Poisson equation, which is coupled to the Vlasov equation, is also resolved through a Fourier expansion. The resulting system of ordinary differential equation is discretized by the implicit second-order accurate Crank–Nicolson time discretization. The non-linear dependence between the Vlasov and Poisson equations is iteratively solved at any time cycle by a Jacobian-Free Newton–Krylov method. In this work we analyze the structure of the main conservation laws of the resulting Legendre–Fourier model, e.g., mass, momentum, and energy, and prove that they are exactly satisfied in the semi-discrete and discrete setting. The L 2 -stability of the method is ensured by discretizing the boundary conditions of the distribution function at the boundaries of the velocity domain by a suitable penalty term. The impact of the penalty term on the conservation properties is investigated theoretically and numerically. An implementation of the penalty term that does not affect the conservation of mass, momentum and energy, is also proposed and studied. A collisional term is introduced in the discrete model to control the filamentation effect, but does not affect the conservation properties of the system. Numerical results on a set of standard test problems illustrate the performance of the method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Implicit filtered P{sub N} for high-energy density thermal radiation transport using discontinuous Galerkin finite elements

In this work, we provide a fully-implicit implementation of the time-dependent, filtered spherical harmonics (FP{sub N}) equations for non-linear, thermal radiative transfer. We investigate local filtering strategies and analyze the effect of the filter on the conditioning of the system, showing in particular that the filter improves the convergence properties of the iterative solver. We also investigate numerically the rigorous error estimates derived in the linear setting, to determine whether they hold also for the non-linear case. Finally, we simulate a standard test problem on an unstructured mesh and make comparisons with implicit Monte Carlo (IMC) calculations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

A particle-in-cell method for the simulation of plasmas based on an unconditionally stable field solver

Here, we propose a new particle-in-cell (PIC) method for the simulation of plasmas based on a recently developed, unconditionally stable solver for the wave equation. This method is not subject to a CFL restriction, limiting the ratio of the time step size to the spatial step size, typical of explicit methods, while maintaining computational cost and code complexity comparable to such explicit schemes. We describe the implementation in one and two dimensions for both electrostatic and electromagnetic cases, and present the results of several standard test problems, showing good agreement with theory with time step sizes much larger than allowed by typical CFL restrictions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Enumeration as a Tool for Structure Solution: A Materials Genomic Approach to Solving the Cation-Ordered Structure of Na 3 V 2 (PO 4 ) 2 F 3

While powder diffraction methods are routinely utilized to optimize structural models for compounds whose crystal structures are known, the determination of unknown structures is far more challenging. When the unknown structure is large, structure solution can become a virtually intractable problem using standard structure solution methodologies, especially when the space group cannot be unambiguously resolved. One such system is the promising Na-ion battery cathode material Na 3 V 2 (PO 4 ) 2 F 3 whose high temperature and room temperature structures were previously solved, but whose more complex low-temperature structure could not be determined. Here, a novel materials genomic approach is demonstrated for the solution of the unknown 100 K structure of Na 3 V 2 (PO 4 ) 2 F 3 in which enumeration methods are first used to generate a large number (~3,000) of trial structures based on plausible orderings of Na ions and then automated Rietveld refinements are carried out to optimize each of these trial structures. Based on both the analysis of the ensemble of optimized trial structures and the density functional theory energy minimization of selected trial structures, the 100 K structure of Na 3 V 2 (PO 4 ) 2 F 3 is best described as belonging to the space group A2 1 am with unit cell dimensions of a = 9.01928(4), b = 27.1379(1), c = 10.73307(5). The 100 K unit cell has a large volume of 2627.07(2) Å 3 with Z = 12 and 33 independent crystallographic sites (9 Na, 3 V, 3 P, 12 O, and 6 F) that is 3x and 6x larger than the room- and high-temperature polymorphs of this phase, respectively. Finally, the novel methods described here will be generally applicable for the solution of the complex cation-ordered structures that commonly occur for battery materials.

36 MATERIALS SCIENCE↗
DOE OSTI2016

Coupled wave-packets for non-adiabatic molecular dynamics: a generalization of Gaussian wave-packet dynamics to multiple potential energy surfaces

Accurate simulation of the non-adiabatic dynamics of molecules in excited electronic states is key to understanding molecular photo-physical processes. Here we present a novel method, based on a semiclassical approximation, that is as efficient as the commonly used mean field Ehrenfest or ad hoc surface hopping methods and properly accounts for interference and decoherence effects. This novel method is an extension of Heller's thawed Gaussian wave-packet dynamics that includes coupling between potential energy surfaces. By studying several standard test problems we demonstrate that the accuracy of the method can be systematically improved while maintaining high efficiency. The method is suitable for investigating the role of quantum coherence in the non-adiabatic dynamics of many-atom molecules.

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

Differentiable but exact formulation of density-functional theory

The universal density functional F of density-functional theory is a complicated and ill-behaved function of the density—in particular, F is not differentiable, making many formal manipulations more complicated. While F has been well characterized in terms of convex analysis as forming a conjugate pair (E, F) with the ground-state energy E via the Hohenberg–Kohn and Lieb variation principles, F is nondifferentiable and subdifferentiable only on a small (but dense) subset of its domain. In this article, we apply a tool from convex analysis, Moreau–Yosida regularization, to construct, for any ε > 0, pairs of conjugate functionals ({sup ε}E, {sup ε}F) that converge to (E, F) pointwise everywhere as ε → 0{sup +}, and such that {sup ε}F is (Fréchet) differentiable. For technical reasons, we limit our attention to molecular electronic systems in a finite but large box. It is noteworthy that no information is lost in the Moreau–Yosida regularization: the physical ground-state energy E(v) is exactly recoverable from the regularized ground-state energy {sup ε}E(v) in a simple way. All concepts and results pertaining to the original (E, F) pair have direct counterparts in results for ({sup ε}E, {sup ε}F). The Moreau–Yosida regularization therefore allows for an exact, differentiable formulation of density-functional theory. In particular, taking advantage of the differentiability of {sup ε}F, a rigorous formulation of Kohn–Sham theory is presented that does not suffer from the noninteracting representability problem in standard Kohn–Sham theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Semiclassical Monte Carlo: A first principles approach to non-adiabatic molecular dynamics

Modeling the dynamics of photophysical and (photo)chemical reactions in extended molecular systems is a new frontier for quantum chemistry. Many dynamical phenomena, such as intersystem crossing, non-radiative relaxation, and charge and energy transfer, require a non-adiabatic description which incorporate transitions between electronic states. Additionally, these dynamics are often highly sensitive to quantum coherences and interference effects. Several methods exist to simulate non-adiabatic dynamics; however, they are typically either too expensive to be applied to large molecular systems (10's-100's of atoms), or they are based on ad hoc schemes which may include severe approximations due to inconsistencies in classical and quantum mechanics. We present, in detail, an algorithm based on Monte Carlo sampling of the semiclassical time-dependent wavefunction that involves running simple surface hopping dynamics, followed by a post-processing step which adds little cost. The method requires only a few quantities from quantum chemistry calculations, can systematically be improved, and provides excellent agreement with exact quantum mechanical results. Here we show excellent agreement with exact solutions for scattering results of standard test problems. Additionally, we find that convergence of the wavefunction is controlled by complex valued phase factors, the size of the non-adiabatic coupling region, and the choice of sampling function. These results help in determining the range of applicability of the method, and provide a starting point for further improvement.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗