Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithms”

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,099 records · Page 61

ecode - Electron Transport Algorithm Testing v. 1.0

ecode is a Monte Carlo code used for testing algorithms related to electron transport. The code can read basic physics parameters, such as energy-dependent stopping powers and screening parameters. The code permits simple planar geometries of slabs or cubes. Parallelization consists of domain replication, with work distributed at the start of the calculation and statistical results gathered at the end of the calculation. Some basic routines (such as input parsing, random number generation, and statistics processing) are shared with the Integrated Tiger Series codes. A variety of algorithms for uncertainty propagation are incorporated based on the stochastic collocation and stochastic Galerkin methods. These permit uncertainty only in the total and angular scattering cross sections. The code contains algorithms for simulating stochastic mixtures of two materials. The physics is approximate, ranging from mono-energetic and isotropic scattering to screened Rutherford angular scattering and Rutherford energy-loss scattering (simple electron transport models). No production of secondary particles is implemented, and no photon physics is implemented.

Franke, Brian C.↗

FAR-ULTRAVIOLET DETECTION OF THE SUSPECTED SUBDWARF COMPANION TO THE Be STAR 59 CYGNI

We report on the detection of a hot subdwarf component in the Be binary system, 59 Cygni. The spectral signature is found in cross-correlation functions of photospheric model spectra with far-ultraviolet spectra obtained by the International Ultraviolet Explorer Satellite, and we used radial velocities from the cross-correlation functions to determine a double-lined spectroscopic orbit. The individual spectra of the binary components were extracted using a Doppler tomography algorithm. The flux of the system is dominated by the rapidly rotating Be star. However, the subdwarf contributes approximately 4% of the UV flux, and its spectrum bears a strong resemblance to that of the hot sdO star BD +75 Degree-Sign 325. Based on the appearance of the UV spectrum and the orbital elements, we present estimates for the stellar masses, radii, and temperatures. The presence of the hot companion causes excess emission from the outer part of the Be disk facing the companion. We present a set of red spectra that show the orbital phase variations of the He I {lambda}6678 emission formed in the heated region of the disk, which probably occurs near the disk outer boundary. 59 Cygni, FY Canis Majoris, and {phi} Persei comprise the known set of Be binaries with detected hot evolved companions, which are the stripped down remains of mass transfer. Their properties demonstrate that some fraction of Be stars were spun up through angular momentum transfer by Roche lobe overflow.

79 ASTRONOMY AND ASTROPHYSICS↗

A Pilot Evaluation of a 4-Dimensional Cone-Beam Computed Tomographic Scheme Based on Simultaneous Motion Estimation and Image Reconstruction

Purpose: To evaluate the performance of a 4-dimensional (4-D) cone-beam computed tomographic (CBCT) reconstruction scheme based on simultaneous motion estimation and image reconstruction (SMEIR) through patient studies. Methods and Materials: The SMEIR algorithm contains 2 alternating steps: (1) motion-compensated CBCT reconstruction using projections from all phases to reconstruct a reference phase 4D-CBCT by explicitly considering the motion models between each different phase and (2) estimation of motion models directly from projections by matching the measured projections to the forward projection of the deformed reference phase 4D-CBCT. Four lung cancer patients were scanned for 4 to 6 minutes to obtain approximately 2000 projections for each patient. To evaluate the performance of the SMEIR algorithm on a conventional 1-minute CBCT scan, the number of projections at each phase was reduced by a factor of 5, 8, or 10 for each patient. Then, 4D-CBCTs were reconstructed from the down-sampled projections using Feldkamp-Davis-Kress, total variation (TV) minimization, prior image constrained compressive sensing (PICCS), and SMEIR. Using the 4D-CBCT reconstructed from the fully sampled projections as a reference, the relative error (RE) of reconstructed images, root mean square error (RMSE), and maximum error (MaxE) of estimated tumor positions were analyzed to quantify the performance of the SMEIR algorithm. Results: The SMEIR algorithm can achieve results consistent with the reference 4D-CBCT reconstructed with many more projections per phase. With an average of 30 to 40 projections per phase, the MaxE in tumor position detection is less than 1 mm in SMEIR for all 4 patients. Conclusion: The results from a limited number of patients show that SMEIR is a promising tool for high-quality 4D-CBCT reconstruction and tumor motion modeling.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Information-theoretic discrepancy based iterative reconstructions (IDIR) for polychromatic x-ray tomography

Purpose: X-ray photons generated from a typical x-ray source for clinical applications exhibit a broad range of wavelengths, and the interactions between individual particles and biological substances depend on particles' energy levels. Most existing reconstruction methods for transmission tomography, however, neglect this polychromatic nature of measurements and rely on the monochromatic approximation. In this study, we developed a new family of iterative methods that incorporates the exact polychromatic model into tomographic image recovery, which improves the accuracy and quality of reconstruction.Methods: The generalized information-theoretic discrepancy (GID) was employed as a new metric for quantifying the distance between the measured and synthetic data. By using special features of the GID, the objective function for polychromatic reconstruction which contains a double integral over the wavelength and the trajectory of incident x-rays was simplified to a paraboloidal form without using the monochromatic approximation. More specifically, the original GID was replaced with a surrogate function with two auxiliary, energy-dependent variables. Subsequently, the alternating minimization technique was applied to solve the double minimization problem. Based on the optimization transfer principle, the objective function was further simplified to the paraboloidal equation, which leads to a closed-form update formula. Numerical experiments on the beam-hardening correction and material-selective reconstruction were conducted to compare and assess the performance of conventional methods and the proposed algorithms.Results: The authors found that the GID determines the distance between its two arguments in a flexible manner. In this study, three groups of GIDs with distinct data representations were considered. The authors demonstrated that one type of GIDs that comprises “raw” data can be viewed as an extension of existing statistical reconstructions; under a particular condition, the GID is equivalent to the Poisson log-likelihood function. The newly proposed GIDs of the other two categories consist of log-transformed measurements, which have the advantage of imposing linearized penalties over multiple discrepancies. For all proposed variants of the GID, the aforementioned strategy was used to obtain a closed-form update equation. Even though it is based on the exact polychromatic model, the derived algorithm bears a structural resemblance to conventional methods based on the monochromatic approximation. The authors named the proposed approach as information-theoretic discrepancy based iterative reconstructions (IDIR). In numerical experiments, IDIR with raw data converged faster than previously known statistical reconstruction methods. IDIR with log-transformed data exhibited superior reconstruction quality and faster convergence speed compared with conventional methods and their variants.Conclusions: The authors' new framework for tomographic reconstruction allows iterative inversion of the polychromatic data model. The primary departure from the traditional iterative reconstruction was the employment of the GID as a new metric for quantifying the inconsistency between the measured and synthetic data. The proposed methods outperformed not only conventional methods based on the monochromatic approximation but also those based on the polychromatic model. The authors have observed that the GID is a very flexible means to design an objective function for iterative reconstructions. Hence, the authors expect that the proposed IDIR framework will also be applicable to other challenging tasks.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

High pressure behaviour of uranium dicarbide (UC{sub 2}): Ab-initio study

The structural stability of uranium dicarbide has been examined under hydrostatic compression employing evolutionary structure search algorithm implemented in the universal structure predictor: evolutionary Xtallography (USPEX) code in conjunction with ab-initio electronic band structure calculation method. The ab-initio total energy calculations involved for this purpose have been carried out within both generalized gradient approximations (GGA) and GGA + U approximations. Our calculations under GGA approximation predict the high pressure structural sequence of tetragonal → monoclinic → orthorhombic for this material with transition pressures of ∼8 GPa and 42 GPa, respectively. The same transition sequence is predicted by calculations within GGA + U also with transition pressures placed at ∼24 GPa and ∼50 GPa, respectively. Further, on the basis of comparison of zero pressure equilibrium volume and equation of state with available experimental data, we find that GGA + U approximation with U = 2.5 eV describes this material better than the simple GGA approximation. The theoretically predicted high pressure structural phase transitions are in disagreement with the only high experimental study by Dancausse et al. [J. Alloys. Compd. 191, 309 (1993)] on this compound which reports a tetragonal to hexagonal phase transition at a pressure of ∼17.6 GPa. Interestingly, during lowest enthalpy structure search using USPEX, we do not see any hexagonal phase to be closer to the predicted monoclinic phase even within 0.2 eV/f. unit. More experiments with varying carbon contents in UC{sub 2} sample are required to resolve this discrepancy. The existence of these high pressure phases predicted by static lattice calculations has been further substantiated by analyzing the elastic and lattice dynamic stability of these structures in the pressure regimes of their structural stability. Additionally, various thermo-physical quantities such as equilibrium volume, bulk modulus, Debye temperature, thermal expansion coefficient, Gruneisen parameter, and heat capacity at ambient conditions have been determined from these calculations and compared with the available experimental data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive matching of the iota ring linear optics for space charge compensation

Many present and future accelerators must operate with high intensity beams when distortions induced by space charge forces are among major limiting factors. Betatron tune depression of above approximately 0.1 per cell leads to significant distortions of linear optics. Many aspects of machine operation depend on proper relations between lattice functions and phase advances, and can be i proved with proper treatment of space charge effects. We implement an adaptive algorithm for linear lattice re matching with full account of space charge in the linear approximation for the case of Fermilab’s IOTA ring. The method is based on a search for initial second moments that give closed solution and, at the same predefined set of goals for emittances, beta functions, dispersions and phase advances at and between points of interest. Iterative singular value decomposition based technique is used to search for optimum by varying wide array of model parameters

43 PARTICLE ACCELERATORS↗

Heterogeneous Mixtures of Dictionary Functions to Approximate Subspace Invariance in Koopman Operators: Why Deep Koopman Operators Work

Abstract Koopman operators model nonlinear dynamics as a linear dynamic system acting on a nonlinear function as the state. This nonstandard state is often called a Koopman observable and is usually approximated numerically by a superposition of functions drawn from a dictionary . In a widely used algorithm, extended dynamic mode decomposition (EDMD), the dictionary functions are drawn from a fixed class of functions. Deep learning combined with EDMD has been used to learn novel dictionary functions in an algorithm called deep dynamic mode decomposition (deepDMD). The learned representation both (1) accurately models and (2) scales well with the dimension of the original nonlinear system. In this paper, we analyze the learned dictionaries from deepDMD and explore the theoretical basis for their strong performance. We explore State-Inclusive Logistic Lifting (SILL) dictionary functions to approximate Koopman observables. Error analysis of these dictionary functions show they satisfy a property of subspace approximation, which we define as uniform finite approximate closure. Typically, a Koopman dictionary’s nonlinear functions are homogeneous. In this paper, we discover that structured mixing of heterogeneous dictionary functions drawn from different classes of nonlinear functions achieve the same accuracy and dimensional scaling as the deep-learning-based deepDMD algorithm Yeung et al. ( In: 2019 American Control Conference (ACC), 2019). We specifically show this by building a heterogeneous dictionary comprised of SILL functions and conjunctive radial basis functions (RBFs). This mixed dictionary achieves similar accuracy and dimensional scaling to deepDMD with an order of magnitude reduction in parameters, while maintaining geometric interpretability. These results strengthen the viability of dictionary-based Koopman models to solving high-dimensional nonlinear learning problems.

Johnson, Charles A.↗

Efficient Generalized Boundary Detection Using a Sliding Information Distance

In this work, we present a general machine learning algorithm for boundary detection within general signals based on an efficient, accurate, and robust approximation of the universal normalized information distance. Our approach uses an adaptive sliding information distance (SLID) combined with a wavelet-based approach for peak identification to locate the boundaries. Special emphasis is placed on developing an adaptive formulation of SLID to handle general signals with multiple unknown and/or drifting section lengths. Although specialized algorithms may outperform SLID when domain knowledge is available, these algorithms are limited to specific applications and do not generalize. SLID excels in these cases. We demonstrate the versatility and efficacy of SLID on a variety of signal types, including synthetically generated sequences of tokens, binary executables for reverse engineering applications, and time series of seismic events.

42 ENGINEERING↗

Estimating the randomness of quantum circuit ensembles up to 50 qubits

Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any random unitaries has consequences on their complexity, expressibility, and trainability. To study this property of random circuits, we develop numerical protocols for estimating the frame potential, the distance between a given ensemble and the exact randomness. Our tensor-network-based algorithm has polynomial complexity for shallow circuits and is high-performing using CPU and GPU parallelism. We study 1. local and parallel random circuits to verify the linear growth in complexity as stated by the Brown–Susskind conjecture, and; 2. hardware-efficient ansätze to shed light on its expressibility and the barren plateau problem in the context of variational algorithms. Our work shows that large-scale tensor network simulations could provide important hints toward open problems in quantum information science.

97 MATHEMATICS AND COMPUTING↗

Semiclassical Monte-Carlo approach for modelling non-adiabatic dynamics in extended molecules

Modelling of non-adiabatic dynamics in extended molecular systems and solids is a next frontier of atomistic electronic structure theory. The underlying numerical algorithms should operate only with a few quantities (that can be efficiently obtained from quantum chemistry), provide a controlled approximation (which can be systematically improved) and capture important phenomena such as branching (multiple products), detailed balance and evolution of electronic coherences. Here we propose a new algorithm based on Monte-Carlo sampling of classical trajectories, which satisfies the above requirements and provides a general framework for existing surface hopping methods for non-adiabatic dynamics simulations. In particular, our algorithm can be viewed as a post-processing technique for analysing numerical results obtained from the conventional surface hopping approaches. Presented numerical tests for several model problems demonstrate efficiency and accuracy of the new method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

New SC Algorithm for MAD-X

MAD-X allows to simulate space-charge effects by approximating the macroparticle ensemble with a Gaussian distribution and using analytic formulas for calculation of the space-charge kick at locations which should be chosen in advance e.g. with V. Kapin’s external code. The new MAD-X version features two innovations: a symplectic three-dimensional space-charge kick and Gaussian fit of particle distribution which – in principle – does not require a linearly stable closed optics to exist thus permitting simulations studies of the parametric resonance stopband crossing. It also allows for non stationary distribution so that envelope resonances can be simulated.

43 PARTICLE ACCELERATORS↗

A weighted reverse Cuthill-McKee procedure for finite element method algorithms to solve strongly anisotropic electrodynamic problems

This paper presents a technique for improving the convergence rate of a generalized minimum residual (GMRES) algorithm applied for the solution of a algebraic system produced by the discretization of an electrodynamic problem with a tensorial electrical conductivity. The electrodynamic solver considered in this work is a part of a magnetohydrodynamic (MHD) code in the low magnetic Reynolds number approximation. The code has been developed for the analysis of MHD interaction during the re-entry phase of a space vehicle. This application is a promising technique intensively investigated for the shock mitigation and the vehicle control in the higher layers of a planetary atmosphere. The medium in the considered application is a low density plasma, characterized by a tensorial conductivity. This is a result of the behavior of the free electric charges, which tend to drift in a direction perpendicular both to the electric field and to the magnetic field. In the given approximation, the electrodynamics is described by an elliptical partial differential equation, which is solved by means of a finite element approach. The linear system obtained by discretizing the problem is solved by means of a GMRES iterative method with an incomplete LU factorization threshold preconditioning. The convergence of the solver appears to be strongly affected by the tensorial characteristic of the conductivity. In order to deal with this feature, the bandwidth reduction in the coefficient matrix is considered and a novel technique is proposed and discussed. First, the standard reverse Cuthill-McKee (RCM) procedure has been applied to the problem. Then a modification of the RCM procedure (the weighted RCM procedure, WRCM) has been developed. In the last approach, the reordering is performed taking into account the relation between the mesh geometry and the magnetic field direction. In order to investigate the effectiveness of the methods, two cases are considered. The RCM and WRCM procedures has successfully improved the convergence rate of the GMRES solver. For strong anisotropies, the WRCM procedure appears to have a higher convergence rate. The same behavior is shown when applying the methods to the rebuilding of an hypersonic MHD experiment.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exascale-capable cellular automaton for nucleation and grain growth

This model is a cellular automata-based algorithm used to predict grain-scale microstructure development. Nucleation and growth of existing grains are considered in an initially liquid domain, where the temperature field evolution is either driven through heat transport simulation data or a frozen temperature approximation (i.e., a constant cooling rate and a fixed thermal gradient). The growth of grains is based on the decentered octahedron algorithm published by Gandin and Rappaz (https://doi.org/10.1016/S1359-6454(96)00303-5), where the grain envelopes are tracked as approximations of the evolving dendritic growth front. The input heat transport data, which can come from simulation of an arbitrary processing technique, consists of coordinates and times at which said coordinates fall below the liquidus and solidus temperatures for the final time. As a result, only the final solidification of a given region is modeled (no remelting). The code is designed to be compatible with pre-Exascale architectures, and uses MPI and the Kokkos library to decompose the computational domain and offload solidification calculations to GPUs.

Rolchigo, MatthewR.↗

Spin orbit coupling for molecular ab initio density matrix renormalization group calculations: Application to g-tensors

Spin Orbit Coupling (SOC) is introduced to molecular ab initio density matrix renormalization group (DMRG) calculations. In the presented scheme, one first approximates the electronic ground state and a number of excited states of the Born-Oppenheimer (BO) Hamiltonian with the aid of the DMRG algorithm. Owing to the spin-adaptation of the algorithm, the total spin S is a good quantum number for these states. After the non-relativistic DMRG calculation is finished, all magnetic sublevels of the calculated states are constructed explicitly, and the SOC operator is expanded in the resulting basis. To this end, spin orbit coupled energies and wavefunctions are obtained as eigenvalues and eigenfunctions of the full Hamiltonian matrix which is composed of the SOC operator matrix and the BO Hamiltonian matrix. This treatment corresponds to a quasi-degenerate perturbation theory approach and can be regarded as the molecular equivalent to atomic Russell-Saunders coupling. For the evaluation of SOC matrix elements, the full Breit-Pauli SOC Hamiltonian is approximated by the widely used spin-orbit mean field operator. This operator allows for an efficient use of the second quantized triplet replacement operators that are readily generated during the non-relativistic DMRG algorithm, together with the Wigner-Eckart theorem. With a set of spin-orbit coupled wavefunctions at hand, the molecular g-tensors are calculated following the scheme proposed by Gerloch and McMeeking. It interprets the effective molecular g-values as the slope of the energy difference between the lowest Kramers pair with respect to the strength of the applied magnetic field. Test calculations on a chemically relevant Mo complex demonstrate the capabilities of the presented method.

74 ATOMIC AND MOLECULAR PHYSICS↗

Determining a Modern Energy Density Functional for Nuclei Using The Simulating Annealing Method

We discuss a realistic case of fitting the values of the parameters of a Skyrme type energy density functional (EDF) to an extensive set of experimental data on the ground-state properties of many nuclei ranging from normal to exotic ones, including some physical constraints. This is carried out within the Hartree-Fock (HF) approach using a simulated-annealing based algorithm for minimizing {kappa}{sup 2}. We also present results of calculations of ground state properties of nuclei using HF and of giant resonances within the HF-based random phase approximation (RPA)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Effect of deformable registration on the dose calculated in radiation therapy planning CT scans of lung cancer patients

Purpose: To characterize the effects of deformable image registration of serial computed tomography (CT) scans on the radiation dose calculated from a treatment planning scan. Methods: Eighteen patients who received curative doses (≥60 Gy, 2 Gy/fraction) of photon radiation therapy for lung cancer treatment were retrospectively identified. For each patient, a diagnostic-quality pretherapy (4–75 days) CT scan and a treatment planning scan with an associated dose map were collected. To establish correspondence between scan pairs, a researcher manually identified anatomically corresponding landmark point pairs between the two scans. Pretherapy scans then were coregistered with planning scans (and associated dose maps) using the demons deformable registration algorithm and two variants of the Fraunhofer MEVIS algorithm (“Fast” and “EMPIRE10”). Landmark points in each pretherapy scan were automatically mapped to the planning scan using the displacement vector field output from each of the three algorithms. The Euclidean distance between manually and automatically mapped landmark points (d{sub E}) and the absolute difference in planned dose (|ΔD|) were calculated. Using regression modeling, |ΔD| was modeled as a function of d{sub E}, dose (D), dose standard deviation (SD{sub dose}) in an eight-pixel neighborhood, and the registration algorithm used. Results: Over 1400 landmark point pairs were identified, with 58–93 (median: 84) points identified per patient. Average |ΔD| across patients was 3.5 Gy (range: 0.9–10.6 Gy). Registration accuracy was highest using the Fraunhofer MEVIS EMPIRE10 algorithm, with an average d{sub E} across patients of 5.2 mm (compared with >7 mm for the other two algorithms). Consequently, average |ΔD| was also lowest using the Fraunhofer MEVIS EMPIRE10 algorithm. |ΔD| increased significantly as a function of d{sub E} (0.42 Gy/mm), D (0.05 Gy/Gy), SD{sub dose} (1.4 Gy/Gy), and the algorithm used (≤1 Gy). Conclusions: An average error of <4 Gy in radiation dose was introduced when points were mapped between CT scan pairs using deformable registration, with the majority of points yielding dose-mapping error <2 Gy (approximately 3% of the total prescribed dose). Registration accuracy was highest using the Fraunhofer MEVIS EMPIRE10 algorithm, resulting in the smallest errors in mapped dose. Dose differences following registration increased significantly with increasing spatial registration errors, dose, and dose gradient (i.e., SD{sub dose}). This model provides a measurement of the uncertainty in the radiation dose when points are mapped between serial CT scans through deformable registration.

60 APPLIED LIFE SCIENCES↗

Learning to Predict Arbitrary Quantum Processes

We present an efficient machine-learning (ML) algorithm for predicting any unknown quantum process ℰ over 𝑛 qubits. For a wide range of distributions 𝒟 on arbitrary 𝑛-qubit states, we show that this ML algorithm can learn to predict any local property of the output from the unknown process ℰ, with a small average error over input states drawn from 𝒟. The ML algorithm is computationally efficient even when the unknown process is a quantum circuit with exponentially many gates. Our algorithm combines efficient procedures for learning properties of an unknown state and for learning a low-degree approximation to an unknown observable. The analysis hinges on proving new norm inequalities, including a quantum analogue of the classical Bohnenblust-Hille inequality, which we derive by giving an improved algorithm for optimizing local Hamiltonians. Numerical experiments on predicting quantum dynamics with evolution time up to 10 6 and system size up to 50 qubits corroborate our proof. Overall, our results highlight the potential for ML models to predict the output of complex quantum dynamics much faster than the time needed to run the process itself.

quantum computation↗

Development of Steady-State and Dynamic Mass and Energy Constrained Neural Networks for Distributed Chemical Systems Using Noisy Transient Data

The paper presents the development of algorithms for mass and energy constrained neural network models that can exactly conserve the overall mass and energy of distributed chemical process systems, even though the noisy transient data used for optimal model training violate the same. In contrast to approximately satisfying mass and energy balance constraints of a system by soft penalization of objective function, algorithms have been developed for solving equality-constrained nonlinear optimization problems, thus providing the guarantee of exactly satisfying the system mass and energy conservation laws. For developing dynamic mass-energy constrained network models for distributed systems, hybrid series and parallel dynamic-static neural networks have been leveraged. The developed algorithms for solving both the training and forward problems are validated using both steady-state and dynamic data in the presence of various noise characteristics. The developed data-driven algorithms are flexible to exactly satisfy mass and energy balance constraints for dynamic chemical processes if the system holdup information is available. The proposed network structures and algorithms are applied to the development of data-driven lumped and distributed models of an adiabatic superheater/reheater system, a nonisothermal continuous stirred tank reactor, as well as an electrically heated plug-flow reactor system where one form of energy gets transformed to another. It has been observed that the mass-energy constrained neural networks yield a root mean squared error of <1% with respect to the system truth for the case studies evaluated in this work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗