SEARCH · Engineering Papers

Results for “approximation algorithm”

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.

SourceResearch connectionFrom yearThrough year

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

At least 1,747 records · Page 97

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)

The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.

127 Qubits↗

NASA NTRS1983

A Computer Program for the Calculation of Three-Dimensional Transonic Nacelle/Inlet Flowfields

A highly efficient computer analysis was developed for predicting transonic nacelle/inlet flowfields. This algorithm can compute the three dimensional transonic flowfield about axisymmetric (or asymmetric) nacelle/inlet configurations at zero or nonzero incidence. The flowfield is determined by solving the full-potential equation in conservative form on a body-fitted curvilinear computational mesh. The difference equations are solved using the AF2 approximate factorization scheme. This report presents a discussion of the computational methods used to both generate the body-fitted curvilinear mesh and to obtain the inviscid flow solution. Computed results and correlations with existing methods and experiment are presented. Also presented are discussions on the organization of the grid generation (NGRIDA) computer program and the flow solution (NACELLE) computer program, descriptions of the respective subroutines, definitions of the required input parameters for both algorithms, a brief discussion on interpretation of the output, and sample cases to illustrate application of the analysis.

Vadyak, J.↗

DOE OSTI2020

Optimized Lie–Trotter–Suzuki decompositions for two and three non-commuting terms

Lie–Trotter–Suzuki decompositions are an efficient way to approximate operator exponentials exp ( t H ) when H is a sum of n (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution algorithms for tensor network states, digital quantum simulation protocols, path integral methods like quantum Monte Carlo, and splitting methods for symplectic integrators in classical Hamiltonian systems. Here, we provide optimized decompositions up to order t 6 . The leading error term is expanded in nested commutators (Hall bases) and we minimize the 1-norm of the coefficients. For n = 2 terms, several of the optima we find are close to those in McLachlan (1995). Generally, our results substantially improve over unoptimized decompositions by Forest, Ruth, Yoshida, and Suzuki. We explain why these decompositions are sufficient to efficiently simulate any one- or two-dimensional lattice model with finite-range interactions. This follows by solving a partitioning problem for the interaction graph.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Automated workflow for non-empirical Wannier-localized optimal tuning of range-separated hybrid functionals

Here, we introduce an automated workflow for generating non-empirical Wannier-localized optimally-tuned screened range-separated hybrid (WOT-SRSH) functionals. WOT-SRSH functionals have been shown to yield highly accurate fundamental band gaps, band structures, and optical spectra for bulk and 2D semiconductors and insulators. Our workflow automatically and efficiently determines the WOT-SRSH functional parameters for a given crystal structure and composition, approximately enforcing the correct screened long-range Coulomb interaction and an ionization potential ansatz. In contrast to previous manual tuning approaches, our tuning procedure relies on a new search algorithm that only requires a few hybrid functional calculations with minimal user input. We demonstrate our workflow on 23 previously studied semiconductors and insulators, reporting the same high level of accuracy. By automating the tuning process and improving its computational efficiency, the approach outlined here enables applications of the WOT-SRSH functional to compute spectroscopic and optoelectronic properties for a wide range of materials.

Gant, Stephen E. [University of California, Berkel↗

DOE OSTI2024

Recycling of silver from silicon solar cells by laser debonding

A laser-debonding approach to silver electrode recovery from solar cells is presented to address the critical need for efficient and eco-friendly recycling methods. The study explores the use of UV nanosecond and IR continuous-wave lasers to precisely debond silver electrodes from silicon wafers. By optimizing parameters like laser power, scan speed, and the number of passes, intact silver electrical contact lines were recovered from solar cells. Scanning electron microscopy with energy-dispersive X-ray spectroscopy (SEM-EDS) analysis confirmed the successful separation of silver from silicon wafers. Furthermore, an increase in the number of laser passes led to the production of silver microparticles, as validated by morphology and compositional studies using EDS. The estimated silver is approximately 90 mg for the Si solar cells of 15.4 * 15.4 cm 2 used in the study. To achieve a large area recovery of silver, a MATLAB code incorporating detection algorithms and specific criteria to automate laser scanning by accurately identifying the location of silver electrodes was developed. This presented laser debonding method is not confined to silicon solar cells but can be extended to other solar cell types featuring metal electrodes, offering a versatile solution. By minimizing the use of hazardous chemicals and reducing operational costs, the developed process aligns with the imperative of environmentally responsible photovoltaic waste management.

14 SOLAR ENERGY↗

DOE OSTI2021

Accurate frozen core approximation for all-electron density-functional theory

We implement and benchmark the frozen core approximation, a technique commonly adopted in electronic structure theory to reduce the computational cost by means of mathematically fixing the chemically inactive core electron states. The accuracy and efficiency of this approach are well controlled by a single parameter, the number of frozen orbitals. Explicit corrections for the frozen core orbitals and the unfrozen valence orbitals are introduced, safeguarding against seemingly minor numerical deviations from the assumed orthonormality conditions of the basis functions. A speedup of over twofold can be achieved for the diagonalization step in all-electron density-functional theory simulations containing heavy elements, without any accuracy degradation in terms of the electron density, total energy, and atomic forces. This is demonstrated in a benchmark study covering 103 materials across the Periodic Table and a large-scale simulation of CsPbBr3 with 2560 atoms. Our study provides a rigorous benchmark of the precision of the frozen core approximation (sub-meV per atom for frozen core orbitals below −200 eV) for a wide range of test cases and for chemical elements ranging from Li to Po. The algorithms discussed here are implemented in the open-source Electronic Structure Infrastructure software package.

Yu, Victor Wen-zhe↗

DOE OSTI2025

Predicting interface structure using the minima hopping method

Here, we adapt the minima hopping method (MHM) to the problem of interfacial structure prediction and apply it to study a canonical problem, the tilt grain boundaries in SrTiO 3 . Our method employs a hybrid approach by first exploring the potential energy surface (PES) of different grain boundary samplings with an empirical force field, among which the fifteen candidates with lower energies are then refined using ab initio density functional theory (DFT) calculations. During the exploratory stage, we bias the search using a local order parameter to primarily sample various reconstructions in the vicinity of the interface, while preserving the crystallinity of the bulk regions. We further enhance the search by incorporating initial structures with rigid body displacements to account for translational variations between bulk phases, enabling the MHM to effectively generate both stoichiometric and nonstoichiometric SrTiO 3 Σ⁢3(111)[110] and Σ⁢3(112)[110] grain boundaries. From an algorithmic standpoint, MHM outperforms earlier studies based on genetic algorithms (GA) by identifying more stable interfacial structures of several SrTiO 3 grain boundaries. The performance of the present implementation of the MHM approach is primarily limited by exploring an approximate description of the PES with a rather simple Buckingham potential. This limitation leads to variations in performance when compared to approaches utilizing more advanced surrogate PES models, such as direct DFT-PES sampling or GA with the embedded atom method (EAM). Despite the present limitations, the MHM approach is able to yield interfacial structures with comparable or lower interfacial energies in specific cases, such as Σ⁢3(111)[110] Γ=1, ±0.5 and Σ⁢3(112)[110] Γ= ±1, −2, underscoring the robustness of the MHM approach even with a simple approximation of the DFT PES. The MHM interfacial structure prediction method thus offers an efficient approach to understanding the grain boundaries and heterointerfaces at the atomic scale, providing an important prerequisite for effective materials design.

density functional theory↗

DOE OSTI2025

Towards Automated Reasoning Chains for Verification of LLM-Generated Scientific Code

With the rise of Large Language Model (LLM) generated code, including in domains like scientific computing, ensuring not only syntactical, but also mathematical correctness, has become a critical task. Traditional formal methods approaches often struggle with the ambiguity of floating-point code, and full symbolic execution is extremely costly and limited. We propose a chain-of-reasoning approach that iteratively lifts basic semantics from code into the SPIRAL system and then establishes numerical equivalency to the desired mathematical operation. Here, we leverage the ample mathematical knowledge already formalized in SPIRAL to enable the system to recognize not just different implementations of the same algorithm but fully separate approaches to solving the given problem. The chain establishes tight error bounds on the output of given code with respect to the true continuous solution it approximates, quantifying all sources of error. We demonstrate this approach by establishing the correctness of a pseudospectral solver for a simple 1-dimensional Poisson problem.

Oschatz, Quentin [Carnegie Mellon University,Pitts↗

DOE OSTI2021

Learning crystal field parameters using convolutional neural networks

We present a deep machine learning algorithm to extract crystal field (CF) Stevens parameters from thermodynamic data of rare-earth magnetic materials. The algorithm employs a two-dimensional convolutional neural network (CNN) that is trained on magnetization, magnetic susceptibility and specific heat data that is calculated theoretically within the single-ion approximation and further processed using a standard wavelet transformation. We apply the method to crystal fields of cubic, hexagonal and tetragonal symmetry and for both integer and half-integer total angular momentum values J J of the ground state multiplet. We evaluate its performance on both theoretically generated synthetic and previously published experimental data on CeAgSb _2 2 , PrAgSb _2 2 and PrMg _2 2 Cu _9 9 , and find that it can reliably and accurately extract the CF parameters for all site symmetries and values of J J considered. This demonstrates that CNNs provide an unbiased approach to extracting CF parameters that avoids tedious multi-parameter fitting procedures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

Survey Operations for the Dark Energy Spectroscopic Instrument

The Dark Energy Spectroscopic Instrument (DESI) survey is a spectroscopic survey of tens of millions of galaxies at 0 < z < 3.5 covering 14,000 sq. deg. of the sky. In its first 1.1 yr of survey operations, it has observed more than 14 million galaxies and 4 million stars. We describe the processes that govern DESI's observations of the 15,000 fields composing the survey. This includes the planning of each night's observations in the afternoon; automatic selection of fields to observe during the night; real-time assessment of field completeness on the basis of observing conditions during each exposure; reduction, redshifting, and quality assurance of each field of targets in the morning following observation; and updates to the list of future targets to observe on the basis of these results. We also compare the performance of the survey with historical expectations and find good agreement. Simulations of the weather and of DESI observations using the real field-selection algorithm show good agreement with the actual observations. After accounting for major unplanned shutdowns, the dark time survey is progressing about 7% faster than forecast, which is good agreement given approximations made in the simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS1980

Linear state feedback, quadratic weights, and closed loop eigenstructures

Equations are derived for the angles of general multivariable root loci and linear quadratic optimal root loci, including angles of departure and approach. The generalized eigenvalue problem is used to compute angles of approach. Equations are also derived to find the sensitivity of closed loop eigenvalue and the directional derivatives of closed loop eigenvectors. An equivalence class of quadratic weights that produce the same asymptotic eigenstructure is defined, a canonical element is defined, and an algorithm to find it is given. The behavior of the optimal root locus in the nonasymptotic region is shown to be different for quadratic weights with the same asymptotic properties. An algorithm is presented that can be used to select a feedback gain matrix for the linear state feedback problem which produces a specified asymptotic eigenstructure. Another algorithm is given to compute the asymptotic eigenstructure properties inherent in a given set of quadratic weights. Finally, it is shown that optimal root loci for nongeneric problems can be approximated by generic ones in the nonasymptotic region.

Thompson, P. M.↗

NASA NTRS1988

Splitting of inviscid fluxes for real gases

Flux-vector and flux-difference splittings for the inviscid terms of the compressible flow equations are derived under the assumption of a general equation of state for a real gas in equilibrium. No necessary assumptions, approximations or auxiliary quantities are introduced. The formulas derived include several particular cases known for ideal gases and readily apply to curvilinear coordinates. Applications of the formulas in a TVD algorithm to one-dimensional shock-tube and nozzle problems show their quality and robustness.

Liou, Meng-Sing↗

NASA NTRS1988

Splitting of inviscid fluxes for real gases

Liou, Meng-Sing↗

NASA NTRS1990

Splitting of inviscid fluxes for real gases

Flux-vector and flux-difference splittings for the inviscid terms of the compressible flow equations are derived under the assumption of a general equation of state for a real gas in equilibrium. No necessary assumptions, approximations for auxiliary quantities are introduced. The formulas derived include several particular cases known for ideal gases and readily apply to curvilinear coordinates. Applications of the formulas in a TVD algorithm to one-dimensional shock-tube and nozzle problems show their quality and robustness.

Liou, Meng-Sing↗

NASA NTRS1999

The IRAS Galaxy Atlas (IGA)

In 1993 we proposed a project to NASA having the goal of producing a new infrared map of our Galaxy. In particular, we proposed to reprocess the IRAS data taken in the early 1980's using modern image processing algorithms and the large Intel parallel computers of the Center for Advanced Computing Research, (at that time called the Caltech Concurrent Supercomputing Facilities - CCSF). The rationale was simple: what took approximately 100 days on a typical workstation would take less than a day on the multi-processor parallel computers, thus making a high-resolution infrared atlas of the Galaxy feasible.

Prince, Thomas A.↗

NASA NTRS2009

NASA Tech Briefs, December 2009

Topics include: A Deep Space Network Portable Radio Science Receiver; Detecting Phase Boundaries in Hard-Sphere Suspensions; Low-Complexity Lossless and Near-Lossless Data Compression Technique for Multispectral Imagery; Very-Long-Distance Remote Hearing and Vibrometry; Using GPS to Detect Imminent Tsunamis; Stream Flow Prediction by Remote Sensing and Genetic Programming; Pilotless Frame Synchronization Using LDPC Code Constraints; Radiometer on a Chip; Measuring Luminescence Lifetime With Help of a DSP; Modulation Based on Probability Density Functions; Ku Telemetry Modulator for Suborbital Vehicles; Photonic Links for High-Performance Arraying of Antennas; Reconfigurable, Bi-Directional Flexfet Level Shifter for Low-Power, Rad-Hard Integration; Hardware-Efficient Monitoring of I/O Signals; Video System for Viewing From a Remote or Windowless Cockpit; Spacesuit Data Display and Management System; IEEE 1394 Hub With Fault Containment; Compact, Miniature MMIC Receiver Modules for an MMIC Array Spectrograph; Waveguide Transition for Submillimeter-Wave MMICs; Magnetic-Field-Tunable Superconducting Rectifier; Bonded Invar Clip Removal Using Foil Heaters; Fabricating Radial Groove Gratings Using Projection Photolithography; Gratings Fabricated on Flat Surfaces and Reproduced on Non-Flat Substrates; Method for Measuring the Volume-Scattering Function of Water; Method of Heating a Foam-Based Catalyst Bed; Small Deflection Energy Analyzer for Energy and Angular Distributions; Polymeric Bladder for Storing Liquid Oxygen; Pyrotechnic Simulator/Stray-Voltage Detector; Inventions Utilizing Microfluidics and Colloidal Particles; RuO2 Thermometer for Ultra-Low Temperatures; Ultra-Compact, High-Resolution LADAR System for 3D Imaging; Dual-Channel Multi-Purpose Telescope; Objective Lens Optimized for Wavefront Delivery, Pupil Imaging, and Pupil Ghosting; CMOS Camera Array With Onboard Memory; Quickly Approximating the Distance Between Two Objects; Processing Images of Craters for Spacecraft Navigation; Adaptive Morphological Feature-Based Object Classifier for a Color Imaging System; Rover Slip Validation and Prediction Algorithm; Safety and Quality Training Simulator; Supply-Chain Optimization Template; Algorithm for Computing Particle/Surface Interactions; Cryogenic Pupil Alignment Test Architecture for Aberrated Pupil Images; and Thermal Transport Model for Heat Sink Design.

Source record↗

NASA NTRS1992

Analytical estimates of the PP-algorithm at low number of Doppler periods per pulse length

When discussing the Doppler velocity estimators, it is of significant interest to analyze their behavior at a low number of Doppler periods n(sub D) = 2v(sub r)t(sub s)/lambda is approximately equal to 1 within the resolution cell t(sub s) (v(sub 4) is the radial velocity, lambda is the wavelength). Obviously, at n(sub D) is approximately less than 1 the velocity error is essentially increased. The problem of low n(sub D) arises in the planetary boundary layer (PBL), where higher resolutions are usually required but the signal-to-noise ratio (SNR) is relatively high. In this work analytical expression for the relative root mean square (RMS) error of the PP Doppler estimator at low number of periods for a narrowband Doppler signal and arbitrary model of the noise correlation function is obtained. The results are correct at relatively high SNR. The analysis is supported by computer simulations at various SNR's.

Angelova, M. D.↗

NASA NTRS2017

Evidence for Reduced Species Star Formation Rates in the Centers of Massive Galaxies at zeta = 4

We perform the first spatially-resolved stellar population study of galaxies in the early universe z equals 3.5 -6.5, utilizing the Hubble Space Telescope Cosmic Assembly Near-infrared Deep Extragalactic Legacy Survey (CANDELS) imaging dataset over the GOODS-S field. We select a sample of 418 bright and extended galaxies at z less than or approximately equal to 3.5-6.5 from a parent sample of approximately 8000 photometric-redshift selected galaxies from Finkelstein et al. We first examine galaxies at 3.5 less than or equal to z less than or approximately equal to 4.0 using additional deep K-band survey data from the HAWK-I UDS and GOODS Survey (HUGS) which covers the 4000 Angstrom break at these redshifts. We measure the stellar mass, star formation rate, and dust extinction for galaxy inner and outer regions via spatially-resolved spectral energy distribution fitting based on a Markov Chain Monte Carlo algorithm. By comparing specific star formation rates (sSFRs) between inner and outer parts of the galaxies we find that the majority of galaxies with the high central mass densities show evidence for a preferentially lower sSFR in their centers than in their outer regions, indicative of reduced sSFRs in their central regions. We also study galaxies at z approximately equal to 5 and 6 (here limited to high spatial resolution in the rest-frame ultraviolet only), finding that they show sSFRs which are generally independent of radial distance from the center of the galaxies. This indicates that stars are formed uniformly at all radii in massive galaxies at z approximately equal to 5-6, contrary tomassive galaxies at z. less than approximately equal to 4.

early universe â€“ galaxies: bulges â€“ galaxies: ↗