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 703 records · Page 39

On the quadratic sampled-data regulator with unstable random disturbances

This paper is concerned with the design of a digital controller, optimizing a quadratic cost function, for a linear system subjected to plant disturbance. The disturbance is viewed as a Gaussian random process generated by a linear system which may be unstable. It is shown that the optimal control consists of the sum of two terms: the optimal control when no disturbance is present and a term depending on the estimates of the disturbance. Necessary and sufficient conditions for the convergence of the gain matrices is given.

Halyo, N.↗

Block iterative restoration of astronomical images with the massively parallel processor

A method is described for algebraic image restoration capable of treating astronomical images. For a typical 500 x 500 image, direct algebraic restoration would require the solution of a 250,000 x 250,000 linear system. The block iterative approach is used to reduce the problem to solving 4900 121 x 121 linear systems. The algorithm was implemented on the Goddard Massively Parallel Processor, which can solve a 121 x 121 system in approximately 0.06 seconds. Examples are shown of the results for various astronomical images.

Heap, Sara R.↗

Gain optimization with non-linear controls

An algorithm has been developed for the analysis and design of controls for non-linear systems. The technical approach is to use statistical linearization to model the non-linear dynamics of a system by a quasi-Gaussian model. A covariance analysis is performed to determine the behavior of the dynamical system and a quadratic cost function. Expressions for the cost function and its derivatives are determined so that numerical optimization techniques can be applied to determine optimal feedback laws. The primary application for this paper is centered about the design of controls for nominally linear systems but where the controls are saturated or limited by fixed constraints. The analysis is general, however, and numerical computation requires only that the specific non-linearity be considered in the analysis.

Slater, G. L.↗

Finite group homomorphic sequential systems.

A class of finite-state sequential systems evolving in groups is considered. It represents a broader class of input-output relations than those found in linear system theory. The concepts of controllability, observability, minimality, realizability, and the isomorphism of minimal realizations are developed. Results that are analogous to, but differ in essential details from, those of linear system theory are derived. Algorithmic design and algebraic decoding may benefit from these results.

Brockett, R. W.↗

SymPix: A spherical grid for efficient sampling of rotationally invariant operators

We present SymPix, a special-purpose spherical grid optimized for efficiently sampling rotationally invariant linear operators. This grid is conceptually similar to the Gauss–Legendre (GL) grid, aligning sample points with iso-latitude rings located on Legendre polynomial zeros. Unlike the GL grid, however, the number of grid points per ring varies as a function of latitude, avoiding expensive oversampling near the poles and ensuring nearly equal sky area per grid point. The ratio between the number of grid points in two neighboring rings is required to be a low-order rational number (3, 2, 1, 4/3, 5/4, or 6/5) to maintain a high degree of symmetries. Our main motivation for this grid is to solve linear systems using multi-grid methods, and to construct efficient preconditioners through pixel-space sampling of the linear operator in question. As a benchmark and representative example, we compute a preconditioner for a linear system that involves the operator D-hat + B-hat {sup T}N{sup −1} B-hat , where B-hat and D-hat may be described as both local and rotationally invariant operators, and N is diagonal in the pixel domain. For a bandwidth limit of ℓ{sub max} = 3000, we find that our new SymPix implementation yields average speed-ups of 360 and 23 for B-hat {sup T}N{sup −1} B-hat and D-hat , respectively, compared with the previous state-of-the-art implementation.

79 ASTRONOMY AND ASTROPHYSICS↗

Optimal Power Flow Derived Sparse Linear Solver Benchmarks

Due to the changing nature of the power grid, it is increasingly important to be able to solve a high-fidelity optimal power-flow models on large power networks. This high-fidelity problem, called AC Optimal Power Flow (ACOPF), is a nonlinear, nonconvex optimization problem. One of the few reliable ways of solving such a problem is interior point methods. These methods result in sparse linear systems where the coefficient matrix is symmetric, indefinite and nearly always ill-conditioned. As such, they are particularly challenging for sparse linear solvers and represent a considerable computational bottleneck in solving the ACOPF problem. In this paper, we introduce a repository of linear systems captured from ACOPF problems when solved by the open-source optimizer IPOPT. These matrices are meant to be used as a test suite for sparse linear solver development.

97 MATHEMATICS AND COMPUTING↗

A new computational approach for the solutions of generalized pantograph-delay differential equations

In this study, a new computational approach is presented to solve the generalized pantograph-delay differential equations (PDDEs). The solutions obtained by our scheme represent by a linear combination of a special kind of basis functions, and can be deduced in a straightforward manner. Firstly, using the least squares approximation method and the Lagrange-multiplier method, the given PDDE is converted to a linear system of algebraic equations, and those unknown coefficients of the solution of the problem are determined by solving this linear system. Secondly, a PDDE related to the error function of the approximate solution is constructed based on the residual error function technique, and error estimation is presented for the suggested method. The convergence of the approximate solution is proved. Several numerical examples are given to demonstrate the accuracy and efficiency. Comparisons are made between the proposed method and other existing methods.

97 MATHEMATICS AND COMPUTING↗

A scalable block-preconditioning strategy for divergence-conforming B-spline discretizations of the Stokes problem

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf–sup stable and pointwise divergence-free. When applied to the discretized Stokes problem, these spaces generate a symmetric and indefinite saddle-point linear system. The iterative method of choice to solve such system is the Generalized Minimum Residual Method. This method lacks robustness, and one remedy is to use preconditioners. For linear systems of saddle-point type, a large family of preconditioners can be obtained by using a block factorization of the system. In this paper, we show how the nesting of “black-box” solvers and preconditioners can be put together in a block triangular strategy to build a scalable block preconditioner for the Stokes system discretized by divergence-conforming B-splines. Lastly, besides the known cavity flow problem, we used for benchmark flows defined on complex geometries: an eccentric annulus and hollow torus of an eccentric annular cross-section.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A harmonic balance method for PDEs

In this report, we describe some approaches to calculate the non-linear system of equations prescribed by the harmonic balance method (HB), a frequency domain analysis technique for modelling a non-linear system of partial differential equations (PDEs). The approach which we ultimately pursue can be seen as a time-collocation approach, except that the harmonic balance equations are obtained weakly (in the sense used in the calculus of variations). This weak formulation allows us to adapt existing transient or stationary PDEs models in the Panzer/Trilinos framework for frequency domain analysis via the harmonic balance method. We begin with a motivatation for the harmonic balance method and outline its mathematical formulation. We then describe some approaches to calculate the harmonic balance formulae, and their means of implementation through the modification of a Panzer tutorial problem - a stationary Helmholtz equation with a constant Dirichlet boundary condition and a non-linear source. For each of these approaches, we outline the necessary adaptations to solve the corresponding (periodically) transient Helmholtz equation with a (temporally) periodic Dirichlet boundary condition and non-linear source.

97 MATHEMATICS AND COMPUTING↗

Higher Order Time Integration Schemes for the Unsteady Navier-Stokes Equations on Unstructured Meshes

The efficiency gains obtained using higher-order implicit Runge-Kutta schemes as compared with the second-order accurate backward difference schemes for the unsteady Navier-Stokes equations are investigated. Three different algorithms for solving the nonlinear system of equations arising at each timestep are presented. The first algorithm (NMG) is a pseudo-time-stepping scheme which employs a non-linear full approximation storage (FAS) agglomeration multigrid method to accelerate convergence. The other two algorithms are based on Inexact Newton's methods. The linear system arising at each Newton step is solved using iterative/Krylov techniques and left preconditioning is used to accelerate convergence of the linear solvers. One of the methods (LMG) uses Richardson's iterative scheme for solving the linear system at each Newton step while the other (PGMRES) uses the Generalized Minimal Residual method. Results demonstrating the relative superiority of these Newton's methods based schemes are presented. Efficiency gains as high as 10 are obtained by combining the higher-order time integration schemes with the more efficient nonlinear solvers.

Jothiprasad, Giridhar↗

Linear Approximation Line Pack Model for Integrated Electricity and Natural Gas Systems OPF

With the increasing installation of renewable energy electricity generation capacity, the penetration of natural gas fired generation is also substantailly increasing in power systems due to their fast response capability to mitigate system variability and uncertainty. The dependencies between the electricity system and the natural gas system are becoming more important to maintain the reliability of both systems. In integrated electricity and natural gas systems (IEGSs) operations, the nonlinearity of the natural gas system brings challenges to the system operators. In this paper, the IEGSs optimal power flow (OPF) model is proposed that includes the line pack of the gas system via linear approximation. The simulation results demonstrate that the proposed model can obtain optimal solutions efficiently that are comparable in accuracy as the nonlinear line pack model.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Hydrodynamics of suspensions of passive and active rigid particles: a rigid multiblob approach

We develop a rigid multiblob method for numerically solving the mobility problem for suspensions of passive and active rigid particles of complex shape in Stokes flow in unconfined, partially confined, and fully confined geometries. As in a number of existing methods, we discretize rigid bodies using a collection of minimally resolved spherical blobs constrained to move as a rigid body, to arrive at a potentially large linear system of equations for the unknown Lagrange multipliers and rigid-body motions. Here we develop a block-diagonal preconditioner for this linear system and show that a standard Krylov solver converges in a modest number of iterations that is essentially independent of the number of particles. Key to the efficiency of the method is a technique for fast computation of the product of the blob-blob mobility matrix and a vector. For unbounded suspensions, we rely on existing analytical expressions for the Rotne-Prager-Yamakawa tensor combined with a fast multipole method (FMM) to obtain linear scaling in the number of particles. For suspensions sedimented against a single no-slip boundary, we use a direct summation on a graphical processing unit (GPU), which gives quadratic asymptotic scaling with the number of particles. For fully confined domains, such as periodic suspensions or suspensions confined in slit and square channels, we extend a recently developed rigid-body immersed boundary method by B. Kallemov, A. P. S. Bhalla, B. E. Griffith, and A. Donev (Commun. Appl. Math. Comput. Sci. 11 (2016), no. 1, 79-141) to suspensions of freely moving passive or active rigid particles at zero Reynolds number. We demonstrate that the iterative solver for the coupled fluid and rigid-body equations converges in a bounded number of iterations regardless of the system size. In our approach, each iteration only requires a few cycles of a geometric multigrid solver for the Poisson equation, and an application of the block-diagonal preconditioner, leading to linear scaling with the number of particles. We optimize a number of parameters in the iterative solvers and apply our method to a variety of benchmark problems to carefully assess the accuracy of the rigid multiblob approach as a function of the resolution. We also model the dynamics of colloidal particles studied in recent experiments, such as passive boomerangs in a slit channel, as well as a pair of non-Brownian active nanorods sedimented against a wall.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

GPU Accelerated Sparse Cholesky Factorization

The solution of sparse symmetric positive definite linear systems is an important computational kernel in large-scale scientific and engineering modeling and simulation. We will solve the linear systems using a direct method, in which a Cholesky factorization of the coefficient matrix is performed using a right-looking approach and the resulting triangular factors are used to compute the solution. Sparse Cholesky factorization is compute intensive. In this work we investigate techniques for reducing the factorization time in sparse Cholesky factorization by offloading some of the dense matrix operations on a GPU. We will describe the techniques we have considered. We achieved up to 4x speedup compared to the CPU-only version.

Karsavuran, M Ozan↗

Tailored multivariate analysis for modulated enhanced diffraction

Modulated enhanced diffraction (MED) is a technique allowing the dynamic structural characterization of crystalline materials subjected to an external stimulus, which is particularly suited for in situ and operando structural investigations at synchrotron sources. Contributions from the (active) part of the crystal system that varies synchronously with the stimulus can be extracted by an offline analysis, which can only be applied in the case of periodic stimuli and linear system responses. In this paper a new decomposition approach based on multivariate analysis is proposed. The standard principal component analysis (PCA) is adapted to treat MED data: specific figures of merit based on their scores and loadings are found, and the directions of the principal components obtained by PCA are modified to maximize such figures of merit. As a result, a general method to decompose MED data, called optimum constrained components rotation (OCCR), is developed, which produces very precise results on simulated data, even in the case of nonperiodic stimuli and/or nonlinear responses. The multivariate analysis approach is able to supply in one shot both the diffraction pattern related to the active atoms (through the OCCR loadings) and the time dependence of the system response (through the OCCR scores). When applied to real data, OCCR was able to supply only the latter information, as the former was hindered by changes in abundances of different crystal phases, which occurred besides structural variations in the specific case considered. To develop a decomposition procedure able to cope with this combined effect represents the next challenge in MED analysis.

Caliandro, Rocco↗

An approach to the development of numerical algorithms for first order linear hyperbolic systems in multiple space dimensions: The constant coefficient case

Two methods for developing high order single step explicit algorithms on symmetric stencils with data on only one time level are presented. Examples are given for the convection and linearized Euler equations with up to the eighth order accuracy in both space and time in one space dimension, and up to the sixth in two space dimensions. The method of characteristics is generalized to nondiagonalizable hyperbolic systems by using exact local polynominal solutions of the system, and the resulting exact propagator methods automatically incorporate the correct multidimensional wave propagation dynamics. Multivariate Taylor or Cauchy-Kowaleskaya expansions are also used to develop algorithms. Both of these methods can be applied to obtain algorithms of arbitrarily high order for hyperbolic systems in multiple space dimensions. Cross derivatives are included in the local approximations used to develop the algorithms in this paper in order to obtain high order accuracy, and improved isotropy and stability. Efficiency in meeting global error bounds is an important criterion for evaluating algorithms, and the higher order algorithms are shown to be up to several orders of magnitude more efficient even though they are more complex. Stable high order boundary conditions for the linearized Euler equations are developed in one space dimension, and demonstrated in two space dimensions.

Goodrich, John W.↗

An adjoint method for neoclassical stellarator optimization

Stellarators remain an enticing route to steady-state fusion power. However, to achieve the required confinement, the magnetic geometry must be highly optimized. This optimization requires navigating high-dimensional spaces, often necessitating the use of gradient-based methods. The gradient of the neoclassical fluxes is expensive to compute with classical methods, requiring $O(N)$ flux computations, where $N$ is the number of parameters. To reduce the cost of the gradient computation, we present an adjoint method for computing the derivatives of moments of the neoclassical distribution function for stellarator optimization. The linear adjoint method allows derivatives of quantities which depend on solutions of a linear system, such as moments of the distribution function, to be computed with respect to many parameters from the solution of only two linear systems. This reduces the cost of computing the gradient to the point that the finite-collisionality neoclassical fluxes can be used within an optimization loop. With the neoclassical adjoint method, we compute solutions of the drift kinetic equation and an adjoint drift kinetic equation to obtain derivatives of neoclassical quantities with respect to geometric parameters. When the number of parameters in the derivative is large ( $O(10^{2})$ ), this adjoint method provides up to a factor of 200 reduction in cost. We demonstrate adjoint-based optimization of the field strength to obtain minimal bootstrap current on a surface. With adjoint-based derivatives, we also compute the local sensitivity to magnetic perturbations on a flux surface and identify regions where tight tolerances on error fields are required for control of the bootstrap current or radial transport. Moreover, the solve for the ambipolar electric field is accelerated using a Newton method with derivatives obtained from the adjoint method.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Presentation: Sensor Anomaly Detection for Nuclear Reactor Systems Utilizing Linear Regression and K-Means Unsupervised Machine Learning: An overview of methods and results

This presentation is a culmination of work which has occurred over the course of a 10-week internship. Anomaly detection methods must be both robust enough to detect subtle anomalies yet not so sensitive to report false positives, which would result significant loss of revenue. Methods currently being developed for autonomous systems are often pursuing a Digital Twin method, which will look at the entire system and model it as a whole. This presentation, however, focuses less on direct application to an NPP, rather acting as a proof of concept for the methods developed. For the project, we look to develop methods to analyze steady-state data and report anomalies.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗