SEARCH · Engineering Papers

Results for “Numerical linear algebra”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 235 records · Page 13

All sources NASA NTRS DOE OSTI

NASA NTRS1993

Linearization of manipulator dynamics using spatial operators

Linearized dynamics models for manipulators are useful in robot analysis, motion planning, and control applications. Techniques from the spatial operator algebra are used to obtain closed form operator expressions for two types of linearized dynamics models, the linearized inverse and forward dynamics models. Spatially recursive algorithms of O(n) and O(n-squared) complexity for the computation of the perturbation vector and coefficient matrices for the linearized inverse dynamics model are developed first. Subsequently, operator factorization and inversion identities are used to develop corresponding closed-form expressions for the linearized forward dynamics model (LFDM). Once again, these are used to develop algorithms of O(n) and O(n-squared) complexity for the computation of the perturbation vector and the coefficient matrices. The algorithms for the LFDM do not require the explicit computation of the mass matrix nor its numerical inversion and are also of lower complexity than the conventional O(n-cubed) algorithms.

Jain, A.↗

NASA NTRS1981

Bifurcation and post-buckling analysis of laminated composite plates via reduced basis technique

A reduced basis technique and a problem-adaptive computational algorithm are presented for the bifurcation and post-buckling analysis of laminated anisotropic plates. The computational algorithm can be conveniently divided into three distinct stages. The first stage is that of determining the bifurcation point. The plate is discretized by using displacement finite element (or finite difference) models. The special symmetries exhibited by the response of the anisotropic plate are used to reduce the size of the analysis region. The vector of unknown nodal parameters is expressed as a linear combination of a small number of basis vectors, and a Rayleigh-Ritz technique is used to approximate the finite element equations by a small system of algebraic equations. The reduced equations are used to determine the bifurcation point and the associated eigenmode of the panel. In the second stage of the bifurcation buckling mode is used to obtain a nonlinear solution in the vicinity of the bifurcation point and new (updated) sets of basis vectors and reduced equations are generated. In the third stage the reduced equations are used to trace the post-buckling paths. The effectiveness of the proposed technique for predicting the bifurcation and post-buckling behavior of plates is demonstrated by means of numerical examples for plates loaded by means of prescribed edge displacements.

Noor, A. K.↗

NASA NTRS1976

Optimal control of spin stabilized spacecraft with telescoping appendages

The control of a spin-stabilized spacecraft consisting of a rigid central hub and one or two movable offset telescoping booms (with end masses) is considered. The equations of rotational motion are linearized about either of two desired final states. A control law for the boom and mass position is sought such that a quadratic cost functional involving the weighted components of angular velocity plus the control is minimized when the final time is unspecified and involves the solution of the matrix Riccati algebraic equation. For three-axis control more than one offset boom (orthogonal to each other) is required. For two-axis control with a single boom offset from a symmetrical hub, an analytic solution is obtained; when this system is used for nutation decay the time constant is one order of magnitude smaller than previously achieved using non-optimal control logic. For the general case results are obtained numerically.

Bainum, P. M.↗

NASA NTRS1985

An efficient algorithm for estimating noise covariances in distributed systems

An efficient computational algorithm for estimating the noise covariance matrices of large linear discrete stochatic-dynamic systems is presented. Such systems arise typically by discretizing distributed-parameter systems, and their size renders computational efficiency a major consideration. The proposed adaptive filtering algorithm is based on the ideas of Belanger, and is algebraically equivalent to his algorithm. The earlier algorithm, however, has computational complexity proportional to p to the 6th, where p is the number of observations of the system state, while the new algorithm has complexity proportional to only p-cubed. Further, the formulation of noise covariance estimation as a secondary filter, analogous to state estimation as a primary filter, suggests several generalizations of the earlier algorithm. The performance of the proposed algorithm is demonstrated for a distributed system arising in numerical weather prediction.

Dee, D. P.↗

NASA NTRS1993

A Realizable Reynolds Stress Algebraic Equation Model

The invariance theory in continuum mechanics is applied to analyze Reynolds stresses in high Reynolds number turbulent flows. The analysis leads to a turbulent constitutive relation that relates the Reynolds stresses to the mean velocity gradients in a more general form in which the classical isotropic eddy viscosity model is just the linear approximation of the general form. On the basis of realizability analysis, a set of model coefficients are obtained which are functions of the time scale ratios of the turbulence to the mean strain rate and the mean rotation rate. The coefficients will ensure the positivity of each component of the mean rotation rate. These coefficients will ensure the positivity of each component of the turbulent kinetic energy - realizability that most existing turbulence models fail to satisfy. Separated flows over backward-facing step configurations are taken as applications. The calculations are performed with a conservative finite-volume method. Grid-independent and numerical diffusion-free solutions are obtained by using differencing schemes of second-order accuracy on sufficiently fine grids. The calculated results are compared in detail with the experimental data for both mean and turbulent quantities. The comparison shows that the present proposal significantly improves the predictive capability of K-epsilon based two equation models. In addition, the proposed model is able to simulate rotational homogeneous shear flows with large rotation rates which all conventional eddy viscosity models fail to simulate.

Shih, Tsan-Hsing↗

NASA NTRS1986

Numerical study of hydrogen-air supersonic combustion by using elliptic and parabolized equations

The two-dimensional Navier-Stokes and species continuity equations are used to investigate supersonic chemically reacting flow problems which are related to scramjet-engine configurations. A global two-step finite-rate chemistry model is employed to represent the hydrogen-air combustion in the flow. An algebraic turbulent model is adopted for turbulent flow calculations. The explicit unsplit MacCormack finite-difference algorithm is used to develop a computer program suitable for a vector processing computer. The computer program developed is then used to integrate the system of the governing equations in time until convergence is attained. The chemistry source terms in the species continuity equations are evaluated implicitly to alleviate stiffness associated with fast chemical reactions. The problems solved by the elliptic code are re-investigated by using a set of two-dimensional parabolized Navier-Stokes and species equations. A linearized fully-coupled fully-implicit finite difference algorithm is used to develop a second computer code which solves the governing equations by marching in spce rather than time, resulting in a considerable saving in computer resources. Results obtained by using the parabolized formulation are compared with the results obtained by using the fully-elliptic equations. The comparisons indicate fairly good agreement of the results of the two formulations.

Chitsomboon, T.↗

NASA NTRS2016

A Model for Jet-Surface Interaction Noise Using Physically Realizable Upstream Turbulence Conditions

This paper is a continuation of previous work in which a generalized Rapid Distortion Theory (RDT) formulation was used to model low-frequency trailing-edge noise. The research was motivated by proposed next-generation aircraft configurations where the exhaust system is tightly integrated with the airframe. Data from recent experiments at NASA on the interaction between high-Reynolds-number subsonic jet flows and an external flat plate showed that the power spectral density (PSD) of the far-field pressure underwent considerable amplification at low frequencies. For example, at the 90deg observation angle, the low-frequency noise could be as much as 10 dB greater than the jet noise itself. In this paper, we present predictions of the noise generated by the interaction of a rectangular jet with the trailing edge of a semi-infinite flat plate. The calculations are based on a formula for the acoustic spectrum of this noise source derived from an exact formal solution of the linearized Euler equations involving (in this case) one arbitrary convected scalar quantity and a Rayleigh equation Green's function. A low-frequency asymptotic approximation for the Green's function based on a two-dimensional mean flow is used in the calculations along with a physically realizable upstream turbulence spectrum, which includes a finite decorrelation region. Numerical predictions of the sound field, based on three-dimensional RANS solutions to determine the mean flow, turbulent kinetic energy and turbulence length and time scales, for a range of subsonic acoustic Mach number jets and nozzle aspect ratios are compared with experimental data. Comparisons of the RANS results with flow data are also presented for selected cases. We find that a finite decorrelation region in the turbulence spectrum increases the low-frequency algebraic decay (the low frequency "roll-off") of the acoustic spectrum with angular frequency thereby producing much closer agreement with noise data for Strouhal numbers less than 0.1. Secondly, the large-aspect-ratio theory is able to predict the low-frequency amplification due to the jet-edge interaction reasonably well, even for moderate aspect ratio nozzles. We show also that the noise predictions for smaller aspect ratio jets can be fine-tuned using the appropriate RANS-based mean flow and turbulence properties.

Jet↗

DOE OSTI2020

Toward a scalable robust security-constrained optimal power flow using a proximal projection bundle method

Robust security-constrained optimal power flow (rSCOPF) aims to find the worst-case contingencies of alternating current optimal power flow (ACOPF) in power systems. With the rise of GPU architectures on the upcoming supercomputer architectures, optimization algorithms that rely on sparse linear algebra and indefinite linear systems are becoming increasingly hard to solve efficiently (e.g. interior-point method). To address this we revisit a maximin optimization formulation of the rSCOPF and the single-level mixed-integer semidefinite programming (MISDP) reformulation, which is obtained by taking the Lagrangian relaxation of the inner minimization ACOPF problem. In this paper, we focus on the development of a proximal projection bundle method (PPBM) for solving continuous relaxation node subproblems of the MISDP problem, based primarily on the well-known alternating direction method of multipliers. Cutting planes reminiscent of bundle method ideas are also applied in coordination with updates of the proximal parameter. The cutting-plane method can generate a large number of linear inequalities, leading to a large scale but decomposable quadratic programming (QP) subproblem that is amenable to GPUs. We present the numerical results on the IEEE 30, 57, 118, and 300-bus systems by using our PBMM method. We discuss the main computational bottleneck of our method, which is the time taken to solve each iteration of a QP subproblem instance of the PPBM, and how GPU architectures can accelerate this solution process.

bundle method↗

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.↗

NASA NTRS2007

Development of a Linear Stirling 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 non-linear 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.↗

NASA NTRS1994

Global Asymptotic Behavior of Iterative Implicit Schemes

The global asymptotic nonlinear behavior of some standard iterative procedures in solving nonlinear systems of algebraic equations arising from four implicit linear multistep methods (LMMs) in discretizing three models of 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODEs) is analyzed using the theory of dynamical systems. The iterative procedures include simple iteration and full and modified Newton iterations. The results are compared with standard Runge-Kutta explicit methods, a noniterative implicit procedure, and the Newton method of solving the steady part of the ODEs. Studies showed that aside from exhibiting spurious asymptotes, all of the four implicit LMMs can change the type and stability of the steady states of the differential equations (DEs). They also exhibit a drastic distortion but less shrinkage of the basin of attraction of the true solution than standard nonLMM explicit methods. The simple iteration procedure exhibits behavior which is similar to standard nonLMM explicit methods except that spurious steady-state numerical solutions cannot occur. The numerical basins of attraction of the noniterative implicit procedure mimic more closely the basins of attraction of the DEs and are more efficient than the three iterative implicit procedures for the four implicit LMMs. Contrary to popular belief, the initial data using the Newton method of solving the steady part of the DEs may not have to be close to the exact steady state for convergence. These results can be used as an explanation for possible causes and cures of slow convergence and nonconvergence of steady-state numerical solutions when using an implicit LMM time-dependent approach in computational fluid dynamics.

Yee, H. C.↗

DOE OSTI2020

Multiscale formulation of frictional contact mechanics at the pore scale

Direct numerical simulation (DNS) yields the highest fidelity predictions of mechanical deformation at the pore scale, but is prohibitively expensive for analyzing large or many samples. Discrete element methods (DEM) are an efficient alternative, but are limited to granular media and incapable of estimating or controlling prediction errors. We present a pore-level multiscale method (PLMM) that approximates DNS efficiently and with controllable accuracy. We focus on the linear elastic response of a consolidated geologic porous medium with arbitrary microstructure, heterogeneous mineralogy, containing cracks or defects. PLMM decomposes the solid phase into non-overlapping subdomains, on which local basis functions are constructed. The bases are then coupled with a global interface problem that accounts for slip or stick contact conditions between the subdomains. PLMM produces an initial, but accurate, approximation to DNS that can be iteratively improved. It is amenable to parallelism and allows for different mesh, models, and physics in each subdomain. An algebraic interpretation of PLMM as a preconditioner is also presented to allow non-intrusive implementation into existing solvers. Lastly, this work extends previous developments of PLMM in fluid dynamics to solid mechanics and enables future extensions towards modeling coupled flow and mechanics problems.

42 ENGINEERING↗

NASA NTRS1989

A survey on the structured singular value

The structured singular value, U, is an important linear algebra tool to study a class of matrix perturbation problems. It is useful for analyzing the robustness of stability and performance of uncertain, (nominally) linear systems. Computation of (M) is difficult, and usually, upper and lower bounds are all that can be reliably computed. Upper bounds give conservative estimates of the sizes of allowable perturbations. The maximum singular value of a matrix M is an upper bound for (M). As an upper bound, it can be improved by finding a transformations to the data (i.e. M) which do not change the structured singular value, but do reduce the maximum singular value. Typically, upper bound algorithms involve searches over sets of transformations to yield the tightest bound. Lower bound algorithms are intelligent searches for minimum-norm solutions to multivariable polynomial equations, and are based on various optimality conditions that hold at the global (and, unfortunately, some local) minima. The current methods to compute both of these types of bounds are reviewed. Theoretical justification and extensive numerical experience with the various algorithms are covered.

Packard, Andy↗

NASA NTRS1993

An algebraic turbulence model for three-dimensional viscous flows

An algebraic turbulence model is proposed for use with three-dimensional Navier-Stokes analyses. It incorporates features of both the Baldwin-Lomax and Cebeci-Smith models. The Baldwin-Lomax model uses the maximum of a function f(y) to determine length and velocity scales. An analysis of the Baldwin-Lomax model shows that f(y) can have a spurious maximum close to the wall, causing numerical problems and non-physical results. The proposed model uses integral relations to determine delta(*) u(sub e) and delta used in the Cebeci-Smith mode. It eliminates a constant in the Baldwin-Lomax model and determines the two remaining constants by comparison to the Cebeci-Smith formulation. Pressure gradient effects, a new wake model, and the implementation of these features in a three-dimensional Navier-Stokes code are also described. Results are shown for a flat plate boundary layer, an annular turbine cascade, and endwall heat transfer in a linear turbine cascade. The heat transfer results agree well with experimental data which shows large variations in endwall Stanton number contours with Reynolds number.

Chima, R. V.↗

NASA NTRS1993

An algebraic turbulence model for three-dimensional viscous flows

An algebraic turbulence model is proposed for use with three-dimensional Navier-Stokes analyses. It incorporates features of both the Baldwin-Lomax and Cebeci-Smith models. The Baldwin-Lomax model uses the maximum of a function f(v) to determine length and velocity scales. An analysis of the Baldwin-Lomax model shows that f(v) can have a spurious maximum close to the wall, causing numerical problems and non-physical results. The proposed model uses integral relations to determine delta(*) u(sub e) and delta used in the Cebeci-Smith mode. It eliminates a constant in the Baldwin-Lomax model and determines the two remaining constants by comparison to the Cebeci-Smith formulation. Pressure gradient effects, a new wake model, and the implementation of these features in a three-dimensional Navier-Stokes code are also described. Results are shown for a flat plate boundary layer, an annular turbine cascade, and endwall heat transfer in a linear turbine cascade. The heat transfer results agree well with experimental data which shows large variations in endwall Stanton number contours with Reynolds number.

Chima, R. V.↗

DOE OSTI2025

Coupling flux balance analysis with reactive transport modeling through machine learning for rapid and stable simulation of microbial metabolic switching

Integrating genome-scale metabolic networks with reactive transport models (RTMs) provides a detailed description of the dynamic changes in microbial growth and metabolism. Despite promising demonstrations in the past, computational inefficiency has been pointed out as a critical issue to overcome because it requires repeated application of linear programming (LP) to obtain flux balance analysis (FBA) solutions in every time step and spatial grid. To address this challenge, we propose a new simulation method where we train and validate artificial neural networks (ANNs) using randomly sampled FBA solutions and incorporate the resulting surrogate FBA model (represented as algebraic equations) into RTMs as source/sink terms. We demonstrate the efficiency of our method via a case study of Shewanella oneidensis MR-1. During aerobic growth on lactate, S. oneidensis produces metabolic byproducts (such as pyruvate and acetate), which are subsequently consumed as alternative carbon sources when the preferred nutrients are depleted. To effectively simulate these complex dynamics, we used a cybernetic approach that models metabolic switches as the outcome of dynamic competition among multiple growth options. In both zero-dimensional batch and one-dimensional column configurations, the ANN-based surrogate models achieved substantial reduction of computational time by several orders of magnitude compared to the original LP-based FBA models. Moreover, the ANN models produced robust solutions without any special measures to prevent numerical instability. These developments significantly promote our ability to utilize genome-scale networks in complex, multi-physics, and multi-dimensional ecosystem modeling.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2022

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗

NASA NTRS1997

Soft-Decision Decoding of Binary Linear Block Codes Based on an Iterative Search Algorithm

This correspondence presents a suboptimum soft-decision decoding scheme for binary linear block codes based on an iterative search algorithm. The scheme uses an algebraic decoder to iteratively generate a sequence of candidate codewords one at a time using a set of test error patterns that are constructed based on the reliability information of the received symbols. When a candidate codeword is generated, it is tested based on an optimality condition. If it satisfies the optimality condition, then it is the most likely (ML) codeword and the decoding stops. If it fails the optimality test, a search for the ML codeword is conducted in a region which contains the ML codeword. The search region is determined by the current candidate codeword and the reliability of the received symbols. The search is conducted through a purged trellis diagram for the given code using the Viterbi algorithm. If the search fails to find the ML codeword, a new candidate is generated using a new test error pattern, and the optimality test and search are renewed. The process of testing and search continues until either the MEL codeword is found or all the test error patterns are exhausted and the decoding process is terminated. Numerical results show that the proposed decoding scheme achieves either practically optimal performance or a performance only a fraction of a decibel away from the optimal maximum-likelihood decoding with a significant reduction in decoding complexity compared with the Viterbi decoding based on the full trellis diagram of the codes.

Lin, Shu↗