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,441 records · Page 80

On estimating gravity anomalies - A comparison of least squares collocation with conventional least squares techniques

The least squares collocation algorithm for estimating gravity anomalies from geodetic data is shown to be an application of the well known regression equations which provide the mean and covariance of a random vector (gravity anomalies) given a realization of a correlated random vector (geodetic data). It is also shown that the collocation solution for gravity anomalies is equivalent to the conventional least-squares-Stokes' function solution when the conventional solution utilizes properly weighted zero a priori estimates. The mathematical and physical assumptions underlying the least squares collocation estimator are described.

Argentiero, P.↗

Accommodation of practical constraints by a linear programming jet select

An experimental spacecraft control system will be incorporated into the Space Shuttle flight software and exercised during a forthcoming mission to evaluate its performance and handling qualities. The control system incorporates a 'phase space' control law to generate rate change requests and a linear programming jet select to compute jet firings. Posed as a linear programming problem, jet selection must represent the rate change request as a linear combination of jet acceleration vectors where the coefficients are the jet firing times, while minimizing the fuel expended in satisfying that request. This problem is solved in real time using a revised Simplex algorithm. In order to implement the jet selection algorithm in the Shuttle flight control computer, it was modified to accommodate certain practical features of the Shuttle such as limited computer throughput, lengthy firing times, and a large number of control jets. To the authors' knowledge, this is the first such application of linear programming. It was made possible by careful consideration of the jet selection problem in terms of the properties of linear programming and the Simplex algorithm. These modifications to the jet select algorithm may by useful for the design of reaction controlled spacecraft.

Bergmann, E.↗

Research in applied mathematics, numerical analysis, and computer science

Research conducted at the Institute for Computer Applications in Science and Engineering (ICASE) in applied mathematics, numerical analysis, and computer science is summarized and abstracts of published reports are presented. The major categories of the ICASE research program are: (1) numerical methods, with particular emphasis on the development and analysis of basic numerical algorithms; (2) control and parameter identification; (3) computational problems in engineering and the physical sciences, particularly fluid dynamics, acoustics, and structural analysis; and (4) computer systems and software, especially vector and parallel computers.

Source record↗

PNS predictions of axisymmetric hypersonic blunt-body and afterbody flowfields

A new space-marching full-body PNS algorithm capable of treating the complete blunt-body and afterbody flowfields over typical wide-bodied configurations is developed and demonstrated. A hybrid differencing scheme involving Flux-Vector Splitting (FVS) across embedded shocks and flowfield discontinuities, and central differencing in smooth (shock-free) regions is used. It is demonstrated that this new full-body PNS scheme can be marched from the spherical stagnation point over the entire body using bow-shock capturing, and provides an efficient and effective way for predicting blunt-body flowfields for various reentry application. The Mach 20 flow over a 30-deg sphere cone is predicted and comparisons are made with an existing VSL scheme for the blunt-body region and an existing PNS scheme for the conical afterbody region. The predicted flowfield and surface-measurable quantities are in excellent agreement, and demonstrate the accuracy and efficiency of the new full-body PNS scheme.

Bhutta, Bilal A.↗

Introduction to Vector Field Visualization

Vector field visualization techniques are essential to help us understand the complex dynamics of flow fields. These can be found in a wide range of applications such as study of flows around an aircraft, the blood flow in our heart chambers, ocean circulation models, and severe weather predictions. The vector fields from these various applications can be visually depicted using a number of techniques such as particle traces and advecting textures. In this tutorial, we present several fundamental algorithms in flow visualization including particle integration, particle tracking in time-dependent flows, and seeding strategies. For flows near surfaces, a wide variety of synthetic texture-based algorithms have been developed to depict near-body flow features. The most common approach is based on the Line Integral Convolution (LIC) algorithm. There also exist extensions of LIC to support more flexible texture generations for 3D flow data. This tutorial reviews these algorithms. Tensor fields are found in several real-world applications and also require the aid of visualization to help users understand their data sets. Examples where one can find tensor fields include mechanics to see how material respond to external forces, civil engineering and geomechanics of roads and bridges, and the study of neural pathway via diffusion tensor imaging. This tutorial will provide an overview of the different tensor field visualization techniques, discuss basic tensor decompositions, and go into detail on glyph based methods, deformation based methods, and streamline based methods. Practical examples will be used when presenting the methods; and applications from some case studies will be used as part of the motivation.

Kao, David↗

Analysis of Waste Material Feedstocks Using Laser-Induced Breakdown Spectroscopy and Machine Learning

Predicting properties such as heating value, ash fusion temperature, and mineral ash composition from Laser-Induced Breakdown Spectroscopy (LIBS) data can make gasifiers more flexible to different feedstocks. Understanding these feedstock properties in-situ improves feedstock conversion modelling methods that allow for consistent operation, higher carbon conversion, and reduced fouling and erosion rates. The purpose of this study is to demonstrate methods for model creation that take LIBS data as predictor features and estimate higher order material properties as a function of feedstock material properties. Six samples were chosen to represent a mixture of abundant and carbon rich waste materials. LIBS measurements were performed on these samples for elemental wavelengths and intensity values. Laboratory analytical results were obtained for each sample’s heating value, proximate and ultimate analysis, mineral ash composition, ash fusion temperatures, and viscosity temperatures. Thermal conductivity was measured using a HotDisk TPS 2500S. LIBS measurements were processed and used as predictor features for machine learning (ML) models to predict the sample’s material properties. Predictor feature selection algorithms, particularly minimum redundancy maximum relevance (mRMR), reduced the dimensionality of ML models. Many modelling methods such as Gaussian process regression (GPR), regression tree, neural networks (NN), and support vector machines (SVM) were demonstrated to be effective at predicting higher order properties; however, mRMR with GPR stood out as a clear winning combination.

01 COAL, LIGNITE, AND PEAT↗

Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth

Matrix chain multiplication -- computing $\mathcal{W} = M^{(0)}\cdots M^{(K-1)}$ where $M^{(k)} \in \mathbb{R}^{P_k \times P_{k+1}}$-- arises in scientific computing, machine learning, and graph analysis. Despite the importance of this problem, for chains of distinct matrices, the classical number of operations grows linearly with the chain length $K$ and polynomially in the matrix dimensions. We present \emph{Two-Tower Matrix Multiplication}, a quantum subroutine that encodes the product $\mathcal{W}$ of the $K$ matrices into a quantum state in circuit depth $\mathcal{O}(\max_{k} \mathrm{polylog} (P_k P_{k+1}))$, which is independent of~$K$ within the QRAM-based state-preparation model, whereas the qubit count is $\mathcal{O}\bigl(\sum_{k} \log P_k \bigr)$; the total gate count remains linear in $K$, so the gain is in the circuit depth. The construction interleaves state-preparation operators across two layers; within each layer, all operators act on disjoint registers and execute in parallel. This subroutine can be specialized for the chain-vector case, which computes the product of $K-1$ matrices applied to a vector. We prove the correctness of the subroutine for all $K$ and provide two implementations using the Qiskit and QCLAB frameworks. The subroutine is applicable to any downstream quantum algorithm that operates on a matrix encoded in the statevector, including norm estimation, graph-matrix powers, linear system solving, and quantum machine learning kernels.

Antonioli, Giacomo [Pisa U.] (ORCID:00090000668703↗

SU-F-BRA-13: Knowledge-Based Treatment Planning for Prostate LDR Brachytherapy Based On Principle Component Analysis

Purpose: To create a knowledge-based algorithm for prostate LDR brachytherapy treatment planning that standardizes plan quality using seed arrangements tailored to individual physician preferences while being fast enough for real-time planning. Methods: A dataset of 130 prior cases was compiled for a physician with an active prostate seed implant practice. Ten cases were randomly selected to test the algorithm. Contours from the 120 library cases were registered to a common reference frame. Contour variations were characterized on a point by point basis using principle component analysis (PCA). A test case was converted to PCA vectors using the same process and then compared with each library case using a Mahalanobis distance to evaluate similarity. Rank order PCA scores were used to select the best-matched library case. The seed arrangement was extracted from the best-matched case and used as a starting point for planning the test case. Computational time was recorded. Any subsequent modifications were recorded that required input from a treatment planner to achieve an acceptable plan. Results: The computational time required to register contours from a test case and evaluate PCA similarity across the library was approximately 10s. Five of the ten test cases did not require any seed additions, deletions, or moves to obtain an acceptable plan. The remaining five test cases required on average 4.2 seed modifications. The time to complete manual plan modifications was less than 30s in all cases. Conclusion: A knowledge-based treatment planning algorithm was developed for prostate LDR brachytherapy based on principle component analysis. Initial results suggest that this approach can be used to quickly create treatment plans that require few if any modifications by the treatment planner. In general, test case plans have seed arrangements which are very similar to prior cases, and thus are inherently tailored to physician preferences.

60 APPLIED LIFE SCIENCES↗

CONUS-wide Projected Flood Frequency and Uncertainty Estimates, Version 1.0

This dataset presents a large-ensemble of CONUS-wide projected flood frequency and uncertainty estimates across ~2.7 million NHDPlusV2 river reaches over the CONUS. The framework producing this dataset leverages a multi-model, uncertainty-aware modeling framework that allows evaluating shifts in flood frequences at the stream reach level across the CONUS. CONUS-wide ensemble streamflow projections generated from hydrologic simulations driven by downscaled and bias-corrected Coupled Model Intercomparison Project Phase 6 (CMIP6) outputs are used to derive these flood frequency and uncertainty estimates over the period 1980 - 2099. A spatially consistent regional L-moment algorithm is applied across clusters defined by the US Hydrologic Unit Code Subregions (HUC4s and HUC8s) and NHDPlusV2 stream orders to estimate flood frequencies. The dataset also includes at-site based flood estimates that allow for the comparison between local and regional approach-based estimates, assess projected changes, and characterize their uncertainties. For more reliable estimation of rare flood frequencies such as 500 and 1000-year return periods, super-ensemble based estimates are also included in the dataset. This dataset is derived to support the "Impact-Informed Dam Safety Risk Assessment for Securing Hydropower Assests" project for the US Department of Energy (DOE) Hydropower and Hydrokinetic Office (H2O). For further details, refer to Kao et al. (2022), Ghimire et al. (2023), Ghimire et al. (2025), and Hosking and Wallis (1997).

Ghimire, Ganesh [ORNL] (ORCID:0000000242843941)↗

Algorithm Determines Wind Speed and Direction from Venturi-Sensor Data

An algorithm computes the velocity of wind from the readings of an instrument like the one described in another Tech Brief. To recapitulate: The sensor has no moving parts and is a compact, rugged means of measuring wind vectors having magnitudes of as much as 300 mph (134 m/s). The sensor includes a Venturi gap bounded by a curved upper and a curved lower surface that are axisymmetric with respect to a vertical axis and mirror-symmetric with respect to a horizontal midplane. One of the curved surfaces is instrumented with multiple ports for measuring dynamic pressures. The sensor also incorporates auxiliary sensors for measuring temperature, relative humidity, and static atmospheric pressure. The design and operation of the sensor are based on the concepts of (1) using Bernoulli's equation (which expresses the relationship among variations of speed, density, and pressure along a streamline) to calculate the speed of the wind from differences among the pressure readings at the various ports; and (2) calculating the direction of the wind from the angular positions of ports selected according to comparisons among their pressure readings. The present algorithm performs these calculations.

Zysko, Jan A.↗

FDEM v.1.0

Algorithm FOEM numerically solves a system of six, coupled, first-order, linear, inhomogeneous partial differential equations (called the "EH-system") with an explicit, time-domain, finite-difference (FD) The six dependent variables three electric field vector components and three magnetic field FOEM vector components) are stored on staggered spatial and temporal grids. Discrete FO operators approximating the partial derivatives possess 2nd-order accuracy in time and Nth-order accuracy in space. The 3D spatial grid is rectangular, and grid intervals are uniform in each coordinate direction. FD formulae for updating the wavefield variables are appropriately non-dimensionalized and normalized so that single-precision arithmetic calculations yield adequate accuracy. This software will be used to generate electromagnetic responses for typical geological/geophysical models of interest in the petroleum, mining, geotechnical, geothermal, hydrological, environmental assessment, and underground storage industries. Additionally, US government agencies (including the military) involved in monitoring of explosions (chemical or nuclear) or remote surveillance of underground facilities may be interested in using algorithm FOEM. Finally, this software may be of use to organizations involved in fundamental research and applications development in the area of electromagnetic wave propagation (e.g. national laboratories, academic departments. industry).

Source record↗

Application of Machine Learning Algorithms to the Study of Noise Artifacts in Gravitational-Wave Data

The sensitivity of searches for astrophysical transients in data from the Laser Interferometer Gravitationalwave Observatory (LIGO) is generally limited by the presence of transient, non-Gaussian noise artifacts, which occur at a high-enough rate such that accidental coincidence across multiple detectors is non-negligible. Furthermore, non-Gaussian noise artifacts typically dominate over the background contributed from stationary noise. These "glitches" can easily be confused for transient gravitational-wave signals, and their robust identification and removal will help any search for astrophysical gravitational-waves. We apply Machine Learning Algorithms (MLAs) to the problem, using data from auxiliary channels within the LIGO detectors that monitor degrees of freedom unaffected by astrophysical signals. Terrestrial noise sources may manifest characteristic disturbances in these auxiliary channels, inducing non-trivial correlations with glitches in the gravitational-wave data. The number of auxiliary-channel parameters describing these disturbances may also be extremely large; high dimensionality is an area where MLAs are particularly well-suited. We demonstrate the feasibility and applicability of three very different MLAs: Artificial Neural Networks, Support Vector Machines, and Random Forests. These classifiers identify and remove a substantial fraction of the glitches present in two very different data sets: four weeks of LIGO's fourth science run and one week of LIGO's sixth science run. We observe that all three algorithms agree on which events are glitches to within 10% for the sixth science run data, and support this by showing that the different optimization criteria used by each classifier generate the same decision surface, based on a likelihood-ratio statistic. Furthermore, we find that all classifiers obtain similar limiting performance, suggesting that most of the useful information currently contained in the auxiliary channel parameters we extract is already being used. Future performance gains are thus likely to involve additional sources of information, rather than improvements in the MLAs themselves.

gravitational-wave data↗

An unstructured-mesh finite-volume MPDATA for compressible atmospheric dynamics

An advancement of the unstructured-mesh finite-volume MPDATA (Multidimensional Positive Definite Advection Transport Algorithm) is presented that formulates the error-compensative pseudo-velocity of the scheme to rely only on face-normal advective fluxes to the dual cells, in contrast to the full vector employed in previous implementations. This is essentially achieved by expressing the temporal truncation error underlying the pseudo-velocity in a form consistent with the flux-divergence of the governing conservation law. The development is especially important for integrating fluid dynamics equations on non-rectilinear meshes whenever face-normal advective mass fluxes are employed for transport compatible with mass continuity—the latter being essential for flux-form schemes. In particular, the proposed formulation enables large-time-step semi-implicit finite-volume integration of the compressible Euler equations using MPDATA on arbitrary hybrid computational meshes. Furthermore, it facilitates multiple error-compensative iterations of the finite-volume MPDATA and improved overall accuracy. The advancement combines straightforwardly with earlier developments, such as the nonoscillatory option, the infinite-gauge variant, and moving curvilinear meshes. A comprehensive description of the scheme is provided for a hybrid horizontally-unstructured vertically-structured computational mesh for efficient global atmospheric flow modelling. The proposed finite-volume MPDATA is verified using selected 3D global atmospheric benchmark simulations, representative of hydrostatic and non-hydrostatic flow regimes. Besides the added capabilities, the scheme retains fully the efficacy of established finite-volume MPDATA formulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Assessing decision boundaries under uncertainty

In order to make design decisions, engineers may seek to identify regions of the design domain that are acceptable in a computationally efficient manner. A design is typically considered acceptable if its reliability with respect to parametric uncertainty exceeds the designer’s desired level of confidence. Despite major advancements in reliability estimation and in design classification via decision boundary estimation, the current literature still lacks a design classification strategy that incorporates parametric uncertainty and desired design confidence. To address this gap, this paper offers a novel interpretation of the acceptance region by defining the decision boundary as the hypersurface which isolates the designs that exceed a user-defined level of confidence given parametric uncertainty. This work addresses the construction of this novel decision boundary using computationally efficient algorithms that were developed for reliability analysis and decision boundary estimation. The approach proposed in this paper is verified on two physical examples from structural and thermal analysis using Support Vector Machines and Efficient Global Optimization-based contour estimation.

97 MATHEMATICS AND COMPUTING↗

Field–potential finite-difference time-domain (FiPo FDTD) technique for computational electromagnetics

Modeling light–matter interactions at the nanoscale requires accurate handling of coupled quantum and electromagnetic systems. This coupling requires information about the electric scalar potential Φ and the magnetic vector potential A, which are not typically calculated in standard computational electromagnetics implementations. To that end, we have developed a field–potential finite-difference time-domain (FiPo FDTD) algorithm, which solves a set of first-order equations for Φ and A alongside equations for the electric and magnetic fields E and H. The FiPo Basic code is essentially conventional FDTD, but with an added module that calculates the potentials. The FiPo Hybrid code self-consistently calculates both fields and potentials and is particularly suitable for coupling with quantum electronic transport solvers because it can be sourced by the potentials themselves. To terminate the domain and mimic infinite space, we have derived and implemented a convolutional perfectly matched layer (CPML) absorbing boundary condition for FiPo FDTD whose performance is on par with state-of-the-art CPMLs for standard FDTD. We present FiPo simulation results on several example systems.

Avazpour, L. [University of Wisconsin-Madison, WI ↗

A graph-based approach to developing adaptive representations of complex reaction mechanisms

An effective adaptive mechanism reduction approach based on flux graph clustering is proposed in this paper. The instantaneous element flux is quantified and considered as a proxy for describing the reactive propensities of the system. Our underlying hypothesis is that even though particular conditions may be characterized by a multitude of combinations of species mass fraction, T, and P, the essential chemistry, and hence the reaction propensity of the mixture that is active under this family of conditions, is the same. Therefore, we opt to use the instantaneous fluxes through the active reactions as an intrinsic property of the system. Flux graphs are first constructed for the chemical reaction system under numerous conditions aiming at capturing the attainable region. Similarity between flux graphs is quantified through the distances between corresponding vectors, using the cosine coefficient and a novel graph-distance metric taking into account the magnitude of each flux and the activity distribution of different fluxes. A hierarchical clustering algorithm is implemented to group similar instantaneous flux graphs into clusters, and consequently a reduced mechanism is generated for each cluster. A search algorithm is defined afterward to assign a new query point to a particular flux graph cluster, and subsequently the reduced mechanism associated with this cluster is used to describe the system at this time point. Finally, the methodology is demonstrated using n-pentane combustion in an adiabatic plug flow reactor model and a pairwise mixing stirred reactor model. (author)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computation of stationary 3D halo currents in fusion devices with accuracy control

This paper addresses the calculation of the resistive distribution of halo currents in three-dimensional structures of large magnetic confinement fusion machines. A Neumann electrokinetic problem is solved on a geometry so complicated that complementarity is used to monitor the discretization error. An irrotational electric field is obtained by a geometric formulation based on the electric scalar potential, whereas three geometric formulations are compared to obtain a solenoidal current density: a formulation based on the electric vector potential and two geometric formulations inspired from mixed and mixed-hybrid Finite Elements. The electric vector potential formulation is usually considered impractical since an enormous computing power is wasted by the topological pre-processing it requires. To solve this challenging problem, we present novel algorithms based on lazy cohomology generators that enable to save orders of magnitude computational time with respect to all other state-of-the-art solutions proposed in literature. Believing that our results are useful in other fields of scientific computing, the proposed algorithm is presented as a detailed pseudocode in such a way that it can be easily implemented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Fixed switching frequency predictive control of an asymmetric source dual inverter system with a floating bridge for multilevel operation

In this study, we propose a modified modulated model predictive control (MMPC) scheme to control an open-end winding induction motor drive using an asymmetric source dual inverter with one floating bridge. The control algorithm uses a modulation algorithm within the cost function optimisation scheme to avoid variable switching frequency. The voltage of the floating capacitor is regulated utilising predefined redundant switching sequences as well as the voltage vector location is identified to improve calculation time. Lastly, the proposed MMPC scheme enhances the output performance with comparison to the model predictive control scheme. Experimental results are presented to verify theory and simulation results.

42 ENGINEERING↗