Search NASA⌕ Search

SEARCH · Search NASA

Results for “standard problem”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 793 records · Page 44

SpaceWire Protocol ID: What Does It Mean To You?

Spacewire is becoming a popular solution for satellite high-speed data buses because it is a simple standard that provides great flexibility for a wide range of system requirements. It is simple in packet format and protocol, allowing users to easily tailor their implementation for their specific application. Some of the attractive aspects of Spacewire that make it easy to implement also make it hard for future reuse. Protocol reuse is difficult because Spacewire does not have a defined mechanism to communicate with the higher layers of the protocol stack. This has forced users of Spacewire to define unique packet formats and define how these packets are to be processed. Each mission writes their own Interface Control Document (ICD) and tailors Spacewire for their specific requirements making reuse difficult. Part of the reason for this habit may be because engineers typically optimize designs for their own requirements in the absence of a standard. This is an inefficient use of project resources and costs more to develop missions. A new packet format for Spacewire has been defined as a solution for this problem. This new packet format is a compliment to the Spacewire standard that will support protocol development upon Spacewire. The new packet definition does not replace the current packet structure, i.e., does not make the standard obsolete, but merely extends the standard for those who want to develop protocols over Spacewire. The Spacewire packet is defined with the first part being the Destination Address, which may be one or more bytes. This is followed by the packet cargo, which is user defined. The cargo is truncated with an End-Of-Packet (EOP) marker. This packet structure offers low packet overhead and allows the user to define how the contents are to be formatted. It also provides for many different addressing schemes, which provide flexibility in the system. This packet flexibility is typically an attractive part of the Spacewire. The new extended packet format adds one new field to the packet that greatly enhances the capability of Spacewire. This new field called the Protocol Identifier (ID) is used to identify the packet contents and the associated processing for the packet. This feature along with the restriction in the packet format that uses the Protocol ID, allows a deterministic method of decoding packets that was not before possible. The first part of the packet is still the Destination Address, which still conforms to the original standard but with one restriction. The restriction is that the first byte seen at the destination by the user needs to be a logical address, independent of the addressing scheme used. The second field is defined as the Protocol ID, which is usually one byte in length. The packet cargo (user defined) follows the Protocol ID. After the packet cargo is the EOP, which defines the end of packet. The value of the Protocol ID is assigned by the Spacewire working group and the protocol description published for others to use. The development of Protocols for Spacewire is currently the area of greatest activity by the Spacewire working group. The first protocol definition by the working group has been completed and is now in the process of formal standardization. There are many other protocols in development for missions that have not yet received formal Protocol ID assignment, but even if the protocols are not formally assigned a value, this effort will provide synergism for future developments.

Rakow, Glenn↗

Nyström type exponential integrators for strongly magnetized charged particle dynamics

Solving for charged particle motion in electromagnetic fields (i.e. the particle pushing problem) is a computationally intensive component of particle-in-cell (PIC) methods for plasma physics simulations. This task is especially challenging when the plasma is strongly magnetized due numerical stiffness arising from the wide range of time scales between highly oscillatory gyromotion and long term macroscopic behavior. A promising approach to solve these problems is by a class of methods known as exponential integrators that can solve linear problems exactly and are A-stable. This work extends the standard exponential integration framework to derive Nyström-type exponential integrators that integrates the Newtonian equations of motion as a second-order differential equation directly. In particular, we derive second-order and third-order Nyström-type exponential integrators for strongly magnetized particle pushing problems. Numerical experiments show that the Nyström-type exponential integrators exhibit significant improvement in computation speed over the standard exponential integrators.

general physics↗

Godiva IV Simulated Radiation Field Characterization and Variance Reduction

Godiva IV is a system comprised of highly enriched uranium alloyed with molybdenum in the form of fuel plate rings. The reactor, along with its predecessors, was designed with the unique ability to satisfy interests in the super-prompt-critical reactor operation space. Originally, the reactor was part of the Los Alamos Critical Experiments Facility (LACEF) at Technical Area-18 (TA-18). The radiation field around Godiva at this facility was well characterized and understood. As a fast neutron system, the neutron spectrum in and around Godiva was close to a Watt Fission spectrum. The Kiva where Godiva IV was located at LACEF was made of thin, sheet metal walls which did not contribute significantly to the neutron spectrum. Following the transition of LACEF to the National Critical Experiments and Research Center (NCERC) in Nevada, Godiva-IV was moved from TA-18 to the Device Assembly Facility (DAF) at the Nevada National Security Site (NNSS). Part of this move brought renewed interest in radiation field characterization. The new facility introduced significant changes to the environment surrounding Godiva, and preliminary foil irradiation results suggested that the room contribution to the neutron spectrum was significant. Unlike at TA-18, a large thermal neutron signature was added to the fast spectrum from Godiva due to significant room return. A primary goal due to the additional complexity that the room return adds to the Godiva IV radiation emission spectrum was the development of an efficient Monte Carlo N-Particle (MCNP) calculation capable of characterizing the neutron spectrum anywhere in the room around Godiva. A campaign of activation foil irradiations and analysis were completed to support the validation of the MCNP model. The modeling of these foils in MCNP can be easily done with a standard volumetric neutron flux tally. However, given the multitude of locations and reaction rates to be modeled, further steps must be taken to increase the efficiency of these calculations in MCNP. During this study, a benchmark model currently under development for Godiva IV was used. A qualitative assessment of the thermal neutron contributors was performed using spatial neutron distribution plots. Additional detail was added to the model based on the qualitative results showing the thermal spectrum’s large sensitivity to hydrogenous material. Neutron energy spectra was evaluated at discrete locations in the room around Godiva to quantify the relative contribution of various components. It was discovered that the concrete walls are the largest contributor to the thermal signature, with minor contributions from plastic components surrounding Godiva. Following these results, two different variance reduction techniques were implemented to improve the problem efficiency in these calculations. In the first approach, an F5 point detector tally was implemented in the standard Godiva IV criticality problem. The second approach involved a weight-window generator implementation with an F5 point detector tally in a fixed source problem. The weight window implementation reduced the runtime from 42739.55 minutes to 1803.34 minutes (computer time), compared to the F5 KCODE implementation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Chance Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty

When uncontrollable resources fluctuate, Optimum Power Flow (OPF), routinely used by the electric power industry to re-dispatch hourly controllable generation (coal, gas and hydro plants) over control areas of transmission networks, can result in grid instability, and, potentially, cascading outages. This risk arises be cause OPF dispatch is computed without awareness of major uncertainty, in particular fluctuations in renewable output. As a result, grid operation under the OPF with renewable variability can lead to frequent conditions where power line flow ratings are significantly exceeded. Such a condition, which is borne by simulations of real grids, would likely resulting in automatic line tripping to protect lines from thermal stress, a risky and undesirable outcome which compromises stability. Smart grid goals include a commitment to large penetration of highly fluctuating renewables, thus calling to reconsider current practices, in particular the use of standard OPF. Our Chance Constrained (CC) OPF corrects the problem and mitigates dangerous renewable fluctuations with minimal changes in the current operational procedure. Assuming availability of a reliable wind forecast parameterizing the distribution function of the uncertain generation, our CC-OPF satisfies all the constraints with high probability while simultaneously minimizing the cost of economic re-dispatch. CC-OPF allows efficient implementation, e.g. solving a typical instance over the 2746-bus Polish network in 20s on a standard laptop.

Energy Planning, Policy, & Economy(29)↗

Resonance form factors from finite-volume correlation functions with the external field method

A novel method for the extraction of form factors of unstable particles on the lattice is proposed. The approach is based on the study of two-particle scattering in a static, spatially periodic external field by using a generalization of the Lüscher method in the presence of such a field. It is shown that the resonance form factor is given by the derivative of the resonance pole position in the complex plane with respect to the coupling constant to the external field. Unlike the standard approach, this proposal does not suffer from problems caused by the presence of the triangle diagram.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗

The Central Limit Theorem for Supercritical Oriented Percolation in Two Dimensions

We consider the cardinality of supercritical oriented bond percolation in two dimensions. We show that, whenever the the origin is conditioned to percolate, the process appropriately normalized converges asymptotically in distribution to the standard normal law. This resolves a longstanding open problem pointed out to in several instances in the literature. The result applies also to the continuous-time analog of the process, viz. the basic one-dimensional contact process. We also derive general random-indices central limit theorems for associated random variables as byproducts of our proof.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computational complexity of the landscape II—Cosmological considerations

We propose a new approach for multiverse analysis based on computational complexity, which leads to a new family of “computational” measure factors. By defining a cosmology as a space–time containing a vacuum with specified properties (for example small cosmological constant) together with rules for how time evolution will produce the vacuum, we can associate global time in a multiverse with clock time on a supercomputer which simulates it. We argue for a principle of “limited computational complexity” governing early universe dynamics as simulated by this supercomputer, which translates to a global measure for regulating the infinities of eternal inflation. The rules for time evolution can be thought of as a search algorithm, whose details should be constrained by a stronger principle of “minimal computational complexity”. Unlike previously studied global measures, ours avoids standard equilibrium considerations and the well-known problems of Boltzmann Brains and the youngness paradox. We also give various definitions of the computational complexity of a cosmology, and argue that there are only a few natural complexity classes.

79 ASTRONOMY AND ASTROPHYSICS↗

The reduced basis method for the electric field integral equation

We introduce the reduced basis method (RBM) as an efficient tool for parametrized scattering problems in computational electromagnetics for problems where field solutions are computed using a standard Boundary Element Method (BEM) for the parametrized electric field integral equation (EFIE). This combination enables an algorithmic cooperation which results in a two step procedure. The first step consists of a computationally intense assembling of the reduced basis, that needs to be effected only once. In the second step, we compute output functionals of the solution, such as the Radar Cross Section (RCS), independently of the dimension of the discretization space, for many different parameter values in a many-query context at very little cost. Parameters include the wavenumber, the angle of the incident plane wave and its polarization.

97 MATHEMATICS AND COMPUTING↗

Top-down estimate of anthropogenic emission inventories and their interannual variability in Houston using a mesoscale inverse modeling technique

The 2000 and 2006 Texas Air Quality Study (TexAQS 2000 and 2006) field campaigns took place in eastern Texas in August-October of 2000 and 2006. Several flights of the National Oceanic and Atmospheric Administration (NOAA) and National Center for Atmospheric Research (NCAR) research aircraft were dedicated to characterizing anthropogenic emissions over Houston. Houston is known for having serious problems with non-attainment of air quality standards. We present a method that uses three models and aircraft observations to assess and improve existing emission inventories using an inverse modeling technique. We used 3-dimensional and 4-dimensional variational (3D-VAR and 4D-VAR) inverse modeling techniques based on a least-squares method to improve the spatial and temporal distribution of CO, NOy (sum of all reactive nitrogen compounds), and SO2 emissions predicted by the 4-km-resolution U.S. Environmental Protection Agency (EPA) National Emission Inventory (NEI) for 2005. Differences between the prior and posterior inventories are discussed in detail. We found that in 2006 the prior daytime emissions in the urban area of Houston have to be reduced by 40% {+-} 12% for CO and 7% {+-} 13% for NOy. Over the Houston Ship Channel, where industrial emissions are predominant, the prior emissions have to be reduced by 41% {+-} 15% for CO and 51% {+-} 9% for NOy. Major ports around Houston have their NOy emissions reduced as well, probably due to uncertainties in near-shore ship emissions in the EPA NEI inventory. Using the measurements from the two field campaigns, we assessed the interannual emission variability between 2000 and 2006. Daytime CO emissions from the Houston urban area have been reduced by 8% {+-} 20%, while the NOy emissions have increased by 20% {+-} 12% from 2000 to 2006. In the Houston Ship Channel, the daytime NOy emissions have increased by 13% {+-} 17%. Our results show qualitative consistencies with known changes in Houston emissions sources.

54 ENVIRONMENTAL SCIENCES↗

A generalized Debye source approach to electromagnetic scattering in layered media

The standard solution to time-harmonic electromagnetic scattering problems in homogeneous layered media relies on the use of the electric field dyadic Green's function. However, for small values of the governing angular frequency ω, evaluation of the electric field using this Green's function exhibits numerical instability. In this short note, we provide an alternative approach which is immune from this low-frequency breakdown as ω → 0. Our approach is based on the generalized Debye source representation of Maxwell fields. Using this formulation, the electric and magnetic fields gracefully decouple in the static limit, a behavior similar to that of the classical Lorenz-Debye-Mie representation of Maxwell fields in spherical geometries. We derive extensions of both the generalized Deybe source and Lorenz-Debye-Mie representations to planar geometries, as well as provide equations for the solution of scattering from a perfectly conducting half-space and in layered media using a Sommerfeld-like approach. These formulas are stable as ω tends to zero, and offer alternatives to the electric field dyadic Green's function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Inverse scattering theory: Inverse scattering series method for one dimensional non-compact support potential

The reversion of the Born-Neumann series of the Lippmann-Schwinger equation is one of the standard ways to solve the inverse acoustic scattering problem. One limitation of the current inversion methods based on the reversion of the Born-Neumann series is that the velocity potential should have compact support. However, this assumption cannot be satisfied in certain cases, especially in seismic inversion. Based on the idea of distorted wave scattering, we explore an inverse scattering method for velocity potentials without compact support. The strategy is to decompose the actual medium as a known single interface reference medium, which has the same asymptotic form as the actual medium and a perturbative scattering potential with compact support. After introducing the method to calculate the Green’s function for the known reference potential, the inverse scattering series and Volterra inverse scattering series are derived for the perturbative potential. Analytical and numerical examples demonstrate the feasibility and effectiveness of this method. Besides, to ensure stability of the numerical computation, the Lanczos averaging method is employed as a filter to reduce the Gibbs oscillations for the truncated discrete inverse Fourier transform of each order. Our method provides a rigorous mathematical framework for inverse acoustic scattering with a non-compact support velocity potential.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Filling data analysis gaps in time-resolved crystallography by machine learning

There is a growing understanding of the structural dynamics of biological molecules fueled by x-ray crystallography experiments. Time-resolved serial femtosecond crystallography (TR-SFX) with x-ray Free Electron Lasers allows the measurement of ultrafast structural changes in proteins. Nevertheless, this technique comes with some limitations. One major challenge is the quality of data from TR-SFX measurements, which often faces issues like data sparsity, partial recording of Bragg reflections, timing errors, and pixel noise. To overcome these difficulties, conventionally, large volumes of data are collected and grouped into a few temporal bins. The data in each bin are then averaged and paired with the mean of their corresponding jittered timestamps. This procedure provides one structure per bin, resulting in a limited number of averaged structures for the entire time interval spanned by the experiment. Therefore, the information on ultrafast structural dynamics at high temporal resolution is lost. This has initiated research for advanced methods of analyzing experimental TR-SFX data beyond the standard binning and averaging method. To address this problem, we use a machine learning algorithm called Nonlinear Laplacian Spectral Analysis (NLSA), which has emerged as a promising technique for studying the dynamics of complex systems. In this work, we demonstrate the power of this algorithm using synthetic x-ray diffraction snapshots from a protein with significant data incompleteness, timing uncertainties, and noise. Our study confirms that NLSA is a suitable approach that effectively mitigates the effects of these artifacts in TR-SFX data and recovers accurate structural dynamics information hidden in such data.

Trujillo, Justin (ORCID:0000000285505360)↗

The spectral properties of distributions and asymptotic methods in perturbation theory

For differential equations of the form x'={epsilon}f(t,x;{epsilon}) in a Banach space a modification of the classical Krylov-Bogolyubov method is put forward. It allows complications in the construction of higher-order approximations which stem from the 'small denominators problem' to be avoided and many of the standard constraints on the behaviour of the function f to be eliminated. The approach suggested is based on some results on the Fourier transforms of distributions. Bibliography: 17 titles.

97 MATHEMATICS AND COMPUTING↗

Low-scale supersymmetry from inflation

We investigate an inflation model with the inflaton being identified with a Higgs boson responsible for the breaking of U(1){sub B−L} symmetry. We show that supersymmetry must remain a good symmetry at scales one order of magnitude below the inflation scale, in order for the inflation model to solve the horizon and flatness problems, as well as to account for the observed density perturbation. The upper bound on the soft supersymmetry breaking mass lies between 1 TeV and 10{sup 3} TeV. Interestingly, our finding opens up a possibility that universes with the low-scale supersymmetry are realized by the inflationary selection. Our inflation model has rich implications; non-thermal leptogenesis naturally works, and the gravitino and moduli problems as well as the moduli destabilization problem can be solved or ameliorated; the standard-model higgs boson receives a sizable radiative correction if the supersymmertry breaking takes a value on the high side ∼ 10{sup 3} TeV.

79 ASTRONOMY AND ASTROPHYSICS↗

Freedom of the mixer rotation axis improves performance in the quantum approximate optimization algorithm

Variational quantum algorithms such as the quantum approximate optimization algorithm (QAOA) are particularly attractive candidates for implementation on near-term quantum processors. As hardware realities such as error and qubit connectivity will constrain achievable circuit depth in the near future, new ways to achieve high performance at low depth are of great interest. In this work, we present a modification to QAOA that adds additional variational parameters in the form of freedom of the rotation axis in the XY plane of the mixer Hamiltonian. Here, via numerical simulation, we show that this leads to a drastic performance improvement over standard QAOA at finding solutions to the MaxCut problem on graphs of up to seven qubits. Furthermore, we explore the Z-phase error mitigation properties of our modified Ansatz, its performance under a realistic error model for a neutral atom quantum processor, and the class of problems it can solve in a single round.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Imaginary Time Propagation on a Quantum Chip

We report evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems, and the heart of a number of numerical methods that have been used with great success in quantum chemistry, condensed matter, and nuclear physics. We propose an algorithm to implement imaginary time propagation on a quantum computer. Our algorithm is devised in the context of an efficient encoding into an optimized gate, drawing on the underlying characteristics of the quantum device of a unitary operation in an extended Hilbert space. However, we prove that for simple problems it can also be successfully applied to standard digital quantum machines. This work paves the way for porting quantum many-body methods based on imaginary-time propagation to near-term quantum devices, enabling the future quantum simulation of the ground states of a broad class of microscopic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Auxiliary-field quantum Monte Carlo method for strongly paired fermions

We solve the zero-temperature unitary Fermi gas problem by incorporating a BCS importance function into the auxiliary-field quantum Monte Carlo method. We demonstrate that this method does not suffer from a sign problem and that it increases the efficiency of standard techniques by many orders of magnitude for strongly paired fermions. We calculate the ground-state energies exactly for unpolarized systems with up to 66 particles on lattices of up to 27{sup 3} sites, obtaining an accurate result for the universal parameter {xi}. We also obtain results for interactions with different effective ranges and find that the energy is consistent with a universal linear dependence on the product of the Fermi momentum and the effective range. This method will have many applications in superfluid cold atom systems and in both electronic and nuclear structures where pairing is important.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗