Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear accelerators”

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 865 records · Page 48
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Relation between perception of vertical axis rotation and vestibulo-ocular reflex symmetry

Subjects seated in a vertical axis rotation chair controlled their rotational velocity by adjusting a potentiometer. Their goal was to null out pseudorandom rotational perturbations in order to remain perceptually stationary. Most subjects showed a slow linear drift of velocity (a constant acceleration) to one side when they were deprived of an earth-fixed visual reference. The amplitude and direction of this drift can be considered a measure of a static bias in the subject's perception of rotation. The presence of a perceptual bias is consistent with a small, constant imbalance of vestibular function which could be of either central or peripheral origin. Deviations from perfect vestibulo-ocular reflex (VOR) symmetry are also assumed to be related to imbalances in either peripheral or central vestibular function. Researchers looked for correlations between perceptual bias and various measures of vestibular reflex symmetry that might suggest a common source for both reflective and perceptual imbalances. No correlations were found. Measurement errors could not account for these results since repeated tests on the same subjects of both perceptual bias and VOR symmetry were well correlated.

Peterka, Robert J.↗
NASA NTRS1995

Modal Correction Method For Dynamically Induced Errors In Wind-Tunnel Model Attitude Measurements

This paper describes a method for correcting the dynamically induced bias errors in wind tunnel model attitude measurements using measured modal properties of the model system. At NASA Langley Research Center, the predominant instrumentation used to measure model attitude is a servo-accelerometer device that senses the model attitude with respect to the local vertical. Under smooth wind tunnel operating conditions, this inertial device can measure the model attitude with an accuracy of 0.01 degree. During wind tunnel tests when the model is responding at high dynamic amplitudes, the inertial device also senses the centrifugal acceleration associated with model vibration. This centrifugal acceleration results in a bias error in the model attitude measurement. A study of the response of a cantilevered model system to a simulated dynamic environment shows significant bias error in the model attitude measurement can occur and is vibration mode and amplitude dependent. For each vibration mode contributing to the bias error, the error is estimated from the measured modal properties and tangential accelerations at the model attitude device. Linear superposition is used to combine the bias estimates for individual modes to determine the overall bias error as a function of time. The modal correction model predicts the bias error to a high degree of accuracy for the vibration modes characterized in the simulated dynamic environment.

Buehrle, R. D.↗
NASA NTRS2006

Loci-STREAM Version 0.9

Loci-STREAM is an evolving computational fluid dynamics (CFD) software tool for simulating possibly chemically reacting, possibly unsteady flows in diverse settings, including rocket engines, turbomachines, oil refineries, etc. Loci-STREAM implements a pressure- based flow-solving algorithm that utilizes unstructured grids. (The benefit of low memory usage by pressure-based algorithms is well recognized by experts in the field.) The algorithm is robust for flows at all speeds from zero to hypersonic. The flexibility of arbitrary polyhedral grids enables accurate, efficient simulation of flows in complex geometries, including those of plume-impingement problems. The present version - Loci-STREAM version 0.9 - includes an interface with the Portable, Extensible Toolkit for Scientific Computation (PETSc) library for access to enhanced linear-equation-solving programs therein that accelerate convergence toward a solution. The name "Loci" reflects the creation of this software within the Loci computational framework, which was developed at Mississippi State University for the primary purpose of simplifying the writing of complex multidisciplinary application programs to run in distributed-memory computing environments including clusters of personal computers. Loci has been designed to relieve application programmers of the details of programming for distributed-memory computers.

Wright, Jeffrey↗
DOE OSTI2022

Magnetically Levitated and Constrained Flywheel Energy Storage System

The concept of using linear induction motors to lift, constrain, accelerate, and decelerate a large-scale flywheel is proposed, and some of the advantages are investigated. Calculations for a Magnetically Levitated Energy Storage System (MLES) are performed that compare a single large scale MLES with a current state of the art flywheel energy storage system in order to show the relative differences and advantages of such a system. The system that is used for comparison is a typical Beacon Power flywheel energy system. This is currently one of the state-of-the-art flywheel energy storage systems and so it can be used to provide a basic data set to compare to an MLES system.

VanOsdol, John↗
NASA NTRS2015

Acceleration and Velocity Sensing from Measured Strain

A simple approach for computing acceleration and velocity of a structure from the strain is proposed in this study. First, deflection and slope of the structure are computed from the strain using a two-step theory. Frequencies of the structure are computed from the time histories of strain using a parameter estimation technique together with an autoregressive moving average model. From deflection, slope, and frequencies of the structure, acceleration and velocity of the structure can be obtained using the proposed approach. Simple harmonic motion is assumed for the acceleration computations, and the central difference equation with a linear autoregressive model is used for the computations of velocity. A cantilevered rectangular wing model is used to validate the simple approach. Quality of the computed deflection, acceleration, and velocity values are independent of the number of fibers. The central difference equation with a linear autoregressive model proposed in this study follows the target response with reasonable accuracy. Therefore, the handicap of the backward difference equation, phase shift, is successfully overcome.

shape sensing↗
DOE OSTI2021

Data-driven acceleration of thermal radiation transfer calculations with the dynamic mode decomposition and a sequential singular value decomposition

In this work, we present a method for accelerating discrete ordinates radiative transfer calculations for radiative transfer. Our method works with nonlinear positivity fixes, in contrast to most acceleration schemes. The method is based on the dynamic mode decomposition (DMD) and using a sequence of rank-one updates to compute the singular value decomposition needed for DMD. Using a sequential method allows us to automatically determine the number of solution vectors to include in the DMD acceleration. We present results for slab geometry discrete ordinates calculations with the standard temperature linearization. Compared with positive source iteration, our results demonstrate that our acceleration method reduces the number of transport sweeps required to solve the problem by a factor of about 3 on a standard diffusive Marshak wave problem, a factor of several thousand on a cooling problem where the effective scattering ratio approaches unity, and a factor of 20 improvement in a realistic, multimaterial radiating shock problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Advanced Modeling of Plasma-based Particle Accelerators

Plasma-based acceleration (PBA) driven by an intense laser (LWFA) or particle beam (PWFA) can produce ultra-high accelerating fields in excess of a GV/cm. PBA could substantially reduce the size and cost of future linear collider facilities if deployed successfully. PBA enables compact tabletop accelerators that can provide lower energy GeV-class beams in a laboratory setting. PBA enables high quality beam generation suitable for x-ray free electron lasers (XFEL) via controllable methods of self-injection. Challenges in modeling and optimization of multi-stage PBA motivate the need for exascale computing and state-of-the-art PIC codes.

43 PARTICLE ACCELERATORS↗
NASA NTRS1974

Ion acceleration in a plasma focus

The electric and magnetic fields associated with anomalous diffusion to the axis of a linear plasma discharge are used to compute representative ion trajectories. Substantial axial acceleration of the ions is demonstrated.

Gary, S. P.↗
DOE OSTI2023

GPU-resident sparse direct linear solvers for alternating current optimal power flow analysis

Integrating renewable resources within the transmission grid at a wide scale poses significant challenges for economic dispatch as it requires analysis with more optimization parameters, constraints, and sources of uncertainty. This motivates the investigation of more efficient computational methods, especially those for solving the underlying linear systems, which typically take more than half of the overall computation time. In this paper, we present our work on sparse linear solvers that take advantage of hardware accelerators, such as graphical processing units (GPUs), and improve the overall performance when used within economic dispatch computations. We treat the problems as sparse, which allows for faster execution but also makes the implementation of numerical methods more challenging. We present the first GPU-native sparse direct solver that can execute on both AMD and NVIDIA GPUs. We demonstrate significant performance improvements when using high-performance linear solvers within alternating current optimal power flow (ACOPF) analysis. Furthermore, we demonstrate the feasibility of getting significant performance improvements by executing the entire computation on GPU-based hardware. Finally, we identify outstanding research issues and opportunities for even better utilization of heterogeneous systems, including those equipped with GPUs.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

High-order matrix-free incompressible flow solvers with GPU acceleration and low-order refined preconditioners

In this work, we present a matrix-free flow solver for high-order finite element discretizations of the incompressible Navier-Stokes and Stokes equations with GPU acceleration. For high polynomial degrees, assembling the matrix for the linear systems resulting from the finite element discretization can be prohibitively expensive, both in terms of computational complexity and memory. For this reason, it is necessary to develop matrix-free operators and preconditioners, which can be used to efficiently solve these linear systems without access to the matrix entries themselves. The matrix-free operator evaluations utilize GPU-accelerated sum-factorization techniques to minimize memory movement and maximize throughput. The preconditioners developed in this work are based on a low-order refined methodology with parallel subspace corrections, as described for diffusion problems in [1]. The saddle-point Stokes system is solved using block-preconditioning techniques, which are robust in mesh size, polynomial degree, time step, and viscosity. For the incompressible Navier-Stokes equations, we make use of projection (fractional step) methods, which require Helmholtz and Poisson solves at each time step. The performance of our flow solvers is assessed on several benchmark problems in two and three spatial dimensions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Compact, Achromatic Non-scaling FFAG Accelerator for HEP, Commercial and Medical Applications (CRADA FRA-2008-0005 Final Report)

Proton and light-ion accelerators have many research and medical applications, but the current state of technology in accelerators severely limits their widespread use: (1) synchrotrons have an intrinsic low duty cycle and become quite large for light ions; and (2) cyclotrons do not have energy variability and require complex superconducting magnets for high energy. A new concept in non-scaling Fixed-Field Alternating-Gradient (FFAGs) has been invented that incorporates both the energy variability of the synchrotron and the high duty cycle of the cyclotron. The concept uses normal-conducting, combined-function magnets that apply only constant (dipole) and linear-gradient (quadrupole) fields to stabilize the accelerator. This project will develop an optimized design for a new non-scaling and cost-effective innovation in FFAG accelerators. The accelerator design will have optics that can stably accelerate protons to 250 MeV (or higher) and carbon ions to =200 MeV, an energy considered ideal for radiation therapy. Phase I will optimize, fully simulate, and demonstrate the feasibility of this accelerator. Commercial Applications and other Benefits as described by the awardee: The fixed-field acceleration concept should eliminate some of the most pronounced technical difficulties, expense, maintenance, and required expertise faced in conventional proton and light-ion accelerators. In addition to the application for high energy physics, these accelerators should have application in cancer treatment, radiopharmaceuticals, and medical isotope production, and materials science.

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Optimization Stability in Excited-State-Specific Variational Monte Carlo

Here, we investigate the issue of optimization stability in variance-based state-specific variational Monte Carlo, discussing the roles of the objective function, the complexity of wave function ansatz, the amount of sampling effort, and the choice of minimization algorithm. Using a small cyanine dye molecule as a test case, we systematically perform minimizations using variants of the linear method as both a standalone algorithm and in a hybrid combination with accelerated descent. We demonstrate that adaptive step control is crucial for maintaining the linear method's stability when optimizing complicated wave functions and that the hybrid method enjoys both greater stability and minimization performance.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

GPU acceleration of all-electron electronic structure theory using localized numeric atom-centered basis functions

We present an implementation of all-electron density-functional theory for massively parallel GPU-based platforms, using localized atom-centered basis functions and real-space integration grids. Special attention is paid to domain decomposition of the problem on non-uniform grids, which enables compute- and memory-parallel execution across thousands of nodes for real-space operations, e.g. the update of the electron density, the integration of the real-space Hamiltonian matrix, and calculation of Pulay forces. To assess the performance of our GPU implementation, we performed benchmarks on three different architectures using a 103-material test set. We find that operations which rely on dense serial linear algebra show dramatic speedups from GPU acceleration: in particular, SCF iterations including force and stress calculations exhibit speedups ranging from 4.5 to 6.6. For the architectures and problem types investigated here, this translates to an expected overall speedup between 3–4 for the entire calculation (including non-GPU accelerated parts), for problems featuring several tens to hundreds of atoms. Additional calculations for a 375-atom Bi2Se3 bilayer show that the present GPU strategy scales for large-scale distributed-parallel simulations.

42 ENGINEERING↗
NASA NTRS1990

Time-optimal Aircraft Pursuit-evasion with a Weapon Envelope Constraint

The optimal pursuit-evasion problem between two aircraft including a realistic weapon envelope is analyzed using differential game theory. Six order nonlinear point mass vehicle models are employed and the inclusion of an arbitrary weapon envelope geometry is allowed. The performance index is a linear combination of flight time and the square of the vehicle acceleration. Closed form solution to this high-order differential game is then obtained using feedback linearization. The solution is in the form of a feedback guidance law together with a quartic polynomial for time-to-go. Due to its modest computational requirements, this nonlinear guidance law is useful for on-board real-time implementation.

Menon, P. K. A.↗
NASA NTRS1983

Creation of high-energy electron tails by means of the modified two-stream instability

Particle simulations of the modified two-stream instability demonstrate strong electron acceleration rather than bulk heating when the relative drift speed is below a critical speed Vc. A very interesting nonlinear mode transition and autoresonance acceleration process is observed which accelerates the electrons much above the phase speed of the linearly unstable modes. Simple criteria are presented that predict the value of Vc and the number density of the accelerated electrons.

Tanaka, M.↗
NASA NTRS1987

Manipulator control by exact linearization

Comments on the application to rigid link manipulators of geometric control theory, resolved acceleration control, operational space control, and nonlinear decoupling theory are given, and the essential unity of these techniques for externally linearizing and decoupling end effector dynamics is discussed. Exploiting the fact that the mass matrix of a rigid link manipulator is positive definite, a consequence of rigid link manipulators belonging to the class of natural physical systems, it is shown that a necessary and sufficient condition for a locally externally linearizing and output decoupling feedback law to exist is that the end effector Jacobian matrix be nonsingular. Furthermore, this linearizing feedback is easy to produce.

Kruetz, K.↗