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 595 records · Page 33
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Nutritional models for a Controlled Ecological Life Support System (CELSS): Linear mathematical modeling

The NASA Controlled Ecological Life Support System (CELSS) Program is involved in developing a biogenerative life support system that will supply food, air, and water to space crews on long-duration missions. An important part of this effort is in development of the knowledge and technological capability of producing and processing foods to provide optimal diets for space crews. This involves such interrelated factors as determination of the diet, based on knowledge of nutrient needs of humans and adjustments in those needs that may be required as a result of the conditions of long-duration space flight; determination of the optimal mixture of crops required to provide nutrients at levels that are sufficient but not excessive or toxic; and consideration of the critical issues of spacecraft space and power limitations, which impose a phytomass minimization requirement. The complex interactions among these factors are examined with the goal of supplying a diet that will satisfy human needs while minimizing the total phytomass requirement. The approach taken was to collect plant nutritional composition and phytomass production data, identify human nutritional needs and estimate the adjustments to the nutrient requirements likely to result from space flight, and then to generate mathematical models from these data.

Wade, Rose C.↗
NASA NTRS1986

Output time response approximation

The approximation of the output response of a nonlinear system by the output response of a linear system to a desired order irrespective of the admissible input applied should prove useful for purposes of control generation and simulation. Given a nonlinear system, an integer k, and an open subset of state space, sufficient conditions are stated that such a linear approximation exists to order k for every point in the set. In addition, a method for finding the approximating linear systems is presented.

Hunt, L. R.↗
NASA NTRS1972

Distribution of error in least-squares solution of an overdetermined system of linear simultaneous equations

Probability density functions were derived for errors in the evaluation of unknowns by the least squares method in system of nonhomogeneous linear equations. Coefficients of the unknowns were assumed correct and computational precision were also assumed. A vector space was used, with number of dimensions equal to the number of equations. An error vector was defined and assumed to have uniform distribution of orientation throughout the vector space. The density functions are shown to be insensitive to the biasing effects of the source of the system of equations.

Miller, C. D.↗
NASA NTRS1976

Some existence and sufficient conditions of optimality

The role of the existence and sufficiency conditions in the field of optimal control was briefly described. The existence theorems are discussed for general nonlinear systems. However, the sufficiency conditions pertain to "nearly" linear systems with integral convex costs. Moreover, a brief discussion of linear systems with multiple-cost functions is presented.

Assefi, T.↗
DOE OSTI2011

Novel Approach to Linear Accelerator Superconducting Magnet System

Superconducting Linear Accelerators include a superconducting magnet system for particle beam transportation that provides the beam focusing and steering. This system consists of a large number of quadrupole magnets and dipole correctors mounted inside or between cryomodules with SCRF cavities. Each magnet has current leads and powered from its own power supply. The paper proposes a novel approach to magnet powering based on using superconducting persistent current switches. A group of magnets is powered from the same power supply through the common, for the group of cryomodules, electrical bus and pair of current leads. Superconducting switches direct the current to the chosen magnet and close the circuit providing the magnet operation in a persistent current mode. Two persistent current switches were fabricated and tested. In the paper also presented the results of magnetic field simulations, decay time constants analysis, and a way of improving quadrupole magnetic center stability. Such approach substantially reduces the magnet system cost and increases the reliability.

43 PARTICLE ACCELERATORS↗
NASA NTRS1990

Computer-aided-analysis of linear control system robustness

Stochastic robustness is a simple technique used to estimate the stability and performance robustness of linear, time-invariant systems. The use of high-speed graphics workstations and control system design software in stochastic robustness analysis is discussed and demonstrated. It is shown that stochastic robustness makes good use of modern computational and graphic tools, and it is easily implemented using commercial control system design and analysis software.

Stengel, Robert F.↗
DOE OSTI2018

Algebraic multigrid preconditioners for two-phase flow in porous media with phase transitions [Algebraic multigrid preconditioners for multiphase flow in porous media with phase transitions]

Multiphase flow is a critical process in a wide range of applications, including oil and gas recovery, carbon sequestration, and contaminant remediation. Numerical simulation of multiphase flow requires solving of a large, sparse linear system resulting from the discretization of the partial differential equations modeling the flow. In the case of multiphase multicomponent flow with miscible effect, this is a very challenging task. The problem becomes even more difficult if phase transitions are taken into account. A new approach to handle phase transitions is to formulate the system as a nonlinear complementarity problem (NCP). Unlike in the primary variable switching technique, the set of primary variables in this approach is fixed even when there is phase transition. Not only does this improve the robustness of the nonlinear solver, it opens up the possibility to use multigrid methods to solve the resulting linear system. The disadvantage of the complementarity approach, however, is that when a phase disappears, the linear system has the structure of a saddle point problem and becomes indefinite, and current algebraic multigrid (AMG) algorithms cannot be applied directly. In this study, we explore the effectiveness of a new multilevel strategy, based on the multigrid reduction technique, to deal with problems of this type. We demonstrate the effectiveness of the method through numerical results for the case of two-phase, two-component flow with phase appearance/disappearance. In conclusion, we also show that the strategy is efficient and scales optimally with problem size.

02 PETROLEUM↗
DOE OSTI2024

A structure-preserving machine learning framework for accurate prediction of structural dynamics for systems with isolated nonlinearities

The nonlinearities present in structural systems are often found in isolated regions within the structure, such as those containing joints or interfaces. However, despite the localized nature of these nonlinearities their presence serves to couple together the modes of the underlying linear system and significantly complicate the development of appropriate reduced-order models; the localized nonlinearities have a global effect on the dynamics of the system. Further, in the presence of evolving structural health the nonlinearities can arise from accumulating damage, with dynamics distinct from those observed in the healthy state. The present work develops a data-driven formulation to identify and include the contributions of the isolated nonlinearities on the dynamics of the underlying linear structure. A novel coordinate separation is developed that decomposes those nonlinearities restricted to the isolated subdomain from the known linear system defined over the entire domain, and the influence of the isolated nonlinearities is reintroduced as an appropriately identified traction at the boundary of the isolated subdomain, referred to as the deviatoric force. In the region exterior to the nonlinear subdomain the response of the ideal linear system recovers that of the original nonlinear system. In this work, the deviatoric force component is predicted using a structure-preserving multilayer perceptron, based only on measured responses at the boundary of the isolated subdomain. Therefore introduction of the perceptron is able to bypass the direct numerical simulation of the nonlinearities within the isolated subdomain. This approach is illustrated through a simple structural system in which an interior region contains cubic nonlinearities and hysteretic damping. Once trained, the machine learning system is able to accurately predict the deviatoric force so that the ideal system recovers the response of the original system in the region outside the isolated nonlinear subdomain. Moreover, the data-driven approach is able to accurately predict the response when the system is subject to differing initial conditions and external excitation without the need for retraining, so that the proposed approach provides a robust description of the structural dynamics of the overall system.

Machine learning↗
DOE OSTI2015

Discontinuous finite element solution of the radiation diffusion equation on arbitrary polygonal meshes and locally adapted quadrilateral grids

In this paper, we propose a piece-wise linear discontinuous (PWLD) finite element discretization of the diffusion equation for arbitrary polygonal meshes. It is based on the standard diffusion form and uses the symmetric interior penalty technique, which yields a symmetric positive definite linear system matrix. A preconditioned conjugate gradient algorithm is employed to solve the linear system. Piece-wise linear approximations also allow a straightforward implementation of local mesh adaptation by allowing unrefined cells to be interpreted as polygons with an increased number of vertices. Several test cases, taken from the literature on the discretization of the radiation diffusion equation, are presented: random, sinusoidal, Shestakov, and Z meshes are used. The last numerical example demonstrates the application of the PWLD discretization to adaptive mesh refinement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Parallel Algebraic Multigrid for Fusion and Higher-Order PDEs

Multigrid methods play a key role in large-scale scientific simulation because they are among the fastest and most scalable approaches for solving the underlying sparse linear systems of equations that arise from a wide array of Partial Differential Equation (PDE) discretizations. Algebraic multigrid (AMG) is a special type of multigrid method that depends only on the description of the linear system, giving it better portability and broader applicability than geometric multigrid, as it requires no explicit knowledge of the problem geometry. Even though these methods are widely used today, there are still applications where further development is needed. In this report, we focus on PDEs with higher-order terms (e.g., fourth order), concentrating on a PDE that arises in tokamak edge plasma simulations (a tokamak is a machine that confines a plasma using magnetic fields and is believed to be the leading plasma confinement concept for future fusion power plants). General multigrid relaxes a linear system on coarser grids and reverses this process with interpolation, but standard AMG methods struggle with the aforementioned higher-order PDEs. We investigate cyclic coarsening and interpolation heuristics, as well as new iterative approximation methods of refining the solution at each grid to improve the existing multigrid approach. To this end, we ensure that these techniques are transferable to a parallelized setting with LLNL’s supercomputers.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1975

Computation of output feedback gains for linear stochastic systems using the Zangnill-Powell Method

Because conventional optimal linear regulator theory results in a controller which requires the capability of measuring and/or estimating the entire state vector, it is of interest to consider procedures for computing controls which are restricted to be linear feedback functions of a lower dimensional output vector and which take into account the presence of measurement noise and process uncertainty. To this effect a stochastic linear model has been developed that accounts for process parameter and initial uncertainty, measurement noise, and a restricted number of measurable outputs. Optimization with respect to the corresponding output feedback gains was then performed for both finite and infinite time performance indices without gradient computation by using Zangwill's modification of a procedure originally proposed by Powell. Results using a seventh order process show the proposed procedures to be very effective.

Kaufman, H.↗
NASA NTRS1977

Computation of output feedback gains for linear stochastic systems using the Zangwill-Powell method

Because conventional optimal linear regulator theory results in a controller which requires the capability of measuring and/or estimating the entire state vector, it is of interest to consider procedures for computing controls which are restricted to be linear feedback functions of a lower dimensional output vector and which take into account the presence of measurement noise and process uncertainty. To this effect a stochastic linear model has been developed that accounts for process parameter and initial uncertainty, measurement noise, and a restricted number of measurable outputs. Optimization with respect to the corresponding output feedback gains was then performed for both finite and infinite time performance indices without gradient computation by using Zangwill's modification of a procedure originally proposed by Powell.

Kaufman, H.↗
NASA NTRS1990

Krylov subspace methods - Theory, algorithms, and applications

Projection methods based on Krylov subspaces for solving various types of scientific problems are reviewed. The main idea of this class of methods when applied to a linear system Ax = b, is to generate in some manner an approximate solution to the original problem from the so-called Krylov subspace span. Thus, the original problem of size N is approximated by one of dimension m, typically much smaller than N. Krylov subspace methods have been very successful in solving linear systems and eigenvalue problems and are now becoming popular for solving nonlinear equations. The main ideas in Krylov subspace methods are shown and their use in solving linear systems, eigenvalue problems, parabolic partial differential equations, Liapunov matrix equations, and nonlinear system of equations are discussed.

Sad, Youcef↗
DOE OSTI2023

Sparse Approximate Multifrontal Factorization with Composite Compression Methods

This article presents a fast and approximate multifrontal solver for large sparse linear systems. In a recent work by Liu et al., we showed the efficiency of a multifrontal solver leveraging the butterfly algorithm and its hierarchical matrix extension, HODBF (hierarchical off-diagonal butterfly) compression to compress large frontal matrices. The resulting multifrontal solver can attain quasi-linear computation and memory complexity when applied to sparse linear systems arising from spatial discretization of high-frequency wave equations. To further reduce the overall number of operations and especially the factorization memory usage to scale to larger problem sizes, in this article we develop a composite multifrontal solver that employs the HODBF format for large-sized fronts, a reduced-memory version of the nonhierarchical block low-rank format for medium-sized fronts, and a lossy compression format for small-sized fronts. This allows us to solve sparse linear systems of dimension up to 2.7 × larger than before and leads to a memory consumption that is reduced by 70% while ensuring the same execution time. The code is made publicly available in GitHub.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2012

Adaptive Algebraic Multigrid for Finite Element Elliptic Equations with Random Coefficients

This thesis presents a two-grid algorithm based on Smoothed Aggregation Spectral Element Agglomeration Algebraic Multigrid (SA-ρAMGe) combined with adaptation. The aim is to build an efficient solver for the linear systems arising from discretization of second-order elliptic partial differential equations (PDEs) with stochastic coefficients. Examples include PDEs that model subsurface flow with random permeability field. During a Markov Chain Monte Carlo (MCMC) simulation process, that draws PDE coefficient samples from a certain distribution, the PDE coefficients change, hence the resulting linear systems to be solved change. At every such step the system (discretized PDE) needs to be solved and the computed solution used to evaluate some functional(s) of interest that then determine if the coefficient sample is acceptable or not. The MCMC process is hence computationally intensive and requires the solvers used to be efficient and fast. This fact that at every step of MCMC the resulting linear system changes, makes an already existing solver built for the old problem perhaps not as efficient for the problem corresponding to the new sampled coefficient. This motivates the main goal of our study, namely, to adapt an already existing solver to handle the problem (with changed coefficient) with the objective to achieve this goal to be faster and more efficient than building a completely new solver from scratch. Our approach utilizes the local element matrices (for the problem with changed coefficients) to build local problems associated with constructed by the method agglomerated elements (a set of subdomains that cover the given computational domain). We solve a generalized eigenproblem for each set in a subspace spanned by the previous local coarse space (used for the old solver) and a vector, component of the error, that the old solver cannot handle. A portion of the spectrum of these local eigen-problems (corresponding to eigenvalues close to zero) form the coarse basis used to define the new two-level method of our interest. We illustrate the performance of this adaptive two-level procedure with a large set of numerical experiments that demonstrate its efficiency over building the solvers from scratch.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗