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 1,243 records · Page 69

Scalability under a Power Bound using the GREMLINs Framework

With the move towards exascale, system and software developers will have to deal with issues of extreme parallelism. The system properties affected most by the increase in node and core count are the shared resources on node and across the system. The increase in parallelism leads to reduced memory and bandwidth when regarding individual cores. Since power is a limiting factor for supercomputers, and power is not fully utilized in current systems, overprovisioning compute resources is a viable approach to maximized power utilization. To maximize system performance in regard to these changing conditions, it is necessary to understand how resource restrictions impact performance and system behavior. For the purpose of understanding anticipated system properties the GREMLINs Framework was developed. The framework gives the opportunity to add power restrictions, hinder memory properties and introduce faults to study resilience, among others. These features give the opportunity to use current petascale technology to study problems system designers and software developers will have to face when moving towards exascale and beyond. This work describes the initial release of the GREMLINs Framework, developed for this work, and shows how it can be used to study the scaling behavior of proxy applications. These proxy applications represent a selection of HPC workloads important to the scientific community. The proxy applications studied are AMG2013, an algebraic multi-grid linear system solver, CoMD, a classical molecular dynamics proxy application and NEKBONE, an application that uses a high order spectral element method to solve the Navier-Stokes equations. The main interest of these studies lies in analysis regarding their power behavior at scale under a power bound. These findings show how the GREMLINs Framework can help systems and software designers to attain better application performance and can also be used as basis for CPU power balancing tools to use power more efficiently.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

LINEAR SOLAR MODELS

We present a new approach to studying the properties of the Sun. We consider small variations of the physical and chemical properties of the Sun with respect to standard solar model predictions and we linearize the structure equations to relate them to the properties of the solar plasma. By assuming that the (variation of) present solar composition can be estimated from the (variation of) nuclear reaction rates and elemental diffusion efficiency in the present Sun, we obtain a linear system of ordinary differential equations which can be used to calculate the response of the Sun to an arbitrary modification of the input parameters (opacity, cross sections, etc.). This new approach is intended to be a complement to the traditional methods for solar model (SM) calculation and allows us to investigate in a more efficient and transparent way the role of parameters and assumptions in SM construction. We verify that these linear solar models recover the predictions of the traditional SMs with a high level of accuracy.

79 ASTRONOMY AND ASTROPHYSICS↗

Convergence Analysis of the Alternating Anderson–Picard Method for Nonlinear Fixed-Point Problems

Anderson acceleration (AA) has been widely used to solve nonlinear fixed-point problems due to its rapid convergence. This work focuses on a variant of AA in which multiple Picard iterations are performed between each AA step, referred to as the Alternating Anderson–Picard (AAP) method. Furthermore, despite introducing more “slow” Picard iterations, this method has been shown to be efficient and even more robust in both linear and nonlinear cases. However, there is a lack of theoretical analysis for AAP in the nonlinear case. In this paper, we address this gap by establishing the equivalence between AAP and a multisecant-GMRES method that uses GMRES to solve a multisecant linear system at each iteration. From this perspective, we show that AAP “converges” to the Newton-GMRES method. Specifically, as the residual approaches zero, the multisecant matrix, the approximate Jacobian inverse, the search direction, and the optimization gain of AAP converge to their counterparts in the Newton-GMRES method. These connections provide insights for analyzing the asymptotic convergence properties of AAP. Consequently, we show that AAP is locally 𝑞-linear convergent and provide an upper bound for the convergence factor of AAP. To validate the theoretical results, numerical examples are provided.

Anderson acceleration↗

Implementation of an algorithm for cylindrical object identification using range data

One of the problems in 3-D object identification and localization is addressed. In robotic and navigation applications the vision system must be able to distinguish cylindrical or spherical objects as well as those of other geometric shapes. An algorithm was developed to identify cylindrical objects in an image when range data is used. The algorithm incorporates the Hough transform for line detection using edge points which emerge from a Sobel mask. Slices of the data are examined to locate arcs of circles using the normal equations of an over-determined linear system. Current efforts are devoted to testing the computer implementation of the algorithm. Refinements are expected to continue in order to accommodate cylinders in various positions. A technique is sought which is robust in the presence of noise and partial occlusions.

Bozeman, Sylvia T.↗

Solving sparse finite element problems on neuromorphic hardware

The finite element method (FEM) is one of the most important and ubiquitous numerical methods for solving partial differential equations (PDEs) on computers for scientific and engineering discovery. Applying the FEM to larger and more detailed scientific models has driven advances in high-performance computing for decades. Here we demonstrate that scalable spiking neuromorphic hardware can directly implement the FEM by constructing a spiking neural network that solves the large, sparse, linear systems of equations at the core of the FEM. We show that for the Poisson equation, a fundamental PDE in science and engineering, our neural circuit achieves meaningful levels of numerical accuracy and close to ideal scaling on modern, inherently parallel and energy-efficient neuromorphic hardware, specifically Intel’s Loihi 2 neuromorphic platform. We illustrate extensions to irregular mesh geometries in both two and three dimensions as well as other PDEs such as linear elasticity. Our spiking neural network is constructed from a recurrent network model of the brain’s motor cortex and, in contrast to black-box deep artificial neural network-based methods for PDEs, directly translates the well-understood and trusted mathematics of the FEM to a natively spiking neuromorphic algorithm.

Applied mathematics↗

System and method for focal-plane illuminator/detector (FASID) design for improved graded index lenses

The present disclosure relates to a detector system for imaging an optical signal received by a graded index (GRIN) optical element to account for known variations in a graded index distribution of the GRIN optical element. The detector system incorporates a plurality of optical detector elements configured to receive optical rays received by the GRIN optical element at specific locations on a plane of the GRIN optical element. Ray tracing software is configured to receive and map the optical rays to a plurality of additional specific locations on the plane based on the known variations in the graded index distribution of the GRIN optical element. A processor uses algorithms for diagonalization of a linear system matrix to determine information on both an intensity and an angle of the received optical rays at each one of the plurality of specific locations on the plane.

Bude, Jeffrey Devin↗

Least-squares finite element solution of 3D incompressible Navier-Stokes problems

Although significant progress has been made in the finite element solution of incompressible viscous flow problems. Development of more efficient methods is still needed before large-scale computation of 3D problems becomes feasible. This paper presents such a development. The most popular finite element method for the solution of incompressible Navier-Stokes equations is the classic Galerkin mixed method based on the velocity-pressure formulation. The mixed method requires the use of different elements to interpolate the velocity and the pressure in order to satisfy the Ladyzhenskaya-Babuska-Brezzi (LBB) condition for the existence of the solution. On the other hand, due to the lack of symmetry and positive definiteness of the linear equations arising from the mixed method, iterative methods for the solution of linear systems have been hard to come by. Therefore, direct Gaussian elimination has been considered the only viable method for solving the systems. But, for three-dimensional problems, the computer resources required by a direct method become prohibitively large. In order to overcome these difficulties, a least-squares finite element method (LSFEM) has been developed. This method is based on the first-order velocity-pressure-vorticity formulation. In this paper the LSFEM is extended for the solution of three-dimensional incompressible Navier-Stokes equations written in the following first-order quasi-linear velocity-pressure-vorticity formulation.

Jiang, Bo-Nan↗

Practical Methodology for the Inclusion of Nonlinear Slosh Damping in the Stability Analysis of Liquid-Propelled Space Vehicles

One of the challenges of developing flight control systems for liquid-propelled space vehicles is ensuring stability and performance in the presence of parasitic minimally damped slosh dynamics in the liquid propellants. This can be especially difficult when the fundamental frequencies of the slosh motions are in proximity to the frequency used for vehicle control. The challenge is partially alleviated since the energy dissipation and effective damping in the slosh modes increases with amplitude. However, traditional launch vehicle control design methodology is performed with linearized systems using a fixed slosh damping corresponding to a slosh motion amplitude based on heritage values. This papers presents a method for performing the control design and analysis using damping at slosh amplitudes chosen based on the resulting limit cycle amplitude of the vehicle thrust vector system due to a control-slosh interaction under degraded phase and gain margin conditions.

Ottander, John A.↗

Practical Methodology for the Inclusion of Nonlinear Slosh Damping in the Stability Analysis of Liquid-propelled Space Vehicles

One of the challenges of developing flight control systems for liquid-propelled space vehicles is ensuring stability and performance in the presence of parasitic minimally damped slosh dynamics in the liquid propellants. This can be especially difficult when the fundamental frequencies of the slosh motions are in proximity to the frequency used for vehicle control. The challenge is partially alleviated since the energy dissipation and effective damping in the slosh modes increases with amplitude. However, traditional launch vehicle control design methodology is performed with linearized systems using a fixed slosh damping corresponding to a slosh motion amplitude based on heritage values. This papers presents a method for performing the control design and analysis using damping at slosh amplitudes chosen based on the resulting limit cycle amplitude of the vehicle thrust vector system due to a control-slosh interaction under degraded phase and gain margin conditions.

Ottander, John A.↗

A state estimation approach based on stochastic expansions

This paper presents a new approach for state estimation problems. It is based on the representation of random variables using stochastic functions. Its main idea is to expand the state variables in terms of the noise variables of the system, and then estimate the unnoisy value of the state variables by taking the mean value of the stochastic expansion. Moreover, it was shown that in some situations, the proposed approach may be adapted to the determination of the probability distribution of the state noise. For the determination of the coefficients of the expansions, we present three approaches: moment matching (MM), collocation (COL) and variational (VAR). In the numerical analysis section, three examples are analyzed including a discrete linear system, the Influenza in a boarding school and the state estimation problem in the Hodgkin–Huxley’s model. In all these examples, the proposed approach was able to estimate the values of the state variables with precision, i.e., with very low RMS values.

97 MATHEMATICS AND COMPUTING↗

Bounding the states of systems with unknown-but-bounded disturbances

Control systems with hard constraints on certain variables are characterized, in an analytical review of recent investigations based on an unknown-but-bounded description of magnitude uncertainties. Hard-constraint problems typically arise in the design of controllers for potentially hazardous systems such as nuclear power plants. Consideration is given to norm bounds based on matrix measures, extensions of Schweppe's (1968) ellipsoid bounds, and set-theoretic regulator design. The performance of these approaches is evaluated by means of numerical simulations involving a third-order nonlinear steam-boiler model; the results are presented in graphs, and it is found that ellipsoid bounds are tightest in the general case, but that box bounds are even tighter for linear systems with Metzler system matrices.

Tsai, Wei K.↗

A Verification-Driven Approach to Control Analysis and Tuning

This paper proposes a methodology for the analysis and tuning of controllers using control verification metrics. These metrics, which are introduced in a companion paper, measure the size of the largest uncertainty set of a given class for which the closed-loop specifications are satisfied. This framework integrates deterministic and probabilistic uncertainty models into a setting that enables the deformation of sets in the parameter space, the control design space, and in the union of these two spaces. In regard to control analysis, we propose strategies that enable bounding regions of the design space where the specifications are satisfied by all the closed-loop systems associated with a prescribed uncertainty set. When this is unfeasible, we bound regions where the probability of satisfying the requirements exceeds a prescribed value. In regard to control tuning, we propose strategies for the improvement of the robust characteristics of a baseline controller. Some of these strategies use multi-point approximations to the control verification metrics in order to alleviate the numerical burden of solving a min-max problem. Since this methodology targets non-linear systems having an arbitrary, possibly implicit, functional dependency on the uncertain parameters and for which high-fidelity simulations are available, they are applicable to realistic engineering problems..

Crespo, Luis G.↗

On stochastic control and optimal measurement strategies

The control of stochastic dynamic systems is studied with particular emphasis on those which influence the quality or nature of the measurements which are made to effect control. Four main areas are discussed: (1) the meaning of stochastic optimality and the means by which dynamic programming may be applied to solve a combined control/measurement problem; (2) a technique by which it is possible to apply deterministic methods, specifically the minimum principle, to the study of stochastic problems; (3) the methods described are applied to linear systems with Gaussian disturbances to study the structure of the resulting control system; and (4) several applications are considered.

Kramer, L. C.↗

Graph theory approach to the eigenvalue problem of large space structures

Graph theory is used to obtain numerical solutions to eigenvalue problems of large space structures (LSS) characterized by a state vector of large dimensions. The LSS are considered as large, flexible systems requiring both orientation and surface shape control. Graphic interpretation of the determinant of a matrix is employed to reduce a higher dimensional matrix into combinations of smaller dimensional sub-matrices. The reduction is implemented by means of a Boolean equivalent of the original matrices formulated to obtain smaller dimensional equivalents of the original numerical matrix. Computation time becomes less and more accurate solutions are possible. An example is provided in the form of a free-free square plate. Linearized system equations and numerical values of a stiffness matrix are presented, featuring a state vector with 16 components.

Reddy, A. S. S. R.↗

A generalized polynomial chaos based ensemble Kalman filter with high accuracy

As one of the most adopted sequential data assimilation methods in many areas, especially those involving complex nonlinear dynamics, the ensemble Kalman filter (EnKF) has been under extensive investigation regarding its properties and efficiency. Compared to other variants of the Kalman filter (KF), EnKF is straightforward to implement, as it employs random ensembles to represent solution states. This, however, introduces sampling errors that affect the accuracy of EnKF in a negative manner. Though sampling errors can be easily reduced by using a large number of samples, in practice this is undesirable as each ensemble member is a solution of the system of state equations and can be time consuming to compute for large-scale problems. In this paper we present an efficient EnKF implementation via generalized polynomial chaos (gPC) expansion. The key ingredients of the proposed approach involve (1) solving the system of stochastic state equations via the gPC methodology to gain efficiency; and (2) sampling the gPC approximation of the stochastic solution with an arbitrarily large number of samples, at virtually no additional computational cost, to drastically reduce the sampling errors. The resulting algorithm thus achieves a high accuracy at reduced computational cost, compared to the classical implementations of EnKF. Numerical examples are provided to verify the convergence property and accuracy improvement of the new algorithm. We also prove that for linear systems with Gaussian noise, the first-order gPC Kalman filter method is equivalent to the exact Kalman filter.

97 MATHEMATICS AND COMPUTING↗

ExaWind: Predictive Wind Energy Simulations

This presentation describes the ExaWind project and the team's progress in creating a suite of performance-portable codes designed for predictive simulations of wind farms on next-generation exascale-class supercomputers. Such simulations will require the resolution of scales spanning many orders of magnitude, from blade boundary layers to wind farm flow structures. In the U.S., the first exascale systems will be GPU accelerated, and different GPU manufacturers have been chosen for the different systems. At the heart of the ExaWind software is a hybrid-solver approach based on the codes Nalu-Wind and AMR-Wind, which are computational fluid dynamics solvers for the incompressible Navier-Stokes equations. Nalu-Wind is an unstructured-grid code used to resolve wind turbine geometry and blade boundary layers, whereas AMR-Wind is a structured-grid background solver for atmospheric turbulent flow and turbine wake propagation. The models are coupled with overset meshes and global linear systems are approximated through a loose-coupling algorithm. Results will include validation-quality high-fidelity simulations and strong/weak scaling results from the Summit supercomputer.

49 EE - Wind and Water Power Program - Wind (EE-4W↗

Milestone 49 Report: Batched Sparse LA Phase 5 Implementation

Batched sparse linear algebra operations in general, and solvers in particular, have become the major algorithmic development activity and foremost performance engineering effort in the numerical software libraries work on modern hardware with accelerators such as GPUs. Many applications, ECP and non-ECP alike, require simultaneous solutions of many small linear systems of equations that are structurally sparse in one form or another. In order to move towards high hardware utilization levels, it is important to provide these applications with appropriate interface designs to be both functionally efficient and performance portable and give full access to the appropriate batched sparse solvers running on modern hardware accelerators prevalent across DOE supercomputing sites since the inception of ECP. To this end, we present here a summary of recent advances on the interface designs in use by HPC software libraries supporting batched sparse linear algebra and the development of sparse batched kernel codes for solvers and preconditioners. We also address the potential interoperability opportunities to keep the corresponding software portable between the major hardware accelerators from AMD, Intel, and NVIDIA, while maintaining the appropriate disclosure levels conforming to the active NDA agreements. The presented interface specifications include a mix of batched band, sparse iterative, and sparse direct solvers with their accompanying functionality that is already required by the application codes or we anticipated to be needed in the near future. This report summarizes progress in Kokkos Kernels and the xSDK libraries MAGMA, Ginkgo, hypre, PETSc, and SuperLU.

97 MATHEMATICS AND COMPUTING↗

A theoretical and experimental evaluation of the microangiographic fluoroscope: A high-resolution region-of-interest x-ray imager

Purpose: The increasing need for better image quality and high spatial resolution for successful endovascular image-guided interventions (EIGIs) and the inherent limitations of the state-of-the-art detectors provide motivation to develop a detector system tailored to the specific, demanding requirements of neurointerventional applications.Method: A microangiographic fluoroscope (MAF) was developed to serve as a high-resolution, region-of-interest (ROI) x-ray imaging detector in conjunction with large lower-resolution full field-of-view (FOV) state-of-the-art x-ray detectors. The newly developed MAF is an indirect x-ray imaging detector capable of providing real-time images (30 frames per second) with high-resolution, high sensitivity, no lag and low instrumentation noise. It consists of a CCD camera coupled to a Gen 2 dual-stage microchannel plate light image intensifier (LII) through a fiber-optic taper. A 300 {mu}m thick CsI(Tl) phosphor serving as the front end is coupled to the LII. The LII is the key component of the MAF and the large variable gain provided by it enables the MAF to operate as a quantum-noise-limited detector for both fluoroscopy and angiography. Results: The linear cascade model was used to predict the theoretical performance of the MAF, and the theoretical prediction showed close agreement with experimental findings. Linear system metrics such as MTF and DQE were used to gauge the detector performance up to 10 cycles/mm. The measured zero frequency DQE(0) was 0.55 for an RQA5 spectrum. A total of 21 stages were identified for the whole imaging chain and each stage was characterized individually. Conclusions: The linear cascade model analysis provides insight into the imaging chain and may be useful for further development of the MAF detector. The preclinical testing of the prototype detector in animal procedures is showing encouraging results and points to the potential for significant impact on EIGIs when used in conjunction with a state-of-art flat panel detector (FPD).

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗