Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear system”

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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
NASA NTRS2007

Development of a Linear Stirling System Model with Varying Heat Inputs

The linear model of the Stirling system developed by NASA Glenn Research Center (GRC) has been extended to include a user-specified heat input. Previously developed linear models were limited to the Stirling convertor and electrical load. They represented the thermodynamic cycle with pressure factors that remained constant. The numerical values of the pressure factors were generated by linearizing GRC's nonlinear System Dynamic Model (SDM) of the convertor at a chosen operating point. The pressure factors were fixed for that operating point, thus, the model lost accuracy if a transition to a different operating point were simulated. Although the previous linear model was used in developing controllers that manipulated current, voltage, and piston position, it could not be used in the development of control algorithms that regulated hot-end temperature. This basic model was extended to include the thermal dynamics associated with a hot-end temperature that varies over time in response to external changes as well as to changes in the Stirling cycle. The linear model described herein includes not only dynamics of the piston, displacer, gas, and electrical circuit, but also the transient effects of the heater head thermal inertia. The linear version algebraically couples two separate linear dynamic models, one model of the Stirling convertor and one model of the thermal system, through the pressure factors. The thermal system model includes heat flow of heat transfer fluid, insulation loss, and temperature drops from the heat source to the Stirling convertor expansion space. The linear model was compared to a nonlinear model, and performance was very similar. The resulting linear model can be implemented in a variety of computing environments, and is suitable for analysis with classical and state space controls analysis techniques.

Regan, Timothy F.↗
DOE OSTI2018

Communication-efficient Distributed Solutions to a System of Linear Equations with Laplacian Sparse Structure

Two communication-efficient distributed algorithms are proposed to solve a system of linear equations Ax = b with Laplacian sparse A. A system of linear equations with Laplacian sparse A can be found in many applications, e.g., the power flow problems and other network flow problems. The first algorithm is based on the gradient descent method in optimization and the agents only share two parts of the system state instead of that of the whole system state, which saves significant communication. The two parts shared by every agent through a communication link are the state information of its own and its neighbors connected by the communication link. The second method is obtained from an approximation of the Newton method, which converges faster. It requires twice as much communication as the first one but is still communicationefficient due to the low dimension of each part shared between agents. The convergence at a linear rate of both methods is proved. A comprehensive comparison of the convergence rate, communication burden, and computation costs between the methods is made. Finally, a simulation is conducted to show the effectiveness of both methods.

Wang, Peng↗
DOE OSTI2021

Linear delta systems with additional degrees of freedom and related methods

A linear delta system includes a frame, rails secured to the frame, linear actuators, each linear actuator coupled to a respective rail and configured to translate along a longitudinal length of the respective rail, pairs of parallel rods each operably coupled to a respective linear actuator, a platform coupled to the pairs of parallel rods, structure configured to movable couple an object to the platform; and at least one degree of freedom imparting assembly including a profiled rod extending in a direction parallel to the rails and a drive unit configured to rotate the profiled rod, wherein the at least one degree of freedom imparting assembly is configured to impart a degree of freedom to the object.

Crawford, Anthony L.↗
NASA NTRS1994

A Navier-Strokes Chimera Code on the Connection Machine CM-5: Design and Performance

We have implemented a three-dimensional compressible Navier-Stokes code on the Connection Machine CM-5. The code is set up for implicit time-stepping on single or multiple structured grids. For multiple grids and geometrically complex problems, we follow the 'chimera' approach, where flow data on one zone is interpolated onto another in the region of overlap. We will describe our design philosophy and give some timing results for the current code. A parallel machine like the CM-5 is well-suited for finite-difference methods on structured grids. The regular pattern of connections of a structured mesh maps well onto the architecture of the machine. So the first design choice, finite differences on a structured mesh, is natural. We use centered differences in space, with added artificial dissipation terms. When numerically solving the Navier-Stokes equations, there are liable to be some mesh cells near a solid body that are small in at least one direction. This mesh cell geometry can impose a very severe CFL (Courant-Friedrichs-Lewy) condition on the time step for explicit time-stepping methods. Thus, though explicit time-stepping is well-suited to the architecture of the machine, we have adopted implicit time-stepping. We have further taken the approximate factorization approach. This creates the need to solve large banded linear systems and creates the first possible barrier to an efficient algorithm. To overcome this first possible barrier we have considered two options. The first is just to solve the banded linear systems with data spread over the whole machine, using whatever fast method is available. This option is adequate for solving scalar tridiagonal systems, but for scalar pentadiagonal or block tridiagonal systems it is somewhat slower than desired. The second option is to 'transpose' the flow and geometry variables as part of the time-stepping process: Start with x-lines of data in-processor. Form explicit terms in x, then transpose so y-lines of data are in-processor. Form explicit terms in y, then transpose so z-lines are in processor. Form explicit terms in z, then solve linear systems in the z-direction. Transpose to the y-direction, then solve linear systems in the y-direction. Finally transpose to the x direction and solve linear systems in the x-direction. This strategy avoids inter-processor communication when differencing and solving linear systems, but requires a large amount of communication when doing the transposes. The transpose method is more efficient than the non-transpose strategy when dealing with scalar pentadiagonal or block tridiagonal systems. For handling geometrically complex problems the chimera strategy was adopted. For multiple zone cases we compute on each zone sequentially (using the whole parallel machine), then send the chimera interpolation data to a distributed data structure (array) laid out over the whole machine. This information transfer implies an irregular communication pattern, and is the second possible barrier to an efficient algorithm. We have implemented these ideas on the CM-5 using CMF (Connection Machine Fortran), a data parallel language which combines elements of Fortran 90 and certain extensions, and which bears a strong similarity to High Performance Fortran. We make use of the Connection Machine Scientific Software Library (CMSSL) for the linear solver and array transpose operations.

Jespersen, Dennis C.↗
DOE OSTI2019

Approximate Green’s Function Coupled Cluster A Method Employing Effective Dimension Reduction

The Green’s function coupled cluster (GFCC) method, originally proposed in the early 1990s, is a powerful many-body tool for computing and analyzing the electronic structures of molecular structures and periodic systems, especially when electrons are strongly correlated. However, in order for the GFCC method to become an approach that can be routinely used in the electronic structure calculations, more robust linear algebraic techniques and approximations need to be employed to reduce its extremely high computational overhead. In our recent studies, we showed that the GFCC equation can be numerically solved by seeking solutions of multiple linear systems in the frequency regime of interest, which can be easily distributed in a massively parallel environment, and broaden the avenue for more state-of-the-art numerical linear algebraic tools associated with multiple linear systems to be kicked in to this field. In the present pursuit of this practice, we show a successful application of model order reduction (MOR) techniques in the GFCC framework. Briefly speaking, for a frequency regime of interest that requires a high resolution of spectral function, instead of solving GFCC linear equation in the original dimension for every single frequency point, an easily-solvable linear system model with reduced dimension can be built upon projecting the original GFCC linear system into a subspace, from which the interpolation and extrapolation can give a reasonable approximation to the results of the original GFCC linear equations. Here, we show that the subspace can be properly constructed in an iterative manner from the auxiliary vectors of the GFCC linear equations at some select frequencies inside the frequency regime. During the iterations, the quality of the subspace, as well as the linear system model, can be systematically improved. The approach is tested in this work in terms of the efficiency and accuracy of computing spectral functions for some typical molecular systems including carbon monoxide, 1,3-butadiene, benzene, and adenine molecules. As a byproduct, the high quality linear system model is also found to be able to provide high quality initial guess for the existing linear solver to improve the convergence performance.

Peng, Bo↗
NASA NTRS1973

Computer programs for the solution of systems of linear algebraic equations

FORTRAN subprograms for the solution of systems of linear algebraic equations are described, listed, and evaluated in this report. Procedures considered are direct solution, iteration, and matrix inversion. Both incore methods and those which utilize auxiliary data storage devices are considered. Some of the subroutines evaluated require the entire coefficient matrix to be in core, whereas others account for banding or sparceness of the system. General recommendations relative to equation solving are made, and on the basis of tests, specific subprograms are recommended.

Sequi, W. T.↗
NASA NTRS1975

On the time-weighted quadratic sum of linear discrete systems

A method is proposed for obtaining the time-weighted quadratic sum for linear discrete systems. The formula of the weighted quadratic sum is obtained from matrix z-transform formulation. In addition, it is shown that this quadratic sum can be derived in a recursive form for several useful weighted functions. The discussion presented parallels that of MacFarlane (1963) for weighted quadratic integral for linear continuous systems.

Jury, E. I.↗
DOE OSTI2024

Large-scale harmonic balance simulations with Krylov subspace and preconditioner recycling

The multi-harmonic balance method combined with numerical continuation provides an efficient framework to compute a family of time-periodic solutions, or response curves, for large-scale, nonlinear mechanical systems. The predictor and corrector steps repeatedly solve a sequence of linear systems that scale by the model size and number of harmonics in the assumed Fourier series approximation. In this paper, a novel Newton–Krylov iterative method is embedded within the multi-harmonic balance and continuation algorithm to efficiently compute the approximate solutions from the sequence of linear systems that arise during the prediction and correction steps. Further, the method recycles, or reuses, both the preconditioner and the Krylov subspace generated by previous linear systems in the solution sequence. A delayed frequency preconditioner refactorizes the preconditioner only when the performance of the iterative solver deteriorates. The GCRO-DR iterative solver recycles a subset of harmonic Ritz vectors to initialize the solution subspace for the next linear system in the sequence. The performance of the iterative solver is demonstrated on two exemplars with contact-type nonlinearities and benchmarked against a direct solver with traditional Newton–Raphson iterations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Evaluation of the microangiographic fluoroscope (MAF) using generalized system performance metrics

Purpose: The performance of a newly developed, high resolution, microangiographic fluoroscope (MAF) (35 {mu}m pixel pitch and 300 {mu}m thick CsI phosphor) was evaluated using a generalized linear system analysis and compared with that of a standard amorphous Si thin film transistor flat panel detector (FPD) (194 {mu}m pixel pitch and 600 {mu}m thick CsI phosphor). The linear system metrics such as modulation transfer function (MTF), noise power spectrum, and detection quantum efficiency (DQE) are commonly used to gauge the intrinsic detector performance in the detector plane. However, these linear system metrics do not provide information about the image receptor performance in a real system since they do not include the effects of other parameters such as focal spot distribution, scatter radiation, and geometric unsharpness, which may compromise detector performance characteristics. Use of generalized linear system metrics [generalized modulation transfer function (GMTF), generalized normalized noise power spectrum (GNNPS), and generalized detection quantum efficiency (GDQE)] that include these effects gives a more meaningful, complete, and appropriate evaluation of detector performance as part of the imaging system. Methods: A uniform head equivalent phantom was used to simulate realistic clinical parameters and x-ray spectra. The detector MTFs were measured using the slanted edge method and the focal spot MTFs were measured using a pinhole assembly. The scatter MTF was simulated and the scatter fraction was measured for a head-equivalent phantom. The generalized system metrics were calculated for different combinations of three choices of focal spots and three different magnifications with two different air-gaps. The performance of the MAF was also illustrated using stent images obtained with different focal spots under similar conditions. Results: Results for the generalized metrics provide a quantitative description of the performance of the imaging system for both detectors. This generalized analysis demonstrated that both detectors have similar imaging capabilities at lower spatial frequencies, but that the MAF has superior performance over the FPD at higher frequencies even when considering focal spot blurring and scatter. Conclusions: This generalized performance analysis demonstrates the significance of focal spot size, magnification, and scatter on the system performance metrics (GMTF, GNNPS, and GDQE). Although the ideal detector performance characteristics of the MAF are not fully realized due to these other system factors, it still retains an advantage in DQE at high spatial frequencies over the FPD. Similar studies based on the generalized linear system metrics can serve as an efficient tool to evaluate total system capabilities under different realistic conditions to enable optimal design for specific imaging tasks.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2015

Decreasing the temporal complexity for nonlinear, implicit reduced-order models by forecasting

Implicit numerical integration of nonlinear ODEs requires solving a system of nonlinear algebraic equations at each time step. Each of these systems is often solved by a Newton-like method, which incurs a sequence of linear-system solves. Most model-reduction techniques for nonlinear ODEs exploit knowledge of system's spatial behavior to reduce the computational complexity of each linear-system solve. However, the number of linear-system solves for the reduced-order simulation often remains roughly the same as that for the full-order simulation. We propose exploiting knowledge of the model's temporal behavior to (1) forecast the unknown variable of the reduced-order system of nonlinear equations at future time steps, and (2) use this forecast as an initial guess for the Newton-like solver during the reduced-order-model simulation. To compute the forecast, we propose using the Gappy POD technique. As a result, the goal is to generate an accurate initial guess so that the Newton solver requires many fewer iterations to converge, thereby decreasing the number of linear-system solves in the reduced-order-model simulation.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

Passive dynamic controllers for non-linear mechanical systems

A methodology for model-independent controller design for controlling large angular motion of multi-body dynamic systems is outlined.The controlled system may consist of rigid and flexible components that undergo large rigid body motion and small elastic deformations. Control forces/torques are applied to drive the system, and at the same time suppress the vibrations due to flexibility of the components. The proposed controller consists of passive second-order systems which may be designed with little knowledge of the system parameters, even if the controlled system is non-linear. Under rather general assumptions, the passive design assures that the closed loop system has guaranteed stability properties. Unlike positive real controller design, stabilization can be accomplished without direct velocity feedback. In addition, the second-order passive design allows dynamic feedback controllers with considerable freedom to tune for desired system response, and to avoid actuator saturation. After developing the basic mathematical formulation of the design methodology, simulation results are presented to illustrate the proposed approach applied to a flexible six-degree-of-freedom manipulator.

Juang, Jer-Nan↗