Search NASA⌕ Search

SEARCH · Search NASA

Results for “polynomial 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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Scalable multilevel Monte Carlo methods exploiting parallel redistribution on coarse levels

Here, we study an element agglomeration coarsening strategy that requires data redistribution at coarse levels when the number of coarse elements becomes smaller than the number of MPI processes used on the finest level. The overall procedure generates coarse elements (general unstructured unions of fine grid elements) within the framework of element-based algebraic multigrid methods (or AMGe) studied previously. The AMGe-generated coarse spaces have the ability to exhibit approximation properties of the same order as the fine-level spaces since by construction they contain the piecewise polynomials of the same order as on the fine level. These approximation properties are key for the successful use of AMGe in multilevel solvers for nonlinear partial differential equations as well as for multilevel Monte Carlo (MLMC) simulations. The ability to coarsen without being constrained by the number of MPI processes, as described in the present paper, allows to improve the scalability of these solvers as well as the overall MLMC method. The paper illustrates this latter fact with detailed scalability study of MLMC simulations applied to model Darcy equations with a stochastic log-normal permeability field.

AMGe↗
NASA NTRS2019

Numerical Investigation and Optimization of a Flushwall Injector for Scramjet Applications at Hypervelocity Flow Conditions

An investigation utilizing Reynolds-averaged simulations (RAS) was performed in order to find optimal designs for an interdigitated flushwall injector suitable for scramjet applications at hypervelocity conditions. The flight Mach number, duct height, spanwise width, and injection angle were the design variables selected to maximize two objective functions: the thrust potential and combustion efficiency. A Latin hypercube sampling design-of-experiments method was used to select design points for RAS. A methodology was developed that automated building geometries and generating grids for each design. The ensuing RAS analysis generated the performance database from which the two objective functions of interest were computed using a one-dimensional performance utility. The data were fitted using four surrogate models: an artificial neural network (ANN) model, a cubic polynomial, a quadratic polynomial, and a Kriging model. Variance-based decomposition showed that both objective functions were primarily driven by changes in the duct height. Multiobjective design optimization was performed for all four surrogate models via a genetic algorithm method. Optimal solutions were obtained at the upper and lower bounds of the flight Mach number range. The Kriging model obtained an optimal solution set that predicted high values for both objective functions. Additionally, three challenge points were selected to assess the designs on the Pareto fronts. Further sampling among the designs of the Pareto fronts are required in order to lower the errors and perform more accurate surrogate-based optimization. sed optimization.

Shenoy, Rajiv R.↗
NASA NTRS1979

The accurate solution of Poisson's equation by expansion in Chebyshev polynomials

A Chebyshev expansion technique is applied to Poisson's equation on a square with homogeneous Dirichlet boundary conditions. The spectral equations are solved in two ways - by alternating direction and by matrix diagonalization methods. Solutions are sought to both oscillatory and mildly singular problems. The accuracy and efficiency of the Chebyshev approach compare favorably with those of standard second- and fourth-order finite-difference methods.

Haidvogel, D. B.↗
NASA NTRS2001

Extending unbiased stereology of brain ultrastructure to three-dimensional volumes

OBJECTIVE: Analysis of brain ultrastructure is needed to reveal how neurons communicate with one another via synapses and how disease processes alter this communication. In the past, such analyses have usually been based on single or paired sections obtained by electron microscopy. Reconstruction from multiple serial sections provides a much needed, richer representation of the three-dimensional organization of the brain. This paper introduces a new reconstruction system and new methods for analyzing in three dimensions the location and ultrastructure of neuronal components, such as synapses, which are distributed non-randomly throughout the brain. DESIGN AND MEASUREMENTS: Volumes are reconstructed by defining transformations that align the entire area of adjacent sections. Whole-field alignment requires rotation, translation, skew, scaling, and second-order nonlinear deformations. Such transformations are implemented by a linear combination of bivariate polynomials. Computer software for generating transformations based on user input is described. Stereological techniques for assessing structural distributions in reconstructed volumes are the unbiased bricking, disector, unbiased ratio, and per-length counting techniques. A new general method, the fractional counter, is also described. This unbiased technique relies on the counting of fractions of objects contained in a test volume. A volume of brain tissue from stratum radiatum of hippocampal area CA1 is reconstructed and analyzed for synaptic density to demonstrate and compare the techniques. RESULTS AND CONCLUSIONS: Reconstruction makes practicable volume-oriented analysis of ultrastructure using such techniques as the unbiased bricking and fractional counter methods. These analysis methods are less sensitive to the section-to-section variations in counts and section thickness, factors that contribute to the inaccuracy of other stereological methods. In addition, volume reconstruction facilitates visualization and modeling of structures and analysis of three-dimensional relationships such as synaptic connectivity.

NASA Discipline Neuroscience↗
NASA NTRS1989

A numerically exact full wave packet approach to molecule-surface scattering

A numerically exact spectral method for solving the time-dependent Schroedinger equation in spherical coordinates is described. The angular dependence of the wave function is represented on a two-dimensional grid of evenly spaced points. The fast Fourier transform algorithm is used to transform between the angle space representation of the wave function and its conjugate representation in momentum space. The time propagation of the wave function is evaluated using an expansion of the time evolution operator as a series of Chebyshev polynomials. Calculations performed for a model system representing H2 scattering from a rectangular corrugated surface yield transition probabilities that are in excellent agreement with those obtained using the close-coupling wave packet (CCWP) method. However, the new method is found to require substantially more computation time than the CCWP method because of the large number of grid points needed to represent the angular dependence of the wave function and the variation in the number of terms required in the Chebyshev representation of the time evolution operator.

Mowrey, R. C.↗
DOE OSTI2025

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Parametrization of Generalized Parton Distributions from 𝑡-Channel String Exchange in AdS Spaces

We introduce a string-based parametrization for nucleon quark and gluon generalized parton distributions (GPDs) that is valid for all skewness. Our approach leverages conformal moments, representing them as the sum of spin-𝑗 nucleon 𝐴-form factor and skewness-dependent spin-𝑗 nucleon 𝐷-form factor, derived from 𝑡-channel string exchange in AdS spaces consistent with Lorentz invariance and unitarity. This model-independent framework, satisfying the polynomiality condition due to Lorentz invariance, uses Mellin moments from empirical data to estimate these form factors. With just five Regge slope parameters, our method accurately produces various nucleon quark GPD types and symmetric nucleon gluon GPDs through pertinent Mellin-Barnes integrals. Our isovector nucleon quark GPD is in agreement with existing lattice data, promising to improve the empirical extraction and global analysis of nucleon GPDs in exclusive processes, by avoiding the deconvolution problem at any skewness, for the first time.

QCD phenomenology↗
DOE OSTI2025

Scalable quantum simulations of scattering in scalar field theory on 120 qubits

Simulations of collisions of fundamental particles on a quantum computer are expected to have an exponential advantage over classical methods and promise to enhance searches for new physics. Furthermore, scattering in scalar field theory has been shown to be bounded-error quantum polynomial time (BQP) complete, making it a representative problem for which quantum computation is efficient. As a step toward large-scale quantum simulations of collision processes, scattering of wave packets in one-dimensional scalar field theory is simulated using 120 qubits of IBM’s Heron superconducting quantum computer ibm_fez. Variational circuits compressing vacuum preparation, wave packet initialization, and time evolution are determined using classical resources. By leveraging physical properties of states in the theory, such as symmetries and locality, the variational quantum algorithm constructs scalable circuits that can be used to simulate arbitrarily large system sizes. A new strategy is introduced to mitigate errors in quantum simulations, which enables the extraction of meaningful results from circuits with up to 4924 two-qubit gates and two-qubit gate depths of 103. The effect of interactions is clearly seen, and is found to be in agreement with classical matrix product state simulations. Finally, the developments that will be necessary to simulate high-energy inelastic collisions on a quantum computer are discussed.

quantum circuits↗
NASA NTRS1972

Feedline dynamic effects on shuttle POGO stability

The transmission parameters for the dynamic characteristics of a feedline were approximated using both power and product series expansions. The feedline transfer functions of a shuttle orbiter feedline configuration were obtained using power and product series approximations of 60th, 120th, 180th, and 240th, order. Bode plots using the above polynomial approximations were obtained and the results compared with the exact solution. The exact solution to the feedline transfer function was obtained by using the transcendental terms appearing in the transmission parameters. The results show that the shuttle orbiter feedline may be modeled adequately by using polynomial approximations for the transcendental functions appearing in the transmission parameters. The power series approach was shown to be preferable to the product series method.

Dimaggio, O. D.↗
NASA NTRS1983

Equations for the angles of arrival and departure for multivariable root loci using frequency-domain methods

Frequency domain methods are developed to obtain explicit equations for the angles of arrival and departure for multivariable root loci. The techniques involve an evaluation of polynomials formulated within the transfer function matrix. The equations defined require simpler computations than the state-space results of Shaked (1976). A class of higher order poles and zeros is formulated in terms of simpler equations than Shaked's, and the equations are shown to be generalizations of the single-input-single-output root locus equations.

Yagle, A. E.↗
NASA NTRS1984

Evolution of assumed stress hybrid finite element

Early versions of the assumed stress hybrid finite elements were based on the a priori satisifaction of stress equilibrium conditions. In the new version such conditions are relaxed but are introduced through additional internal displacement functions as Lagrange multipliers. A rational procedure is to choose the displacement terms such that the resulting strains are now of complete polynomials up to the same degree as that of the assumed stresses. Several example problems indicate that optimal element properties are resulted by this method.

Pian, T. H. H.↗
NASA NTRS1987

A full simulation of a vortex ring

A three-dimensional spectral method is developed for the solution to the incompressible Navier-Stokes equations in an unbounded domain. The spectral method relies on divergence-free basis functions as proposed by Leonard (1981). The basis functions are formed using vector spherical harmonics and Jacobi polynomials together with a mapping in the radial direction. An axisymmetric code was written and is verified using an exact solution of the Stokes equations. Preliminary results for the evolution of a vortex ring according to the Navier-Stokes equations are presented.

Stanaway, S. K.↗
NASA NTRSDate not supplied

Spatial and Temporal Deconfliction of Trajectories in the Presence of Uncertainties

Demonstration of conflict-free movement for multi-agent teams in challenging scenarios is crucial in developing trust and trustworthiness in an autonomous transport system. Tolerance verification queries are explored as a mechanism to enforce spatial and temporal deconfliction for a cooperating team of Unmanned Aerial Systems (UAS) with prescribed heterogeneous path-following performance. Obstacles in the environment are modelled as set of polyhedra, whereas each vehicle’s trajectory is represented as a sequence of polynomial curves with C2 continuity, expressed in a Bernstein basis. Each vehicle is modelled as a point mass and a safety distance, informed by the geometry of the UAS and the worst-case path-following error. This defines a tube around the trajectories where each UAS is most likely to fly through. In addition, obstacles in the environment have an associated safety buffer around them to account for the uncertainty in their location and geometric description. The tolerance verification queries explored in this paper combine the safety distance information from each UAS and environmental hazard to compute trajectories that are contained within the safe configuration space. Tolerance verification is also compared with other proximity queries to determine the suitability of each method along the different steps of the trajectory generation algorithm. This paper analyzes the fitness and performance of three proximity queries – collision, tolerance verification, and distance computations – between polyhedral and polynomial curves to ensure deconfliction between obstacles and vehicles, but also between polynomial curves to guarantee safe separation among cooperating UAS.

trajectory generation↗
DOE OSTI2026

ZTF-SEDm Type Ia supernova sample for Twins Embedding spectrophotometric standardization

Aims. This paper has two aims: the first aim is to build a large homogeneous spectrophotometric sample of Type Ia supernovae (SNe Ia) from the second data release of the Zwicky Transient Facility (ZTF DR2). We used the spectrum sample from the low-resolution ( R ∼ 100) SEDmachine (SEDm) Integral Field Spectrograph (IFS) that gathered 3069 spectra. This is one of the largest samples of such collections that can attempt to reproduce the Twins Embedding (TE) spectrophotometric standardization method. This is our second objective. The method was developed based on high-quality spectra from 200 SNe Ia of the Nearby Supernova factory (SNfactory) and led to an exceptionally low value of 0.073 mag for the intrinsic scatter. Methods. As the SEDm is not designed as a spectrophotometric instrument, we first improved the flux-calibration accuracy of the SN Ia spectrum sample using the ZTF photometric data, which were calibrated at the percent level. We corrected the spectra for second-order polynomials, fitted by comparing the synthetic photometry in the ZTF g , r , i filters with the light-curve (LC) data. We then applied the three steps of the TE parameterization to a subset of 783 ZTF SN spectra near maximum light while comparing results from SNfactory and ZTF. We finally analyzed the standardization methods based on the TE parameters. Results. The precision of the phase-correction model, which is the first step of the TE, is estimated at 0.01 mag in g band based on ZTF data. Despite the challenge posed by the spectrum-extraction pipeline associated with the SEDm (flux calibration, leftover host signal, low signal-to-noise ratio, and low resolution), we applied a first standardization in color based on the second step of the TE, called read between the lines (RBTL), to the ZTF sample. We reached a Hubble residual scatter of 0.153 mag, all in normalized median absolute deviation, which is to be compared to the ∼0.11 mag obtained with the SNfactory data. The SALT color and stretch standardization reaches a scatter of 0.164 mag for the same ZTF SN Ia sample, and its host steps are ∼0.1 mag and zero for RBTL. When considering the scatter due to the redshift error and flux calibration error, we estimated a RBTL scatter of ∼0.129 mag for this ZTF sample as an upper limit because we identified an additional contribution from a systematic error in color. We tested the standardization based on the nonlinear TE parameters, and, as expected from the low spectrum quality, it did not improve the overall dispersion. Conclusions. We release 1897 flux calibrated spectra of 1607 SNe Ia with an estimated photometric accuracy of 0.07 mag. We further demonstrate that some amount of spectrophotometric SN Ia standardization can be done with limited-quality spectra. The RBTL standardization is more efficient than that of SALT with one parameter less, and the resulting host steps are consistent with zero. This makes it less prone to astrophysical bias. For future spectroscopic surveys, targeting the extraction pipeline for a thorough flux calibration and good signal-to-noise ratio would enable us to compute the full TE standardization, which would further reduce the scatter in the distance estimate.

Ganot, C↗
DOE OSTI2025

Learning to classify quantum phases of matter with a few measurements

We study the identification of quantum phases of matter, at zero temperature, when only part of the phase diagram is known in advance. Following a supervised learning approach, we show how to use our previous knowledge to construct an observable capable of classifying the phase even in the unknown region. By using a combination of classical and quantum techniques, such as tensor networks, kernel methods, generalization bounds, quantum algorithms, and shadow estimators, we show that, in some cases, the certification of new ground states can be obtained with a polynomial number of measurements. An important application of our findings is the classification of the phases of matter obtained in quantum simulators, e.g. cold atom experiments, capable of efficiently preparing ground states of complex many-particle systems and applying simple measurements, e.g. single qubit measurements, but unable to perform a universal set of gates.

quantum machine learning↗