Search NASA⌕ Search

SEARCH · Search NASA

Results for “subspace 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.

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

At least 433 records · Page 24

An adaptive adversarial domain adaptation approach for corn yield prediction

Recently, statistical machine learning and deep learning methods have been widely explored for corn yield prediction. Though successful, machine learning models generated within a specific spatial domain often lose their validity when directly applied to new regions. To address this issue, we designed an unsupervised adaptive domain adversarial neural network (ADANN). Specifically, through domain adversarial training, the ADANN model reduced the impact of domain shift by projecting data from different domains into the same subspace. Also, the ADANN model was designed to be trained in an adaptive way, which guaranteed the model can learn the domain-invariant features and perform accurate yield prediction simultaneously. Informative variables including time-series vegetation indices and sequential weather observations were first collected from multiple data sources and aggregated to the county level. Then, we trained the ADANN model with the extracted features and corresponding reported county-level corn yield from the U.S. Department of Agriculture (USDA). Finally, the trained model was evaluated in four testing years 2016–2019. The U.S. corn belt was used as the study area and counties under study were grouped into two diverse ecological regions. Overall, the experimental results showed that the developed ADANN model had better performance than three other state-of-the-art machine learning models in both local experiments (train and test in the same region) and transfer experiments (train and test in different regions). As the first study using adversarial learning for crop yield prediction, this research demonstrates a novel solution for improving model transferability on crop yield prediction.

59 BASIC BIOLOGICAL SCIENCES↗

Parametric model-order reduction for radiation transport using multi-resolution proper orthogonal decomposition

For parametric high-fidelity simulations, it is often desirable to utilize a reduced-order model (ROM) to emulate, at a reduced computational cost, parametric solutions of the governing partial differential equations (PDEs) for unseen parameter values. One commonly employed option is to utilize a data-driven, projection-based ROM supplemented with subspace identification via proper orthogonal decomposition (POD). POD discovers the ROM subspace by computing the singular value decomposition (SVD) of a set of training data from the full-order model (FOM). In streaming-dominated radiation transport simulations with localized sources, solutions often greatly vary over the spatial domain by many orders of magnitude. In such cases, machine-precision arithmetic can be insufficient to obtain an accurate SVD, resulting in a poorly performing ROM. We present a method called multiresolution POD (mrPOD) that mitigates these inaccuracies. The mrPOD method works by decomposing the spatial domain into regions and performing proper orthogonal decomposition on the training dataset separately in each region. In conclusion, mrPOD is tested on single energy group and multigroup atmospheric shielding transport problems and is shown to outperform classic POD.

42 ENGINEERING↗

Learning infinite-horizon average-reward restless multi-action bandits via index awareness

We consider the online restless bandits with average-reward and multiple actions, where the state of each arm evolves according to a Markov decision process (MDP), and the reward of pulling an arm depends on both the current state of the corresponding MDP and the action taken. Since finding the optimal control is typically intractable for restless bandits, existing learning algorithms are often computationally expensive or with a regret bound that is exponential in the number of arms and states. In this paper, we advocate \textit{index-aware reinforcement learning} (RL) solutions to design RL algorithms operating on a much smaller dimensional subspace by exploiting the inherent structure in restless bandits. Specifically, we first propose novel index policies to address dimensionality concerns, which are provably optimal. We then leverage the indices to develop two low-complexity index-aware RL algorithms, namely, (i) GM-R2MAB, which has access to a generative model; and (ii) UC-R2MAB, which learns the model using an upper confidence style online exploitation method. We prove that both algorithms achieve a sub-linear regret that is only polynomial in the number of arms and states. A key differentiator between our algorithms and existing ones stems from the fact that our RL algorithms contain a novel exploitation that leverages our proposed provably optimal index policies for decision-makings.

Xiong, Guojun↗

Sampling Low-Dimensional Markovian Dynamics for Preasymptotically Recovering Reduced Models from Data with Operator Inference

This work introduces a method for learning low-dimensional models from data of high-dimensional black-box dynamical systems. The novelty is that the learned models are exactly the reduced models that are traditionally constructed with classical projection-based model reduction techniques. Thus, the proposed approach learns models that are guaranteed to have the well-studied properties of reduced models known from model reduction, without requiring full knowledge of the governing equations and without requiring the operators of the high-dimensional systems. The key ingredient is a new data sampling scheme to obtain re-projected trajectories of high-dimensional systems that correspond to Markovian dynamics in low-dimensional subspaces. The exact recovery of reduced models from these re-projected trajectories is guaranteed pre-asymptotically under certain conditions for finite amounts of data and for a large class of systems with polynomial nonlinear terms. Numerical results demonstrate that the low-dimensional models learned with the proposed approach match reduced models from traditional model reduction up to numerical errors in practice. In conclusion, the numerical results further indicate that low-dimensional models fitted to re-projected trajectories are predictive even in situations where models fitted to trajectories without re-projection are inaccurate and unstable.

97 MATHEMATICS AND COMPUTING↗

Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems

Security-constrained unit commitment (SCUC) is a fundamental problem in power systems and electricity markets. In practical settings, SCUC is repeatedly solved via mixed-integer linear programming (MIP), sometimes multiple times per day, with only minor changes in input data. In this work, we propose a number of machine learning techniques to effectively extract information from previously solved instances in order to significantly improve the computational performance of MIP solvers when solving similar instances in the future. Based on statistical data, we predict redundant constraints in the formulation, good initial feasible solutions, and affine subspaces where the optimal solution is likely to lie, leading to a significant reduction in problem size. Computational results on a diverse set of realistic and large-scale instances show that using the proposed techniques, SCUC can be solved on average 4.3 times faster with optimality guarantees and 10.2 times faster without optimality guarantees, with no observed reduction in solution quality. Out-of-distribution experiments provide evidence that the method is somewhat robust against data-set shift. Summary of Contribution. The paper describes a novel computational method, based on a combination of mixed-integer linear programming (MILP) and machine learning (ML), to solve a challenging and fundamental optimization problem in the energy sector. The method advances the state-of-the-art, not only for this particular problem, but also, more generally, in solving discrete optimization problems via ML. We expect that the techniques presented can be readily used by practitioners in the energy sector and adapted, by researchers in other fields, to other challenging operations research problems that are solved routinely.

Machine Learning↗

An adaptive least-squares global sensitivity method and application to a plasma-coupled combustion prediction with parametric correlation

We introduce an efficient non-intrusive surrogate-based methodology for global sensitivity analysis and uncertainty quantification. Modified covariance-based sensitivity indices (mCov-SI) are defined for outputs that reflect correlated effects. The overall approach is applied to simulations of a complex plasma-coupled combustion system with disparate uncertain parameters in sub-models for chemical kinetics and a laser-induced breakdown ignition seed. The surrogate is based on an Analysis of Variance (ANOVA) expansion, such as widely used in statistics, with orthogonal polynomials representing the ANOVA subspaces and a polynomial dimensional decomposition (PDD) representing its multi-dimensional components. The coefficients of the PDD expansion are obtained using a least-squares regression, which both avoids the direct computation of high-dimensional integrals and affords an attractive flexibility in choosing sampling points. This facilitates importance sampling using a Bayesian calibrated posterior distribution, which is fast and thus particularly advantageous in common practical cases, such as our large-scale demonstration, for which the asymptotic convergence properties of polynomial expansions cannot be realized due to computation expense. Effort, instead, is focused on efficient finite-resolution sampling. Standard covariance-based sensitivity indices (Cov-SI) are employed to account for correlation of the uncertain parameters. Magnitude of Cov-SI is unfortunately unbounded, which can produce extremely large indices that limit their utility. Alternatively, mCov-SI are then proposed in order to bound this magnitude $\in$ [0, 1]. The polynomial expansion is coupled with an adaptive ANOVA strategy to provide an accurate surrogate as the union of several low-dimensional spaces, avoiding the typical computational cost of a high-dimensional expansion. It is also adaptively simplified according to the relative contribution of the different polynomials to the total variance. Finally, the approach is demonstrated for a laser-induced turbulent combustion simulation model, which includes parameters with correlated effects.

42 ENGINEERING↗

Exponential Time Differencing Schemes for Fuel Depletion and Transport in Molten Salt Reactors: Theory and Implementation

A numerical framework for modeling depletion and mass transport in liquid-fueled molten salt reactions is presented based on exponential time differencing. The solution method involves using the finite volume method to transform the system of partial differential equations (PDEs) into a much larger system of ordinary differential equations. The key part of this method involves solving for the exponential of a matrix. We explore six different algorithms to compute the exponential in a series of progression problems that explore physical transport phenomena in molten salt reactors. This framework shows good results for solving linear parabolic PDEs with each of the six matrix exponential algorithms. For large problems, the series solvers such as Padé and Taylor have large run times, which can be mitigated by using the Krylov subspace.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Multiple time step molecular dynamics in the optimized isokinetic ensemble steered with the molecular theory of solvation: Accelerating with advanced extrapolation of effective solvation forces

We develop efficient handling of solvation forces in the multiscale method of multiple time step molecular dynamics (MTS-MD) of a biomolecule steered by the solvation free energy (effective solvation forces) obtained from the 3D-RISM-KH molecular theory of solvation (three-dimensional reference interaction site model complemented with the Kovalenko-Hirata closure approximation). To reduce the computational expenses, we calculate the effective solvation forces acting on the biomolecule by using advanced solvation force extrapolation (ASFE) at inner time steps while converging the 3D-RISM-KH integral equations only at large outer time steps. The idea of ASFE consists in developing a discrete non-Eckart rotational transformation of atomic coordinates that minimizes the distances between the atomic positions of the biomolecule at different time moments. The effective solvation forces for the biomolecule in a current conformation at an inner time step are then extrapolated in the transformed subspace of those at outer time steps by using a modified least square fit approach applied to a relatively small number of the best force-coordinate pairs. The latter are selected from an extended set collecting the effective solvation forces obtained from 3D-RISM-KH at outer time steps over a broad time interval. The MTS-MD integration with effective solvation forces obtained by converging 3D-RISM-KH at outer time steps and applying ASFE at inner time steps is stabilized by employing the optimized isokinetic Nosé-Hoover chain (OIN) ensemble. Compared to the previous extrapolation schemes used in combination with the Langevin thermostat, the ASFE approach substantially improves the accuracy of evaluation of effective solvation forces and in combination with the OIN thermostat enables a dramatic increase of outer time steps. We demonstrate on a fully flexible model of alanine dipeptide in aqueous solution that the MTS-MD/OIN/ASFE/3D-RISM-KH multiscale method of molecular dynamics steered by effective solvation forces allows huge outer time steps up to tens of picoseconds without affecting the equilibrium and conformational properties, and thus provides a 100- to 500-fold effective speedup in comparison to conventional MD with explicit solvent. With the statistical-mechanical 3D-RISM-KH account for effective solvation forces, the method provides efficient sampling of biomolecular processes with slow and/or rare solvation events such as conformational transitions of hydrated alanine dipeptide with the mean life times ranging from 30 ps up to 10 ns for “flip-flop” conformations, and is particularly beneficial for biomolecular systems with exchange and localization of solvent and ions, ligand binding, and molecular recognition.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Dynamics of photosynthetic light harvesting systems interacting with N-photon Fock states

Here, we develop a method to simulate the excitonic dynamics of realistic photosynthetic light harvesting systems, including non-Markovian coupling to phonon degrees of freedom, under excitation by N-photon Fock state pulses. This method combines the input–output and the hierarchical equations of motion formalisms into a double hierarchy of density matrix equations. We show analytically that under weak field excitation relevant to natural photosynthesis conditions, an N-photon Fock state input and a corresponding coherent state input give rise to equal density matrices in the excited manifold. However, an N-photon Fock state input induces no off-diagonal coherence between the ground and excited subspaces, in contrast with the coherences created by a coherent state input. We derive expressions for the probability to absorb a single Fock state photon with or without the influence of phonons. For short pulses (or, equivalently, wide bandwidth pulses), we show that the absorption probability has a universal behavior that depends only upon a system-dependent effective energy spread parameter Δ and an exciton–light coupling constant Γ. This holds for a broad range of chromophore systems and for a variety of pulse shapes. We also analyze the absorption probability in the opposite long pulse (narrow bandwidth) regime. We then derive an expression for the long time emission rate in the presence of phonons and use it to study the difference between collective vs independent emission. Finally, we present a numerical simulation for the LHCII monomer (14-mer) system under single photon excitation that illustrates the use of the double hierarchy equations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Validity of pair truncations with effective interaction in Ca isotopes

Using the GXPF1A interaction for the pf shell nuclei, we calculate energy levels and E2 transition rates for the semimagic nuclei {sup 43-46}Ca within both the exact shell-model space and a number of subspaces constructed using collective nucleon pairs. We present explicitly the overlaps between wave functions of low-lying states obtained from shell-model calculations and those obtained using truncated nucleon-pair subspaces. These examples are used as touchstones of pair approximations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Nuclear Theory from First Principles to Forefront Experiments (Final Report for DE-SC0018638)

The Lee research group is a part of the Nuclear Lattice Effective Field Theory Collaboration, which has developed and performed ab initio lattice simulations of nuclear structure, scattering, reactions, and many-body systems. The other senior members of the collaboration include Ulf-G. Meißner at Bonn/Julich, Evgeny Epelbaum and Hermann Krebs at Bochum, Timo Lahde and Thomas Luu at Julich, and Gautam Rupak at Mississippi State. Our letter “Ab initio alpha-alpha scattering” was featured in a Nature News and Views article. Another letter “Nuclear binding near a quantum phase transition” was highlighted in a Viewpoint article in the online APS journal Physics as well as a news article in the IOP publication Physics World (September 21, 2016). Our letter “Eigenvector continuation with subspace learning” was also highlighted a Synopsis article in Physics. There are many promising ab initio approaches being used to calculate the properties of few-and many-nucleon systems. This includes the no-core shell model, symmetry-adapted no-core shell model quantum Monte Carlo, auxiliary-field diffusion Monte Carlo, self-consistent Green’s functions, many-body perturbation theory, in-medium similarity renormalization group, and coupled cluster methods. Lattice effective field theory is another ab initio approach which combines the framework of effective field theory with lattice Monte Carlo methods to allow favorable scaling from few- to many-body systems. Perhaps the most important aspect of lattice effective field theory is that its strengths and weaknesses are orthogonal to that of other ab initio methods. For example, lattice effective field theory has little difficulty in probing cluster structures and collectivity, while such features are much more difficult using other methods. Furthermore it can be used to compute superfluid condensate fractions as well as the phase diagram of strongly matter and the density and temperature dependence of clustering. Lattice effective field theory was first used in simulations of infinite nuclear matter and infinite neutron matter with pions and without pions. In addition to the efforts by our collaboration, there have been recent efforts by other groups as well.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

G2Aero: A Python package for separable shape tensors

G2Aero is a Python package for the design and deformation of discrete planar curves and tubular surfaces using a geometric data-driven approach. G2Aero utilizes a topology of product manifolds: the Grassmannian, $\mathcal{G}$($\mathcal{n}$, 2) - the set of 2-dimensional subspaces in $\mathbb{R}$ $\mathcal{n}$ - and the symmetric positive-definite (SPD) manifold, $\mathcal{S}^{2}_{++}$ - the set of 2x2 SPD matrices. The package provides a novel framework for representing separable deformations to shapes, which consist of stretching, scaling, rotating, and translating - also known as affine deformations - and a set of complementary deformations - which we refer to as undulation-type deformations. We focus on airfoil and blade design applications to emphasize the utility of the methods in an environment where the separation of affine and undulation-type deformations is critical. Notable functionalities of the framework for blade design include: 1) generating novel 2D (airfoil) shapes informed by a database of physically relevant airfoils, 2) building 3D blades by interpolating sequences of 2D airfoil cross-sections, and 3) generating blades with consistent perturbations along the blade span. We discuss the framework and provide examples in the context of wind energy applications, specifically wind turbine blade design. Figure 1 shows the wire frame obtained by interpolating airfoils defining the IEA 15-MW wind turbine blade and applying affine transformations corresponding to twist, chordal scaling, and bending. This, and all other figures in the paper, can be reproduced following examples and referencing supporting documentation provided in the G2Aero package.

97 MATHEMATICS AND COMPUTING↗

A Three-level BDDC algorithm for saddle point problems

BDDC algorithms have previously been extended to the saddle point problems arising from mixed formulations of elliptic and incompressible Stokes problems. In these two-level BDDC algorithms, all iterates are required to be in a benign space, a subspace in which the preconditioned operators are positive definite. This requirement can lead to large coarse problems, which have to be generated and factored by a direct solver at the beginning of the computation and they can ultimately become a bottleneck. An additional level is introduced in this paper to solve the coarse problem approximately and to remove this difficulty. This three-level BDDC algorithm keeps all iterates in the benign space and the conjugate gradient methods can therefore be used to accelerate the convergence. This work is an extension of the three-level BDDC methods for standard finite element discretization of elliptic problems and the same rate of convergence is obtained for the mixed formulation of the same problems. Estimate of the condition number for this three-level BDDC methods is provided and numerical experiments are discussed.

97 MATHEMATICS AND COMPUTING↗

Visualization and efficient generation of constrained high-dimensional theoretical parameter spaces

We describe a set of novel methods for efficiently sampling high-dimensional parameter spaces of physical theories defined at high energies, but constrained by experimental measurements made at lower energies. Often, theoretical models such as supersymmetry are defined by many parameters, $\mathcal{O}$(10 – 100), expressed at high energies, while relevant experimental constraints are often defined at much lower energies, preventing them from directly ruling out portions of the space. Instead, the low-energy constraints define a complex, potentially non-contiguous subspace of the theory parameters. Naive scanning of the theory space for points which satisfy the low-energy constraints is hopelessly inefficient due to the high dimensionality, and the inverse problem is considered intractable. As a result, many theoretical spaces remain under-explored. We introduce a class of modified generative autoencoders, which attack this problem by mapping the high-dimensional parameter space to a structured low-dimensional latent space, allowing for easy visualization and efficient generation of theory points which satisfy experimental constraints. An extension without dimensional compression, which focuses on limiting potential information loss, is also introduced.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A self-consistent field formulation of excited state mean field theory

In this work, we show that, as in Hartree-Fock theory, the orbitals for excited state mean field theory can be optimized via a self-consistent one-electron equation in which electron-electron repulsion is accounted for through mean field operators. In addition to showing that this excited state ansatz is sufficiently close to a mean field product state to admit a one-electron formulation, this approach brings the orbital optimization speed to within roughly a factor of two of ground state mean field theory. The approach parallels Hartree Fock theory in multiple ways, including the presence of a commutator condition, a one-electron mean-field working equation, and acceleration via direct inversion in the iterative subspace. When combined with a configuration interaction singles Davidson solver for the excitation coefficients, the self-consistent field formulation dramatically reduces the cost of the theory compared to previous approaches based on quasi-Newton descent.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Thermodynamics of the dipole-octupole pyrochlore magnet Ce 2 Hf 2 O 7 in applied magnetic fields

The recently discovered dipole-octupole pyrochlore magnet Ce 2 Hf 2 O 7 is a promising three-dimensional quantum spin liquid candidate which shows no signs of ordering at low temperature. Here we investigate the thermodynamic response to magnetic fields applied along the global [110] direction using specific heat measurements and fits using numerical methods, and solve the corresponding magnetic structure using neutron diffraction. Specific heat data in moderate fields are reproduced well, however, at high fields the agreement is not satisfactory. We especially observe a two-step release of entropy, a finding that demands a review of both theory and experiment. We address it within the framework of three possible scenarios, including an analysis of the crystal field Hamiltonian not restricted to the two-dimensional single-ion doublet subspace. We conclusively rule out two of these scenarios and find qualitative agreement with a simple model of field misalignment with respect to the crystalline direction. As a result, we discuss the implications of our findings for [111] applied fields and for future experiments on Ce 2 Hf 2 O 7 and its sister compounds.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Importance of charge self-consistency in first-principles description of strongly correlated systems

First-principles approaches have been successful in solving many-body Hamiltonians for real materials to an extent when correlations are weak or moderate. As the electronic correlations become stronger often embedding methods based on first-principles approaches are used to better treat the correlations by solving a suitably chosen many-body Hamiltonian with a higher level theory. The success of such embedding theories, often referred to as second-principles, is commonly measured by the quality of self-energy Σ which is either a function of energy or momentum or both. However, Σ should, in principle, also modify the electronic eigenfunctions and thus change the real space charge distribution. While such practices are not prevalent, some works that use embedding techniques do take into account these effects. In such cases, choice of partitioning, of the parameters defining the correlated Hamiltonian, of double-counting corrections, and the adequacy of low-level Hamiltonian hosting the correlated subspace hinder a systematic and unambiguous understanding of such effects. Further, for a large variety of correlated systems, strong correlations are largely confined to the charge sector. Then an adequate nonlocal low-order theory is important, and the high-order local correlations embedding contributes become redundant. Here we study the impact of charge self-consistency within two example cases, TiSe 2 and CrBr 3 , and show how real space charge re-distribution due to correlation effects taken into account within a first-principles Green’s function-based many-body perturbative approach is key in driving qualitative changes to the final electronic structure of these materials.

36 MATERIALS SCIENCE↗

Bound Constrained Partial DifferentialEquation Inverse Problem Solution by theSemi-Smooth Newton Method

We present the mathematical derivation, software implementation details, and computational results for a semi-smooth Newton method applied to two inverse problems governed by partial differential equations with bound constraints. The two problems share mathematical structural similarities to density-based topology optimization problems. The semi-smooth Newton method provides a mesh independent solution computation for the two test problems. A key step is that the complementarity part of the necessary optimality conditions are reformulated with the use of a complementarity functionφsuch that the complementarity conditions are satisfied if and only if a zero of a nonsmooth function has been obtained. The modular finite element package MFEM is utilized for the software implementation. In addition we constructed a matrix-free Operator to enable the use of efficient Krylov subspace IterativeSolver of MFEM for the solution of our two target problems.

97 MATHEMATICS AND COMPUTING↗