Search NASA⌕ Search

SEARCH · Search NASA

Results for “variable order”

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 307 records · Page 17

A reforecasting-based dynamic reserve estimation for variable renewable generation and demand uncertainty

The installed capacity of renewables-based energy sources has been increasing in traditional power systems. In order to accommodate the increased variability and uncertainty associated with the deeper penetration of renewable sources like solar and wind, adjusted amounts of dynamic reserve are needed. Although probabilistic dynamic reserve estimation methods have been previously developed, most of them consider the uncertainty to be represented by parametric density functions that tend to perform poorly under extreme events and, moreover, neglect uncertainty introduced by the forecasting model itself. Toward addressing these limitations, this work presents, for the first time, a dynamic reserve estimation method for flexibility that incorporates nonparametric density estimation and a machine learning based reforecasting to provide a day-ahead prediction of the mean and spread of uncertainty around the base forecast. The prediction is, in turn, used to estimate the up and down reserve relative to the base forecast. Here, the present method takes various endogenous and exogenous features, including the calendar variables, as input to estimate the day-ahead reserve. Using a combination of reforecasting and dynamic reserve estimation techniques, the method is shown to adjust better to the dynamic nature of reserve requirements providing only what is needed to accommodate the expected deviations. Considering California Independent System Operator (CAISO) solar, wind and load data over an 18 month period, up to 67% reduction in the amount of reserve capacity needed for a one day reserve and reserve penalty for solar uncertainty is demonstrated. Additionally, the risk of reserve insufficiency in meeting the net demand is reduced by 20% with the proposed method.

14 SOLAR ENERGY↗

Downscaled hyper-resolution (400 m) gridded datasets of daily precipitation and temperature (2008–2019) for the East–Taylor subbasin (western United States)

Abstract. High-resolution gridded datasets of meteorological variables are needed in order to resolve fine-scale hydrological gradients in complex mountainous terrain. Across the United States, the highest available spatial resolution of gridded datasets of daily meteorological records is approximately 800 m. This work presents gridded datasets of daily precipitation and mean temperature for the East–Taylor subbasin (in the western United States) covering a 12-year period (2008–2019) at a high spatial resolution (400 m). The datasets are generated using a downscaling framework that uses data-driven models to learn relationships between climate variables and topography. We observe that downscaled datasets of precipitation and mean temperature exhibit smoother spatial gradients (while preserving the spatial variability) when compared to their coarser counterparts. Additionally, we also observe that when downscaled datasets are upscaled to the original resolution (800 m), the mean residual error is almost zero, ensuring no bias when compared with the original data. Furthermore, the downscaled datasets are observed to be linearly related to elevation, which is consistent with the methodology underlying the original 800 m product. Finally, we validate the spatial patterns exhibited by downscaled datasets via an example use case that models lidar-derived estimates of snowpack. The presented dataset constitutes a valuable resource to resolve fine-scale hydrological gradients in the mountainous terrain of the East–Taylor subbasin, which is an important study area in the context of water security for the southwestern United States and Mexico. The dataset is publicly available at https://doi.org/10.15485/1822259 (Mital et al., 2021).

54 ENVIRONMENTAL SCIENCES↗

SCEC/USGS Community Stress-Drop Validation Study: How Spectral Fitting Approaches Influence Measured Source Parameters

Spectral source parameters used to estimate an earthquake’s stress drop (⁠Δσ⁠) can vary significantly across measurement approaches. The Statewide California Earthquake Center/U.S. Geological Survey Community Stress‐Drop Validation Study was initiated to compare source parameter estimates, focusing initially on a dataset from the 2019 Ridgecrest earthquake sequence. As part of that validation effort, here we focus on one potential source of uncertainty: whether spectral fitting approaches alone, applied to a common set of spectra from the 2019 Ridgecrest sequence result in different source parameter estimates. By using a common set of benchmark spectra analyzed across a consistent frequency band of 1–40 Hz, we eliminate many sources of variability. A subgroup of validation study participants volunteered to estimate the low‐frequency displacement (⁠Ω 0 ⁠) and corner frequency (⁠ƒ c ⁠) by fitting a smooth function to benchmark displacement spectra. Participants used linear‐ or log‐sampled spectra, assumed a Brune or Boatwright spectral model, and applied different misfit criteria. We compare 17 approaches used to estimate ⁠Ω 0 ⁠, ƒ c ⁠, and Δσ for 54 earthquake spectra. Our results reveal that 35% of events have Δσ estimates within a factor of two, whereas others exhibit variations exceeding an order of magnitude. The variability in and can largely be attributed to whether a spectrum is consistent with the smooth function of an idealized simple crack model. The trade‐off between Ω 0 and ƒ c may be more pronounced when using linearly sampled spectra, as higher frequency spectral bumps control the fits. As expected, methods that assumed a Boatwright model tended to have lower Ω 0 and somewhat higher ƒ c compared to those assuming a Brune model, although resulting Δσ estimates are similar. Finally, when compared to the overall validation study results, the fitting approach alone may account for between 5% and 90% (25% on average) of the total variability in spectral Δσ⁠.

58 GEOSCIENCES↗

Computation of solar perturbations with Poisson series

Description of a project for computing first-order perturbations of natural or artificial satellites by integrating the equations of motion on a computer with automatic Poisson series expansions. A basic feature of the method of solution is that the classical variation-of-parameters formulation is used rather than rectangular coordinates. However, the variation-of-parameters formulation uses the three rectangular components of the disturbing force rather than the classical disturbing function, so that there is no problem in expanding the disturbing function in series. Another characteristic of the variation-of-parameters formulation employed is that six rather unusual variables are used in order to avoid singularities at the zero eccentricity and zero (or 90 deg) inclination. The integration process starts by assuming that all the orbit elements present on the right-hand sides of the equations of motion are constants. These right-hand sides are then simple Poisson series which can be obtained with the use of the Bessel expansions of the two-body problem in conjunction with certain interation methods. These Poisson series can then be integrated term by term, and a first-order solution is obtained.

Broucke, R.↗

Detection of variable VHE γ -ray emission from the extra-galactic γ -ray binary LMC P3

Context. Recently, the high-energy (HE, 0.1–100 GeV) γ-ray emission from the object LMC P3 in the Large Magellanic Cloud (LMC) has been discovered to be modulated with a 10.3-day period, making it the first extra-galactic γ-ray binary. Aim. This work aims at the detection of very-high-energy (VHE, >100 GeV) γ-ray emission and the search for modulation of the VHE signal with the orbital period of the binary system. Methods. LMC P3 has been observed with the High Energy Stereoscopic System (H.E.S.S.); the acceptance-corrected exposure time is 100 h. The data set has been folded with the known orbital period of the system in order to test for variability of the emission. Results. VHE γ-ray emission is detected with a statistical significance of 6.4 σ. The data clearly show variability which is phase-locked to the orbital period of the system. Periodicity cannot be deduced from the H.E.S.S. data set alone. The orbit-averaged luminosity in the 1–10 TeV energy range is (1.4 ± 0.2) × 1035 erg s -1 . A luminosity of (5 ± 1) × 1035 erg s -1 is reached during 20% of the orbit. HE and VHE γ-ray emissions are anti-correlated. In conclucion, LMC P3 is the most luminous γ-ray binary known so far.

79 ASTRONOMY AND ASTROPHYSICS↗

A Combined Machine Learning and High-Energy X-ray Diffraction Approach to Understanding Liquid and Amorphous Metal Oxides

Determining the structure-property relations of liquid and amorphous metal oxides is challenging, due to their variable short-range order and polyhedral connectivity. To predict chemically realistic structures, we have developed a Machine Learned, Gaussian Approximation Potential (GAP) for HfO 2 , with a focus on enhanced sampling of the training database and accurate density functional theory calculations. By using training datasets for the GAP model at the level of Density Functional Theory-Strongly Constrained and Appropriately Normed (DFT-SCAN) level of theory, our results show that the topology of both the low viscosity liquid and the amorphous form are dominated by edge-shared chains and small corner-shared rings of polyhedra. This topology is shown to be consistent with the structure of other liquid and amorphous transition metal oxides of variable ion size, such as TiO 2 and ZrO 2 . Current limitations of the ML-GAP modeling method for obtaining glass structures and future perspectives are also discussed.

36 MATERIALS SCIENCE↗

Incorporating Endmember Variability into Spectral Mixture Analysis Through Endmember Bundles

Variation in canopy structure and biochemistry induces a concomitant variation in the top-of-canopy spectral reflectance of a vegetation type. Hence, the use of a single endmember spectrum to track the fractional abundance of a given vegetation cover in a hyperspectral image may result in fractions with considerable error. One solution to the problem of endmember variability is to increase the number of endmembers used in a spectral mixture analysis of the image. For example, there could be several tree endmembers in the analysis because of differences in leaf area index (LAI) and multiple scatterings between leaves and stems. However, it is often difficult in terms of computer or human interaction time to select more than six or seven endmembers and any non-removable noise, as well as the number of uncorrelated bands in the image, limits the number of endmembers that can be discriminated. Moreover, as endmembers proliferate, their interpretation becomes increasingly difficult and often applications simply need the aerial fractions of a few land cover components which comprise most of the scene. In order to incorporate endmember variability into spectral mixture analysis, we propose representing a landscape component type not with one endmember spectrum but with a set or bundle of spectra, each of which is feasible as the spectrum of an instance of the component (e.g., in the case of a tree component, each spectrum could reasonably be the spectral reflectance of a tree canopy). These endmember bundles can be used with nonlinear optimization algorithms to find upper and lower bounds on endmember fractions. This approach to endmember variability naturally evolved from previous work in deriving endmembers from the data itself by fitting a triangle, tetrahedron or, more generally, a simplex to the data cloud reduced in dimension by a principal component analysis. Conceptually, endmember variability could make it difficult to find a simplex that both surrounds the data cloud and has vertices that are realistic endmember spectra with reflectances between 0 and 1. In this paper, we create endmember bundles and bounding fraction images for an AVIRIS subscene simulated with a plant canopy radiative transfer model. The simulated subscene is spatially patterned after a subscene from the AVIRIS image acquired August, 1993 over La Copita, Texas. In addition, for comparison, we performed a traditional unmixing with image endmembers.

Bateson, C. Ann↗

Computing Bounds on Resource Levels for Flexible Plans

A new algorithm efficiently computes the tightest exact bound on the levels of resources induced by a flexible activity plan (see figure). Tightness of bounds is extremely important for computations involved in planning because tight bounds can save potentially exponential amounts of search (through early backtracking and detection of solutions), relative to looser bounds. The bound computed by the new algorithm, denoted the resource-level envelope, constitutes the measure of maximum and minimum consumption of resources at any time for all fixed-time schedules in the flexible plan. At each time, the envelope guarantees that there are two fixed-time instantiations one that produces the minimum level and one that produces the maximum level. Therefore, the resource-level envelope is the tightest possible resource-level bound for a flexible plan because any tighter bound would exclude the contribution of at least one fixed-time schedule. If the resource- level envelope can be computed efficiently, one could substitute looser bounds that are currently used in the inner cores of constraint-posting scheduling algorithms, with the potential for great improvements in performance. What is needed to reduce the cost of computation is an algorithm, the measure of complexity of which is no greater than a low-degree polynomial in N (where N is the number of activities). The new algorithm satisfies this need. In this algorithm, the computation of resource-level envelopes is based on a novel combination of (1) the theory of shortest paths in the temporal-constraint network for the flexible plan and (2) the theory of maximum flows for a flow network derived from the temporal and resource constraints. The measure of asymptotic complexity of the algorithm is O(N O(maxflow(N)), where O(x) denotes an amount of computing time or a number of arithmetic operations proportional to a number of the order of x and O(maxflow(N)) is the measure of complexity (and thus of cost) of a maximumflow algorithm applied to an auxiliary flow network of 2N nodes. The algorithm is believed to be efficient in practice; experimental analysis shows the practical cost of maxflow to be as low as O(N1.5). The algorithm could be enhanced following at least two approaches. In the first approach, incremental subalgorithms for the computation of the envelope could be developed. By use of temporal scanning of the events in the temporal network, it may be possible to significantly reduce the size of the networks on which it is necessary to run the maximum-flow subalgorithm, thereby significantly reducing the time required for envelope calculation. In the second approach, the practical effectiveness of resource envelopes in the inner loops of search algorithms could be tested for multi-capacity resource scheduling. This testing would include inner-loop backtracking and termination tests and variable and value-ordering heuristics that exploit the properties of resource envelopes more directly.

Muscvettola, Nicola↗

End-To-End Uncertainty Quantification with Analytical Derivatives for Design Under Uncertainty

Uncertainty quantification (UQ) is a rapidly growing and evolving discipline, especially within the aerospace community. Performing analysis with UQ can provide decision makers with a wealth of information about a candidate design. However, the value of UQ is fully realized when the information gained during UQ analysis is leveraged in a feedback loop of a design optimization process, often referred to as design under uncertainty. Although design under uncertainty can be a powerful risk mitigation technique, there are a number of roadblocks that prevent its implementation. Two primary factors are computational costs and added complexity of the analysis. High fidelity simulations on the order tens of uncertain variables quickly become computationally infeasible. Also, implementing UQ into an existing multidisciplinary design and optimization (MDO) process often requires extensive knowledge of the UQ methods and careful treatment of the problem formulation. The objective of this work is to address these two primary roadblocks and enable practitioners to efficiently perform design under uncertainty with limited knowledge of the UQ discipline. Methods outlined in this paper demonstrate MDO incorporating UQ into the design process, leveraging an analytic derivative tool chain through the entire optimization. The proposed approach leverages machine learning techniques to generate a differentiable confidence interval output from polynomial chaos models. This technique, coupled with the incorporation of analytical derivatives through the Polynomial Chaos Expansion (PCE) process, eliminates the need to estimate derivatives which are usually obtained from finite difference, complex step, or similar methods. Developing a differentiable confidence interval allows mixed uncertainty problems (both epistemic and aleatory) to be modeled. Without such modeling, these problems cannot accurately predict objective functions containing statistical quantities such as mean and variance. The addition of analytic derivatives to a polynomial chaos-based UQ method decreases the computational costs of performing design under uncertainty by orders of magnitude in comparison with methods such as complex step. The method and codes developed are modular in nature and are a drop-in solution for design under uncertainty within existing MDO problems. A low-fidelity analytical multidisciplinary optimization under uncertainty for a wing design in OpenMDAO is detailed in this paper. This demonstration case will include both objective functions and constraints which are influenced by uncertain parameters.

Ben D Phillips↗

End-To-End Uncertainty Quantification with Analytical Derivatives for Design Under Uncertainty

Uncertainty quantification (UQ) is a rapidly growing and evolving discipline, especially within the aerospace community. Performing analysis with UQ can provide decision makers with a wealth of information about a candidate design. However, the value of UQ is fully realized when the information gained during UQ analysis is leveraged in a feedback loop of a design optimization process, often referred to as design under uncertainty. Although design under uncertainty can be a powerful risk mitigation technique, there are a number of roadblocks that prevent its implementation. Two primary factors are computational costs and added complexity of the analysis. High fidelity simulations on the order tens of uncertain variables quickly become computationally infeasible. Also, implementing UQ into an existing multidisciplinary design and optimization (MDO) process often requires extensive knowledge of the UQ methods and careful treatment of the problem formulation. The objective of this work is to address these two primary roadblocks and enable practitioners to efficiently perform design under uncertainty with limited knowledge of the UQ discipline. Methods outlined in this paper demonstrate MDO incorporating UQ into the design process, leveraging an analytic derivative tool chain through the entire optimization. The proposed approach leverages machine learning techniques to generate a differentiable confidence interval output from polynomial chaos models. This technique, coupled with the incorporation of analytical derivatives through the Polynomial Chaos Expansion (PCE) process, eliminates the need to estimate derivatives which are usually obtained from finite difference, complex step, or similar methods. Developing a differentiable confidence interval allows mixed uncertainty problems (both epistemic and aleatory) to be modeled. Without such modeling, these problems cannot accurately predict objective functions containing statistical quantities such as mean and variance. The addition of analytic derivatives to a polynomial chaos-based UQ method decreases the computational costs of performing design under uncertainty by orders of magnitude in comparison with methods such as complex step. The method and codes developed are modular in nature and are a drop-in solution for design under uncertainty within existing MDO problems. A low-fidelity analytical multidisciplinary optimization under uncertainty for a wing design in OpenMDAO is detailed in this paper. This demonstration case will include both objective functions and constraints which are influenced by uncertain parameters.

Ben Phillips↗

Approach for Input Uncertainty Propagation and Robust Design in CFD Using Sensitivity Derivatives

An implementation of the approximate statistical moment method for uncertainty propagation and robust optimization for quasi 3-D Euler CFD code is presented. Given uncertainties in statistically independent, random, normally distributed input variables, first- and second-order statistical moment procedures are performed to approximate the uncertainty in the CFD output. Efficient calculation of both first- and second-order sensitivity derivatives is required. In order to assess the validity of the approximations, these moments are compared with statistical moments generated through Monte Carlo simulations. The uncertainties in the CFD input variables are also incorporated into a robust optimization procedure. For this optimization, statistical moments involving first-order sensitivity derivatives appear in the objective function and system constraints. Second-order sensitivity derivatives are used in a gradient-based search to successfully execute a robust optimization. The approximate methods used throughout the analyses are found to be valid when considering robustness about input parameter mean values.

Putko, Michele M.↗

Edge length dynamics on graphs with applications to p-adic AdS/CFT

We formulate a Euclidean theory of edge length dynamics based on a notion of Ricci curvature on graphs with variable edge lengths. In order to write an explicit form for the discrete analog of the Einstein-Hilbert action, we require that the graph should either be a tree or that all its cycles should be sufficiently long. The infinite regular tree with all edge lengths equal is an example of a graph with constant negative curvature, providing a connection with p-adic AdS/CFT, where such a tree takes the place of anti-de Sitter space. Here, we compute simple correlators of the operator holographically dual to edge length fluctuations. This operator has dimension equal to the dimension of the boundary, and it has some features in common with the stress tensor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An optimization-based approach to parameter learning for fractional type nonlocal models

Nonlocal operators of fractional type are a popular modeling choice for applications that do not adhere to classical diffusive behavior; however, one major challenge in nonlocal simulations is the selection of model parameters. In this study we propose an optimization-based approach to parameter identification for fractional models with an optional truncation radius. We formulate the inference problem as an optimal control problem where the objective is to minimize the discrepancy between observed data and an approximate solution of the model, and the control variables are the fractional order and the truncation length. For the numerical solution of the minimization problem we propose a gradient-based approach, where we enhance the numerical performance by an approximation of the bilinear form of the state equation and its derivative with respect to the fractional order. Several numerical tests in one and two dimensions illustrate the theoretical results and show the robustness and applicability of our method.

97 MATHEMATICS AND COMPUTING↗

A coupled multipoint stress–multipoint flux mixed finite element method for the Biot system of poroelasticity

In this work, we present a mixed finite element method for a five-field formulation of the Biot system of poroelasticity that reduces to a cell-centered pressure–displacement system on simplicial and quadrilateral grids. A mixed stress–displacement–rotation formulation for elasticity with weak stress symmetry is coupled with a mixed velocity–pressure Darcy formulation. The spatial discretization is based on combining the multipoint stress mixed finite element (MSMFE) method for elasticity and the multipoint flux mixed finite element (MFMFE) method for Darcy flow. It uses the lowest order Brezzi–Douglas–Marini mixed finite element spaces for the poroelastic stress and Darcy velocity, piecewise constant displacement and pressure, and continuous piecewise linear or bilinear rotation. A vertex quadrature rule is applied to the velocity, stress, and stress–rotation bilinear forms, which block-diagonalizes the corresponding matrices and allows for local velocity, stress, and rotation elimination. This leads to a cell-centered positive-definite system for pressure and displacement at each time step. We perform error analysis for the semidiscrete and fully discrete formulations, establishing first order convergence for all variables in their natural norms. The numerical tests confirm the theoretical convergence rates and illustrate the locking-free property of the method.

42 ENGINEERING↗

Adjoint DSMC for nonlinear spatially-homogeneous Boltzmann equation with a general collision model

We derive an adjoint method for the Direct Simulation Monte Carlo (DSMC) method for the spatially homogeneous Boltzmann equation with a general collision law. This generalizes our previous results in Caflisch et al., which was restricted to the case of Maxwell molecules, for which the collision rate is constant. The main difficulty in generalizing the previous results is that a rejection sampling step is required in the DSMC algorithm in order to handle the variable collision rate. We find a new term corresponding to the so-called score function in the adjoint equation and a new adjoint Jacobian matrix capturing the dependence of the collision parameter on the velocities. The new formula works for a much more general class of collision models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Radon kinetics in a natural indoor radon chamber

An unusual 180 m 3 storage room in the basement of a two-story laboratory building is unventilated, and separated from occupiable rooms by double steel doors. The space completely borders on soil through the concrete floor and two of its concrete walls. The room also contains a separate inner chamber with 1 m thick concrete walls designed to damp vibrations in the room above it. The space boasts a relatively high radon level, 1083 Bq m –3 , which varies with local outdoor environmental conditions. Measurements were made of radon concentrations at various locations and heights within the facility. More than a year of continuous radon concentration data corresponding to a single location are also available, along with measurements of indoor and outdoor pressure, temperature, and humidity. Data were also collected with as many as five fans placed in different locations and cycled on for variable time periods. First order linear kinetic models were created to explain the observed approaches to steady state due to changing conditions and wash-out resulting from intentional ventilation. Results demonstrate a good fit between changes in the radon concentration level and the developed compartmental models. Furthermore, no significant differences were observed between radon concentration at different locations or heights in the chamber.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗