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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2014

SU-E-I-11: Cascaded Linear System Model for Columnar CsI Flat Panel Imagers with Depth Dependent Gain and Blur

Purpose: To implement a depth dependent gain and blur cascaded linear system model (CLSM) for optimizing columnar structured CsI indirect conversion flat panel imager (FPI) for advanced imaging applications. Methods: For experimental validation, depth dependent escape efficiency, e(z), was extracted from PHS measurement of different CsI scintillators (thickness, substrate and light output). The inherent MTF and DQE of CsI was measured using high resolution CMOS sensor. For CLSM, e(z) and the depth dependent MTF(f,z), were estimated using Monte Carlo simulation (Geant4) of optical photon transport through columnar CsI. Previous work showed that Monte Carlo simulation for CsI was hindered by the non-ideality of its columnar structure. In the present work we allowed variation in columnar width with depth, and assumed diffusive reflective backing and columns. Monte Carlo simulation was performed using an optical point source placed at different depth of the CsI layer, from which MTF(z,f) and e(z) were computed. The resulting e(z) with excellent matching with experimental measurements were then applied to the CLSM, Monte Carlo simulation was repeated until the modeled MTF, DQE(f) also match experimental measurement. Results: For a 150 micron FOS HL type CsI, e(z) varies between 0.56 to 0.45, and the MTF at 14 cycles/mm varies between 62.1% to 3.9%, from the front to the back of the scintillator. The overall MTF and DQE(f) at all frequencies are in excellent agreement with experimental measurements at all frequencies. Conclusion: We have developed a CLSM for columnar CsI scintillators with depth dependent gain and MTF, which were estimated from Monte Carlo simulation with novel optical simulation settings. Preliminary results showed excellent agreement between simulation results and experimental measurements. Future work is aimed at extending this approach to optimize CsI screen optic design and sensor structure for achieving higher DQE(f) in cone-beam CT, which uses high kVp.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

A two-level GPU-accelerated incomplete LU preconditioner for general sparse linear systems

This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block-Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors by targeting an algebraically smooth vector. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods on challenging anisotropic diffusion problems and a collection of general sparse matrices.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1985

A method to stabilize linear systems using eigenvalue gradient information

Formal optimization methods and eigenvalue gradient information are used to develop a stabilizing control law for a closed loop linear system that is initially unstable. The method was originally formulated by using direct, constrained optimization methods with the constraints being the real parts of the eigenvalues. However, because of problems in trying to achieve stabilizing control laws, the problem was reformulated to be solved differently. The method described uses the Davidon-Fletcher-Powell minimization technique to solve an indirect, constrained minimization problem in which the performance index is the Kreisselmeier-Steinhauser function of the real parts of all the eigenvalues. The method is applied successfully to solve two different problems: the determination of a fourth-order control law stabilizes a single-input single-output active flutter suppression system and the determination of a second-order control law for a multi-input multi-output lateral-directional flight control system. Various sets of design variables and initial starting points were chosen to show the robustness of the method.

Wieseman, C. D.↗
DOE OSTI2019

Optimal Distributed Control of Spatially Invariant Time Varying Linear Systems

In this paper, the optimal distributed linear time varying H2 control problem for cone causal spatially invariant linear time varying (SILTV) systems is considered. This class of systems was initially defined in the work of Voulgaris et al. for cone causal spatially invariant (SI) linear time invariant (LTI) systems. First, the optimal time varying H2 problem is posed using a version of the Youla parameterization. This allows to transform the problem into an affine form which results in a convex but infinite dimensional distributed optimization. Next, the problem is solved by computing an operator projection on a class of time varying Youla parameters with a cone causal distributed structure. The cone causal spatially invariant systems are viewed as input-output multiplicative operators with a mixed causal time varying structure with respect to time, and spatially invariant with respect to the space dimension.

Djouadi, Seddik M.↗
DOE OSTI2018

Alternating Anderson–Richardson method: An efficient alternative to preconditioned Krylov methods for large, sparse linear systems

Here, we present the Alternating Anderson–Richardson (AAR) method: an efficient and scalable alternative to preconditioned Krylov solvers for the solution of large, sparse linear systems on high performance computing platforms. Specifically, we generalize the recently proposed Alternating Anderson–Jacobi (AAJ) method (Pratapa et al., 2016) to include preconditioning, discuss efficient parallel implementation, and provide serial MATLAB and parallel C/C++ implementations. In serial applications to nonsymmetric systems, we find that AAR is comparably robust to GMRES, using the same preconditioning, while often outperforming it in time to solution; and find AAR to be more robust than Bi-CGSTAB for the problems considered. In parallel applications to the Helmholtz and Poisson equations, we find that AAR shows superior strong and weak scaling to GMRES, Bi-CGSTAB, and Conjugate Gradient (CG) methods, using the same preconditioning, with consistently shorter times to solution at larger processor counts. Finally, in massively parallel applications to the Poisson equation, on up to 110,592 processors, we find that AAR shows superior strong and weak scaling to CG, with shorter minimum time to solution. We thus find that AAR offers a robust and efficient alternative to current state-of-the-art solvers, with increasing advantages as the number of processors grows.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

Polynomial Transformations For Discrete-Time Linear Systems

Transformations based on polynomial matrices of finite degree developed for use in computing functions for compensation, inversion, and approximation of discrete-time, multivariable, linear systems. Method derived from z-transform transfer-function form of matrices. Applicable to cascade-compensation problems in design of control systems.

Baram, Yoram↗
NASA NTRS1990

QMR: A Quasi-Minimal Residual method for non-Hermitian linear systems

The biconjugate gradient (BCG) method is the natural generalization of the classical conjugate gradient algorithm for Hermitian positive definite matrices to general non-Hermitian linear systems. Unfortunately, the original BCG algorithm is susceptible to possible breakdowns and numerical instabilities. A novel BCG like approach is presented called the quasi-minimal residual (QMR) method, which overcomes the problems of BCG. An implementation of QMR based on a look-ahead version of the nonsymmetric Lanczos algorithm is proposed. It is shown how BCG iterates can be recovered stably from the QMR process. Some further properties of the QMR approach are given and an error bound is presented. Finally, numerical experiments are reported.

Freund, Roland W.↗
NASA NTRS1990

Fast secant methods for the iterative solution of large nonsymmetric linear systems

A family of secant methods based on general rank-1 updates was revisited in view of the construction of iterative solvers for large non-Hermitian linear systems. As it turns out, both Broyden's good and bad update techniques play a special role, but should be associated with two different line search principles. For Broyden's bad update technique, a minimum residual principle is natural, thus making it theoretically comparable with a series of well known algorithms like GMRES. Broyden's good update technique, however, is shown to be naturally linked with a minimum next correction principle, which asymptotically mimics a minimum error principle. The two minimization principles differ significantly for sufficiently large system dimension. Numerical experiments on discretized partial differential equations of convection diffusion type in 2-D with integral layers give a first impression of the possible power of the derived good Broyden variant.

Deuflhard, Peter↗
NASA NTRS1992

Identifiability of linear systems in physical coordinates

Identifiability of linear, time-invariant systems in physical coordinates is discussed. It is shown that identification of the system matrix in physical coordinates can be accomplished by determining a transformation matrix that relates the physical locations of actuators and sensors to the test-data-derived input and output matrices. For systems with symmetric matrices, the solution of a constrained optimization problem is used to characterize all the possible solutions of the transformation matrix. Conditions for the existence of a unique transformation matrix are established easily from the explicit form of the solutions. For systems with limited inputs and outputs, the question about which part of the system can be uniquely identified is also answered. A simple mass-spring system is used to verify the conclusions of this study.

Su, Tzu-Jeng↗
DOE OSTI2018

PCG method with Strang’s circulant preconditioner for Hermitian positive definite linear system in Riesz space fractional advection–dispersion equations

In this paper, preconditioned conjugate gradient (PCG) method with Strang’s circulant preconditioner is investigated to solve the Hermitian positive definite linear systems, which is result from the Crank–Nicolson (C-N) finite difference scheme with the weighted and shifted Grünwald difference (WSGD) operators to discretize the Riesz space fractional advection–dispersion equation (RSFADE). We show that the spectrum of the preconditioned matrix is clustered around 1, and the singular values of the preconditioned matrix are uniformly bounded away from zero under a certain condition, respectively; hence the PCG method, when applied to solving the preconditioned system, converges superlinearly. Moreover, the complexity in each iteration of the PCG method is O(Nlog N) via using the fast Fourier transforms, where N is the matrix size. Numerical experiments are included to demonstrate the effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1980

A scaling theory for linear systems

A theory of scaling for rational (transfer) functions in terms of transformation groups is developed. Two different four-parameter scaling groups which play natural roles in studying linear systems are identified and the effect of scaling on Fisher information and related statistical measures in system identification are studied. The scalings considered include change of time scale, feedback, exponential scaling, magnitude scaling, etc. The scaling action of the groups studied is tied to the geometry of transfer functions in a rather strong way as becomes apparent in the examination of the invariants of scaling. As a result, the scaling process also provides new insight into the parameterization question for rational functions.

Brockett, R. W.↗
DOE OSTI2016

Response analysis of a class of quasi-linear systems with fractional derivative excited by Poisson white noise

The Poisson white noise, as a typical non-Gaussian excitation, has attracted much attention recently. However, little work was referred to the study of stochastic systems with fractional derivative under Poisson white noise excitation. This paper investigates the stationary response of a class of quasi-linear systems with fractional derivative excited by Poisson white noise. The equivalent stochastic system of the original stochastic system is obtained. Then, approximate stationary solutions are obtained with the help of the perturbation method. Finally, two typical examples are discussed in detail to demonstrate the effectiveness of the proposed method. The analysis also shows that the fractional order and the fractional coefficient significantly affect the responses of the stochastic systems with fractional derivative.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1975

Design of optimal partial state feedback controllers for linear systems in stochastic environments

The problem of obtaining an optimal control law, which is constrained to be a feedback of the available measurements, is considered for both continuous and discrete time linear systems subjected to additive white process noise and measurement noise. Necessary conditions are obtained for minimizing a quadratic performance function for both finite and infinite duration cases. The feedback gain matrices are constrained to be constant for the infinite duration cases. For all the cases considered, algorithms are derived for generating sequences of feedback gain matrices which successively improve the performance function. Computational aspects are discussed via application to two continuous time processes, including a helicopter/slung load system subjected to measurement noise and random wind gust input.

Joshi, S. M.↗
NASA NTRS1990

Upper and lower covariance bounds for perturbed linear systems

Both upper and lower bounds are established for state covariance matrices under parameter perturbations of the plant. The motivation for this study lies in the fact that many robustness properties of linear systems are given explicitly in terms of the state covariance matrix. Moreover, there exists a theory for control by covariance assignment. The results provide robustness properties of these covariance controllers.

Xu, J.-H.↗
DOE OSTI2024

The Cauchy Problem for Boltzmann Bi-linear Systems: The Mixing of Monatomic and Polyatomic Gases

Abstract From a unified vision of vector valued solutions in weighted Banach spaces, this paper establishes the existence and uniqueness for space homogeneous Boltzmann bi-linear systems with conservative collisional forms arising in complex gas dynamical structures. This broader vision is directly applied to dilute multi-component gas mixtures composed of both monatomic and polyatomic gases. Such models can be viewed as extensions of scalar Boltzmann binary elastic flows, as much as monatomic gas mixtures with disparate masses and single polyatomic gases, providing a unified approach for vector valued solutions in weighted Banach spaces. Novel aspects of this work include developing the extension of a general ODE theory in vector valued weighted Banach spaces, precise lower bounds for the collision frequency in terms of the weighted Banach norm, energy identities, angular or compact manifold averaging lemmas which provide coerciveness resulting into global in time stability, a new combinatorics estimate for p -binomial forms producing sharper estimates for the k -moments of bi-linear collisional forms. These techniques enable the Cauchy problem improvement that resolves the model with initial data corresponding to strictly positive and bounded initial vector valued mass and total energy, in addition to only a $$2^+$$ 2 + moment determined by the hard potential rates discrepancy, a result comparable in generality to the classical Cauchy theory of the scalar homogeneous Boltzmann equation.

Physics↗
DOE OSTI2014

A Multiple-Set Overlapping-Domain Decomposed Monte Carlo Synthetic Acceleration Method for Linear Systems

We present a multiple-set overlapping-domain decomposed strategy for parallelizing the Monte Carlo Synthetic Acceleration method. Monte Carlo Synthetic Acceleration methods use the Neumann-Ulam class of Monte Carlo solvers for linear systems to accelerate a fixed-point iteration sequence. Effective parallel algorithms for these methods require the parallelization of the underlying Neumann-Ulam solvers. To do this in a domain decomposed environment, we borrow strategies traditionally implemented in Monte Carlo particle transport to parallelize the problem. The parallel Neumann-Ulam and multiple-set overlapping-domain decomposition algorithms are presented along with parallel scaling data for the resulting implementation using the Titan Cray XK7 machine at Oak Ridge National Laboratory.

Computer Science↗