Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized 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.

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

At least 469 records · Page 26

An efficient approach to unstructured mesh hydrodynamics on the cell broadband engine (u)

Unstructured mesh physics for the Cell Broadband Engine (CBE) has received little or no attention to date, largely because the CBE architecture poses particular challenges for unstructured mesh algorithms. SPU memory management strategies such as data preloading cannot be applied to the irregular memory storage patterns of unstructured meshes; and the SPU vector instruction set does not support the indirect addressing needed by connectivity arrays. This paper presents an approach to unstructured mesh physics that addresses these challenges, by creating a new mesh data structure and reorganizing code to give efficient CBE performance. The approach is demonstrated on the FLAG production hydrodynamics code using standard test problems, and results show an average speedup of more than 5x over the original code.

99 GENERAL AND MISCELLANEOUS↗

Rigorous justification for the space–split sensitivity algorithm to compute linear response in Anosov systems

Ruelle gave a formula for linear response of transitive Anosov diffeomorphisms. Recently, practically computable realizations of Ruelle's formula have emerged that potentially enable sensitivity analysis of certain high-dimensional chaotic numerical simulations encountered in the applied sciences. In this paper, we provide full mathematical justification for the convergence of one such efficient computation, the space–split sensitivity, or S3, algorithm. In S3, Ruelle's formula is computed as a sum of two terms obtained by decomposing the perturbation vector field into a coboundary and a remainder that is parallel to the unstable direction. Such a decomposition results in a splitting of Ruelle's formula that is amenable to efficient computation. Here, we prove the existence of the S3 decomposition and the convergence of the computations of both resulting components of Ruelle's formula.

97 MATHEMATICS AND COMPUTING↗

Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor

Models of interacting many-body quantum systems that may realize new exotic phases of matter, notably quantum spin liquids, are challenging to study using even state-of-the-art classical methods such as tensor network simulations. Quantum computing provides a promising route for overcoming these difficulties to find ground states, dynamics, and more. In this paper, we argue that recently developed hybrid quantum-classical algorithms based on real-time evolution are promising methods for solving a particularly important model in the search for spin liquids, the antiferromagnetic Heisenberg model on the two-dimensional kagome lattice. We show how to construct efficient quantum circuits to implement time evolution for the model and to evaluate key observables on the quantum computer, and we argue that the method has favorable scaling with increasing system size. We then restrict to a 12-spin star plaquette from the kagome lattice and a related 8-spin system, and we give an empirical demonstration on these small systems that the hybrid algorithms can efficiently find the ground state energy and the magnetization curve. For these demonstrations, we use four levels of approximation: exact state vectors, exact state vectors with statistical noise from sampling, noisy classical emulators, and (for the 8-spin system only) real quantum hardware, specifically the Quantinuum H1-1 processor; for the noisy simulations and hardware demonstration, we also employ error mitigation strategies based on the symmetries of the Hamiltonian. Our results strongly suggest that these hybrid algorithms present a promising direction for studying quantum spin liquids and more generally for resolving important unsolved problems in condensed matter theory and beyond.

97 MATHEMATICS AND COMPUTING↗

Delaunay walk for fast nearest neighbor: accelerating correspondence matching for ICP

Point set registration algorithms such as Iterative Closest Point (ICP) are commonly utilized in time-constrained environments like robotics. Finding the nearest neighbor of a point in a reference 3D point set is a common operation in ICP and frequently consumes at least 90% of the computation time. We introduce a novel approach to performing the distance-based nearest neighbor step based on Delaunay triangulation. This greedy algorithm finds the nearest neighbor of a query point by traversing the edges of the Delaunay triangulation created from a reference 3D point set. Our work integrates the Delaunay traversal into the correspondences search of ICP and exploits the iterative aspect of ICP by caching previous correspondences to expedite each iteration. An algorithmic analysis and comparison is conducted showing an order of magnitude speedup for both serial and vector processor implementation.

3d point cloud processing↗

Ab-initio simulation of spin-vibronic spectra of methoxy radical

Despite the fact that experimental and theoretical work on the spectrum of methoxy has stretched from the microwave to the ultraviolet and proceeded for nearly 50 years, parts of the spectrum have remained a challenge to simulate theoretically and make reliable line-by-line assignments. The spectral complexity arises because the radical has a non-zero electron spin and significant vibronic coupling between the two elec- tronic components of the ground state due to the presence of a conical intersection. This work describes a completely ab initio effort to understand and assign the spin- vibronic levels of the X 2E state from 0 to above 3000 cm−1, a region that includes the fundamental transitions of the C-H symmetric and asymmetric stretches that have not previously been identified uniquely. A potential energy surface for methoxy was calculated at the EOM-CCSDT/ANO1 level of theory. Subsequently this potential energy surface was fit to a quartic power series expansion of all nine vibrational nor- mal coordinates (as determined at the minimum of the conical intersection) by the use of a machine-learning-based algorithm. After the addition of spin-orbit coupling, the spin-vibronic problem was solved using both the Krylov-Schur and Lanczos algorithms with the SOCJT3 software to converge eigenvalues up to 3500 cm−1 and their eigen- vectors. The latter were used, in conjunction with the calculated dipole moment and its derivatives (calculated using finite differences at EOM-CCSDT/ANO1 level), to determine spectral intensities for the spin-vibronic spectra. The calculated transition frequencies and intensities were used to simulate and assign the observed transitions of the spin-vibronic spectra of the radical. The credibility of the assignments and their significance is discussed in detail.

Sharma, Ketan [University of Florida, Gainesville,↗

A Second-Order Time-Stepping Scheme for Simulating Ensembles of Parameterized Flow Problems

Abstract We consider settings for which one needs to perform multiple flow simulations based on the Navier–Stokes equations, each having different initial condition data, boundary condition data, forcing functions, and/or coefficients such as the viscosity. For such settings, we propose a second-order time accurate ensemble-based method that to simulate the whole set of solutions, requires, at each time step, the solution of only a single linear system with multiple right-hand-side vectors. Rigorous analyses are given proving the conditional stability and establishing error estimates for the proposed algorithm. Numerical experiments are provided that illustrate the analyses.

Mathematics↗

Chiral rank-$k$ truncations for the multigrid preconditioner of Wilson fermions in lattice QCD

We present a modification to the setup algorithm for the multigrid preconditioner of Wilson fermions in lattice QCD. A larger number of test vectors than that used in conventional multigrid is generated by the smoother. This set of test vectors is then truncated by a singular value decomposition on the chiral components of the test vectors, which are subsequently used to form the prolongation and restriction matrices of the multigrid hierarchy. This modification is demonstrated to improve the convergence of linear equations on an anisotropic lattice with 𝑚𝜋 ≈ 280 MeV from the Hadron Spectrum Collaboration and an isotropic lattice with 𝑚𝜋 ≈ 220 MeV from the MILC Collaboration. The lattice volume dependence of the method is also examined.

Whyte, Travis [Jülich Supercomputing Center, Jülic↗

Comparing Calibration Algorithms for the Rapid Characterization of Pretreated Corn Stover Using Near-Infrared Spectroscopy

Rapid characterization of biomass composition is a key enabling technology for biorefineries—the ability to measure the chemical composition of biomass materials entering the biorefinery as well as the composition of key process intermediate streams would allow real-time process control and the development of robust models to predict process performance. The utility of near-infrared (NIR) spectroscopy for rapid characterization requires multivariate algorithms for building calibration models. The most prevalent algorithm used for building calibration models using NIR spectra is the linear modeling algorithm Partial Least Squares Regression (PLS). Nonlinear regression algorithms (which are typically more computationally intensive than linear modeling approaches) have gained popularity in recent years due to their ability to solve a wide variety of classification and regression problems and the dramatic increase in available computational resources. In this work, we demonstrate that a calibration model can predict the composition of corn stover process intermediate samples pretreated with three different treatments—hot water (HW), dilute acid (DA), and deacetylation followed by dilute acid (DDA). We quantitatively compare three different algorithms for building prediction models based on near-infrared spectroscopy—partial least squares (PLS), support vector machines (SVM), and random forests (RF). We demonstrate the utility of improving model performance by accounting for instrument performance variability using repeated measurements of standard materials (e.g., the “repeatability file” strategy) and investigate its performance with nonlinear regression techniques, and we discuss methods for quantifying the uncertainties of specific predictions among the three methods.

09 BIOMASS FUELS↗

The Orbits of Jupiter’s Irregular Satellites

We report on the improved ephemerides for the irregular Jovian satellites. We used a combination of numerically integrated equations of motion and a weighted least-squares algorithm to fit the astrometric measurements. The orbital fits for 59 satellites are summarized in terms of state vectors, post-fit residuals, and mean orbital elements. The current data set appears to be sensitive to the mass of Himalia, which is constrained to the range of GM = 0.13–0.28 km{sup 3} s{sup −2}. Here, GM is the product of the Newtonian constant of gravitation, G and the body's mass, M . Our analysis of the orbital uncertainties indicates that 11 out of 59 satellites are lost owing to short data arcs. The lost satellites hold provisional International Astronomical Union (IAU) designations and will likely need to be rediscovered.

79 ASTRONOMY AND ASTROPHYSICS↗

Wireless Indoor Location Estimation Based on Neural Network RSS Signature Recognition (LENSR)

Location Based Services (LBS), context aware applications, and people and object tracking depend on the ability to locate mobile devices, also known as localization, in the wireless landscape. Localization enables a diverse set of applications that include, but are not limited to, vehicle guidance in an industrial environment, security monitoring, self-guided tours, personalized communications services, resource tracking, mobile commerce services, guiding emergency workers during fire emergencies, habitat monitoring, environmental surveillance, and receiving alerts. This paper presents a new neural network approach (LENSR) based on a competitive topological Counter Propagation Network (CPN) with k-nearest neighborhood vector mapping, for indoor location estimation based on received signal strength. The advantage of this approach is both speed and accuracy. The tested accuracy of the algorithm was 90.6% within 1 meter and 96.4% within 1.5 meters. Several approaches for location estimation using WLAN technology were reviewed for comparison of results.

99 GENERAL AND MISCELLANEOUS↗

Moebius Algorithm for Domain Wall and GapDW Fermions

The M\"obius domain wall action \cite{Brower:2004xi} is a generalization of Shamir's action, which gives exactly the same overlap fermion lattice action as the separation ($L_s$) between the domain walls is taken to infinity. The performance advantages of the algorithm are presented for a small ensemble of quenched, full QCD domain wall and Gap domain wall lattices \cite{Vranas:2006zk}. In particular, it is shown that at the larger lattice spacings relevant to current dynamical simulations M\"obius fermions work well together with GapDWF reducing $L_s$ by more than a factor of two. It is noted that there is precise map between the domain wall and effective overlap action at finite quark mass including finite $L_s$ chiral violations so that the Ward-Takahashi identities for the axial and vector currents are exactly equivalent in both formulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Estimation of LOCA break size using cascaded support vector regression - 334

A failure of emergency core cooling system (ECCS) during a certain small break loss of coolant accident (SBLOCA) can cause a severe core uncovery and fuel failure. The safety injection systems (SISs) might not function properly in case of a SBLOCA, due to the slight change of pressure in the pipes. Early trend of the major parameters has to be observed and the accurate information has to be given to the nuclear power plant (NPP) operators by precisely identifying the break size to effectively manage accidents. In this study, the objective is to provide to operators the information on the break size in a short time by considering the accident situations such as hot-leg LOCA, cold-leg LOCA, steam generator tube rupture (SGTR). A cascaded support vector regression (CSVR) is used in order to estimate the break size. The simulation data set was obtained from the optimized power plant reactor 1000 (OPR1000) using modular accident analysis program (MAAP) code. And genetic algorithm (GA) was used to select the input variables of the CSVR model and optimize its parameters. As a result of this study, the CSVR model estimate very well the break size of LOCAs. If the operators can predict the break size in the LOCA, they can response quickly and properly to LOCA circumstances to prevent the core uncovery and fuel failure. Also, it will be possible to more efficiently manage beyond design basis accidents. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A novel computer-aided lung nodule detection system for CT images

Purpose: The paper presents a complete computer-aided detection (CAD) system for the detection of lung nodules in computed tomography images. A new mixed feature selection and classification methodology is applied for the first time on a difficult medical image analysis problem. Methods: The CAD system was trained and tested on images from the publicly available Lung Image Database Consortium (LIDC) on the National Cancer Institute website. The detection stage of the system consists of a nodule segmentation method based on nodule and vessel enhancement filters and a computed divergence feature to locate the centers of the nodule clusters. In the subsequent classification stage, invariant features, defined on a gauge coordinates system, are used to differentiate between real nodules and some forms of blood vessels that are easily generating false positive detections. The performance of the novel feature-selective classifier based on genetic algorithms and artificial neural networks (ANNs) is compared with that of two other established classifiers, namely, support vector machines (SVMs) and fixed-topology neural networks. A set of 235 randomly selected cases from the LIDC database was used to train the CAD system. The system has been tested on 125 independent cases from the LIDC database. Results: The overall performance of the fixed-topology ANN classifier slightly exceeds that of the other classifiers, provided the number of internal ANN nodes is chosen well. Making educated guesses about the number of internal ANN nodes is not needed in the new feature-selective classifier, and therefore this classifier remains interesting due to its flexibility and adaptability to the complexity of the classification problem to be solved. Our fixed-topology ANN classifier with 11 hidden nodes reaches a detection sensitivity of 87.5% with an average of four false positives per scan, for nodules with diameter greater than or equal to 3 mm. Analysis of the false positive items reveals that a considerable proportion (18%) of them are smaller nodules, less than 3 mm in diameter. Conclusions: A complete CAD system incorporating novel features is presented, and its performance with three separate classifiers is compared and analyzed. The overall performance of our CAD system equipped with any of the three classifiers is well with respect to other methods described in literature.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

An Incremental Tensor Train Decomposition Algorithm

We present a new algorithm for incrementally updating the tensor train decomposition of a stream of tensor data. This new algorithm, called the tensor train incremental core expansion (TT-ICE) improves upon the current state-of-the-art algorithms for compressing in tensor train format by developing a new adaptive approach that incurs significantly slower rank growth and guarantees compression accuracy. This capability is achieved by limiting the number of new vectors appended to the TT-cores of an existing accumulation tensor after each data increment. These vectors represent directions orthogonal to the span of existing cores and are limited to those needed to represent a newly arrived tensor to a target accuracy. We provide two versions of the algorithm: TT-ICE and TT-ICE accelerated with heuristics (TT-ICE*). Here, we provide a proof of correctness for TT-ICE and empirically demonstrate the performance of the algorithms in compressing large-scale video and scientific simulation datasets. Compared to existing approaches that also use rank adaptation, TT-ICE* achieves 57× higher compression and up to 95% reduction in computational time.

97 MATHEMATICS AND COMPUTING↗

Shape-constrained Input Estimation for Efficient Multi-shaker Vibration Testing

Multi-shaker vibration testing is gaining interest from structural dynamics test engineers as it can provide a much more accurate match to complicated field vibration responses than traditional single-axis shaker tests. However, the force capabilities of the small modal shakers typically used in multi-shaker vibration tests has limited the achievable response levels. To date, most multi-shaker vibration tests have been performed using a variety of standard, commercially-available control systems. While these control systems are adequate for a wide range of multiple-input/multiple-output tests, their control algorithms have not been tailored for the specific problem of multi-shaker vibration tests: efficiently coordinating the various shakers to work together to achieve a desired response. Here, a new input estimation algorithm is developed and demonstrated using simulations and actual test data. This algorithm, dubbed shape-constrained input estimation, is shown to effectively coordinate multiple shakers using a set of constraint vectors based on the deflection shapes of the test structure. This is accomplished by using the singular vector shapes of the system frequency response matrix, which allows the constraint vectors to automatically change as a function of frequency. Simulation and test results indicate a significant reduction in the input forces required to achieve a desired response. Finally, the results indicate that shape-constrained input estimation is an effective method to achieve higher response levels from limited shaker forces which will enable higher level multi-shaker vibration tests to be performed.

42 ENGINEERING↗

Lung tumor tracking in fluoroscopic video based on optical flow

Respiratory gating and tumor tracking for dynamic multileaf collimator delivery require accurate and real-time localization of the lung tumor position during treatment. Deriving tumor position from external surrogates such as abdominal surface motion may have large uncertainties due to the intra- and interfraction variations of the correlation between the external surrogates and internal tumor motion. Implanted fiducial markers can be used to track tumors fluoroscopically in real time with sufficient accuracy. However, it may not be a practical procedure when implanting fiducials bronchoscopically. In this work, a method is presented to track the lung tumor mass or relevant anatomic features projected in fluoroscopic images without implanted fiducial markers based on an optical flow algorithm. The algorithm generates the centroid position of the tracked target and ignores shape changes of the tumor mass shadow. The tracking starts with a segmented tumor projection in an initial image frame. Then, the optical flow between this and all incoming frames acquired during treatment delivery is computed as initial estimations of tumor centroid displacements. The tumor contour in the initial frame is transferred to the incoming frames based on the average of the motion vectors, and its positions in the incoming frames are determined by fine-tuning the contour positions using a template matching algorithm with a small search range. The tracking results were validated by comparing with clinician determined contours on each frame. The position difference in 95% of the frames was found to be less than 1.4 pixels ({approx}0.7 mm) in the best case and 2.8 pixels ({approx}1.4 mm) in the worst case for the five patients studied.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

WE-D-9A-02: Automated Landmark-Guided CT to Cone-Beam CT Deformable Image Registration

Purpose: The anatomical changes that occur between the simulation CT and daily cone-beam CT (CBCT) are investigated using an automated landmark-guided deformable image registration (LDIR) algorithm with simultaneous intensity correction. LDIR was designed to be accurate in the presence of tissue intensity mismatch and heavy noise contamination. Method: An auto-landmark generation algorithm was used in conjunction with a local small volume (LSV) gradient matching search engine to map corresponding landmarks between the CBCT and planning CT. The LSVs offsets were used to perform an initial deformation, generate landmarks, and correct local intensity mismatch. The landmarks act as stabilizing controlpoints in the Demons objective function. The accuracy of the LDIR algorithm was evaluated on one synthetic case with ground truth and data of ten head and neck cancer patients. The deformation vector field (DVF) accuracy was accessed using a synthetic case. The Root mean square error of the 3D canny edge (RMSECE), mutual information (MI), and feature similarity index metric (FSIM) were used to access the accuracy of LDIR on the patient data. The quality of the corresponding deformed contours was verified by an attending physician. Results: The resulting 90 percentile DVF error for the synthetic case was within 5.63mm for the original demons algorithm, 2.84mm for intensity correction alone, 2.45mm using controlpoints without intensity correction, and 1.48 mm for the LDIR algorithm. For the five patients the mean RMSECE of the original CT, Demons deformed CT, intensity corrected Demons CT, control-point stabilized deformed CT, and LDIR CT was 0.24, 0.26, 0.20, 0.20, and 0.16 respectively. Conclusion: LDIR is accurate in the presence of multimodal intensity mismatch and CBCT noise contamination. Since LDIR is GPU based it can be implemented with minimal additional strain on clinical resources. This project has been supported by a CPRIT individual investigator award RP11032.

60 APPLIED LIFE SCIENCES↗

Linearized Functional Minimization for Inverse Modeling

Heterogeneous aquifers typically consist of multiple lithofacies, whose spatial arrangement significantly affects flow and transport. The estimation of these lithofacies is complicated by the scarcity of data and by the lack of a clear correlation between identifiable geologic indicators and attributes. We introduce a new inverse-modeling approach to estimate both the spatial extent of hydrofacies and their properties from sparse measurements of hydraulic conductivity and hydraulic head. Our approach is to minimize a functional defined on the vectors of values of hydraulic conductivity and hydraulic head fields defined on regular grids at a user-determined resolution. This functional is constructed to (i) enforce the relationship between conductivity and heads provided by the groundwater flow equation, (ii) penalize deviations of the reconstructed fields from measurements where they are available, and (iii) penalize reconstructed fields that are not piece-wise smooth. We develop an iterative solver for this functional that exploits a local linearization of the mapping from conductivity to head. This approach provides a computationally efficient algorithm that rapidly converges to a solution. A series of numerical experiments demonstrates the robustness of our approach.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗