Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear algebra”

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,225 records · Page 68

Research on unsteady transonic flow theory

A two-dimensional theory is considered for the unsteady flow disturbances caused by aeroelastic deformations of a thick wing at high subsonic freestream Mach numbers, having a single, internally embedded supercritical (locally supersonic) steady flow region adjacent to the low pressure side of the wing. The theory develops a matrix of unsteady aerodynamic influence coefficients (AICs) suitable as a strip theory for aeroelastic analysis of large aspect ratio thick wings of moderate sweep, typical of a wide class of current and future aircraft. The theory derives the linearized unsteady flow solutions separately for both the subcritical and supercritical regions. These solutions are coupled together to give the requisite (wing pressure-downwash) AICs by the intermediate step of defining flow disturbances on the sonic line, and at the shock wave; these intermediate quantities are then algebraically eliminated by expressing them in terms of the wing surface downwash.

Revell, J. D.↗

Adaptive Algebraic Smoothers

methods based on Local Sensitivity Analysis (LSA). The method can be used in the context of geometric and algebraic multigrid methods for constructing smoothers, and in the context of Krylov methods for constructing block preconditioners. It is suitable for both constant and variable coecient problems. Furthermore, the method can be applied to systems arising from both scalar and coupled system partial differential equations (PDEs), as well as linear systems that do not arise from PDEs. The simplicity of the method will allow it to be easily incorporated into existing multigrid and Krylov solvers while providing a powerful tool for adaptively constructing methods tuned to a problem.

99 GENERAL AND MISCELLANEOUS↗

HEMS: Home Energy Management System [SWR-15-12] - Stochastic Optimal Scheduling of Residential Appliances with Renewable Energy Sources

The HEMS algorithm schedules residential appliance operation to minimize the weighted sum of occupant discomfort, total energy cost, peak electricity consumption and carbon footprint, weighted according to occupant preferences. A centralized mixed integer linear programming (MILP) based optimization approach is taken, with the HEMS managing all appliances directly, following a Model Predictive Control (MPC) methodology which determines the optimal schedule over the user-specified scheduling horizon and repeats the optimization at configurable time intervals. The HEMS is developed on the General Algebraic Modeling System (GAMS) using the MILP solver. This system is able to effectively deal with the stochasticity in the distributed system by utilizing Monte Carlo simulation where uncertainties in future electricity price, outdoor temperature, water usage, solar and wind generation can be accounted for. The HEMS controls the operation of the heating, ventilation and air conditioning (HVAC) system, water heater, refrigerator, residential batteries, electric vehicles, standalone micro combined heat and power (CHP) generator, dishwasher, washer/dryer, pool pumps, and lighting.

Pratt, Annabelle↗

A second order iteration procedure for correlation of analysis frequencies with test data

A second derivative frequency modification procedure is developed to iteratively change analysis modeling parameters for the more rapid convergence of analytically determined frequencies to those obtained by structural dynamic testing. A nonlinear system of algebraic equations in the modeling parameters is derived and a rapidly converging iterative method for their solution is presented. Numerical results obtained show that the higher order formulation and nonlinear predictor-corrector solution procedure yields results which are more rapidly convergent than those obtained using only the usual linear first-order parameter modification procedure. The proposed higher order theory also connverges in some cases when the ordinary linear theory does not.

Ojalvo, I. U.↗

Implicity restarted Arnoldi/Lanczos methods for large scale eigenvalue calculations

Eigenvalues and eigenfunctions of linear operators are important to many areas of applied mathematics. The ability to approximate these quantities numerically is becoming increasingly important in a wide variety of applications. This increasing demand has fueled interest in the development of new methods and software for the numerical solution of large-scale algebraic eigenvalue problems. In turn, the existence of these new methods and software, along with the dramatically increased computational capabilities now available, has enabled the solution of problems that would not even have been posed five or ten years ago. Until very recently, software for large-scale nonsymmetric problems was virtually non-existent. Fortunately, the situation is improving rapidly. The purpose of this article is to provide an overview of the numerical solution of large-scale algebraic eigenvalue problems. The focus will be on a class of methods called Krylov subspace projection methods. The well-known Lanczos method is the premier member of this class. The Arnoldi method generalizes the Lanczos method to the nonsymmetric case. A recently developed variant of the Arnoldi/Lanczos scheme called the Implicitly Restarted Arnoldi Method is presented here in some depth. This method is highlighted because of its suitability as a basis for software development.

Sorensen, Danny C.↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Coupling flux balance analysis with reactive transport modeling through machine learning for rapid and stable simulation of microbial metabolic switching

Integrating genome-scale metabolic networks with reactive transport models (RTMs) provides a detailed description of the dynamic changes in microbial growth and metabolism. Despite promising demonstrations in the past, computational inefficiency has been pointed out as a critical issue to overcome because it requires repeated application of linear programming (LP) to obtain flux balance analysis (FBA) solutions in every time step and spatial grid. To address this challenge, we propose a new simulation method where we train and validate artificial neural networks (ANNs) using randomly sampled FBA solutions and incorporate the resulting surrogate FBA model (represented as algebraic equations) into RTMs as source/sink terms. We demonstrate the efficiency of our method via a case study of Shewanella oneidensis MR-1. During aerobic growth on lactate, S. oneidensis produces metabolic byproducts (such as pyruvate and acetate), which are subsequently consumed as alternative carbon sources when the preferred nutrients are depleted. To effectively simulate these complex dynamics, we used a cybernetic approach that models metabolic switches as the outcome of dynamic competition among multiple growth options. In both zero-dimensional batch and one-dimensional column configurations, the ANN-based surrogate models achieved substantial reduction of computational time by several orders of magnitude compared to the original LP-based FBA models. Moreover, the ANN models produced robust solutions without any special measures to prevent numerical instability. These developments significantly promote our ability to utilize genome-scale networks in complex, multi-physics, and multi-dimensional ecosystem modeling.

59 BASIC BIOLOGICAL SCIENCES↗

General integrable n-level, many-mode Janes-Cummings-Dicke models and classical r-matrices with spectral parameters

Using the technique of classical r-matrices and quantum Lax operators, we construct the most general form of the quantum integrable “n-level, many-mode” spin-boson Jaynes-Cummings-Dicke-type hamiltonians describing an interaction of a molecule of N n-level atoms with many modes of electromagnetic field and containing, in general, additional non-linear interaction terms. We explicitly obtain the corresponding quantum Lax operators and spin-boson analogs of the generalized Gaudin hamiltonians and prove their quantum commutativity. We investigate symmetries of the obtained models that are associated with the geometric symmetries of the classical r-matrices and construct the corresponding algebra of quantum integrals. We consider in detail three classes of non-skew-symmetric classical r-matrices with spectral parameters and explicitly obtain the corresponding quantum Lax operators and Jaynes-Cummings-Dicke-type hamiltonians depending on the considered r-matrix.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Covariance and the hierarchy of frame bundles

This is an essay on the general concept of covariance, and its connection with the structure of the nested set of higher frame bundles over a differentiable manifold. Examples of covariant geometric objects include not only linear tensor fields, densities and forms, but affinity fields, sectors and sector forms, higher order frame fields, etc., often having nonlinear transformation rules and Lie derivatives. The intrinsic, or invariant, sets of forms that arise on frame bundles satisfy the graded Cartan-Maurer structure equations of an infinite Lie algebra. Reduction of these gives invariant structure equations for Lie pseudogroups, and for G-structures of various orders. Some new results are introduced for prolongation of structure equations, and for treatment of Riemannian geometry with higher-order moving frames. The use of invariant form equations for nonlinear field physics is implicitly advocated.

Estabrook, Frank B.↗

On a class of unsteady three-dimensional Navier Stokes solutions relevant to rotating disc flows: Threshold amplitudes and finite time singularities

A class of exact steady and unsteady solutions of the Navier Stokes equations in cylindrical polar coordinates is given. The flows correspond to the motion induced by an infinite disc rotating with constant angular velocity about the z-axis in a fluid occupying a semi-infinite region which, at large distances from the disc, has velocity field proportional to (x,-y,O) with respect to a Cartesian coordinate system. It is shown that when the rate of rotation is large, Karman's exact solution for a disc rotating in an otherwise motionless fluid is recovered. In the limit of zero rotation rate a particular form of Howarth's exact solution for three-dimensional stagnation point flow is obtained. The unsteady form of the partial differential system describing this class of flow may be generalized to time-periodic equilibrium flows. In addition the unsteady equations are shown to describe a strongly nonlinear instability of Karman's rotating disc flow. It is shown that sufficiently large perturbations lead to a finite time breakdown of that flow whilst smaller disturbances decay to zero. If the stagnation point flow at infinity is sufficiently strong, the steady basic states become linearly unstable. In fact there is then a continuous spectrum of unstable eigenvalues of the stability equations but, if the initial value problem is considered, it is found that, at large values of time, the continuous spectrum leads to a velocity field growing exponentially in time with an amplitude decaying algebraically in time.

Hall, Philip↗

Applying Quantum Computing to Simulate Power System Dynamics

Power system dynamics are generally modeled by high dimensional nonlinear differential-algebraic equations due to a large number of generators, loads, and transmission lines. Thus, its computational complexity grows exponentially with the system size. This paper demonstrates the potential use of quantum computing algorithms to model the power system dynamics. Leveraging a symbolic programming framework, we equivalently convert the power system dynamics’ differential algebraic equations (DAEs) into ordinary differential equations (ODEs), where the data of the state vector can be encoded into quantum computers via amplitude encoding. The system's nonlinearity is captured by Taylor polynomial expansion, the quantum state tensor, and Hamiltonian simulation, whereas state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can simulate the dynamics of the power system with high accuracy, whereas its complexity is polynomial in the logarithm of the system dimension. Our work also illustrates the use of scientific machine learning tools for implementing scientific computing concepts, e.g., Taylor expansion, DAEs/ODEs transform, and quantum computing solver, in the field of power engineering.

Tran, Huynh↗

Balanced truncation-rational Krylov methods for model reduction in large scale dynamical systems

In this paper, we consider the balanced truncation method for model reductions in large-scale linear and time-independent dynamical systems with multi-inputs and multi-outputs. The method is based on the solutions of two large coupled Lyapunov matrix equations when the system is stable or on the computation of stabilizing positive and semi-definite solutions of some continuous-time algebraic Riccati equations when the dynamical system is not stable. Using the rational block Arnoldi, we show how to compute approximate solutions to these large Lyapunov or algebraic Riccati equations. The obtained approximate solutions are given in a factored form and used to build the reduced order model. We give some theoretical results and present numerical examples with some benchmark models.

97 MATHEMATICS AND COMPUTING↗

A multigrid waveform relaxation method for solving the poroelasticity equations

In this work, a multigrid waveform relaxation method is proposed for solving a collocated finite difference discretization of the linear Biot’s model. This gives rise to the first space–time multigrid solver for poroelasticity equations in the literature. The waveform relaxation iteration is based on a point-wise Vanka smoother that couples the pressure variable at a grid-point with the displacements around it. A semi-algebraic mode analysis is proposed to theoretically analyze the convergence of the multigrid waveform relaxation algorithm. This analysis is novel since it combines the semi-algebraic analysis, suitable for parabolic problems, with the non-standard analysis for overlapping smoothers. The practical utility of the method is illustrated through several numerical experiments in one and two dimensions.

97 MATHEMATICS AND COMPUTING↗

Extending quantum operations

For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on quantum states are trace-preserving completely positive maps, but we also consider variants of these requirements. We generalize the definition of complete positivity to linear maps defined on arbitrary subspaces, then formulate this notion as a semidefinite program, and relate it by duality to approximative extensions of this map. This gives a characterization of the maps which can be approximated arbitrarily well as the restriction of a map that is completely positive on the whole algebra, also yielding the familiar extension theorems on operator spaces. For quantum channel extensions and extensions by probabilistic operations we obtain semidefinite characterizations, and we also elucidate the special case of Abelian inputs or outputs. Finally, revisiting a theorem by Alberti and Uhlmann, we provide simpler and more widely applicable conditions for certain extension problems on qubits, and by using a semidefinite programming formulation we exhibit counterexamples to seemingly reasonable but false generalizations of the Alberti-Uhlmann theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Polyad quantum numbers and multiple resonances in anharmonic vibrational studies of polyatomic molecules

In the theory of anharmonic vibrations of a polyatomic molecule, mixing the zero-order vibrational states due to cubic, quartic and higher-order terms in the potential energy expansion leads to the appearance of more-or-less isolated blocks of states (also called polyads), connected through multiple resonances. Such polyads of states can be characterized by a common secondary integer quantum number. This polyad quantum number is defined as a linear combination of the zero-order vibrational quantum numbers, attributed to normal modes, multiplied by non-negative integer polyad coefficients, which are subject to definition for any particular molecule. According to Kellman's method [J. Chem. Phys. 93, 6630 (1990)], the corresponding formalism can be conveniently described using vector algebra. In the present work, a systematic consideration of polyad quantum numbers is given in the framework of the canonical Van Vleck perturbation theory (CVPT) and its numerical-analytic operator implementation for reducing the Hamiltonian to the quasi-diagonal form, earlier developed by the authors. It is shown that CVPT provides a convenient method for the systematic identification of essential resonances and the definition of a polyad quantum number. The method presented is generally suitable for molecules of significant size and complexity, as illustrated by several examples of molecules up to six atoms. The polyad quantum number technique is very useful for assembling comprehensive basis sets for the matrix representation of the Hamiltonian after removal of all non-resonance terms by CVPT. In addition, the classification of anharmonic energy levels according to their polyad quantum numbers provides an additional means for the interpretation of observed vibrational spectra.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Unfolded equations for current interactions of 4d massless fields as a free system in mixed dimensions

Interactions of massless fields of all spins in four dimensions with currents of any spin are shown to result from a solution of the linear problem that describes a gluing between a rank-one (massless) system and a rank-two (current) system in the unfolded dynamics approach. Since the rank-two system is dual to a free rank-one higher-dimensional system that effectively describes conformal fields in six space-time dimensions, the constructed system can be interpreted as describing a mixture between linear conformal fields in four and six dimensions. An interpretation of the obtained results in the spirit of the AdS/CFT correspondence is discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A supernodal all-pairs shortest path algorithm

We show how to exploit graph sparsity in the Floyd-Warshall algorithm for the all-pairs shortest path (Apsp) problem. Floyd-Warshall is an attractive choice for Apsp on high-performing systems due to its structural similarity to solving dense linear systems and matrix multiplication. However, if sparsity of the input graph is not properly exploited, Floyd-Warshall will perform unnecessary asymptotic work and thus may not be a suitable choice for many input graphs. To overcome this limitation, the key idea in our approach is to use the known algebraic relationship between Floyd-Warshall and Gaussian elimination, and import several algorithmic techniques from sparse Cholesky factorization, namely, fill-in reducing ordering, symbolic analysis, supernodal traversal, and elimination tree parallelism. When combined, these techniques reduce computation, improve locality and enhance parallelism. We implement these ideas in an efficient shared memory parallel prototype that is orders of magnitude faster than an efficient multi-threaded baseline Floyd-Warshall that does not exploit sparsity. Our experiments suggest that the Floyd-Warshall algorithm can compete with Dijkstra's algorithm (the algorithmic core of Johnson's algorithm) for several classes sparse graphs.

Sao, Piyush↗