Search NASA⌕ Search

SEARCH · Search NASA

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 649 records · Page 36

Self-consistent field theory based molecular dynamics with linear system-size scaling

We present an improved field-theoretic approach to the grand-canonical potential suitable for linear scaling molecular dynamics simulations using forces from self-consistent electronic structure calculations. It is based on an exact decomposition of the grand canonical potential for independent fermions and does neither rely on the ability to localize the orbitals nor that the Hamilton operator is well-conditioned. Hence, this scheme enables highly accurate all-electron linear scaling calculations even for metallic systems. The inherent energy drift of Born-Oppenheimer molecular dynamics simulations, arising from an incomplete convergence of the self-consistent field cycle, is circumvented by means of a properly modified Langevin equation. The predictive power of the present approach is illustrated using the example of liquid methane under extreme conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Synchronization of Coupled Dynamical Systems: Tolerance to Weak Connectivity and Arbitrarily Bounded Time-Varying Delays

We study synchronization of coupled linear systems over networks with weak connectivity and time-varying delays. We focus on the case that the internal dynamics are time-varying but non-expansive. Both uniformly connected and infinitely connected communication topologies are considered. A new concept of P-synchronization is introduced and we first show that global asymptotic P-synchronization can be achieved over directed networks with uniform joint connectivity and arbitrarily bounded delays. We then study the case of the infinitely jointly connected communication topology. In particular, for the undirected communication topologies, it turns out that the existence of a uniform time interval for the communication topology is not necessary and P-synchronization can be achieved when the time varying delays are arbitrarily bounded. Simulations are given to validate the theoretical results.

Linear time-varying system, Synchronization, Switc↗

A Critical Examination of Wind-Wave Spectral Functional Form

Traditionally, data from random ocean waves are presented in spectral functions. The spectra are the result of Fourier analysis. Fourier spectral analysis has dominated data analysis for, at least, the last hundred years. It has been the standard method for is examining the global amplitude-frequency distributions. Although Fourier transform valid under extremely general conditions, there are some crucial restrictions for the Fourier spectral analysis. The system must be linear, and the data must be stationary- otherwise, the resulting spectrum will make little physical sense. The stationarity requirement is also a common required criterion for most of other available data analysis methods. Nevertheless, few, if any, natural phenomena are linear and stationary. To compound these complications is the imperfection of our probes or numerical schemes the interactions of the imperfect probes even with a perfect linear system can make the final data nonlinear. Furthermore, all the available data are usually of finite duration. Under these conditions, Fourier analysis is of limited use, For lack of alternatives, however, Fourier analysis is still used to process such data. The loose application of Fourier analysis and the insouciant adoption of the stationary and linear assumptions may lead to misleading conclusions. Ocean waves are know to be nonlinear, and the wind system generating the wave field are seldom stationary- As a result, the traditional examination of the spectral form hardly made physical sense. A new method for analyzing nonlinear and nonstationary data has been developed. The key part is the Empirical Mode Decomposition (EMD) method with which any complicated data set can be decomposed into a finite and often small number of Intrinsic Mode Functions (IMF) that serve as the basis of the representation of the data, This decomposition method is adaptive, and, therefore, highly efficient. The IMFs admit well-behaved Hilbert transforms, and yield instantaneous energy and frequency as functions of time that give sharp identifications of imbedded structures. The final presentation of the results is an energy-frequency-time distribution, designated as the Hilbert Spectrum. Among the main conceptual innovations is the introduction of the instantaneous frequencies for complicated data sets, which eliminate the need of spurious harmonics to represent nonlinear and nonstationary signals. The spectral forms of the ocean waves are very different. This new method offers the first physical meaningful view of the wave spectrum. Data from laboratory and field will be presented to illustrate the differences.

Huang, Norden E.↗

On the determination of optimal costly measurement strategies for linear stochastic systems.

This paper presents the formulation of a class of optimization problems dealing with selecting, at each instant of time, one measurement provided by one out of many sensors. Each measurement has an associated measurement cost. The basic problem is then to select an optimal measurement policy, during a specified observation time interval, so that a weighted combination of prediction accuracy and accumulated observation cost is optimized. The current analysis is limited to the class of linear stochastic dynamic systems and measurement subsystems. The problem of selecting the optimal measurement strategy can be transformed into a deterministic optimal control problem. It is shown that the optimal measurement policy and the associated matched Kalman-type filter can be precomputed.

Athans, M.↗

Preconditioned least‐squares Petrov–Galerkin reduced order models

Abstract In this article, we introduce a methodology for improving the accuracy and efficiency of reduced order models (ROMs) constructed using the least‐squares Petrov–Galerkin (LSPG) projection method through the introduction of preconditioning. Unlike prior related work, which focuses on preconditioning the linear systems arising within the ROM numerical solution procedure to improve linear solver performance, our approach leverages a preconditioning matrix directly within the minimization problem underlying the LSPG formulation. Applying preconditioning in this way has the potential to improve ROM accuracy for several reasons. First, preconditioning the LSPG formulation changes the norm defining the residual minimization, which can improve the residual‐based stability constant bounding the ROM solution's error. The incorporation of a preconditioner into the LSPG formulation can have the additional effect of scaling the components of the residual being minimized to make them roughly of the same magnitude, which can be beneficial when applying the LSPG method to problems with disparate scales (e.g., dimensional equations, multi‐physics problems). Importantly, we demonstrate that an “ideal preconditioned” LSPG ROM (a ROM in which the preconditioner is the inverse of the Jacobian of its corresponding full order model) emulates projection of the full order model solution increment onto the reduced basis. This quantity defines a lower bound on the error of a ROM solution for a given reduced basis. By designing preconditioners that approximate the Jacobian inverse—as is common in designing preconditioners for solving linear systems—it is possible to obtain a ROM whose error approaches this lower bound. The proposed approach is evaluated on several mechanical and thermo‐mechanical problems implemented within the Albany HPC code and run in the predictive regime, with prediction across material parameter space. We demonstrate numerically that the introduction of simple Jacobi, Gauss‐Seidel, and ILU preconditioners into the proper orthogonal decomposition/LSPG formulation reduces significantly the ROM solution error, the reduced Jacobian condition number, the number of nonlinear iterations required to reach convergence, and the wall time (thereby improving efficiency). Moreover, our numerical results reveal that the introduction of preconditioning can deliver a robust and accurate solution for test cases in which the unpreconditioned LSPG method fails to converge.

Lindsay, Payton↗

MueMat Multicrid Toolbox

MueMat is intended for the research and development of multigrid algorithms used in the solution of sparse linear systems arising from systems of partial differential equations. The software can generate example linear systems and provides short programs to demonstrate the various interfaces for creating, accessing, and applying the solvers. MueMat currently includes two types of algebraic multigrid methods and many commonly used smoothers. However, the software is intended to be extensible, and new methods can be incorporated easily. MueMat also allows for advanced usage, such as combining multiple methods and segregated solves. The library supports point and block access to matrix data. MueMat has been designed for use within the programming environment of the Mathworks program MATLAB®. All algorithms and methods in MueMat have been or will be published in the open scientific literature.

Boman, ErikG.↗

A REPORT ON THREE SERIES OF EXPERIMENTS AND THE DESCRIPTION OF A SIMPLIFIED MODEL OF THE THIN WALL CYLINDER AND CONE BUCKLING MECHANISM

Three series of experiments were performed to investigate the nature of the buckling phenomenon. They were: a) influence of an increasing dimple on the buckling load of a cylinder; b) investigation of the strain distribution on one cylinder, after one or more waves were imposed on it; c) measurements of lateral deflections at buckling. The results of such experiments give some support to the idea of a buckling model, which can be of eventual interest to the thin wall cylinder and cone buckling problem, where a non-linear system (the buckled band) is considered in series with a linear system (the unbuckled portion of the cylinder, plus the testing-machine )

CYLINDER↗

Robust control design for aerospace applications

Time-domain control design for stability robustness of linear systems with structured uncertainty is addressed. Upper bounds on the linear perturbation of an asymptotically stable linear system are obtained, making it possible to maintain stability by using the structural information of the uncertainty. A quantitative measure called the stability robustness index is introduced and used to design controllers for robust stability. The proposed state feedback control design algorithm can be used, for a given set of perturbations, to select the range of control effort for which the system is stability-robust. Conversely it can be used, for a given control effort, to determine the size of the tolerable perturbation. The algorithm is illustrated with examples from aircraft control and large-space-structure control problems.

Yedavalli, Rama K.↗

Linear approximations of nonlinear systems

The development of a method for designing an automatic flight controller for short and vertical take off aircraft is discussed. This technique involves transformations of nonlinear systems to controllable linear systems and takes into account the nonlinearities of the aircraft. In general, the transformations cannot always be given in closed form. Using partial differential equations, an approximate linear system called the modified tangent model was introduced. A linear transformation of this tangent model to Brunovsky canonical form can be constructed, and from this the linear part (about a state space point x sub 0) of an exact transformation for the nonlinear system can be found. It is shown that a canonical expansion in Lie brackets about the point x sub 0 yields the same modified tangent model.

Hunt, L. R.↗

MAPPRAISER: A massively parallel map-making framework for multi-kilo pixel CMB experiments

Forthcoming cosmic microwave background (CMB) polarized anisotropy experiments have the potential to revolutionize our understanding of the Universe and fundamental physics. The sought-after, tale-telling signatures will be however distributed over voluminous data sets which these experiments will collect. These data sets will need to be efficiently processed and unwanted contributions due to astrophysical, environmental, and instrumental effects characterized and efficiently mitigated in order to uncover the signatures. This poses a significant challenge to data analysis methods, techniques, and software tools which will not only have to be able to cope with huge volumes of data but to do so with unprecedented precision driven by the demanding science goals posed for the new experiments. A keystone of efficient CMB data analysis is solvers of very large linear systems of equations. Such systems appear in very diverse contexts throughout CMB data analysis pipelines, however they typically display similar algebraic structures and can therefore be solved using similar numerical techniques. Linear systems arising in the so-called map-making problem are one of the most prominent and common ones. In this work we present a massively parallel, flexible and extensible framework, comprised of a numerical library, MIDAPACK, and a high level code, MAPPRAISER, which provide tools for solving efficiently such systems. Here, the framework implements iterative solvers based on conjugate gradient techniques: enlarged and preconditioned using different preconditioners. We demonstrate the framework on simulated examples reflecting basic characteristics of the forthcoming data sets issued by ground-based and satellite-borne instruments, executing it on as many as 16,384 compute cores. The software is developed as an open source project freely available to the community at: https://github.com/B3Dcmb/midapack.

79 ASTRONOMY AND ASTROPHYSICS↗

A preconditioning technique for Schur complement systems arising in stochastic optimization

Deterministic sample average approximations of stochastic programming problems with recourse are suitable for a scenario-based parallelization. In this paper the parallelization is obtained by using an interior-point method and a Schur complement mechanism for the interior-point linear systems. However, the direct linear solves involving the dense Schur complement matrix are expensive, and adversely affect the scalability of this approach. We address this issue by proposing a stochastic preconditioner for the Schur complement matrix and by using Krylov iterative methods for the solution of the dense linear systems. The stochastic preconditioner is built based on a subset of existing scenarios and can be assembled and factorized on a separate process before the computation of the Schur complement matrix finishes on the remaining processes. The expensive factorization of the Schur complement is removed from the parallel execution flow and the scaling of the optimization solver is considerably improved with this approach. The spectral analysis indicates an exponentially fast convergence in probability to 1 of the eigenvalues of the preconditioned matrix with the number of scenarios incorporated in the preconditioner. Numerical experiments performed on the relaxation of a unit commitment problem show good performance, in terms of both the accuracy of the solution and the execution time.

99 GENERAL AND MISCELLANEOUS↗

Linear approximations of nonlinear systems

A method for designing an automatic flight controller for short and vertical takeoff aircraft is presently being developed at NASA Ames Research Center. This technique involves transformations of nonlinear systems to controllable linear systems and takes into account the nonlinearities of the aircraft. In general, the transformations cannot always be given in closed form. Using partial differential equations, an approximate linear system, called the modified tangent model, was recently introduced. A linear transformation of this tangent model to Brunovsky canonical form can be constructed, and from this an approximation of an exact transformation for the nonlinear system can be found. It is shown that a canonical expansion in Lie brackets about the point x(0) yields the same modified tangent model.

Hunt, L. R.↗

Block encoding of the three-dimensional heterogeneous Poisson equation with application to fracture flow

Quantum linear system (QLS) algorithms offer the potential to solve large-scale linear systems exponentially faster than classical methods. However, applying QLS algorithms to real-world problems remains challenging due to issues such as state preparation, data loading, and efficient information extraction. In this work, we study the feasibility of applying QLS algorithms to solve discretized three-dimensional (3D) heterogeneous Poisson equations, with specific examples relating to groundwater flow through geologic fracture networks. We explicitly construct a block encoding for the 3D heterogeneous Poisson matrix by leveraging the sparse local structure of the discretized operator. While classical solvers benefit from preconditioning, we show that block encoding the system matrix and preconditioner separately does not improve the effective condition number that dominates the QLS run-time. This differs from classical approaches where the preconditioner and the system matrix can often be implemented independently. Nevertheless, due to the structure of the problem in three dimensions, the quantum algorithm achieves a run-time of 𝑂⁡(𝑁 2/3 polylog 𝑁 ⋅log (1/𝜖)), outperforming the best classical methods (with run times of 𝑂⁡(𝑁⁢log 𝑁 ⋅log (1/𝜖))) and offering exponential memory savings. These results highlight both the promise and limitations of QLS algorithms for practical scientific computing, and point to effective condition-number reduction as a key barrier in achieving quantum advantages.

58 GEOSCIENCES↗

On the controllability of a class of discrete bilinear systems.

The subject of this paper is the controllability of a class of time invariant discrete bilinear systems. Bilinear systems are classified into two categories: homogeneous and inhomogeneous. Necessity as well as the sufficiency results are obtained by means of decomposing the bilinear system into a linear system and a multiplicative feedback. By-products of the decomposition are the notions of multiplicative feedback compensation and the multiplicative feedback with bias compensation which may prove to be alternatives for the classical linear feedback compensation.

Goka, T.↗

Flight control application of new stability robustness bounds for linear uncertain systems

This paper addresses the issue of obtaining bounds on the real parameter perturbations of a linear state-space model for robust stability. Based on Kronecker algebra, new, easily computable sufficient bounds are derived that are much less conservative than the existing bounds since the technique is meant for only real parameter perturbations (in contrast to specializing complex variation case to real parameter case). The proposed theory is illustrated with application to several flight control examples.

Yedavalli, Rama K.↗