Search NASA⌕ Search

SEARCH · Search NASA

Results for “Polynomials”

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 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Analyzing the Quantum Approximate Optimization Algorithm: Ansätze, Symmetries, and Lie Algebras

The quantum approximate optimization algorithm (QAOA) has been proposed as a method to obtain approximate solutions for combinatorial optimization tasks. In this work, we study the underlying algebraic properties of three QAOA ansätze for the maximum-cut problem on connected graphs, while focusing on the generated Lie algebras as well as their invariant subspaces. Specifically, we analyze the standard QAOA ansatz as well as the orbit and multiangle ansätze. We are able to fully characterize the Lie algebras of the multiangle ansatz across arbitrary connected graphs, finding that they only fall into one of just six families. Aside from the cycle and path graphs, the Lie dimensions for every graph are exponentially large in the system size, meaning that multiangle ansätze are extremely prone to exhibiting barren plateaus. Then, a similar quasi-graph-independent Lie-algebraic characterization beyond the multiangle ansatz is impeded as the circuit exhibits additional “hidden” symmetries besides those naturally arising from a certain parity-superselection operator and all automorphisms of the considered graph. Disregarding the “hidden” symmetries, we can upper bound the dimensions of the orbit and the standard Lie algebras, and the dimensions of the associated invariant subspaces are determined via explicit character formulas. To finish, we conjecture that (for most graphs) the standard Lie algebras have only components that are either exponential or that grow, at most, polynomially with the system size. This would imply that the QAOA is either prone to barren plateaus or classically simulable. More generally, our work provides a symmetry framework and tools to analyze any desired variational quantum algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

CrysFieldExplorer : rapid optimization of the crystal field Hamiltonian

A new approach to the fast optimization of crystal electric field (CEF) parameters to fit experimental data is presented. This approach is implemented in a lightweight Python-based program, CrysFieldExplorer. The main novelty of the method is the development of a unique loss function, referred to as the spectrum characteristic loss (L Spectrum ), which is based on the characteristic polynomial of the Hamiltonian matrix. Particle swarm optimization and a covariance matrix adaptation evolution strategy are used to find the minimum of the total loss function. It is demonstrated that CrysFieldExplorer can perform direct fitting of CEF parameters to any experimental data such as a neutron spectrum, susceptibility or magnetization measurements etc. CrysFieldExplorer can handle a large number of non-zero CEF parameters and reveal multiple local and global minimum solutions. Crystal field theory, the loss function, and the implementation and limitations of the program are discussed within the context of two examples.

42 ENGINEERING↗
DOE OSTI2022

Analytic descriptions of parabolic X-ray mirrors

On X-ray beamlines and telescopes, glancing-incidence mirrors with parabolic profiles are used to collimate, focus, and collect light. Here, analytic descriptions for paraboloidal, plane-parabolic, and parabolic cylindrical mirrors in several congruent geometries that are commonly used in fabrication, metrology, and modeling are provided. The exact expressions are derived directly from Fermat's principle, without coordinate transformations, in several mirror-centered coordinate systems, including one with the surface tangent to the central point of intersection. Coefficients for a sixth-order polynomial series approximation are calculated for that coordinate system.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Growth functions of periodic space tessellations

This work analyzes the rules governing the growth of the numbers of vertices, edges and faces in all possible periodic tessellations of the 2D Euclidean space, and encodes those rules in several types of polynomial growth functions. These encodings map the geometric, combinatorial and topological properties of the tessellations into sets of integer coefficients. Several general statements about these encodings are given with rigorous mathematical proof. The variation of the growth functions is represented graphically and analyzed in orphic diagrams, so named because of their similarity to orphic art. Several examples of 3D space groups are included, to emphasize the complexity of the growth functions in higher dimensions. A freely available Python library is presented to facilitate the discovery of the growth functions and the generation of orphic diagrams.

Chemistry↗
DOE OSTI2021

Tensorized Feature Spaces for Feature Explosion

In this paper 1 1 This manuscript has been authored by UT-Battelle, LLC under Contract No. DE-AC05-000R22725 with the U.S. Department of Energy. The United States Government retains and the publisher, by accepting the article for publication, acknowledges that the United States Government retains a nonexclusive, paid-up, irrevocable, worldwide license to publish or reproduce the published form of this manuscript, or allow others to do so, for United States Government purposes. The Department of Energy will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan (http://energy.gov/downloads/doe-public-access-plan) This research used resources of the Oak Ridge Leadership Computing Facility, which is a DOE Office of Science User Facility supported under Contract DE-AC05-000R22725., we present a novel framework that uses tensor factorization to generate richer feature spaces for pixel classification in hyperspectral images. In particular, we assess the performance of different tensor rank decomposition methods as compared to the traditional kernel-based approaches for the hyperspectral image classification problem. We propose Orion, which takes as input a hyperspectral image tensor and a rank and outputs an enhanced feature space from the factor matrices of the decomposed tensor. Our method is a feature explosion technique that inherently maps low dimensional input space in $\mathbb{R}^{K}$ to high dimensional space in $\mathbb{R}^{R}$ , where $R\gg K$ , say in the order of 1000x, like a kernel. We show how the proposed method exploits the multi-linear structure of hyperspectral three dimensional tensor. We demonstrate the effectiveness of our method with experiments on three publicly available hyperspectral datasets with labeled pixels and compare their classification performance against traditional linear and non-linear supervised learning methods such as SVM with Linear, Polynomial, RBF kernels, and the Multi-Layer Perceptron model. Finally, we explore the relationship between the rank of the tensor decomposition and the classification accuracy using several hyperspectral datasets with ground truth.

Pasricha, Ravdeep Singh↗
DOE OSTI2022

Calibration of Distributed Temperature Sensors Using Commercially Available SMF-28 Optical Fiber From 22 °C to 1000 °C

Optical frequency domain reflectometry (OFDR) is a family of optical techniques which can be used to produce distributed temperature measurements from the spectral shift of an interference pattern based on the Rayleigh backscatter signature of an optical fiber. Adaptive signal processing techniques have recently been used with OFDR to record meaningful spectral shift data from commercially available SMF-28 optical fibers heated beyond 950 °C. Furthermore, a correlation between the measured spectral shift and temperature has not yet been developed at these high temperatures. To extend the measurable temperature range of OFDR in SMF-28, this work describes the development of such a correlation from room temperature (22 °C) to 1000 °C. The relationship between spectral shift and temperature change over this range was found to be best characterized by the fourth-order polynomial ΔT=(-4.241 * 10 -11 )S 4 + (-2.017 * 10 -7 )S 3 + (-3.677 * 10 -4 )S 2 + (-0.8057)S, where ΔT represents the temperature difference compared to the reference temperature, and S represents the spectral shift measured by the fibers. The calibration developed in this work assumes that the fiber has been fully annealed by heating the fiber to 1000 °C for a few hours. This paper is the first to demonstrate the calibration and use of SMF-28 distributed optical fiber sensors up to 1000 °C, enabled using adaptive OFDR-based signal processing.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

A Semi-Analytical Solution Approach for Solving Constant-Coefficient First-Order Partial Differential Equations

Simulation and control of many dynamic systems involve solving partial differential equations (PDE). This letter proposes a semi-analytical solution (SAS) approach for fast and high-quality solution of first-order PDEs. The region of interest of the studied PDE is divided into a grid, and an SAS is derived for each grid cell in the form of the multivariate polynomials, of which the coefficients are identified using initial value and boundary value conditions. The solutions are solved in a “time-stepping” manner, i.e. within one time step, the coefficients of the SAS are identified and the initial value of the next time step is evaluated. This approach achieves a significantly larger grid cell than the widely used finite difference method, and thus enhances the computational efficiency significantly. Furthermore, the simulation result on the natural gas pipeline model demonstrates the advantages of SAS in accuracy and computational efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Coherency-Constrained Spectral Clustering for Power Network Reduction

This paper presents a methodology for reducing the complexity of large-scale power network models using spectral clustering, aggregation of electrical components, and cost function approximation. Two approaches are explored using unconstrained and constrained spectral clustering to determine areas for effective system reduction. Once the system areas are determined, both loads and generators by type are aggregated, and their new cost function is approximated through polynomial curve-fitting or statistical methods. The performance of reduced networks is evaluated in terms of their ability to follow the true daily cost of the original system over a 24-hour period considering a set of several days. Two test systems are taken as test beds. Application of the methodology to a modified version of the IEEE 39-bus system reduces it from 17 generators to a 4-bus system and 9 generators with about 93% of accuracy. Similarly, the IEEE 118-bus system is reduced from 19 generators to a 3-bus system with three aggregated units achieving over 99% of accuracy. These findings address scalability challenges and enhance accuracy for high and mid-loading level conditions, and by aggregating thermal units with similar cost functions.

42 ENGINEERING↗
DOE OSTI2021

Data-Driven Global Sensitivity Analysis of Three-Phase Distribution System with PVs

Global sensitivity analysis (GSA) of distribution system with respect to stochastic PV variations plays an important role in designing optimal voltage control schemes. This paper proposes a Kriging, i.e., Gaussian process modeling enabled data-driven GSA method. The key idea is to develop a surrogate model that captures the hidden global relationship between voltage and real and reactive power injections from the historical data. With the surrogate model, the Sobol index can be conveniently calculated to assess the global sensitivity of voltage to various power injection variations. Comparison results with other model-based GSA methods on the IEEE 37-bus feeder, such as the polynomial chaos expansion and the Monte Carlo approaches demonstrate that the proposed method can achieve accurate GSA outcomes while maintaining high computational efficiency.

distribution system analysis↗
DOE OSTI2020

Optimization of Simultaneous Measurement for Variational Quantum Eigensolver Applications

Variational quantum eigensolver (VQE) is a promising algorithm suitable for near-term quantum computers. VQE aims to approximate solutions to exponentially-sized optimization problems by executing a polynomial number of quantum sub-problems. However, the number of subproblems scales as N-4 for typical problems of interest-a daunting growth rate that poses a serious limitation for emerging applications such as quantum computational chemistry. We mitigate this issue by exploiting the simultaneous measurability of subproblems corresponding to commuting terms. Our technique transpiles VQE instances into a format optimized for simultaneous measurement, ultimately yielding 8-30x lower cost. Our work also encompasses a synthesis tool for compiling simultaneous measurement circuits with minimal overhead. We demonstrate experimental validation of our techniques by estimating the ground state energy of deuteron with a quantum computer. We also investigate the underlying statistics of simultaneous measurement and devise an adaptive strategy for mitigating harmful covariance terms.

quantum computing↗
DOE OSTI2022

A Multiagent Deep Reinforcement Learning-Enabled Dual-Branch Damping Controller for Multimode Oscillation

Here, this study develops a multiagent deep reinforcement learning (MADRL)-enabled framework for the decentralized cooperative control of a novel dual-branch (DB) damping controller for both low-frequency oscillation (LFO) and ultralow-frequency oscillation (ULFO). It has two branches, each of which consists of a proportional resonance (PR) and a second-order polynomial that is designed to handle target oscillation modes. To improve the robustness of the controller to system uncertainties, MADRL is developed, where multiagents are centrally trained to obtain the coordinated adaptive control policy while being executed in a decentralized manner to provide the optimal parameter setting for each controller with only local states. Comparisons with the IEEE 10-machine 39-bus system demonstrate that the proposed method achieves better robustness to uncertainties, lower communication delay, and single-point failure, as well as damping control performances for both LFO and ULFO.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Generalized Theory and Realization of Reconfigurable Bandpass Filtering Equalizers

Here, in this article, a generalized theory of bandpass filtering equalizers is proposed. A filtering equalizer is a device that combines the frequency-selective properties of a filter with the controllable slope of an equalizer into a single component. The equations used to design the function for a desired slope are provided, and the design methodology to determine the necessary filtering polynomials is also shown. The controllable slope of the dual-function component is realized using variable capacitors, which are used to tune both a transmission zero and a matching network to achieve the desired slope. A third-order bandpass filtering equalizer is designed, fabricated, and measured to verify the generalized theory. The component is designed to operate at 1 GHz with a slope that can be reconfigured from 1 to 3 dB along the passband. This proposed filtering equalizer demonstrates the feasibility of a tunable, low-cost, size, weight, and power (C-SWaP) solution to enable increased flatness in the overall system response and thereby decrease the error vector magnitude (EVM) of future radio frequency (RF) systems and a design process that allows for future development of filtering equalizers.

Filter↗
DOE OSTI2022

Silicon Photomultipliers Coupled to Scintillators With the Emission Maximum at 550 nm

A majority of the silicon photomultipliers (SiPMs) are sensitive to blue and near-ultraviolet (NUV) photons that are not optimized for scintillators with the emission maximum at wavelengths longer than 500 nm. The red–green–blue (RGB) SiPM is developed for the maximum photon detection efficiency (PDE) at 550 nm, which is a good match for some high-light-yield scintillators, such as CsI:Tl (CsI) and Gd 1.5 Y 1.5 Ga 2 Al 3 O 12 :Ce (GYGAG). Comparisons are made for the performance of these scintillators coupled to the RGB SiPM and a blue-sensitive SiPM. Because it takes tens of nanoseconds for the microcells to recharge after registering a photon hit, the linearity of these scintillation detectors was studied for high-energy gammas where numerous scintillation photons are generated. In addition, the energy resolution of the 662-keV gamma emitted by 137 Cs was measured for temperatures between –20 °C and 50 °C. The nonlinearity was observed above 1 MeV for all measurements, and however, it can be corrected by energy calibration using a third-degree polynomial. For CsI, the energy resolution is better with the blue-sensitive SiPM because of the lower dark count rate (DCR). In contrast, GYGAG coupled to the RGB SiPM has a better energy resolution for temperatures below 30 °C because of the well-matched emission spectrum and PDE distribution. Nevertheless, the advantage disappears for temperatures above 30 °C due to the higher DCR. It would be useful to further develop the RGB SiPM with a lower DCR and higher operating temperatures.

42 ENGINEERING↗
DOE OSTI2020

A Data-Driven Nonparametric Approach for Probabilistic Load-Margin Assessment Considering Wind Power Penetration

A modern power system is characterized by an increasing penetration of wind power, which results in large uncertainties in its states. These uncertainties must be quantified properly; otherwise, the system security may be threatened. Facing this challenge, here we propose a cost-effective, data-driven approach to assessing a power system's load margin probabilistically. Using actual wind data, a kernel density estimator is applied to infer the nonparametric wind speed distributions, which are further merged into the framework of a vine copula. The latter enables us to simulate complex multivariate and highly dependent model inputs with a variety of bivariate copulae that precisely represent the tail dependence in the correlated samples. Furthermore, to reduce the prohibitive computational time of traditional Monte-Carlo simulations that process a large amount of samples, we propose to use a nonparametric, Gaussian-process-emulator-based reduced-order model to replace the original complicated continuation power-flow model through a Bayesian-learning framework. To accelerate the convergence rate of this Bayesian algorithm, a truncated polynomial chaos surrogate, which serves as a highly efficient, parametric Bayesian prior, is developed. This emulator allows us to execute the time-consuming continuation power-flow solver at the sampled values with a negligible computational cost. Results of simulations that are performed on several test systems reveal the impressive performance of the proposed method in the probabilistic load-margin assessment.

17 WIND ENERGY↗
DOE OSTI2021

Ensemble Learning Based Convex Approximation of Three-Phase Power Flow

Though the convex optimization has been widely used in power systems, it still cannot guarantee to yield a tight (accurate) solution to some problems. To mitigate this issue, this paper proposes an ensemble learning based convex approximation for alternating current (AC) power flow equations that differs from the existing convex relaxations. The proposed approach is based on three-phase quadratic power flow equations in rectangular coordinates. To develop this data-driven convex approximation of power flows, the polynomial regression (PR) is first deployed as a basic learner to fit convex relationships between the independent and dependent variables. Then, ensemble learning algorithms such as gradient boosting (GB) and bagging are introduced to combine learners to boost model performance. Based on the learned convex approximation of power flow, optimal power flow (OPF) is formulated as a convex quadratic programming problem. The simulation results on IEEE standard cases of both balanced and unbalanced systems show that, in the context of solving OPF, the proposed data-driven convex approximation outperforms the conventional semi-definite programming (SDP) relaxation in both accuracy and computational efficiency, especially in the cases that the conventional SDP relaxation fails

Convex approximation↗
DOE OSTI2021

Global Sensitivity Analysis of Large Distribution System with PVs using Deep Gaussian Process

Global sensitivity analysis (GSA) of the voltage to uncertain power injection variations plays an important role for appropriate Volt-VAR optimization. This paper proposes a data-driven GSA method for large-scale distribution systems with a large number of uncertain sources. Specifically, the deep Gaussian process is used to identify the mapping relationship between uncertain power injections and voltages. This allows us to resort to the analysis of variance framework to calculate the Sobol indices for GSA. Unlike the existing polynomial chaos expansion and Gaussian process-based approaches, our proposed method has much better scalability. Test results on the EPRI 1747-node K1 circuit with a different number and different probability distributions of uncertain sources demonstrate that the proposed method can achieve accurate GSA under various conditions.

14 SOLAR ENERGY↗
DOE OSTI2022

Physics-Informed Sparse Gaussian Process for Probabilistic Stability Analysis of Large-Scale Power System with Dynamic PVs and Loads

This work proposes a physics-informed sparse Gaussian process (SGP) for probabilistic stability assessment of large-scale power systems in the presence of uncertain dynamic PVs and loads. The differential and algebraic equations considering uncertainties from dynamic PVs and loads are reformulated to a nonlinear mapping relationship that allows the application of SGP. Thanks to the nonparametric characteristic of Gaussian process, the proposed framework does not require distributions of uncertain inputs and this distinguishes it from existing approaches. As the original Gaussian process is not scalable to large-scale systems with high dimensional uncertain inputs, this paper develops the SGP with a stochastic variational inference technique. It leads to approximately two orders of complex reduction. A data pre-processing step is also introduced to tackle the coexistence of stable and unstable cases by sample clustering and constructing separate SGPs. The probabilistic transient stability index is analyzed to assess system stability under different uncertain dynamics loads and PVs. Comparisons are performed with the sampling-based, the polynomial chaos expansion-based, and traditional Gaussian process-based methods on the modified IEEE 118-bus and Texas 2000-bus systems under various scenarios, including different levels of uncertainties and the existence of nonlinear correlations among dynamic PVs. The impacts of data quality and quantity issues are also investigated. It is shown that the proposed SGP achieves significantly improved computational efficiency while maintaining high accuracy with a limited number of data.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Controller-Based Energy-Aware Wireless Sensor Network Routing Using Quantum Algorithms

Energy-efficient routing in wireless sensor networks has attracted attention from researchers in both academia and industry, most recently motivated by the opportunity to use software-defined network-inspired approaches. These problems are NP-hard, with algorithms needing computation time that scales faster than polynomials in the problem size. Consequently, heuristic algorithms are used in practice, which are unable to guarantee optimally. In this article, we show proof-of-principle for the use of a quantum annealing processor instead of a classical processor, to find optimal or nearly optimal solutions very quickly. Our preliminary results for small networks show that this approach using quantum computing has great promise and may open the door for other significant improvements in the efficacy of network algorithms.

42 ENGINEERING↗