Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “coordinate computing”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Spherical fitting for oscilloscope film trace reading

This report describes a spherical fitting algorithm that can be used for estimating the oscilloscope film trace coordinates. This algorithm was adopted from a least square algebraic spherical fitting algorithm developed by the author earlier for photovoltaic velocimetry applications. Preliminary assessment suggests that the algorithm may be used for optimizing the coordinates manually digitized by the user, or may be used as an uncertainty estimator for the user’s film reading uncertainties.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1977

A computer program for the identification of helicopter impulsive noise sources

A computer program is presented for calculating the source location of implusive noise in helicopters. The program (INSL) is written in FORTRAN for the CDC 7600 computer. Inputs are the rotor operating conditions and the time intervals (T) between rotor 1/rev index and impulsive noises as measured by different microphones. The outputs are the possible noise source locations in terms of rotor radial and azimuthal coordinates. Typical computer time for a run of six microphone measurements is 1.5 sec, and the cost is about 12 cents for the CDC 7600.

Lee, A.↗
DOE OSTI2022

Coordinate Transformations

This whitepaper provides details for the background, conventions, definitions, transformation equations, examples, and implementation used in the Solid Body Geometry (SBG) transformations in Monte Carlo Application ToolKit (MCATK).

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1986

Interactive algebraic grid-generation technique

An algebraic grid generation technique and use of an associated interactive computer program are described. The technique, called the two boundary technique, is based on Hermite cubic interpolation between two fixed, nonintersecting boundaries. The boundaries are referred to as the bottom and top, and they are defined by two ordered sets of points. Left and right side boundaries which intersect the bottom and top boundaries may also be specified by two ordered sets of points. when side boundaries are specified, linear blending functions are used to conform interior interpolation to the side boundaries. Spacing between physical grid coordinates is determined as a function of boundary data and uniformly space computational coordinates. Control functions relating computational coordinates to parametric intermediate variables that affect the distance between grid points are embedded in the interpolation formulas. A versatile control function technique with smooth-cubic-spline functions is presented. The technique works best in an interactive graphics environment where computational displays and user responses are quickly exchanged. An interactive computer program based on the technique and called TBGG (two boundary grid generation) is also described.

Smith, R. E.↗
NASA NTRS2004

Rapid Structured Volume Grid Smoothing and Adaption Technique

A rapid, structured volume grid smoothing and adaption technique, based on signal processing methods, was developed and applied to the Shuttle Orbiter at hypervelocity flight conditions in support of the Columbia Accident Investigation. Because of the fast pace of the investigation, computational aerothermodynamicists, applying hypersonic viscous flow solving computational fluid dynamic (CFD) codes, refined and enhanced a grid for an undamaged baseline vehicle to assess a variety of damage scenarios. Of the many methods available to modify a structured grid, most are time-consuming and require significant user interaction. By casting the grid data into different coordinate systems, specifically two computational coordinates with arclength as the third coordinate, signal processing methods are used for filtering the data [Taubin, CG v/29 1995]. Using a reverse transformation, the processed data are used to smooth the Cartesian coordinates of the structured grids. By coupling the signal processing method with existing grid operations within the Volume Grid Manipulator tool, problems related to grid smoothing are solved efficiently and with minimal user interaction. Examples of these smoothing operations are illustrated for reduction in grid stretching and volume grid adaptation. In each of these examples, other techniques existed at the time of the Columbia accident, but the incorporation of signal processing techniques reduced the time to perform the corrections by nearly 60%. This reduction in time to perform the corrections therefore enabled the assessment of approximately twice the number of damage scenarios than previously possible during the allocated investigation time.

Alter, Stephen J.↗
NASA NTRS2006

Rapid Structured Volume Grid Smoothing and Adaption Technique

A rapid, structured volume grid smoothing and adaption technique, based on signal processing methods, was developed and applied to the Shuttle Orbiter at hypervelocity flight conditions in support of the Columbia Accident Investigation. Because of the fast pace of the investigation, computational aerothermodynamicists, applying hypersonic viscous flow solving computational fluid dynamic (CFD) codes, refined and enhanced a grid for an undamaged baseline vehicle to assess a variety of damage scenarios. Of the many methods available to modify a structured grid, most are time-consuming and require significant user interaction. By casting the grid data into different coordinate systems, specifically two computational coordinates with arclength as the third coordinate, signal processing methods are used for filtering the data [Taubin, CG v/29 1995]. Using a reverse transformation, the processed data are used to smooth the Cartesian coordinates of the structured grids. By coupling the signal processing method with existing grid operations within the Volume Grid Manipulator tool, problems related to grid smoothing are solved efficiently and with minimal user interaction. Examples of these smoothing operations are illustrated for reductions in grid stretching and volume grid adaptation. In each of these examples, other techniques existed at the time of the Columbia accident, but the incorporation of signal processing techniques reduced the time to perform the corrections by nearly 60%. This reduction in time to perform the corrections therefore enabled the assessment of approximately twice the number of damage scenarios than previously possible during the allocated investigation time.

Alter, Stephen J.↗
NASA NTRS1982

An implicit solution of the three-dimensional Navier-Stokes equations for an airfoil spanning a wind tunnel

An implicit finite-difference algorithm is developed for the numerical solution of the incompressible three dimensional Navier-Stokes equations in the non-conservative primitive-variable formulation. The flow field about an airfoil spanning a wind-tunnel is computed. The coordinate system is generated by an extension of the two dimensional body-fitted coordinate generation techniques of Thompson, as well as that of Sorenson, into three dimensions. Two dimensional grids are stacked along a spanwise coordinate defined by a simple analytical function. A Poisson pressure equation for advancing the pressure in time is arrived at by performing a divergence operation on the momentum equations. The pressure at each time-step is calculated on the assumption that continuity be unconditionally satisfied. An eddy viscosity coefficient, computed according to the algebraic turbulence formulation of Baldwin and Lomax, simulates the effects of turbulence.

Moitra, A.↗
NASA NTRS1998

Algorithms for Efficient Computation of Transfer Functions for Large Order Flexible Systems

An efficient and robust computational scheme is given for the calculation of the frequency response function of a large order, flexible system implemented with a linear, time invariant control system. Advantage is taken of the highly structured sparsity of the system matrix of the plant based on a model of the structure using normal mode coordinates. The computational time per frequency point of the new computational scheme is a linear function of system size, a significant improvement over traditional, still-matrix techniques whose computational times per frequency point range from quadratic to cubic functions of system size. This permits the practical frequency domain analysis of systems of much larger order than by traditional, full-matrix techniques. Formulations are given for both open- and closed-loop systems. Numerical examples are presented showing the advantages of the present formulation over traditional approaches, both in speed and in accuracy. Using a model with 703 structural modes, the present method was up to two orders of magnitude faster than a traditional method. The present method generally showed good to excellent accuracy throughout the range of test frequencies, while traditional methods gave adequate accuracy for lower frequencies, but generally deteriorated in performance at higher frequencies with worst case errors being many orders of magnitude times the correct values.

Maghami, Peiman G.↗
NASA NTRS1997

Efficient Computation of Closed-loop Frequency Response for Large Order Flexible Systems

An efficient and robust computational scheme is given for the calculation of the frequency response function of a large order, flexible system implemented with a linear, time invariant control system. Advantage is taken of the highly structured sparsity of the system matrix of the plant based on a model of the structure using normal mode coordinates. The computational time per frequency point of the new computational scheme is a linear function of system size, a significant improvement over traditional, full-matrix techniques whose computational times per frequency point range from quadratic to cubic functions of system size. This permits the practical frequency domain analysis of systems of much larger order than by traditional, full-matrix techniques. Formulations are given for both open and closed loop loop systems. Numerical examples are presented showing the advantages of the present formulation over traditional approaches, both in speed and in accuracy. Using a model with 703 structural modes, a speed-up of almost two orders of magnitude was observed while accuracy improved by up to 5 decimal places.

Maghami, Peiman G.↗
NASA NTRS1992

Computation of the flow field in a centrifugal impeller with splitter blades

To support the design effort of the Space Transportation Main Engine (STME) Fuel Pump Stage, viscous flow calculations were performed in a centrifugal impeller with splitter blades. These calculations were carried out with a Navier-Stokes solver (MINT), which employs a linearized block-implicit Alternating Direction Implicit (ADI) procedure to iteratively solve a finite difference form of the system of conservation equations of mass, momentum, and energy in body-fitted coordinates. A computational grid was generated algebraically for the 'channel' between two main blades of the impeller and extended both upstream of the impeller inlet and downstream of the impeller exit so that the appropriate boundary conditions could be applied. The results of the calculations show that although the overall level of flow distortion near the impeller exit is not very large, there is a noticeable difference between the flow patterns in the two 'passages' (one passage between the pressure side of the splitter blade and the suction side of the next full blade).

Dejong, Frederik J.↗
NASA NTRS1993

Transforming Vectors Measured By Noncoaligned Instruments

Method for computing relationships between coordinate axes of two vector-measuring instruments not aligned with each other, one need only measure two nonparallel vectors u and v simultaneously in both coordinate systems. These measurements provide all data needed to compute transformation of any vector from one coordinate system to other. Particularly useful in computing alignments and transformations between accelerometers, gyroscopes, and instruments mounted on platforms subjected to vibrations, thermal strains, and other distortions causing alignments to vary unpredictably with time.

Ritter, James R.↗
NASA NTRS2004

Overview of Transonic to Hypersonic Stage Separation Tool Development for Multi-Stage-to-Orbit Concepts

An overview of research efforts at NASA in support of the stage separation and ascent aerothermodynamics research program is presented. The objective of this work is to develop a synergistic suite of experimental, computational, and engineering tools and methods to apply to vehicle separation across the transonic to hypersonic speed regimes. Proximity testing of a generic bimese wing-body configuration is on-going in the transonic (Mach numbers 0.6, 1.05, and 1.1), supersonic (Mach numbers 2.3, 3.0, and 4.5) and hypersonic (Mach numbers 6 and 10) speed regimes in four wind tunnel facilities at the NASA Langley Research Center. An overset grid, Navier-Stokes flow solver has been enhanced and demonstrated on a matrix of proximity cases and on a dynamic separation simulation of the bimese configuration. Steady-state predictions with this solver were in excellent agreement with wind tunnel data at Mach 3 as were predictions via a Cartesian-grid Euler solver. Experimental and computational data have been used to evaluate multi-body enhancements to the widely-used Aerodynamic Preliminary Analysis System, an engineering methodology, and to develop a new software package, SepSim, for the simulation and visualization of vehicle motions in a stage separation scenario. Web-based software will be used for archiving information generated from this research program into a database accessible to the user community. Thus, a framework has been established to study stage separation problems using coordinated experimental, computational, and engineering tools.

Murphy, Kelly J.↗
DOE OSTI2026

Hydrated Metal and Metal-Nitrate Complexes in Water: Full Lanthanide(III) Series plus Miscellaneous Metal Ions

This is a dataset of hydrated metal complexes and metal–nitrate hydrated complexes intended for public use, reproducibility, and downstream structural analysis. A key feature is coverage across the full lanthanide(III) series (La–Lu), enabling systematic comparisons of coordination motifs and bonding trends across the entire lanthanide sequence. In addition to the lanthanides, the dataset also includes other metal ions such as UO2(VI), Fe(II), and Fe(III). The dataset provides optimized geometries for hydrated and nitrate-containing hydrated complexes, together with representative ab initio molecular dynamics (AIMD) trajectories saved in standard XYZ formats. The accompanying NWChem input decks enable reproduction of the reported calculations and provide a starting point for extending the simulations to related coordination environments. Computationally, DFT calculations employ the B3LYP functional with DFT-D3BJ dispersion corrections and a COSMO continuum solvent model (dielectric constant 78.4) to represent solvation beyond the explicitly treated first hydration shell. AIMD simulations are performed with the NWChem qmd module at 298 K, integrating nuclear motion with the velocity-Verlet algorithm and controlling temperature using a Nosé–Hoover thermostat. Trajectories are approximately 4.8 ps in length and are used primarily to assess short-time stability of candidate coordination motifs, including (for lanthanides) differences between 8- versus 9-water coordination and comparisons between nitrate-bound and nitrate-free hydrated complexes.

Dinpajooh, Mohammadhasan [Pacific Northwest Nation↗
NASA NTRS1985

Finding Bright-Spot Coordinates in Television Images

Circuit provides data for computer to calculate coordinates of bright spot of light in video image. Calculation performed while image being scanned, and results available immediately at end of video frame. Video-processing circuit has variety of potential uses in commerce and industry. For example, locates tagged-parts on factory assembly line or track airplane landing lights.

Richardson, T. E.↗
DOE OSTI2026

Blueprint: Coordinated Vulnerability Disclosure (CVD) Adoption for Information Sharing and Analysis Center (ISAC)-Like Groups

The electric vehicle supply equipment (EVSE) industry is an incredibly diverse set of participants (EVSE manufacturers, charge network operators (CNOs), original equipment manufacturers (OEMs), etc.), and with the potential for an Information Sharing and Analysis Centers (ISAC) or ISAC-like group, it requires a series of guidance for doing a multiparty coordinated vulnerability disclosure (CVD) such that a group like this could be successful. This blueprint provides a template and guidance to stakeholders in the EVSE industry for conducting a multiparty CVD. It also formalizes what multiparty CVD could look like in an ISAC-like group with multiple entities as well as vulnerability coordinators by specifically calling out who in the ISAC-like group may be involved, and which industry members it may apply to. This blueprint leverages tools such as Vultron, VINCE, etc. along with open resources such as the Software Engineering Institutes guide for coordinated vulnerability disclosure, for the stakeholder in the EVSE industry to start up a CVD program of their own.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2003

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗
DOE OSTI2024

Characterizing 4-string contact interaction using machine learning

Abstract The geometry of 4-string contact interaction of closed string field theory is characterized using machine learning. We obtain Strebel quadratic differentials on 4-punctured spheres as a neural network by performing unsupervised learning with a custom-built loss function. This allows us to solve for local coordinates and compute their associated mapping radii numerically. We also train a neural network distinguishing vertex from Feynman region. As a check, 4-tachyon contact term in the tachyon potential is computed and a good agreement with the results in the literature is observed. We argue that our algorithm is manifestly independent of number of punctures and scaling it to characterize the geometry ofn-string contact interaction is feasible.

Physics↗
DOE OSTI2021

An Eulerian Vlasov-Fokker–Planck algorithm for spherical implosion simulations of inertial confinement fusion capsules

Here, we present a numerical algorithm that enables a phase-space adaptive Eulerian Vlasov–Fokker–Planck (VFP) simulation of inertial confinement fusion (ICF) capsule implosions. The approach relies on extending a recent mass, momentum, and energy conserving phase-space moving-mesh adaptivity strategy to spherical geometry. In configuration space, we employ a mesh motion partial differential equation (MMPDE) strategy while, in velocity space, the mesh is expanded/contracted and shifted with the plasma’s evolving temperature and drift velocity. The mesh motion is dealt with by transforming the underlying VFP equations into a computational (logical) coordinate, with the resulting inertial terms carefully discretized to ensure conservation. To deal with the spatial and temporally varying dynamics in a spherically imploding system, we have developed a novel nonlinear stabilization strategy for MMPDE in the configuration space. The strategy relies on a nonlinear optimization procedure that optimizes between mesh quality and the volumetric rate change of the mesh to ensure both accuracy and stability of the solution. Implosions of ICF capsules are driven by several boundary conditions: (1) an elastic moving wall boundary; (2) a time-dependent Maxwellian Dirichlet boundary; and (3) a pressure-driven Lagrangian boundary. Of these, the pressure-driven Lagrangian boundary driver is new to our knowledge. The implementation of our strategy is verified through a set of test problems, including the Guderley and Van-Dyke implosion problems — the first-ever reported using a Vlasov–Fokker–Planck model.

1D2V↗