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,585 records · Page 88

Preconditioning for the Navier-Stokes equations with finite-rate chemistry

The extension of Van Leer's preconditioning procedure to generalized finite-rate chemistry is discussed. Application to viscous flow is begun with the proper preconditioning matrix for the one-dimensional Navier-Stokes equations. Eigenvalue stiffness is resolved and convergence-rate acceleration is demonstrated over the entire Mach-number range from nearly stagnant flow to hypersonic. Specific benefits are realized at the low and transonic flow speeds typical of complete propulsion-system simulations. The extended preconditioning matrix necessarily accounts for both thermal and chemical nonequilibrium. Numerical analysis reveals the possible theoretical improvements from using a preconditioner for all Mach number regimes. Numerical results confirm the expectations from the numerical analysis. Representative test cases include flows with previously troublesome embedded high-condition-number areas. Van Leer, Lee, and Roe recently developed an optimal, analytic preconditioning technique to reduce eigenvalue stiffness over the full Mach-number range. By multiplying the flux-balance residual with the preconditioning matrix, the acoustic wave speeds are scaled so that all waves propagate at the same rate, an essential property to eliminate inherent eigenvalue stiffness. This session discusses a synthesis of the thermochemical nonequilibrium flux-splitting developed by Grossman and Cinnella and the characteristic wave preconditioning of Van Leer into a powerful tool for implicitly solving two and three-dimensional flows with generalized finite-rate chemistry. For finite-rate chemistry, the state vector of unknowns is variable in length. Therefore, the preconditioning matrix extended to generalized finite-rate chemistry must accommodate a flexible system of moving waves. Fortunately, no new kind of wave appears in the system. The only existing waves are entropy and vorticity waves, which move with the fluid, and acoustic waves, which propagate in Mach number dependent directions. The nonequilibrium vibrational energies and species densities in the unknown state vector act strictly as convective waves. The essential concept for extending the preconditioning to generalized chemistry models is determining the differential variables which symmetrize the flux Jacobians. The extension is then straight-forward. This algorithm research effort will be released in a future version of the production level computational code coined the General Aerodynamic Simulation Program (GASP), developed by Walters, Slack, and McGrory.

Godfrey, Andrew G.↗

Efficient Optimization of Low-Thrust Spacecraft Trajectories

A paper describes a computationally efficient method of optimizing trajectories of spacecraft driven by propulsion systems that generate low thrusts and, hence, must be operated for long times. A common goal in trajectory-optimization problems is to find minimum-time, minimum-fuel, or Pareto-optimal trajectories (here, Pareto-optimality signifies that no other solutions are superior with respect to both flight time and fuel consumption). The present method utilizes genetic and simulated-annealing algorithms to search for globally Pareto-optimal solutions. These algorithms are implemented in parallel form to reduce computation time. These algorithms are coupled with either of two traditional trajectory- design approaches called "direct" and "indirect." In the direct approach, thrust control is discretized in either arc time or arc length, and the resulting discrete thrust vectors are optimized. The indirect approach involves the primer-vector theory (introduced in 1963), in which the thrust control problem is transformed into a co-state control problem and the initial values of the co-state vector are optimized. In application to two example orbit-transfer problems, this method was found to generate solutions comparable to those of other state-of-the-art trajectory-optimization methods while requiring much less computation time.

Lee, Seungwon↗

Active Suppression of Instabilities in Engine Combustors

A method of feedback control has been proposed as a means of suppressing thermo-acoustic instabilities in a liquid- fueled combustor of a type used in an aircraft engine. The basic principle of the method is one of (1) sensing combustor pressure oscillations associated with instabilities and (2) modulating the rate of flow of fuel to the combustor with a control phase that is chosen adaptively so that the pressure oscillations caused by the modulation oppose the sensed pressure oscillations. The need for this method arises because of the planned introduction of advanced, lean-burning aircraft gas turbine engines, which promise to operate with higher efficiencies and to emit smaller quantities of nitrogen oxides, relative to those of present aircraft engines. Unfortunately, the advanced engines are more susceptible to thermoacoustic instabilities. These instabilities are hard to control because they include large dead-time phase shifts, wide-band noise characterized by amplitudes that are large relative to those of the instabilities, exponential growth of the instabilities, random net phase walks, and amplitude fluctuations. In this method (see figure), the output of a combustion-pressure sensor would be wide-band-pass filtered and then further processed to generate a control signal that would be applied to a fast-actuation valve to modulate the flow of fuel. Initially, the controller would rapidly take large phase steps in order to home in, within a fraction of a second, to a favorable phase region within which the instability would be reduced. Then the controller would restrict itself to operate within this phase region and would further restrict itself to operate within a region of stability, as long as the power in the instability signal was decreasing. In the phase-shifting scheme of this method, the phase of the control vector would be made to continuously bounce back and forth from one boundary of an effective stability region to the other. Computationally, this scheme would be implemented by the adaptive sliding phaser averaged control (ASPAC) algorithm, which requires very little detailed knowledge of the combustor dynamics. In the ASPAC algorithm, the power of the instability signal would be calculated from the wide-bandpass- filtered combustion-pressure signal and averaged over a period of time (typically of the order of a few hundredths of a second) corresponding to the controller updating cycle [not to be confused with the controller sampling cycle, which would be much shorter (typically of the order of 10(exp -4) second)].

Kopasakis, George↗

EOS MLS Level 2 Data Processing Software Version 3

This software accepts the EOS MLS calibrated measurements of microwave radiances products and operational meteorological data, and produces a set of estimates of atmospheric temperature and composition. This version has been designed to be as flexible as possible. The software is controlled by a Level 2 Configuration File that controls all aspects of the software: defining the contents of state and measurement vectors, defining the configurations of the various forward models available, reading appropriate a priori spectroscopic and calibration data, performing retrievals, post-processing results, computing diagnostics, and outputting results in appropriate files. In production mode, the software operates in a parallel form, with one instance of the program acting as a master, coordinating the work of multiple slave instances on a cluster of computers, each computing the results for individual chunks of data. In addition, to do conventional retrieval calculations and producing geophysical products, the Level 2 Configuration File can instruct the software to produce files of simulated radiances based on a state vector formed from a set of geophysical product files taken as input. Combining both the retrieval and simulation tasks in a single piece of software makes it far easier to ensure that identical forward model algorithms and parameters are used in both tasks. This also dramatically reduces the complexity of the code maintenance effort.

Livesey, Nathaniel J.↗

Efficient Maneuver Placement for Automated Trajectory Design

When designing a mission, the addition of a maneuver at the right spot often improves the utility of an otherwise mediocre trajectory. However, the additional degrees of freedom of finding the best maneuver location can severely complicate automated broad-search algorithms. A computationally-efficient formulation that reduces the maneuver design space to a single dimension is presented, where the efficacy of additional maneuvers along previously computed transfers is calculated explicitly via Lawden's "primer vector." Examples include leveraging maneuvers to ease capture at Europa, phasing maneuvers to enable resonant-hopping among Saturn's moons, and broken-plane maneuvers on transfers to Mars.

Landau, Damon↗

The Added Value of SMAP Soil Moisture in Crop Yield Forecasting Over Argentina

Argentina is one of the major producers and exporter of soybeans, corn, and wheat to the world market; therefore, the accurate and timely forecasting of those crops yield is crucial to national crop management and global food security. Previous studies have mainly focused on developing forecasting models for a specific crop type and location using a single source of data (e.g., vegetation indices), thus providing little insight into the forecasting models' performance on different crop types and regions. Besides, these models are based on traditional statistical regression algorithms, while more advanced machine learning approaches have not been explored. This study investigated the estimation of crop yields of three major crops (corn, soybean, and winter wheat) using Multiple Linear Regression (MLR) and Support Vector Machine (SVM), over major growing provinces in Argentina. Our models were trained and evaluated on data from 2015 to 2020, where three remote sensing products (Normalized difference vegetation index (NDVI), SMAP soil moisture, and MODIS evapotranspiration) were used as predictors. Our results indicated that accurate crop yield forecasts using the developed regression models could be made one to two months before harvest. The MLR and SVM model performance varied among different crop types, where soybean and corn exhibited better predictability compare to the wheat. In most cases, the SVM outperformed the multiple linear regression model due to its ability to capture the nonlinear and complex features of the crop-production process. The forecasted model that combines data from multiple sources outperformed single-source satellite data. The highest accuracy was obtained when the three data sources were all considered in the model development. Results also indicated that the inclusion of SMAP soil moisture improved crop yield forecasting in most provinces, and the most significant improvements occurred in the drier region.

Nazmus Shams Sazib↗

Calibration method for a spectral computerized tomography system

A calibration method for an x-ray computerized tomography system and a method of tomographic reconstruction are provided. The calibration method includes steps of measuring at least one point spread function (PSF) at each of a plurality of points, compressing each PSF, and in one or more storing operations, storing the compressed PSFs in a computer-accessible storage medium. The PSF measurements are made in a grid of calibration points in a field of view (FOV) of the system. In the measuring step, an absorber is positioned at each of the calibration points, and an x-ray projection is taken at least once at each of those absorber positions. In the method of tomographic image reconstruction, projection data from an x-ray tomographic projection system are input to an iterative image reconstruction algorithm. The algorithm retrieves and utilizes a priori system information (APSI) The APSI comprises comprising point spread functions (PSFs) of all voxels in a voxelization of the field of view that are compressed in the form of vectors of parameters. For utilization, each retrieved vector of parameters is decompressed so as to generate a discretized PSF.

Jimenez, Jr., Edward Steven↗

Controlling Attitude of a Solar-Sail Spacecraft Using Vanes

A paper discusses a concept for controlling the attitude and thrust vector of a three-axis stabilized Solar Sail spacecraft using only four single degree-of-freedom articulated spar-tip vanes. The vanes, at the corners of the sail, would be turned to commanded angles about the diagonals of the square sail. Commands would be generated by an adaptive controller that would track a given trajectory while rejecting effects of such disturbance torques as those attributable to offsets between the center of pressure on the sail and the center of mass. The controller would include a standard proportional + derivative part, a feedforward part, and a dynamic component that would act like a generalized integrator. The controller would globally track reference signals, and in the presence of such control-actuator constraints as saturation and delay, the controller would utilize strategies to cancel or reduce their effects. The control scheme would be embodied in a robust, nonlinear algorithm that would allocate torques among the vanes, always finding a stable solution arbitrarily close to the global optimum solution of the control effort allocation problem. The solution would include an acceptably small angle, slow limit-cycle oscillation of the vanes, while providing overall thrust vector pointing stability and performance.

Mettler, Edward↗

A novel improved model for building energy consumption prediction based on model integration

Building energy consumption prediction plays an irreplaceable role in energy planning, management, and conservation. Constantly improving the performance of prediction models is the key to ensuring the efficient operation of energy systems. Moreover, accuracy is no longer the only factor in revealing model performance, it is more important to evaluate the model from multiple perspectives, considering the characteristics of engineering applications. Based on the idea of model integration, this paper proposes a novel improved integration model (stacking model) that can be used to forecast building energy consumption. The stacking model combines advantages of various base prediction algorithms and forms them into “meta-features” to ensure that the final model can observe datasets from different spatial and structural angles. Two cases are used to demonstrate practical engineering applications of the stacking model. A comparative analysis is performed to evaluate the prediction performance of the stacking model in contrast with existing well-known prediction models including Random Forest, Gradient Boosted Decision Tree, Extreme Gradient Boosting, Support Vector Machine, and K-Nearest Neighbor. The results indicate that the stacking method achieves better performance than other models, regarding accuracy (improvement of 9.5%–31.6% for Case A and 16.2%–49.4% for Case B), generalization (improvement of 6.7%–29.5% for Case A and 7.1%-34.6% for Case B), and robustness (improvement of 1.5%–34.1% for Case A and 1.8%–19.3% for Case B). The proposed model enriches the diversity of algorithm libraries of empirical models.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

SU-E-J-170: Beyond Single-Cycle 4DCT: Maximum a Posteriori (MAP) Reconstruction-Based Binning-Free Multicycle 4DCT for Lung Radiotherapy

Purpose: Thoracic motion changes from cycle-to-cycle and day-to-day. Conventional 4DCT does not capture these cycle to cycle variations. We present initial results of a novel 4DCT reconstruction technique based on maximum a posteriori (MAP) reconstruction. The technique uses the same acquisition process (and therefore dose) as a conventional 4DCT in order to create a high spatiotemporal resolution cine CT that captures several breathing cycles. Methods: Raw 4DCT data were acquired from a lung cancer patient. The continuous 4DCT was reconstructed using MAP algorithm which uses the raw, time-stamped CT data to reconstruct images while simultaneously estimating deformation in the subject's anatomy. This framework incorporates physical effects such as hysteresis and is robust to detector noise and irregular breathing patterns. The 4D image is described in terms of a 3D reference image defined at one end of the hysteresis loop, and two deformation vector fields (DVFs) corresponding to inhale motion and exhale motion respectively. The MAP method uses all of the CT projection data and maximizes the log posterior in order to iteratively estimate a timevariant deformation vector field that describes the entire moving and deforming volume. Results: The MAP 4DCT yielded CT-quality images for multiple cycles corresponding to the entire duration of CT acquisition, unlike the conventional 4DCT, which only yielded a single cycle. Variations such as amplitude and frequency changes and baseline shifts were clearly captured by the MAP 4DC Conclusion: We have developed a novel, binning-free, parameterized 4DCT reconstruction technique that can capture cycle-to-cycle variations of respiratory motion. This technique provides an invaluable tool for respiratory motion management research. This work was supported by funding from the National Institutes of Health and VisionRT Ltd. Amit Sawant receives research funding from Varian Medical Systems, Vision RT and Elekta.

60 APPLIED LIFE SCIENCES↗

Deformable Image Registration of Liver With Consideration of Lung Sliding Motion

Purpose: A feature based deformable registration model with sliding transformation was developed in the upper abdominal region for liver cancer. Methods: A two-step thin-plate spline (bi-TPS) algorithm was implemented to deformably register the liver organ. The first TPS registration was performed to exclusively quantify the sliding displacement component. A manual segmentation of the thoracic and abdominal cavity was performed as a priori knowledge. Tissue feature points were automatically identified inside the segmented contour on the images. The scale invariant feature transform method was utilized to match feature points that served as landmarks for the subsequent TPS registration to derive the sliding displacement vector field. To a good approximation, only motion along superior/inferior (SI) direction of voxels on each slice was averaged to obtain the sliding displacement for each slice. A second TPS transformation, as the last step, was carried out to obtain the local deformation field. Manual identification of bifurcation on liver, together with the manual segmentation of liver organ, was employed as a ''ground truth'' for assessing the algorithm's performance. Results: The proposed two-step TPS was assessed with six liver patients. The average error of liver bifurcation between manual identification and calculation for these patients was less than 1.8 mm. The residual errors between manual contour and propagated contour of liver organ using the algorithm fell in the range between 2.1 and 2.8 mm. An index of Dice similarity coefficient (DSC) between manual contour and calculated contour for liver tumor was 93.6% compared with 71.2% from the conventional TPS calculation. Conclusions: A high accuracy ({approx}2 mm) of the two-step feature based TPS registration algorithm was achievable for registering the liver organ. The discontinuous motion in the upper abdominal region was properly taken into consideration. Clinical implementation of the algorithm will find broad application in radiation therapy of liver cancer.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Volume 2: Explicit, multistage upwind schemes for Euler and Navier-Stokes equations

The objective of this study was to develop a high-resolution-explicit-multi-block numerical algorithm, suitable for efficient computation of the three-dimensional, time-dependent Euler and Navier-Stokes equations. The resulting algorithm has employed a finite volume approach, using monotonic upstream schemes for conservation laws (MUSCL)-type differencing to obtain state variables at cell interface. Variable interpolations were written in the k-scheme formulation. Inviscid fluxes were calculated via Roe's flux-difference splitting, and van Leer's flux-vector splitting techniques, which are considered state of the art. The viscous terms were discretized using a second-order, central-difference operator. Two classes of explicit time integration has been investigated for solving the compressible inviscid/viscous flow problems--two-state predictor-corrector schemes, and multistage time-stepping schemes. The coefficients of the multistage time-stepping schemes have been modified successfully to achieve better performance with upwind differencing. A technique was developed to optimize the coefficients for good high-frequency damping at relatively high CFL numbers. Local time-stepping, implicit residual smoothing, and multigrid procedure were added to the explicit time stepping scheme to accelerate convergence to steady-state. The developed algorithm was implemented successfully in a multi-block code, which provides complete topological and geometric flexibility. The only requirement is C degree continuity of the grid across the block interface. The algorithm has been validated on a diverse set of three-dimensional test cases of increasing complexity. The cases studied were: (1) supersonic corner flow; (2) supersonic plume flow; (3) laminar and turbulent flow over a flat plate; (4) transonic flow over an ONERA M6 wing; and (5) unsteady flow of a compressible jet impinging on a ground plane (with and without cross flow). The emphasis of the test cases was validation of code, and assessment of performance, as well as demonstration of flexibility.

Elmiligui, Alaa↗

Decoding {beta}-decay systematics: A global statistical model for {beta}{sup -} half-lives

Statistical modeling of nuclear data provides a novel approach to nuclear systematics complementary to established theoretical and phenomenological approaches based on quantum theory. Continuing previous studies in which global statistical modeling is pursued within the general framework of machine learning theory, we implement advances in training algorithms designed to improve generalization, in application to the problem of reproducing and predicting the half-lives of nuclear ground states that decay 100% by the {beta}{sup -} mode. More specifically, fully connected, multilayer feed-forward artificial neural network models are developed using the Levenberg-Marquardt optimization algorithm together with Bayesian regularization and cross-validation. The predictive performance of models emerging from extensive computer experiments is compared with that of traditional microscopic and phenomenological models as well as with the performance of other learning systems, including earlier neural network models as well as the support vector machines recently applied to the same problem. In discussing the results, emphasis is placed on predictions for nuclei that are far from the stability line, and especially those involved in r-process nucleosynthesis. It is found that the new statistical models can match or even surpass the predictive performance of conventional models for {beta}-decay systematics and accordingly should provide a valuable additional tool for exploring the expanding nuclear landscape.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

TH-A-BRF-08: Deformable Registration of MRI and CT Images for MRI-Guided Radiation Therapy

Purpose: To evaluate the quality of a commercially available MRI-CT image registration algorithm and then develop a method to improve the performance of this algorithm for MRI-guided prostate radiotherapy. Methods: Prostate contours were delineated on ten pairs of MRI and CT images using Eclipse. Each pair of MRI and CT images was registered with an intensity-based B-spline algorithm implemented in Velocity. A rectangular prism that contains the prostate volume was partitioned into a tetrahedral mesh which was aligned to the CT image. A finite element method (FEM) was developed on the mesh with the boundary constraints assigned from the Velocity generated displacement vector field (DVF). The resultant FEM displacements were used to adjust the Velocity DVF within the prism. Point correspondences between the CT and MR images identified within the prism could be used as additional boundary constraints to enforce the model deformation. The FEM deformation field is smooth in the interior of the prism, and equal to the Velocity displacements at the boundary of the prism. To evaluate the Velocity and FEM registration results, three criteria were used: prostate volume conservation and center consistence under contour mapping, and unbalanced energy of their deformation maps. Results: With the DVFs generated by the Velocity and FEM simulations, the prostate contours were warped from MRI to CT images. With the Velocity DVFs, the prostate volumes changed 10.2% on average, in contrast to 1.8% induced by the FEM DVFs. The average of the center deviations was 0.36 and 0.27 cm, and the unbalance energy was 2.65 and 0.38 mJ/cc3 for the Velocity and FEM registrations, respectively. Conclusion: The adaptive FEM method developed can be used to reduce the error of the MIbased registration algorithm implemented in Velocity in the prostate region, and consequently may help improve the quality of MRI-guided radiation therapy.

60 APPLIED LIFE SCIENCES↗

eFESTA: Ensemble Feature Exploration with Surface Density Estimates

We propose surface density estimate (SDE) to model the spatial distribution of surface features-isosurfaces, ridge surfaces, and streamsurfaces-in 3D ensemble simulation data. The inputs of SDE computation are surface features represented as polygon meshes, and no field datasets are required (e.g., scalar fields or vector fields). The SDE is defined as the kernel density estimate of the infinite set of points on the input surfaces and is approximated by accumulating the surface densities of triangular patches. We also propose an algorithm to guide the selection of a proper kernel bandwidth for SDE computation. An ensemble Feature Exploration method based on Surface densiTy EstimAtes (eFESTA) is then proposed to extract and visualize the major trends of ensemble surface features. For an ensemble of surface features, each surface is first transformed into a density field based on its contribution to the SDE, and the resulting density fields are organized into a hierarchical representation based on the pairwise distances between them. The hierarchical representation is then used to guide visual exploration of the density fields as well as the underlying surface features. We demonstrate the application of our method using isosurface in ensemble scalar fields, Lagrangian coherent structures in uncertain unsteady flows, and streamsurfaces in ensemble fluid flows.

Computational modeling↗

Hierarchical probing for estimating the trace of the matrix inverse on toroidal lattices

The standard approach for computing the trace of the inverse of a very large, sparse matrix $A$ is to view the trace as the mean value of matrix quadratures, and use the Monte Carlo algorithm to estimate it. This approach is heavily used in our motivating application of Lattice QCD. Often, the elements of $A^{-1}$ display certain decay properties away from the non zero structure of $A$, but random vectors cannot exploit this induced structure of $A^{-1}$. Probing is a technique that, given a sparsity pattern of $A$, discovers elements of $A$ through matrix-vector multiplications with specially designed vectors. In the case of $A^{-1}$, the pattern is obtained by distance-$k$ coloring of the graph of $A$. For sufficiently large $k$, the method produces accurate trace estimates but the cost of producing the colorings becomes prohibitively expensive. More importantly, it is difficult to search for an optimal $k$ value, since none of the work for prior choices of $k$ can be reused.

Stathopoulos, Andreas↗

Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints (SHEBO) v1.0

SHEBO (surrogate optimization of problems with hidden constraints and expensive black-box objectives) is an efficient optimization algorithm that employs surrogate models to solve computationally expensive black-box simulation optimization problems that have hidden constraints. Hidden constraints are encountered when the objective function evaluation does not return a value for a parameter vector. These constraints are often encountered in optimization problems in which the objective function is computed by a black-box simulation code. SHEBO uses a combination of local and global search strategies together with an evaluability prediction function and a dynamically adjusted evaluability threshold to iteratively select new sample points.

Mueller, Juliane↗

Lion Cub: Minimizing Communication Overhead in Distributed Lion

Communication overhead is a key challenge in distributed deep learning, especially on slower Ethernet intercon nects, and given current hardware trends, communication is likely to become a major bottleneck. While gradient compression techniques have been explored for SGD and Adam, the Lion optimizer has the distinct advantage that its update vectors are the output of a sign operation, enabling straightforward quantization. However, simply compressing updates for communication and using techniques like majority voting fails to lead to end-to-end speedups due to inefficient communication algorithms and reduced convergence. We analyze three factors critical to distributed learning with Lion: optimizing communication methods, identifying effective quantization methods, and assessing the necessity of momentum synchronization. Our findings show that quantization techniques adapted to Lion and selective momentum synchronization can significantly reduce communication costs while maintaining convergence. We combine these into Lion Cub, which enables up to 5x speedups in end-to-end training compared to Lion. This highlights Lion’s potential as a communication-efficient solution for distributed training.

97 MATHEMATICS AND COMPUTING↗