Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “COMPUTER METHOD”

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 451 records · Page 25

Rapid method for computing the mechanical resonances of irregular objects

A solid object's geometry, density, and elastic moduli completely determine its spectrum of normal modes. Solving the inverse problem—determining a material's elastic moduli given a set of resonance frequencies and sample geometry—relies on the ability to compute resonance spectra accurately and efficiently. Established methods for calculating these spectra are either fast but limited to simple geometries, or are applicable to arbitrarily shaped samples at the cost of being prohibitively slow. Here, we describe a method to rapidly compute the normal modes of irregularly shaped objects using entirely open-source software. Our method's accuracy compares favorably with existing methods for simple geometries and shows a significant improvement in speed over existing methods for irregular geometries.

Acoustics↗

An O(N squared) method for computing the eigensystem of N by N symmetric tridiagonal matrices by the divide and conquer approach

An efficient method is proposed to solve the eigenproblem of N by N Symmetric Tridiagonal (ST) matrices. Unlike the standard eigensolvers which necessitate O(N cubed) operations to compute the eigenvectors of such ST matrices, the proposed method computes both the eigenvalues and eigenvectors with only O(N squared) operations. The method is based on serial implementation of the recently introduced Divide and Conquer (DC) algorithm. It exploits the fact that by O(N squared) of DC operations, one can compute the eigenvalues of N by N ST matrix and a finite number of pairs of successive rows of its eigenvector matrix. The rest of the eigenvectors--all of them or one at a time--are computed by linear three-term recurrence relations. Numerical examples are presented which demonstrate the superiority of the proposed method by saving an order of magnitude in execution time at the expense of sacrificing a few orders of accuracy.

Gill, Doron↗

Computer-implemented method and apparatus for autonomous position determination using magnetic field data

A computer-implemented method and apparatus for determining position of a vehicle within 100 km autonomously from magnetic field measurements and attitude data without a priori knowledge of position. An inverted dipole solution of two possible position solutions for each measurement of magnetic field data are deterministically calculated by a program controlled processor solving the inverted first order spherical harmonic representation of the geomagnetic field for two unit position vectors 180 degrees apart and a vehicle distance from the center of the earth. Correction schemes such as a successive substitutions and a Newton-Raphson method are applied to each dipole. The two position solutions for each measurement are saved separately. Velocity vectors for the position solutions are calculated so that a total energy difference for each of the two resultant position paths is computed. The position path with the smaller absolute total energy difference is chosen as the true position path of the vehicle.

Ketchum, Eleanor A.↗

Hardware packet pacing using a DMA in a parallel computer

Method and system for hardware packet pacing using a direct memory access controller in a parallel computer which, in one aspect, keeps track of a total number of bytes put on the network as a result of a remote get operation, using a hardware token counter.

97 MATHEMATICS AND COMPUTING↗

Providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

Methods, apparatus, and products are disclosed for providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: identifying each link in the global combining network for each compute node of the operational group; designating one of a plurality of point-to-point class routing identifiers for each link such that no compute node in the operational group is connected to two adjacent compute nodes in the operational group with links designated for the same class routing identifiers; and configuring each compute node of the operational group for point-to-point communications with each adjacent compute node in the global combining network through the link between that compute node and that adjacent compute node using that link's designated class routing identifier.

97 MATHEMATICS AND COMPUTING↗

A rational interpolation method to compute frequency response

A rational interpolation method for approximating a frequency response is presented. The method is based on a product formulation of finite differences, thereby avoiding the numerical problems incurred by near-equal-valued subtraction. Also, resonant pole and zero cancellation schemes are developed that increase the accuracy and efficiency of the interpolation method. Selection techniques of interpolation points are also discussed.

Kenney, Charles↗

Efficient numerical methods for computing ground states of spin-1 Bose–Einstein condensates based on their characterizations

In this paper, we propose efficient numerical methods for computing ground states of spin-1 Bose–Einstein condensates (BECs) with/without the Ioffe–Pritchard magnetic field B(x). When B(x)≠0, a numerical method is introduced to compute the ground states and it is also applied to study properties of ground states. Numerical results suggest that the densities of m{sub F}=±1 components in ground states are identical for any nonzero B(x). In particular, if B(x)≡B≠0 is a constant, the ground states satisfy the single-mode approximation. When B(x)≡0, efficient and simpler numerical methods are presented to solve the ground states of spin-1 BECs based on their ferromagnetic/antiferromagnetic characterizations. Numerical simulations show that our methods are more efficient than those in the literature. In addition, some conjectures are made from our numerical observations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Dispatching packets on a global combining network of a parallel computer

Methods, apparatus, and products are disclosed for dispatching packets on a global combining network of a parallel computer comprising a plurality of nodes connected for data communications using the network capable of performing collective operations and point to point operations that include: receiving, by an origin system messaging module on an origin node from an origin application messaging module on the origin node, a storage identifier and an operation identifier, the storage identifier specifying storage containing an application message for transmission to a target node, and the operation identifier specifying a message passing operation; packetizing, by the origin system messaging module, the application message into network packets for transmission to the target node, each network packet specifying the operation identifier and an operation type for the message passing operation specified by the operation identifier; and transmitting, by the origin system messaging module, the network packets to the target node.

97 MATHEMATICS AND COMPUTING↗

SCALE-6 Sensitivity/Uncertainty Methods and Covariance Data

Computational methods and data used for sensitivity and uncertainty analysis within the SCALE nuclear analysis code system are presented. The methodology used to calculate sensitivity coefficients and similarity coefficients and to perform nuclear data adjustment is discussed. A description is provided of the SCALE-6 covariance library based on ENDF/B-VII and other nuclear data evaluations, supplemented by 'low-fidelity' approximate covariances.

99 GENERAL AND MISCELLANEOUS↗

An Automated Refinement Process for Particle Trajectory Methods in GlennICE

Computational methods for ice accretion can simulate the impact of water drops and ice crystals on an aircraft surface in a Lagrangian reference frame or in the Eulerian reference frame. In the Eulerian reference frame, particles are considered a continuous fluid while in the Lagrangian frame individual particle trajectories are calculated. Methods that use the Eulerian reference frame are typically easier to develop as established modules used for continuum mechanics can be leveraged. The Eulerian systems can also be faster since the user does not have to simulate millions of particles in order to achieve good results. It is imperative therefore that a Lagrangian method optimize the release points of trajectories such that accurate solutions can be obtained while minimizing as much as possible the number of trajectories computed. This paper will present a methodology for this refinement process and demonstrate its effectiveness on sample three dimensional test cases.

William B Wright↗

An Automated Refinement Process for Particle Trajectory Methods in GlennICE

Computational methods for ice accretion can simulate the impact of water drops and ice crystals on an aircraft surface in a Lagrangian reference frame or in the Eulerian reference frame. In the Eulerian reference frame, particles are considered a continuous fluid while in the Lagrangian frame individual particle trajectories are calculated. Methods that use the Eulerian reference frame are typically easier to develop as established modules used for continuum mechanics can be leveraged. The Eulerian systems can also be faster since the user does not have to simulate millions of particles in order to achieve good results. It is imperative therefore that a Lagrangian method optimize the release points of trajectories such that accurate solutions can be obtained while minimizing as much as possible the number of trajectories computed. This paper will present a methodology for this refinement process and demonstrate its effectiveness on sample three dimensional test cases.

William Wright↗

Enabling in-time Prognostics with Surrogate Modeling through Physics-enhanced Dynamic Mode Decomposition Method

Computational models provide essential quantitative tools for assessing and predicting the health and performance of physical systems. However, high-fidelity models are rarely used in real-time operations or large optimization loops, due to their time-intensive nature. A common approach to improving computational efficiency of prognosis is to employ surrogate models. Such models can significantly decrease computation time for some accuracy loss. In this context, use of Dynamic Mode Decomposition (DMD) is proposed to generate surrogate models for lithium-ion (Li-ion) battery discharge. DMD has been suggested and used successfully in the area of fluid dynamics for over a decade, but it has not been applied to the PHM domain, where far-ahead prediction of nonlinear behavior is crucial to propagate faults or predict Remaining Useful Life (RUL). For Li-ion battery health management, the standard application of DMD using only the observable quantities of interest was unable to capture the nonlinear discharge of batteries exhibited in lab testing. The Koopman theory, however, provides a mechanism to tradeoff low dimensional nonlinear models with high-dimensional linear ones in a DMD framework, by augmenting nonlinear state variables into the system representation. In this way, DMD allows for configurable simulation accuracy dependent on the dimensionality of the Koopman operator. For battery health management, we augmented the observable variables with the hidden states of a higher-fidelity physics model to build the DMD surrogate. In comparison to a high-fidelity model, the surrogate improved computational efficiency with only a minimal loss of accuracy, and enabled long-term prognostics horizons. A generalized method for this was implemented in the prog models python package.

prognostics and health management↗

Line-plane broadcasting in a data communications network of a parallel computer

Methods, apparatus, and products are disclosed for line-plane broadcasting in a data communications network of a parallel computer, the parallel computer comprising a plurality of compute nodes connected together through the network, the network optimized for point to point data communications and characterized by at least a first dimension, a second dimension, and a third dimension, that include: initiating, by a broadcasting compute node, a broadcast operation, including sending a message to all of the compute nodes along an axis of the first dimension for the network; sending, by each compute node along the axis of the first dimension, the message to all of the compute nodes along an axis of the second dimension for the network; and sending, by each compute node along the axis of the second dimension, the message to all of the compute nodes along an axis of the third dimension for the network.

Archer, Charles J↗

Self-pacing direct memory access data transfer operations for compute nodes in a parallel computer

Methods, apparatus, and products are disclosed for self-pacing DMA data transfer operations for nodes in a parallel computer that include: transferring, by an origin DMA on an origin node, a RTS message to a target node, the RTS message specifying an message on the origin node for transfer to the target node; receiving, in an origin injection FIFO for the origin DMA from a target DMA on the target node in response to transferring the RTS message, a target RGET descriptor followed by a DMA transfer operation descriptor, the DMA descriptor for transmitting a message portion to the target node, the target RGET descriptor specifying an origin RGET descriptor on the origin node that specifies an additional DMA descriptor for transmitting an additional message portion to the target node; processing, by the origin DMA, the target RGET descriptor; and processing, by the origin DMA, the DMA transfer operation descriptor.

97 MATHEMATICS AND COMPUTING↗

Line-plane broadcasting in a data communications network of a parallel computer

Methods, apparatus, and products are disclosed for line-plane broadcasting in a data communications network of a parallel computer, the parallel computer comprising a plurality of compute nodes connected together through the network, the network optimized for point to point data communications and characterized by at least a first dimension, a second dimension, and a third dimension, that include: initiating, by a broadcasting compute node, a broadcast operation, including sending a message to all of the compute nodes along an axis of the first dimension for the network; sending, by each compute node along the axis of the first dimension, the message to all of the compute nodes along an axis of the second dimension for the network; and sending, by each compute node along the axis of the second dimension, the message to all of the compute nodes along an axis of the third dimension for the network.

97 MATHEMATICS AND COMPUTING↗

An initial investigation into methods of computing transonic aerodynamic sensitivity coefficients

Research conducted during the period from July 1991 through December 1992 is covered. A method based upon the quasi-analytical approach was developed for computing the aerodynamic sensitivity coefficients of three dimensional wings in transonic and subsonic flow. In addition, the method computes for comparison purposes the aerodynamic sensitivity coefficients using the finite difference approach. The accuracy and validity of the methods are currently under investigation.

Carlson, Leland A.↗