Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 37 records · Page 2

Motion Cueing Algorithm Development: Initial Investigation and Redesign of the Algorithms

In this project four motion cueing algorithms were initially investigated. The classical algorithm generated results with large distortion and delay and low magnitude. The NASA adaptive algorithm proved to be well tuned with satisfactory performance, while the UTIAS adaptive algorithm produced less desirable results. Modifications were made to the adaptive algorithms to reduce the magnitude of undesirable spikes. The optimal algorithm was found to have the potential for improved performance with further redesign. The center of simulator rotation was redefined. More terms were added to the cost function to enable more tuning flexibility. A new design approach using a Fortran/Matlab/Simulink setup was employed. A new semicircular canals model was incorporated in the algorithm. With these changes results show the optimal algorithm has some advantages over the NASA adaptive algorithm. Two general problems observed in the initial investigation required solutions. A nonlinear gain algorithm was developed that scales the aircraft inputs by a third-order polynomial, maximizing the motion cues while remaining within the operational limits of the motion system. A braking algorithm was developed to bring the simulator to a full stop at its motion limit and later release the brake to follow the cueing algorithm output.

Telban, Robert J.↗

Motion Cueing Algorithm Development: Piloted Performance Testing of the Cueing Algorithms

The relative effectiveness in simulating aircraft maneuvers with both current and newly developed motion cueing algorithms was assessed with an eleven-subject piloted performance evaluation conducted on the NASA Langley Visual Motion Simulator (VMS). In addition to the current NASA adaptive algorithm, two new cueing algorithms were evaluated: the optimal algorithm and the nonlinear algorithm. The test maneuvers included a straight-in approach with a rotating wind vector, an offset approach with severe turbulence and an on/off lateral gust that occurs as the aircraft approaches the runway threshold, and a takeoff both with and without engine failure after liftoff. The maneuvers were executed with each cueing algorithm with added visual display delay conditions ranging from zero to 200 msec. Two methods, the quasi-objective NASA Task Load Index (TLX), and power spectral density analysis of pilot control, were used to assess pilot workload. Piloted performance parameters for the approach maneuvers, the vertical velocity upon touchdown and the runway touchdown position, were also analyzed but did not show any noticeable difference among the cueing algorithms. TLX analysis reveals, in most cases, less workload and variation among pilots with the nonlinear algorithm. Control input analysis shows pilot-induced oscillations on a straight-in approach were less prevalent compared to the optimal algorithm. The augmented turbulence cues increased workload on an offset approach that the pilots deemed more realistic compared to the NASA adaptive algorithm. The takeoff with engine failure showed the least roll activity for the nonlinear algorithm, with the least rudder pedal activity for the optimal algorithm.

Houck, Jacob A.↗

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗

Prospects for in vivo estimation of photon linear attenuation coefficients using postprocessing dual-energy CT imaging on a commercial scanner: Comparison of analytic and polyenergetic statistical reconstruction algorithms

Purpose: Accurate patient-specific photon cross-section information is needed to support more accurate model-based dose calculation for low energy photon-emitting modalities in medicine such as brachytherapy and kilovoltage x-ray imaging procedures. A postprocessing dual-energy CT (pDECT) technique for noninvasivein vivo estimation of photon linear attenuation coefficients has been experimentally implemented on a commercial CT scanner and its accuracy assessed in idealized phantom geometries. Methods: Eight test materials of known composition and density were used to compare pDECT-estimated linear attenuation coefficients to NIST reference values over an energy range from 10 keV to 1 MeV. As statistical image reconstruction (SIR) has been shown to reconstruct images with less random and systematic error than conventional filtered backprojection (FBP), the pDECT technique was implemented with both an in-house polyenergetic SIR algorithm, alternating minimization (AM), as well as a conventional FBP reconstruction algorithm. Improvement from increased spectral separation was also investigated by filtering the high-energy beam with an additional 0.5 mm of tin. The law of propagated uncertainty was employed to assess the sensitivity of the pDECT process to errors in reconstructed images. Results: Mean pDECT-estimated linear attenuation coefficients for the eight test materials agreed within 1% of NIST reference values for energies from 1 MeV down to 30 keV, with mean errors rising to between 3% and 6% at 10 keV, indicating that the method is unbiased when measurement and calibration phantom geometries are matched. Reconstruction with FBP and AM algorithms conferred similar mean pDECT accuracy. However, single-voxel pDECT estimates reconstructed on a 1 × 1 × 3 mm{sup 3} grid are shown to be highly sensitive to reconstructed image uncertainty; in some cases pDECT attenuation coefficient estimates exhibited standard deviations on the order of 20% around the mean. Reconstruction with the statistical AM algorithm led to standard deviations roughly 40% to 60% less than FBP reconstruction. Additional tin filtration of the high energy beam exhibits similar pDECT estimation accuracy as the unfiltered beam, even when scanning with only 25% of the dose. Using the law of propagated uncertainty, low Z materials are found to be more sensitive to image reconstruction errors than high Z materials. Furthermore, it is estimated that reconstructed CT image uncertainty must be limited to less than 0.25% to achieve a target linear-attenuation coefficient estimation uncertainty of 3% at 28 keV. Conclusions: That pDECT supports mean linear attenuation coefficient measurement accuracies of 1% of reference values for energies greater than 30 keV is encouraging. However, the sensitivity of the pDECT measurements to noise and systematic errors in reconstructed CT images warrants further investigation in more complex phantom geometries. The investigated statistical reconstruction algorithm, AM, reduced random measurement uncertainty relative to FBP owing to improved noise performance. These early results also support efforts to increase DE spectral separation, which can further reduce the pDECT sensitivity to measurement uncertainty.

61 RADIATION PROTECTION AND DOSIMETRY↗

An efficient polyenergetic SART (pSART) reconstruction algorithm for quantitative myocardial CT perfusion

Purpose: In quantitative myocardial CT perfusion imaging, beam hardening effect due to dense bone and high concentration iodinated contrast agent can result in visible artifacts and inaccurate CT numbers. In this paper, an efficient polyenergetic Simultaneous Algebraic Reconstruction Technique (pSART) was presented to eliminate the beam hardening artifacts and to improve the CT quantitative imaging ability. Methods: Our algorithm made threea priori assumptions: (1) the human body is composed of several base materials (e.g., fat, breast, soft tissue, bone, and iodine); (2) images can be coarsely segmented to two types of regions, i.e., nonbone regions and noniodine regions; and (3) each voxel can be decomposed into a mixture of two most suitable base materials according to its attenuation value and its corresponding region type information. Based on the above assumptions, energy-independent accumulated effective lengths of all base materials can be fast computed in the forward ray-tracing process and be used repeatedly to obtain accurate polyenergetic projections, with which a SART-based equation can correctly update each voxel in the backward projecting process to iteratively reconstruct artifact-free images. This approach effectively reduces the influence of polyenergetic x-ray sources and it further enables monoenergetic images to be reconstructed at any arbitrarily preselected target energies. A series of simulation tests were performed on a size-variable cylindrical phantom and a realistic anthropomorphic thorax phantom. In addition, a phantom experiment was also performed on a clinical CT scanner to further quantitatively validate the proposed algorithm. Results: The simulations with the cylindrical phantom and the anthropomorphic thorax phantom showed that the proposed algorithm completely eliminated beam hardening artifacts and enabled quantitative imaging across different materials, phantom sizes, and spectra, as the absolute relative errors were reduced from [−7.5%, 12.1%] for SART to [−0.1%, 0.1%] for pSART. When using low kVp spectra and high reference energies, pSART also showed improved reconstruction efficiency in terms of convergence speed compared to the conventional SART algorithm. The phantom experiment on a clinical CT scanner indicated that the quantitative advantage of pSART is realizable in experimental CT acquisition, as the absolute relative errors across material inserts were less than 0.4%. Conclusions: By incorporatinga priori information (material attenuation coefficients, x-ray source spectrum, and region type information) into the reconstruction process, the proposed pSART algorithm could effectively eliminate beam hardening artifacts, reconstruct the accurate attenuation coefficients for precise quantitative imaging, and accelerate the reconstruction process.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Precise ROCOF estimation algorithm for low inertia power grids

The precise estimation of Rate Of Change Of Frequencies (ROCOFs) in a generation trip event can be helpful on power system inertia estimation, fast system response, and accurate event capturing. However, the ROCOF estimations from the existing Synchronized Measurement Devices (SMDs) are usually simply calculated by the finite difference between two adjacent frequency measurement points. The ineluctable noises, disturbances, and spikes from real-world frequency measurements can bring large dynamics to the ROCOF estimation and thus can result in an inaccurate estimation of the initial ROCOF. This issue becomes more serious when the target power grid has low inertia, and a large amount of distributed energy sources are deployed. To address this issue, a precise ROCOF estimation algorithm is designed based on least square method with flexible window size. In addition, a median filter is also designed and applied on the frequency measurements before using the proposed algorithm. The window size and thresholds in the proposed algorithm are determined with historical event data analysis. The proposed algorithm is deployed in a low cost, flexible, and distribution level universal grid analyzer (UGA) platform. In conclusion, multiple experiments are conducted in both a laboratory and the Hawaiian Islands to verify the effectiveness of the proposed algorithm.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A weighted state redistribution algorithm for embedded boundary grids

State redistribution is an algorithm that stabilizes cut cells for embedded boundary grid methods. This work extends the earlier algorithm in several important ways. First, state redistribution is extended to three spatial dimensions. Second, we discuss several algorithmic changes and improvements motivated by the more complicated cut cell geometries that can occur in higher dimensions. In particular, we introduce a weighted version with less dissipation in an easily generalizable framework. Third, we demonstrate that state redistribution can also stabilize a solution update that includes both advective and diffusive contributions. Notably, the stabilization algorithm is shown to be effective for incompressible as well as compressible reacting flows. Finally, we discuss the implementation of the algorithm for several exascale-ready simulation codes based on AMReX, demonstrating ease of use in combination with domain decomposition, hybrid parallelism and complex physics.

97 MATHEMATICS AND COMPUTING↗

Efficient Algorithms for Estimating the Absorption Spectrum within Linear Response TDDFT

We present a special symmetric Lanczos algorithm and a kernel polynomial method (KPM) for approximating the absorption spectrum of molecules within the linear response time-dependent density functional theory (TDDFT) framework in the product form. In contrast to existing algorithms, the new algorithms are based on reformulating the original non-Hermitian eigenvalue problem as a product eigenvalue problem and the observation that the product eigenvalue problem is self-adjoint with respect to an appropriately chosen inner product. This allows a simple symmetric Lanczos algorithm to be used to compute the desired absorption spectrum. The use of a symmetric Lanczos algorithm only requires half of the memory compared with the nonsymmetric variant of the Lanczos algorithm. The symmetric Lanczos algorithm is also numerically more stable than the nonsymmetric version. The KPM algorithm is also presented as a low-memory alternative to the Lanczos approach, but the algorithm may require more matrix-vector multiplications in practice. We discuss the pros and cons of these methods in terms of their accuracy as well as their computational and storage cost. Applications to a set of small and medium-sized molecules are also presented.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Polar Liquid Cloud Base Detection Algorithms for High Spectral Resolution or Micropulse Lidar Data

Liquid layers in clouds affect their microphysical processes, as well as the atmospheric energy budget. However, explicit liquid cloud base height (LCBH) detection algorithms using ground-based instruments (e.g., lidars) are currently absent in the literature. Most studies use either fixed lidar parameter thresholds or cloud base height data products that do not distinguish between ice and liquid, all of which might introduce inconsistencies and errors in the resolved LCBHs. In this paper, two LCBH detection algorithms are presented; the first algorithm uses the high spectral resolution lidar (HSRL) data, and yields satisfactory results. The second algorithm incorporates micropulse lidar (MPL) data for the LCBH detection. A 1-year long comparison of data gathered at Barrow, Alaska, and McMurdo Station, Antarctica, which includes other cloud base detection methodologies (ceilometer, MPL value-added product cloud base height, LCBHs detected using a fixed MPL depolarization threshold) emphasize the merits of the MPL algorithm.

Silber, Israel↗

A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information

We present a structured quasi-Newton algorithm for unconstrained optimization problems that have unavailable second-order derivatives or Hessian terms. We provide a formal derivation of the well-known Broyden--Fletcher--Goldfarb--Shanno (BFGS) secant update formula that approximates only the missing Hessian terms, and we propose a linesearch quasi-Newton algorithm based on a modification of Wolfe conditions that converges to first-order optimality conditions. We also analyze the local convergence properties of the structured BFGS algorithm and show that it achieves superlinear convergence under the standard assumptions used by quasi-Newton methods using secant updates. In conclusion, we provide a thorough study of the practical performance of the algorithm on the CUTEr suite of test problems and show that our structured BFGS-based quasi-Newton algorithm outperforms the unstructured counterpart(s).

97 MATHEMATICS AND COMPUTING↗

Dose Calculation Accuracy of the Monte Carlo Algorithm for CyberKnife Compared with Other Commercially Available Dose Calculation Algorithms

Monte Carlo dose calculation algorithms have the potential for greater accuracy than traditional model-based algorithms. This enhanced accuracy is particularly evident in regions of lateral scatter disequilibrium, which can develop during treatments incorporating small field sizes and low-density tissue. A heterogeneous slab phantom was used to evaluate the accuracy of several commercially available dose calculation algorithms, including Monte Carlo dose calculation for CyberKnife, Analytical Anisotropic Algorithm and Pencil Beam convolution for the Eclipse planning system, and convolution-superposition for the Xio planning system. The phantom accommodated slabs of varying density; comparisons between planned and measured dose distributions were accomplished with radiochromic film. The Monte Carlo algorithm provided the most accurate comparison between planned and measured dose distributions. In each phantom irradiation, the Monte Carlo predictions resulted in gamma analysis comparisons >97%, using acceptance criteria of 3% dose and 3-mm distance to agreement. In general, the gamma analysis comparisons for the other algorithms were <95%. The Monte Carlo dose calculation algorithm for CyberKnife provides more accurate dose distribution calculations in regions of lateral electron disequilibrium than commercially available model-based algorithms. This is primarily because of the ability of Monte Carlo algorithms to implicitly account for tissue heterogeneities, density scaling functions; and/or effective depth correction factors are not required.

61 RADIATION PROTECTION AND DOSIMETRY↗

Computing the energy of a water molecule using multideterminants: A simple, efficient algorithm

Quantum Monte Carlo (QMC) methods such as variational Monte Carlo and fixed node diffusion Monte Carlo depend heavily on the quality of the trial wave function. Although Slater-Jastrow wave functions are the most commonly used variational ansatz in electronic structure, more sophisticated wave functions are critical to ascertaining new physics. One such wave function is the multi-Slater-Jastrow wave function which consists of a Jastrow function multiplied by the sum of Slater determinants. In this paper we describe a method for working with these wave functions in QMC codes that is easy to implement, efficient both in computational speed as well as memory, and easily parallelized. The computational cost scales quadratically with particle number making this scaling no worse than the single determinant case and linear with the total number of excitations. Additionally, we implement this method and use it to compute the ground state energy of a water molecule.

97 MATHEMATICS AND COMPUTING↗

Interface of an uncoupled boundary layer algorithm with an inviscid core flow algorithm for unsteady supersonic engine inlets

An uncoupled boundary layer algorithm was combined with an inviscid core flow algorithm to model flows within supersonic engine inlets. The inviscid flow algorithm that was used was the LArge Perturbation INlet Code (LAPIN). The boundary layer and inviscid core flow algorithms were formulated in different manners. The boundary layer algorithm was two dimensional and solved in nonconservation form, while the core flow algorithm was one dimensional and solved in conservation form. In order to interface the two codes, the following modifications were important. The coordinate system was set up to maintain the parabolic nature of the boundary layer algorithm while approaching the one dimensional core flow solution far from a wall. The pressure gradient used in the boundary layer equation was calculated using the core flow values and the boundary layer equations, so the boundary layer solution smoothly approached the core flow values far from the wall. Flaring was used for the advection terms perpendicular to the core flow to maintain the stability of the algorithm. With these modifications, the combined viscous/inviscid algorithm matched well with experimental observations of pressure distributions with a supersonic inlet.

Darling, Douglas↗

Interface of an uncoupled boundary layer algorithm with an inviscid core flow algorithm for unsteady supersonic engine inlets

An uncoupled boundary layer algorithm was combined with an inviscid core flow algorithm to model flows within supersonic engine inlets. The inviscid flow algorithm that was used was the LArge Perturbation INlet Code (LAPIN). The boundary layer and inviscid core flow algorithms were formulated in different manners. The boundary layer algorithm was two dimensional and solved in nonconservation form, while the core flow algorithm was one dimensional and solved in conservation form. In order to interface the two codes, the following modifications were important. The coordinate system was set up to maintain the parabolic nature of the boundary layer algorithm while approaching the one dimensional core flow solution far from a wall. The pressure gradient used in the boundary layer equation was calculated using the core flow values and the boundary layer equations, so the boundary layer solution smoothly approached the core flow values far from the wall. Flaring was used for the advection terms perpendicular to the core flow to maintain the stability of the algorithm. With these modifications, the combined viscous/inviscid algorithm matched well experimental observations of pressure distributions with a supersonic inlet.

Darling, Douglas↗

Data-Driven Distributed Algorithms for Estimating Eigenvalues and Eigenvectors of Interconnected Dynamical Systems

Here, the paper presents data-driven algorithms to estimate in a distributed manner the eigenvalues, right and left eigenvectors of an unknown linear (or linearized) interconnected dynamic system. In particular, the proposed algorithms do not require the identification of the system model in advance before performing the estimation. As a first step, we consider interconnected dynamical system with distinct eigenvalues. The proposed strategy first estimates the eigenvalues using the well-known Prony method. The right and left eigenvectors are then estimated by solving distributively a set of linear equations. One important feature of the proposed algorithms is that the topology of communication network used to perform the distributed estimation can be chosen arbitrarily, given that it is connected, and is also independent of the structure or sparsity of the system (state) matrix. The proposed distributed algorithms are demonstrated via a numerical example.

97 MATHEMATICS AND COMPUTING↗

The impact of low-Z and high-Z metal implants in IMRT: A Monte Carlo study of dose inaccuracies in commercial dose algorithms

Purpose: The aim of the study was to evaluate the dosimetric impact of low-Z and high-Z metallic implants on IMRT plans. Methods: Computed tomography (CT) scans of three patients were analyzed to study effects due to the presence of Titanium (low-Z), Platinum and Gold (high-Z) inserts. To eliminate artifacts in CT images, a sinogram-based metal artifact reduction algorithm was applied. IMRT dose calculations were performed on both the uncorrected and corrected images using a commercial planning system (convolution/superposition algorithm) and an in-house Monte Carlo platform. Dose differences between uncorrected and corrected datasets were computed and analyzed using gamma index (Pγ{sub <1}) and setting 2 mm and 2% as distance to agreement and dose difference criteria, respectively. Beam specific depth dose profiles across the metal were also examined. Results: Dose discrepancies between corrected and uncorrected datasets were not significant for low-Z material. High-Z materials caused under-dosage of 20%–25% in the region surrounding the metal and over dosage of 10%–15% downstream of the hardware. Gamma index test yielded Pγ{sub <1}>99% for all low-Z cases; while for high-Z cases it returned 91% < Pγ{sub <1}< 99%. Analysis of the depth dose curve of a single beam for low-Z cases revealed that, although the dose attenuation is altered inside the metal, it does not differ downstream of the insert. However, for high-Z metal implants the dose is increased up to 10%–12% around the insert. In addition, Monte Carlo method was more sensitive to the presence of metal inserts than superposition/convolution algorithm. Conclusions: The reduction in terms of dose of metal artifacts in CT images is relevant for high-Z implants. In this case, dose distribution should be calculated using Monte Carlo algorithms, given their superior accuracy in dose modeling in and around the metal. In addition, the knowledge of the composition of metal inserts improves the accuracy of the Monte Carlo dose calculation significantly.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Entanglement perspective on the quantum approximate optimization algorithm

Many quantum algorithms seek to output a specific bitstring solving the problem of interest—or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit depth, which aims to solve quadratic unconstrained binary optimization problems. Hence, the expected final state for these algorithms is either a product state or a low-entangled superposition involving a few bitstrings. What happens in between the initial N -qubit product state | 0 〉 ⊗ N and the final one regarding entanglement? Here, we consider the QAOA algorithm for solving the paradigmatic MaxCut problem on different types of graphs. We study the entanglement growth and spread resulting from randomized and optimized QAOA circuits and find that there is a volume-law entanglement barrier between the initial and final states. We also investigate the entanglement spectrum in connection with random matrix theory. In addition, we compare the entanglement production with a quantum annealing protocol aiming to solve the same MaxCut problems. Finally, we discuss the implications of our results for the simulation of QAOA circuits with tensor network-based methods relying on low-entanglement for efficiency, such as matrix product states.

Dupont, Maxime↗

Automatic Regionalization Algorithm for Distributed State Estimation in Power Systems

The deregulation of the power system and the incorporation of generation from renewable energy sources recessitates faster state estimation in the smart grid. Distributed state estimation (DSE) has become a promising and scalable solution to this urgent demand. In this paper, we investigate the regionalization algorithms for the power system, a necessary step before distributed state estimation can be performed. To the best of the authors' knowledge, this is the first investigation on automatic regionalization (AR). We propose three spectral clustering based AR algorithms. Simulations show that our proposed algorithms outperform the two investigated manual regionalization cases. With the help of AR algorithms, we also show how the number of regions impacts the accuracy and convergence speed of the DSE and conclude that the number of regions needs to be chosen carefully to improve the convergence speed of DSEs.

24 POWER TRANSMISSION AND DISTRIBUTION↗