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 1,711 records · Page 95

SIS epidemiological model for adaptive RT: Forecasting the parotid glands shrinkage during tomotherapy treatment

Purpose: A susceptible-infected-susceptible (SIS) epidemic model was applied to radiation therapy (RT) treatments to predict morphological variations in head and neck (H&N) anatomy. Methods: 360 daily MVCT images of 12 H&N patients treated by tomotherapy were analyzed in this retrospective study. Deformable image registration (DIR) algorithms, mesh grids, and structure recontouring, implemented in the RayStation treatment planning system (TPS), were applied to assess the daily organ warping. The parotid’s warping was evaluated using the epidemiological approach considering each vertex as a single subject and its deformed vector field (DVF) as an infection. Dedicated IronPython scripts were developed to export daily coordinates and displacements of the region of interest (ROI) from the TPS. MATLAB tools were implemented to simulate the SIS modeling. Finally, the fully trained model was applied to a new patient. Results: A QUASAR phantom was used to validate the model. The patients’ validation was obtained setting 0.4 cm of vertex displacement as threshold and splitting susceptible (S) and infectious (I) cases. The correlation between the epidemiological model and the parotids’ trend for further optimization of alpha and beta was carried out by Euclidean and dynamic time warping (DTW) distances. The best fit with experimental conditions across all patients (Euclidean distance of 4.09 ± 1.12 and DTW distance of 2.39 ± 0.66) was obtained setting the contact rate at 7.55 ± 0.69 and the recovery rate at 2.45 ± 0.26; birth rate was disregarded in this constant population. Conclusions: Combining an epidemiological model with adaptive RT (ART), the authors’ novel approach could support image-guided radiation therapy (IGRT) to validate daily setup and to forecast anatomical variations. The SIS-ART model developed could support clinical decisions in order to optimize timing of replanning achieving personalized treatments.

60 APPLIED LIFE SCIENCES↗

Initial CEED API (CEED-MS10)

Key components of CEED software development involve fast finite element operator storage and evaluation, architecture optimizations, performant algorithms for all orders, global kernels for finite element operators, efficient use of the memory sub-system, optimal data locality and motion, enhanced scalability and parallelism, and fast tensor contractions. As ultimate goals of the project, CEED is exploring and identifying the best algorithms for the full range of discretizations and applying algorithmic and software development to support ECP applications’ needs. In this milestone, we initiated the development and implementation of a common CEED API consisting of two main components: low-level and high-level APIs. We accomplished the goal of having the low-level component ready for the release of CEED v1.0 in the next quarter, see CEED-MS13. In this report we also provide a highlight from CEED’s integration with the MARBL app and the corresponding Laghos miniapp. A main theme in this work has been the systematic transition of advanced algorithms, developed and tested in Laghos, to the large-scale multi-physics settings of the MARBL code. The low-level CEED API provides a set of FE kernels and components for writing new low-level kernels. Examples include: vector and sparse linear algebra, element matrix assembly over a batch of elements, partial assembly and action for efficient high-order operators like mass, diffusion, advection, etc. The main goal of the low-level API is to establish the basis for the high-level API. Also, identifying such low-level kernels and providing a reference implementation for them serves as the basis for collaboration with vendors and STs. Another goal for the low-level API is to make it easy for applications with their own discretization infrastructure, who do not want to switch directly to using the high-level CEED API, to still evaluate and use the core operations provided by the low-level API. One of the challenges with high-order methods is that a global sparse matrix is no longer a good representation of a high-order linear operator, both with respect to the FLOPs needed for its evaluation, as well as the memory transfer needed for a matvec. Thus, another important question we tried to address while developing the low-level API is: is it possible to abstract out in a natural and efficient way the different implementations and data structures that arise when dealing with various computational device types: CPUs, GPUs, etc. Fully answering this question is beyond the scope of this particular milestone, since that requires longer time as we develop and expand the devices we support. The future high-level API will be the frontend provided by CEED consisting of high-level abstractions such as meshes, finite element spaces and solutions, bilinear forms, solvers, etc. At this high-level, an important aspect of the API will be to provide a uniform abstraction layer for writing code in a portable manner. To achieve that, we plan to utilize the MPI programming model combined with a device abstraction layer (DAL) for finite element computations that we will develop. The DAL will serve as the bridge between the low- and the high-level APIs, allowing a variety of programming models to be used for the low-level kernel implementations. The software artifacts delivered as part of this milestone include an initial CEED API software implementation (libCEED) provided through the CEED website, http://ceed.exascaleproject.org and the CEED GitHub organization, http://github.com/ceed. In addition to details and results from the above R&D efforts, in this document we are also reporting on other project-wide activities performed in Q1 of FY18, including: the Nek5000 v17.0 MFEM v3.3.2 and PETSc v3.8 releases, collaborations with ECP/ST and SciDAC projects, the inaugural Nek5000 hackathon and various outreach activities.

97 MATHEMATICS AND COMPUTING↗

Integrated risk/cost planning models for the US Air Traffic system

A prototype network planning model for the U.S. Air Traffic control system is described. The model encompasses the dual objectives of managing collision risks and transportation costs where traffic flows can be related to these objectives. The underlying structure is a network graph with nonseparable convex costs; the model is solved efficiently by capitalizing on its intrinsic characteristics. Two specialized algorithms for solving the resulting problems are described: (1) truncated Newton, and (2) simplicial decomposition. The feasibility of the approach is demonstrated using data collected from a control center in the Midwest. Computational results with different computer systems are presented, including a vector supercomputer (CRAY-XMP). The risk/cost model has two primary uses: (1) as a strategic planning tool using aggregate flight information, and (2) as an integrated operational system for forecasting congestion and monitoring (controlling) flow throughout the U.S. In the latter case, access to a supercomputer is required due to the model's enormous size.

Mulvey, J. M.↗

Quotient-difference type generalizations of the power method and their analysis

The recursion relations that were proposed by W. F. Ford and A. Sidi (Appl. Numer. Math, 4 (1988), pp. 477-489) for implementing vector extrapolation methods are used for devising generalizations of the power method for linear operators. These generalizations are shown to produce approximations to largest eigenvalues of a linear operator under certain conditions. They are similar in form to the quotient-difference algorithm and share similar convergence properties with the latter. These convergence properties also resemble those obtained for the basic LR and QR algorithms. Finally, it is shown that the convergence rate produced by one fo these generalizations is twice as fast for normal operators as it is for nonnormal operators.

Sidi, Avram↗

Error control techniques for satellite and space communications

The unequal error protection capabilities of convolutional and trellis codes are studied. In certain environments, a discrepancy in the amount of error protection placed on different information bits is desirable. Examples of environments which have data of varying importance are a number of speech coding algorithms, packet switched networks, multi-user systems, embedded coding systems, and high definition television. Encoders which provide more than one level of error protection to information bits are called unequal error protection (UEP) codes. In this work, the effective free distance vector, d, is defined as an alternative to the free distance as a primary performance parameter for UEP convolutional and trellis encoders. For a given (n, k), convolutional encoder, G, the effective free distance vector is defined as the k-dimensional vector d = (d(sub 0), d(sub 1), ..., d(sub k-1)), where d(sub j), the j(exp th) effective free distance, is the lowest Hamming weight among all code sequences that are generated by input sequences with at least one '1' in the j(exp th) position. It is shown that, although the free distance for a code is unique to the code and independent of the encoder realization, the effective distance vector is dependent on the encoder realization.

Costello, Daniel J., Jr.↗

Wire Detection Algorithms for Navigation

In this research we addressed the problem of obstacle detection for low altitude rotorcraft flight. In particular, the problem of detecting thin wires in the presence of image clutter and noise was studied. Wires present a serious hazard to rotorcrafts. Since they are very thin, their detection early enough so that the pilot has enough time to take evasive action is difficult, as their images can be less than one or two pixels wide. Two approaches were explored for this purpose. The first approach involved a technique for sub-pixel edge detection and subsequent post processing, in order to reduce the false alarms. After reviewing the line detection literature, an algorithm for sub-pixel edge detection proposed by Steger was identified as having good potential to solve the considered task. The algorithm was tested using a set of images synthetically generated by combining real outdoor images with computer generated wire images. The performance of the algorithm was evaluated both, at the pixel and the wire levels. It was observed that the algorithm performs well, provided that the wires are not too thin (or distant) and that some post processing is performed to remove false alarms due to clutter. The second approach involved the use of an example-based learning scheme namely, Support Vector Machines. The purpose of this approach was to explore the feasibility of an example-based learning based approach for the task of detecting wires from their images. Support Vector Machines (SVMs) have emerged as a promising pattern classification tool and have been used in various applications. It was found that this approach is not suitable for very thin wires and of course, not suitable at all for sub-pixel thick wires. High dimensionality of the data as such does not present a major problem for SVMs. However it is desirable to have a large number of training examples especially for high dimensional data. The main difficulty in using SVMs (or any other example-based learning method) is the need for a very good set of positive and negative examples since the performance depends on the quality of the training set.

Kasturi, Rangachar↗

Cold Commissioning Simulant Selection for the Hanford Tank Waste Treatment Plant LAW Facility - 18465

Commissioning the Low-Activity Waste (LAW) Facility of the Hanford Tank Waste Treatment and Immobilization Plant (WTP) will require large volumes (∼2,000,000 liters) of a non-radioactive, chemically analogous waste simulant. Cold commissioning will provide for operator training in an integrated facility, demonstration of mechanical process equipment capacity, environmental performance demonstration of emissions control systems, and process control systems shakedown and tuning. Selection of the cold commissioning simulant is following a structured four-phase process to arrive at the preferred composition and recipe. Phases I, II and III are complete. Phase I laid the framework for decision making with preparation of a Project Management Plan, an update to the Simulant Development, Approval, Validation, and Documentation procedure, and a kickoff meeting to gather stakeholder input into the simulant definition and selection criteria. Phase II consisted of a comprehensive literature search and compilation of LAW simulant recipes, followed by initial screening against the selection criteria identified in Phase I. This process identified 72 candidate simulant recipes and down-selected 9 for further study. Phase III studies involved a) statistical comparisons of the similarity of candidate simulant compositions to the tank waste feed vector, b) process modelling of the commissioning sequence with each simulant to estimate glass former and simulant material consumption, offgas and effluent volumes and compositions, and product glass volumes and compositions, and c) evaluation of simulants against the immobilized LAW glass composition algorithm to determine allo able waste loading to ensure compliance with product specifications and process constraints. The results of these studies identified two of the candidate recipes to be carried forward to full-scale testing. Phase IV consists of testing these two recipes at vendor facilities to determine scalability, fabricability, and stability of the simulants when produced at industrial scale. Scalability is the ability to take a recipe from bench scale (1 to 40 liters) batch size to full scale (>35,000 liters) batch size. Fabricability is the ability of a recipe to be prepared in large batches without the need for complex or expensive mechanical equipment, heating, or cooling systems. Stability is the ability of a simulant to withstand long term storage and variations in environmental conditions without unacceptable changes in key characteristics (the set of chemical, physical, and rheological parameters that the simulant is intended to exhibit during cold commissioning tests). Simulants will also be tested for compatibility with other startup material (i.e., frit), tuning simulants, and environmental performance demonstration test spiking solutions to ensure against unexpected situations. Using a structured process is essential when making high impact decisions such as waste simulant selection. Proper planning and a clear explanation of how the decision process will unfold is key to obtaining stakeholder buy-in as more information is gathered. The documentation resulting from this structured selection process will be compiled and summarized in a Cold Commissioning Simulant Definition deliverable due to the Department of Energy 24 months before the start of Cold Commissioning. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A hybrid reconstruction algorithm for fast and accurate 4D cone-beam CT imaging

Purpose: 4D cone beam CT (4D-CBCT) has been utilized in radiation therapy to provide 4D image guidance in lung and upper abdomen area. However, clinical application of 4D-CBCT is currently limited due to the long scan time and low image quality. The purpose of this paper is to develop a new 4D-CBCT reconstruction method that restores volumetric images based on the 1-min scan data acquired with a standard 3D-CBCT protocol. Methods: The model optimizes a deformation vector field that deforms a patient-specific planning CT (p-CT), so that the calculated 4D-CBCT projections match measurements. A forward-backward splitting (FBS) method is invented to solve the optimization problem. It splits the original problem into two well-studied subproblems, i.e., image reconstruction and deformable image registration. By iteratively solving the two subproblems, FBS gradually yields correct deformation information, while maintaining high image quality. The whole workflow is implemented on a graphic-processing-unit to improve efficiency. Comprehensive evaluations have been conducted on a moving phantom and three real patient cases regarding the accuracy and quality of the reconstructed images, as well as the algorithm robustness and efficiency. Results: The proposed algorithm reconstructs 4D-CBCT images from highly under-sampled projection data acquired with 1-min scans. Regarding the anatomical structure location accuracy, 0.204 mm average differences and 0.484 mm maximum difference are found for the phantom case, and the maximum differences of 0.3–0.5 mm for patients 1–3 are observed. As for the image quality, intensity errors below 5 and 20 HU compared to the planning CT are achieved for the phantom and the patient cases, respectively. Signal-noise-ratio values are improved by 12.74 and 5.12 times compared to results from FDK algorithm using the 1-min data and 4-min data, respectively. The computation time of the algorithm on a NVIDIA GTX590 card is 1–1.5 min per phase. Conclusions: High-quality 4D-CBCT imaging based on the clinically standard 1-min 3D CBCT scanning protocol is feasible via the proposed hybrid reconstruction algorithm.

60 APPLIED LIFE SCIENCES↗

Machine Learning-Based Identification of the Interface Regions for Coupling Local and Nonlocal Models

Local-nonlocal coupling approaches provide a means to combine the computational efficiency of local models and the accuracy of nonlocal models. However, the coupling process can be challenging, requiring expertise to identify the interface between local and nonlocal regions. Here, this study introduces a machine learning-based approach to automatically detect the regions in which the local and nonlocal models should be used. The method uses loading functions evaluated at grid points to decide the model selection at those points. Training of the networks is based on datasets provided by classes of loading functions for which reference coupling configurations are computed using accurate coupled solutions, where accuracy is measured in terms of the relative error between the solution to the coupling approach and the solution to the nonlocal model. We study two approaches that vary in data structure. The first, the full-domain input data approach, uses the entire load vector and outputs a complete label vector, performing a global classification. The second, a window-based approach, processes loads into windows and addresses the problem as a node-wise classification where each window's central point is classified individually. The classification problems are solved via deep learning algorithms based on convolutional neural networks. The performance of these approaches is studied on one-dimensional numerical examples using F1-scores and accuracy metrics. Notably, the windowing approach achieves an accuracy of 0.96 and an F1-score of 0.97, highlighting its potential to automate coupling processes effectively and enhance computational efficiency in material science applications.

97 MATHEMATICS AND COMPUTING↗

Constrained low-thrust guidance.

Constrained low thrust guidance algorithms for three axis and spin-stabilized, constant power, solar electric propelled spacecraft on fixed time rendezvous missions are developed. A 'bang-bang' type of minimum-propellant thrust program is used. Control constraints arise from the specification that the thrust vector must remain fixed relative to the solar panels. The guidance law is derived from deterministic linear perturbation theory and is controllable to first order on trajectories containing at least two thrust arcs. The number and timing of guidance updates and the effectiveness of the guidance law in compensating for state and control estimation biases and uncertainties are discussed. Numerical comparisons between the optimal control and the restricted control case are presented on a Encke comet rendezvous.

Ungs, M. J.↗

Investigation of electrodynamic stabilization and control of long orbiting tethers

An algorithm for using electric currents to control pendular oscillations induced by various perturbing forces on the Skyhook wire is considered. Transverse and vertical forces on the tether; tether instability modes and causes during retrieval by space shuttle; simple and spherical pendulum motion and vector damping; and current generation and control are discussed. A computer program for numerical integration of the in-plane and out-of-plane displacements of the tether vs time was developed for heuristic study. Some techniques for controlling instabilities during payload retrieval and methods for employing the tether for launching satellites from the space shuttle are considered. Derivations and analyses of a general nature used in all of the areas studied are included.

Arnold, D. A.↗

Advances in information extraction techniques

Sundry recent developments are presented which show some potential for affecting the automatic extraction of information from remotely sensed data. Pattern representations more abstract than Euclidean vector spaces offer some hope of unifying structural and decision theoretical approaches. The estimation of expected classification error rates is becoming more sophisticated and rigorous, but useful finite-sample results for nonparametric distributions appear unobtainable. Focus on computational complexity allows comparison of algorithms, while software engineering techniques reduce the effort necessary to develop and maintain complex image processing systems. Advances in computer systems architecture, commercial database technology, and man-machine communications should be closely monitored by the remote sensing community. A NASA-sponsored recommendation for research directions in mathematical pattern recognition are offered.

Nagy, G.↗

Embedding of attitude determination in n-dimensional spaces

The problem of attitude determination in n-dimensional spaces is addressed. The proper parameters are found, and it is shown that not all three-dimensional methods have useful extensions to higher dimensions. It is demonstrated that Rodriguez parameters are conveniently extendable to other dimensions. An algorithm for using these parameters in the general n-dimensional case is developed and tested with a four-dimensional example. The correct mathematical description of angular velocities is addressed, showing that angular velocity in n dimensions cannot be represented by a vector but rather by a tensor of the second rank. Only in three dimensions can the angular velocity be described by a vector.

Bar-Itzhack, Itzhack Y.↗

Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems

We present an algorithm to compute the pseudospectral abscissa for a nonlinear eigenvalue problem. The algorithm relies on global under-estimator and over-estimator functions for the eigenvalue and singular value functions involved. These global models follow from eigenvalue perturbation theory. The algorithm has three particular features. First, it converges to the globally rightmost point of the pseudospectrum, and it is immune to nonsmoothness. The global convergence assertion is under the assumption that a global lower bound is available for the second derivative of a singular value function depending on one parameter. It may not be easy to deduce such a lower bound analytically, but assigning large negative values works robustly in practice. Second, it is applicable to large-scale problems since the dominant cost per iteration stems from computing the smallest singular value and associated singular vectors, for which efficient iterative solvers can be used. Furthermore, a significant increase in computational efficiency can be obtained by subspace acceleration, that is, by restricting the domains of the linear maps associated with the matrices involved to small but suitable subspaces, and solving the resulting reduced problems. Occasional restarts of these subspaces further enhance the efficiency for large-scale problems. Finally, in contrast to existing iterative approaches based on constructing low-rank perturbations and rightmost eigenvalue computations, the algorithm relies on computing only singular values of complex matrices. Hence, the algorithm does not require solutions of nonlinear eigenvalue problems, thereby further increasing efficiency and reliability. This work is accompanied by a robust implementation of the algorithm that is publicly available.

97 MATHEMATICS AND COMPUTING↗

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗

Enabling Technology for Energy Sustainability: Power Electronic Converter Control for Renewables

To ensure high penetration of renewable energy sources into power grids, their interfacing inverters need to be designed to provide grid support functions. Important grid support functions include frequency and voltage support. To this end, the research community has recently invested heavily on grid-forming control pilot projects. Grid forming control aims to replace traditional grid following control, which is based on phase-locked loop and can achieve decoupled real and reactive power control. Here, in this article, we review the state-of-the-art grid following and forming technology and point out some deficiencies in dynamic performance in the widely adopted grid-forming control design. We also examine how to ensure that the vector control capable of decoupled real and reactive power regulation can also be achieved in the grid forming design. This type of design has been prototyped and shown great potential to enable retrofitting of large amounts of grid-following controllers through purely software algorithm update. The technology ensures reliable operation of power grids with high penetration of IBRs, thereby further reducing fossil fueled energy sources and cut down carbon emission.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An orthogonal coordinate grid following the three-dimensional viscous flow over a concave surface

Swept wings designed for laminar flow control exhibit both centrifugal and crossflow instabilities which produce streamwise vortices that can lead to early transition from laminar to turbulent flow in the presence of Tollmien-Schlichting waves. This paper outlines an iterative algorithm for generation of an orthogonal, curvilinear, coordinate grid following the streamlines of the three-dimensional viscous flow over a swept, concave surface. The governing equations for the metric tensor are derived from the Riemann-Christoffel tensor for an Euclidian geometry. Unit vectors along streamline, normal and binormal directions are determined. The governing equations are not solved directly, but are employed only as compatibility equations. The scale factor for the streamline coordinate is obtained by an iterative integration scheme on a 200 x 100 x 5 grid, while the other two scale factors are determined from definitions. Sample results are obtained which indicate that the compatibility equation error decreases linearly with grid step size. Grids smaller than 200 x 100 x 5 are found to be inadequate to resolve the grid curvature.

Dagenhart, J. R↗

A VLSI Processor Engine to Support Calculation of the Vector Wave Equation

The development of a VLSI processor engine tailored to support computation of the near-field vector wave equation (VWE) is presented. Calculation of the near field is essential for evaluation of the electromagnetic fields generated by a complex radiating structure. The processor engine presented is optimized such that it takes advantage of the extensive parallelism inherent in the computational algorithm. The utilization of very large scale integration (VLSI) circuit technology and a customized reduced instruction set computer (RISC) architecture support development of a system of these processor engines, each of which is capable of performing the VWE algorithm calculation. By taking maximum advantage of the parallelism present in the calculation and dividing the problem among an array of these processor engines, the calculation can be computed in a realistic time frame.

J W Degroat↗