Search NASA⌕ Search

SEARCH · Search NASA

Results for “Linear Optimization”

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 1,603 records · Page 89

Invited Review Article: Measurement uncertainty of linear phase-stepping algorithms

Phase retrieval techniques are widely used in optics, imaging and electronics. Originating in signal theory, they were introduced to interferometry around 1970. Over the years, many robust phase-stepping techniques have been developed that minimize specific experimental influence quantities such as phase step errors or higher harmonic components of the signal. However, optimizing a technique for a specific influence quantity can compromise its performance with regard to others. We present a consistent quantitative analysis of phase measurement uncertainty for the generalized linear phase stepping algorithm with nominally equal phase stepping angles thereby reviewing and generalizing several results that have been reported in literature. All influence quantities are treated on equal footing, and correlations between them are described in a consistent way. For the special case of classical N-bucket algorithms, we present analytical formulae that describe the combined variance as a function of the phase angle values. For the general Arctan algorithms, we derive expressions for the measurement uncertainty averaged over the full 2{pi}-range of phase angles. We also give an upper bound for the measurement uncertainty which can be expressed as being proportional to an algorithm specific factor. Tabular compilations help the reader to quickly assess the uncertainties that are involved with his or her technique.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Overview of recent trends and developments for BPM systems

Beam position monitoring (BPM) systems are the workhorse of beam diagnostics for almost any kind of charged particle accelerator: linear, circular or transport-lines, operating with leptons, hadrons or heavy ions. BPMs are essential for beam commissioning, accelerator fault analysis and trouble shooting, machine optics, as well as lattice measurements, and finally, for accelerator optimization, in order to achieve the ultimate beam quality. This presentation summarizes the efforts of the beam instrumentation community on recent developments and advances on BPM technologies, i.e. BPM pickup monitors and front-end electronics (analog and digital). Principles, examples, and state-of-the-art status on various BPM techniques, serving hadron and heavy ion machines, sync light synchrotron's, as well as electron linacs for FEL or HEP applications are outlined.

43 PARTICLE ACCELERATORS↗

Impact of Linearity and Write Noise of Analog Resistive Memory Devices in a Neural Algorithm Accelerator

Resistive memory (ReRAM) shows promise for use as an analog synapse element in energy-efficient neural network algorithm accelerators. A particularly important application is the training of neural networks, as this is the most computationally-intensive procedure in using a neural algorithm. However, training a network with analog ReRAM synapses can significantly reduce the accuracy at the algorithm level. In order to assess this degradation, analog properties of ReRAM devices were measured and hand-written digit recognition accuracy was modeled for the training using backpropagation. Bipolar filamentary devices utilizing three material systems were measured and compared: one oxygen vacancy system, Ta-TaO x , and two conducting metallization systems, Cu-SiO 2 , and Ag/chalcogenide. Analog properties and conductance ranges of the devices are optimized by measuring the response to varying voltage pulse characteristics. Key analog device properties which degrade the accuracy are update linearity and write noise. Write noise may improve as a function of device manufacturing maturity, but write nonlinearity appears relatively consistent among the different device material systems and is found to be the most significant factor affecting accuracy. As a result, this suggests that new materials and/or fundamentally different resistive switching mechanisms may be required to improve device linearity and achieve higher algorithm training accuracy.

97 MATHEMATICS AND COMPUTING↗

Dynamic Multi-Sensor Multi-Mission Optimal Planning Tool

Remote sensing systems have firmly established a role in providing immense value to commercial industry, scientific exploration, and national security. Continued maturation of sensing technology has reduced the cost of deploying highly-capable sensors while at the same time increased reliance on the information these sensors can provide. The demand for time on these sensors is unlikely to diminish. Coordination of next-generation sensor systems, larger constellations of satellites, unmanned aerial vehicles, ground telescopes, etc. is prohibitively complex for existing heuristics-based scheduling techniques. The project was a two-year collaboration spanning multiple Sandia centers and included a partnership with Texas A&M University. We have developed algorithms and software for collection scheduling, remote sensor field-of-view pointing models, and bandwidth-constrained prioritization of sensor data. Our approach followed best practices from the operations research and computational geometry communities. These models provide several advantages over state of the art techniques. In particular, our approach is more flexible compared to heuristics that tightly couple models and solution techniques. First, our mixed-integer linear models afford a rigorous analysis so that sensor planners can quantitatively describe a schedule relative to the best possible. Optimal or near-optimal schedules can be produced with commercial solvers in operational run-times. These models can be modified and extended to incorporate different scheduling and resource constraints and objective function definitions. Further, we have extended these models to proactively schedule sensors under weather and ad hoc collection uncertainty. This approach stands in contrast to existing deterministic schedulers which assume a single future weather or ad hoc collection scenario. The field-of-view pointing algorithm produces a mosaic with the fewest number of images required to fully cover a region of interest. The bandwidth-constrained algorithms find the highest priority information that can be transmitted. All of these are based on mixed-integer linear programs so that, in the future, collection scheduling, field-of-view, and bandwidth prioritization can be combined into a single problem. Experiments conducted using the developed models, commercial solvers, and benchmark datasets have demonstrated that proactively scheduling against uncertainty regularly and significantly outperforms deterministic schedulers.

47 OTHER INSTRUMENTATION↗

Optimizing the FEDVR-TDCC Code for Exploring the Quantum Dynamics of Two-Electron Systems in Intense Laser Pulses

To efficiently solve the three-dimensional (3D) time-dependent linear and nonlinear Schrödinger equation, we have developed a large-scale parallel code RSP-FEDVR [B. I. Schneider, L. A. Collins, and S. X. Hu, Phys. Rev. E 73, 036708 (2006)], which combines the finite-element discrete variable representation (FEDVR) with the real-space product algorithm. Using the similar algorithm, we have derived an accurate approach to solve the time-dependent close-coupling (TDCC) equation for exploring two-electron dynamics in linearly polarized intense laser pulses. However, when the number N of partial waves used for the TDCC expansion increases, the FEDVR-TDCC code unfortunately slows down, because the potential-matrix operation scales as ~O(N^2). In this paper, we show that the full potential-matrix operation can be decomposed into a series of small-matrix operations utilizing the sparse property of the N N potential matrix. Such optimization speeds up the FEDVR-TDCC code by an order of magnitude for N=256. This may facilitate the ultimate solution to the 3D two-electron quantum dynamics in ultrashort intense optical laser pulses, where a large number of partial waves are required.

Hu, S X↗

Advanced Shuttle Strategies for Parallel QCCD Architectures

Trapped ions (TIs) are at the forefront of quantum computing implementation, offering unparalleled coherence, fidelity, and connectivity. However, the scalability of TI systems is hampered by the limited capacity of individual ion traps, necessitating intricate ion shuttling for advanced computational tasks. The quantum charge-coupled device (QCCD) framework has emerged as a promising solution, facilitating ion mobility for universal quantum computation. Current QCCD architectures predominantly feature a linear topology, which is increasingly recognized as inefficient for complex quantum operations. Anticipating the shift toward more efficacious designs, this article introduces an innovative quantum scheduling strategy optimized for parallel QCCD topologies. Our strategy proposes a probabilistic formula for ion movement, alongside ingenious methods for local layer generation and layer compression, yielding a significant reduction in ion shuttle times. Through simulations, we demonstrate that our strategy not only substantially outstrips the linear model but also exhibits better performance over other parallel strategies that employ greedy algorithms. This is achieved through our nuanced resolution of complexities, such as traffic blocks and trap capacity limitations. The consequent reduction in shuttle operations leads to lower energy consumption and an enhancement in the quantum computer's fidelity, ultimately accelerating program execution times.

43 PARTICLE ACCELERATORS↗

SU-E-J-239: IMRT Planning of Prostate Cancer for a MRI-Linac Based On MRI Only

Purpose: : To investigate dosimetric differences between MRI- and CT-based IMRT planning for prostate cancer, the impact of a magnetic field in a MRI-Linac, and to explore the feasibility of IMRT planning based on MRI alone. Methods: IMRT plans were generated based on CT and MRI images acquired on two representative prostate-cancer patients using clinical dose volume constraints. A research planning system (Monaco, Elekta), which employs a Monte Carlo dose engine and includes a perpendicular magnetic field of 1.5T from an MRI-Linac, was used. Bulk electron density assignments based on organ-specific values from ICRU 46 were used to convert MRI (T2) to pseudo CT. With the same beam configuration as in the original CT plan, 5 additional plans were generated based on CT or MRI, with or without optimization (i.e., just recalculation) and with or without the magnetic field. The plan quality in terms of commonly used dose volume (DV) parameters for all plans was compared. The statistical uncertainty on dose was < 1%. Results: For plans with the same contour set but without re-optimization, the DV parameters were different from those for the original CT plan, mostly less than 5% with a few exceptions. These differences were reduced to mostly less than 3% when the plans were re-optimized. For plans with contours from MRI, the differences in the DV parameters varied depending on the difference in the contours as compared to CT. For the optimized plans with contours from MR, the differences for PTV were less than 3%. Conclusion: The prostate IMRT plans based on MRI-only for a MR-Linac were practically similar as compared to the CT plan under the same beam and optimization configuration if the difference on the structure delineation is excluded, indicating the feasibility of using MRI-only for prostate IMRT.

60 APPLIED LIFE SCIENCES↗

Hydrogen bond arrangements in (H 2 O) 20, 24, 28 clathrate hydrate cages: Optimization and many-body analysis

Here we provide a detailed study of hydrogen bonding arrangements, relative stability, residual entropy, and an analysis of the many-body effects in the (H 2 O) 20 (D-cage), (H 2 O) 24 (T-cage), and (H 2 O) 28 (H-cage) hollow cages making up structures I (sI) and II (sII) of clathrate hydrate lattices. Based on the enumeration of the possible hydrogen bonding networks for a fixed oxygen atom scaffold, the residual entropy (S 0 ) of these three gas phase cages was estimated at 0.754 82, 0.754 44, and 0.754 17 · Nk b , where N is the number of molecules and k b is Boltzmann’s constant. A previously identified descriptor of enhanced stability based on the relative arrangement and connectivity of nearest-neighbor fragments on the polyhedral water cluster [strong-weak-effective-bond model] also applies to the larger hollow cages. The three cages contain a maximum of 7, 9, and 11 such preferable arrangements of trans nearest dimer pairs with one “free” OH bond on the donor molecule (t1d dimers). The Many-Body Expansion (MBE) up to the 4-body suggests that the many-body terms vary nearly linearly with the cluster binding energy. Using a hierarchical approach of screening the relative stability of networks starting from optimizations with the TIP4P, TTM2.1-F, and MB-pol classical potentials, subsequently refining at more accurate levels of electronic structure theory (DFT and MP2), and finally correcting for zero-point energy, we were able to identify a group of four low-lying isomers of the (H 2 O) 24 T-cage, two of which are antisymmetric and the other two form a pair of antipode configurations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A General Stochastic Maximum Principle for SDEs of Mean-field Type

We study the optimal control for stochastic differential equations (SDEs) of mean-field type, in which the coefficients depend on the state of the solution process as well as of its expected value. Moreover, the cost functional is also of mean-field type. This makes the control problem time inconsistent in the sense that the Bellman optimality principle does not hold. For a general action space a Peng's-type stochastic maximum principle (Peng, S.: SIAM J. Control Optim. 2(4), 966-979, 1990) is derived, specifying the necessary conditions for optimality. This maximum principle differs from the classical one in the sense that here the first order adjoint equation turns out to be a linear mean-field backward SDE, while the second order adjoint equation remains the same as in Peng's stochastic maximum principle.

97 MATHEMATICS AND COMPUTING↗

A Maximum Principle for SDEs of Mean-Field Type

We study the optimal control of a stochastic differential equation (SDE) of mean-field type, where the coefficients are allowed to depend on some functional of the law as well as the state of the process. Moreover the cost functional is also of mean-field type, which makes the control problem time inconsistent in the sense that the Bellman optimality principle does not hold. Under the assumption of a convex action space a maximum principle of local form is derived, specifying the necessary conditions for optimality. These are also shown to be sufficient under additional assumptions. This maximum principle differs from the classical one, where the adjoint equation is a linear backward SDE, since here the adjoint equation turns out to be a linear mean-field backward SDE. As an illustration, we apply the result to the mean-variance portfolio selection problem.

97 MATHEMATICS AND COMPUTING↗

Minimax theorems in fuzzy metric spaces

A minimax theorem is a theorem providing conditions which guarantee that the max–min inequality is also an equality. The first theorem in this sense is von Neumann’s minimax theorem, which was considered the starting point of game theory. Since then, several alternative generalizations of von Neumann’s original theorem have appeared in the literature. Variational inequality and minimax problems are of fundamental importance in modern non-linear analysis. They are widely applied in mechanics, differential equations, control theory, mathematical economics, game theory, and optimization. The purpose of this paper is first to establish a minimax theorem for mixed lower–upper semi-continuous functions in fuzzy metric spaces which extends the minimax theorems of many von Neumann types. As applications, we utilize this result to study the existence problems of solutions for abstract variational inequalities and quasi-variational inequalities in fuzzy metric spaces and to study the coincidence problems and saddle problems in fuzzy metric spaces.

97 MATHEMATICS AND COMPUTING↗

Bridging paradigms: Designing for HPC-Quantum convergence

Here, this paper presents a comprehensive software stack architecture for integrating quantum computing (QC) capabilities with High-Performance Computing (HPC) environments. While quantum computers show promise as specialized accelerators for scientific computing, their effective integration with classical HPC systems presents significant technical challenges. We propose a hardware-agnostic software framework that supports both current noisy intermediate-scale quantum devices and future fault-tolerant quantum computers, while maintaining compatibility with existing HPC workflows. The architecture includes a quantum gateway interface, standardized APIs for resource management, and robust scheduling mechanisms to handle both simultaneous and interleaved quantum–classical workloads. Key innovations include: (1) a unified resource management system that efficiently coordinates quantum and classical resources, (2) a flexible quantum programming interface that abstracts hardware-specific details, (3) A Quantum Platform Manager API that simplifies the integration of various quantum hardware systems, and (4) a comprehensive tool chain for quantum circuit optimization and execution. We demonstrate our architecture through implementation of quantum–classical algorithms, including the variational quantum linear solver, showcasing the framework’s ability to handle complex hybrid workflows while maximizing resource utilization. This work provides a foundational blueprint for integrating QC capabilities into existing HPC infrastructures, addressing critical challenges in resource management, job scheduling, and efficient data movement between classical and quantum resources.

97 MATHEMATICS AND COMPUTING↗

Pore-scale simulation of gas flow in microscopic permeable media with complex geometries

Lattice Boltzmann method (LBM) is an efficient tool to perform direct numerical simulation of gas flow in micro-size pores. Despite great advances in LBM and its use in describing gas flow in micro-size channels in slip and transitional flow regimes, exploring formulations that are able to capture flow behavior in domains with complex boundary geometries remains a challenging task. As a result, the impact of complexities in pore structures on gas flow may not be fully explored using LBM. In this study, we propose to use the combined bounce-back and Maxwellian diffusive reflection scheme to capture the slip velocity with a new set of slip coefficients. Optimal values of slip coefficients are determined using a gradient based method, where the results from the linearized Boltzmann equation is used as the reference solution. The proposed formulation is further validated against predictions from molecular dynamics simulation in the presence of complex geometries by introducing obstacles of different shapes in straight channels. LBM with the proposed boundary treatment is then used to investigate gas flow in a synthetic microscopic permeable medium. Here, results indicate that gas exhibits different flow configurations as Knudsen number varies, and apparent gas permeability appears to have up to a second-order dependency on the reciprocal mean pressure in slip and transitional flow regimes.

03 NATURAL GAS↗

Etendue-matched two-stage concentrators with multiple receivers

A possible way to concentrate sun light is by using a Fresnel reflector: a large number of small mirrors (called heliostats) that mimic the behavior of a large concentrator, replacing it. These heliostats can move to track the sun, keeping its light concentrated onto the receiver. Fresnel concentrators, however, may have important losses. If the heliostats are spaced from each other, some light will miss them and be lost. If the heliostats are close to each other, they will block part of each other's reflected light, also producing losses. One possible way to minimize these losses is to intersect two focusing Fresnel concentrators forming a Compact Linear Fresnel Reflector - CLFR. Although improving on a simple focusing Fresnel concentrator, these optics are still not optimal. Here new geometries for Fresnel reflectors are explored, minimizing their losses and increasing their concentration. This is achieved by changing the overall shape of the primary, making it a wave-shaped trough surface and/or by allowing for a variable size and shape of the heliostats as a function of the position in the heliostat field. These new Fresnel concentrators may also be combined with secondaries significantly improving their total concentration, which now approaches the theoretical maximum. (author)

14 SOLAR ENERGY↗

Structure and proton conduction in sulfonated poly(ether ether ketone) semi-permeable membranes: a multi-scale computational approach.

The design of polymeric membranes for proton or ionic exchange highly depends on the fundamental understanding of the physical and molecular mechanisms that control the formation of the conduction channels. There is an inherent relation between the dynamical structure of the polymeric membrane and the electrostatic forces that drive membrane segregation and proton transport. Here, we used a multi-scale computational approach to analyze the morphology of sulfonated poly(ether ether ketone) membranes at the mesoscale. A self-consistent description of the electrostatic phenomenon was adopted, where discrete polymer chains and a continuum proton field were embedded in a continuum fluid. Brownian dynamics was used for the evolution of the suspended polymer molecules, while a convection-diffusion transport equation, including the Nernst-Planck diffusion mechanism, accounted for the dynamics of the proton concentration field. We varied the polymer concentration, the degree of sulfonation and the level of confinement to find relationships between membrane structure and proton conduction. Our results indicate that the reduced mobility of polymer chains, at concentrations above overlap, and a moderate degree of sulfonation -i.e., 30% - are essential elements for membrane segregation and proton domain connectivity. These conditions also ensure that the membrane structure is not affected by size or by potential gradients. Importantly, our analysis shows that membrane conductivity and current are linearly dependent on polymer concentration and quadratically dependent on the degree of sulfonation. We found that the optimal polymeric membrane design requires a polymer concentration above overlap and a degree of sulfonation around 50%. These conditions promote a dynamical membrane morphology with a constant density of proton channels. Our results and measurements agree with previous experimental works, thereby validating our model and observations.

Molina, Jarol↗

Multi-component symmetry-projected approach for molecular ground state correlations

The symmetry-projected Hartree–Fock ansatz for the electronic structure problem can efficiently account for static correlation in molecules, yet it is often unable to describe dynamic correlation in a balanced manner. Here, we consider a multi-component, systematically improvable approach, that accounts for all ground state correlations. Our approach is based on linear combinations of symmetry-projected configurations built out of a set of non-orthogonal, variationally optimized determinants. The resulting wavefunction preserves the symmetries of the original Hamiltonian even though it is written as a superposition of deformed (broken-symmetry) determinants. We show how short expansions of this kind can provide a very accurate description of the electronic structure of simple chemical systems such as the nitrogen and the water molecules, along the entire dissociation profile. In addition, we apply this multi-component symmetry-projected approach to provide an accurate interconversion profile among the peroxo and bis(μ-oxo) forms of [Cu{sub 2}O{sub 2}]{sup 2+}, comparable to other state-of-the-art quantum chemical methods.

74 ATOMIC AND MOLECULAR PHYSICS↗

PRIMORDIAL GRAVITATIONAL WAVE DETECTABILITY WITH DEEP SMALL-SKY COSMIC MICROWAVE BACKGROUND EXPERIMENTS

We use the Bayesian estimation on direct T - Q - U cosmic microwave background (CMB) polarization maps to forecast errors on the tensor-to-scalar power ratio r, and hence on primordial gravitational waves, as a function of sky coverage f{sub sky}. This map-based likelihood filters the information in the pixel-pixel space into the optimal combinations needed for r detection for cut skies, providing enhanced information over a first-step linear separation into a combination of E, B, and mixed modes, and ignoring the latter. With current computational power and for typical resolutions appropriate for r detection, the large matrix inversions required are accurate and fast. Our simulations explore two classes of experiments, with differing bolometric detector numbers, sensitivities, and observational strategies. One is motivated by a long duration balloon experiment like Spider, with pixel noise {proportional_to}{radical}(f{sub sky}) for a specified observing period. This analysis also applies to ground-based array experiments. We find that, in the absence of systematic effects and foregrounds, an experiment with Spider-like noise concentrating on f{sub sky} {approx} 0.02-0.2 could place a 2{sigma}{sub r} Almost-Equal-To 0.014 boundary ({approx}95% confidence level), which rises to 0.02 with an l-dependent foreground residual left over from an assumed efficient component separation. We contrast this with a Planck-like fixed instrumental noise as f{sub sky} varies, which gives a Galaxy-masked (f{sub sky} = 0.75) 2{sigma}{sub r} Almost-Equal-To 0.015, rising to Almost-Equal-To 0.05 with the foreground residuals. Using as the figure of merit the (marginalized) one-dimensional Shannon entropy of r, taken relative to the first 2003 WMAP CMB-only constraint, gives -2.7 bits from the 2012 WMAP9+ACT+SPT+LSS data, and forecasts of -6 bits from Spider (+ Planck); this compares with up to -11 bits for CMBPol, COrE, and PIXIE post-Planck satellites and -13 bits for a perfectly noiseless cosmic variance limited experiment. We thus confirm the wisdom of the current strategy for r detection of deeply probed patches covering the f{sub sky} minimum-error trough with balloon and ground experiments.

79 ASTRONOMY AND ASTROPHYSICS↗

Achievable noise performance of spectroscopic prototype DEPFET detectors

A new generation of spectroscopic X-ray DEPFET detectors has been produced here in the course of the detector development for the Wide Field Imager (WFI) of Athena. These devices served to perform a detailed analysis of the noise composition, which was enabled by the development of appropriate test algorithms. A result of the analysis is the distinction of different components, which sum up to the total noise. In particular the contribution of shot noise, white noise and 1/f noise to the readout noise is determined as well as the signal noise caused by the generation of charge carriers. The resulting parametrization enables the adaptation and optimization of operation modes to given purposes. The studied prototype detectors included 64×64 pixels with a linear gate design and provided an excellent noise, below 1.6 e - ENC at a readout time faster than 10 μs/pixel and a temperature of -80 °C in rolling-shutter operation. This performance is enabled by an extended signal integration time. A further noise reduction is prevented by the signal noise, caused by charge carrier generation. In order to demonstrate the low noise properties of the DEPFET transistor, the measurement conditions were adapted and a noise of 0.95 e - ENC was measured at the expense of the sensor size—by operating only parts of the sensor in window mode—and dynamic range—by using the Al Kα line at about 1.49 keV for calibration.

47 OTHER INSTRUMENTATION↗