Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “System of Linear Equations”

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 91 records · Page 5

Tensor-GMRES method for large sparse systems of nonlinear equations

This paper introduces a tensor-Krylov method, the tensor-GMRES method, for large sparse systems of nonlinear equations. This method is a coupling of tensor model formation and solution techniques for nonlinear equations with Krylov subspace projection techniques for unsymmetric systems of linear equations. Traditional tensor methods for nonlinear equations are based on a quadratic model of the nonlinear function, a standard linear model augmented by a simple second order term. These methods are shown to be significantly more efficient than standard methods both on nonsingular problems and on problems where the Jacobian matrix at the solution is singular. A major disadvantage of the traditional tensor methods is that the solution of the tensor model requires the factorization of the Jacobian matrix, which may not be suitable for problems where the Jacobian matrix is large and has a 'bad' sparsity structure for an efficient factorization. We overcome this difficulty by forming and solving the tensor model using an extension of a Newton-GMRES scheme. Like traditional tensor methods, we show that the new tensor method has significant computational advantages over the analogous Newton counterpart. Consistent with Krylov subspace based methods, the new tensor method does not depend on the factorization of the Jacobian matrix. As a matter of fact, the Jacobian matrix is never needed explicitly.

Feng, Dan↗

Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow

Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. Here, we investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Preconditioned conjugate gradient methods for the Navier-Stokes equations

A preconditioned Krylov subspace method (GMRES) is used to solve the linear systems of equations formed at each time-integration step of the unsteady, two-dimensional, compressible Navier-Stokes equations of fluid flow. The Navier-Stokes equations are cast in an implicit, upwind finite-volume, flux-split formulation. Several preconditioning techniques are investigated to enhance the efficiency and convergence rate of the implicit solver based on the GMRES algorithm. The superiority of the new solver is established by comparisons with a conventional implicit solver, namely line Gauss-Seidel relaxation (LGSR). Computational test results for low-speed (incompressible flow over a backward-facing step at Mach 0.1), transonic flow (trailing edge flow in a transonic turbine cascade), and hypersonic flow (shock-on-shock interactions on a cylindrical leading edge at Mach 6.0) are presented. For the Mach 0.1 case, overall speedup factors of up to 17 (in terms of time-steps) and 15 (in terms of CPU time on a CRAY-YMP/8) are found in favor of the preconditioned GMRES solver, when compared with the LGSR solver. The corresponding speedup factors for the transonic flow case are 17 and 23, respectively. The hypersonic flow case shows slightly lower speedup factors of 9 and 13, respectively. The study of preconditioners conducted in this research reveals that a new LUSGS-type preconditioner is much more efficient than a conventional incomplete LU-type preconditioner.

Ajmani, Kumud↗

Aeroelastic stability of complete rotors with application to a teetering rotor in forward flight

The derivation of a set of nonlinear coupled flap-lag-torsion equations of motion for moderately large deflections of an elastic, two bladed teetering helicopter rotor in forward flight is concisely outlined. The following degrees of freedom are included in the mathematical model: rigid body flapping, rigid body lead lag, elastic bending in flap and lead-lag blade root torsion and shaft torsion. Quasi-steady aerodynamic loads are considered and the effects of reversed flow are included. The aeroelastic stability of the complete rotor is investigated using a linearized system of equations of motion. The equilibrium position about which the equations are linearized is obtained by considering the trim state of the helicopter, in true or simulated forward flight conditions. The sensitivity of the aeroelastic stability boundaries to interblade structural and mechanical coupling is illustrated by comparing the complete rotor stability boundaries with those obtained from a single blade analysis for a number of hover and forward flight cases.

Shamie, J.↗

Aeroelastic stability of complete rotors with application to a teetering rotor in forward flight

The derivation of a set of non-linear coupled flap-lag-torsion equations of motion for moderately large deflections of an elastic, two-bladed teetering helicopter rotor in forward flight is concisely outlined. The following degrees of freedom are included in the mathematical model: rigid body flapping, rigid body lead-lag, elastic bending in flap and lead-lag, blade root torsion, and shaft torsion. Quasi-steady aerodynamic loads are considered and the effects of reversed flow are included. The aeroelastic stability of the complete rotor is investigated by using a linearized system of equations of motion. The equilibrium position about which the equations are linearized is obtained by considering the trim state of the helicopter, in true or simulated forward flight conditions. The sensitivity of the aeroelastic stability boundaries to interblade structural and mechanical coupling is illustrated by comparing the complete rotor stability boundaries with those obtained from a single blade analysis for a number of hover and forward flight cases.

Shamie, J.↗

Parallel tridiagonal equation solvers

Three parallel algorithms were compared for the direct solution of tridiagonal linear systems of equations. The algorithms are suitable for computers such as ILLIAC 4 and CDC STAR. For array computers similar to ILLIAC 4, cyclic odd-even reduction has the least operation count for highly structured sets of equations, and recursive doubling has the least count for relatively unstructured sets of equations. Since the difference in operation counts for these two algorithms is not substantial, their relative running times may be more related to overhead operations, which are not measured in this paper. The third algorithm, based on Buneman's Poisson solver, has more arithmetic operations than the others, and appears to be the least favorable. For pipeline computers similar to CDC STAR, cyclic odd-even reduction appears to be the most preferable algorithm for all cases.

Stone, H. S.↗

An interpretation and solution of ill-conditioned linear equations

Data insufficiency, poorly conditioned matrices and singularities in equations occur regularly in complex optimization, correlation, and interdisciplinary model studies. This work concerns itself with two methods of obtaining certain physically realistic solutions to ill-conditioned or singular algebraic systems of linear equations arising from such studies. Two efficient computational solution procedures that generally lead to locally unique solutions are presented when there is insufficient data to completely define the model, or a least-squares error formulation of this system results in an ill-conditioned system of equations. If it is assumed that a reasonable estimate of the uncertain data is available in both cases cited above, then we shall show how to obtain realistic solutions efficiently, in spite of the insufficiency of independent data. The proposed methods of solution are more efficient than singular-value decomposition for dealing with such systems, since they do not require solutions for all the non-zero eigenvalues of the coefficient matrix.

Ojalvo, I. U.↗

On a fourth order accurate implicit finite difference scheme for hyperbolic conservation laws. II - Five-point schemes

This paper presents a family of two-level five-point implicit schemes for the solution of one-dimensional systems of hyperbolic conservation laws, which generalized the Crank-Nicholson scheme to fourth order accuracy (4-4) in both time and space. These 4-4 schemes are nondissipative and unconditionally stable. Special attention is given to the system of linear equations associated with these 4-4 implicit schemes. The regularity of this system is analyzed and efficiency of solution-algorithms is examined. A two-datum representation of these 4-4 implicit schemes brings about a compactification of the stencil to three mesh points at each time-level. This compact two-datum representation is particularly useful in deriving boundary treatments. Numerical results are presented to illustrate some properties of the proposed scheme.

Harten, A.↗

A Curved, Elastostatic Boundary Element for Plane Anisotropic Structures

The plane-stress equations of linear elasticity are used in conjunction with those of the boundary element method to develop a novel curved, quadratic boundary element applicable to structures composed of anisotropic materials in a state of plane stress or plane strain. The curved boundary element is developed to solve two-dimensional, elastostatic problems of arbitrary shape, connectivity, and material type. As a result of the anisotropy, complex variables are employed in the fundamental solution derivations for a concentrated unit-magnitude force in an infinite elastic anisotropic medium. Once known, the fundamental solutions are evaluated numerically by using the known displacement and traction boundary values in an integral formulation with Gaussian quadrature. All the integral equations of the boundary element method are evaluated using one of two methods: either regular Gaussian quadrature or a combination of regular and logarithmic Gaussian quadrature. The regular Gaussian quadrature is used to evaluate most of the integrals along the boundary, and the combined scheme is employed for integrals that are singular. Individual element contributions are assembled into the global matrices of the standard boundary element method, manipulated to form a system of linear equations, and the resulting system is solved. The interior displacements and stresses are found through a separate set of auxiliary equations that are derived using an Airy-type stress function in terms of complex variables. The capabilities and accuracy of this method are demonstrated for a laminated-composite plate with a central, elliptical cutout that is subjected to uniform tension along one of the straight edges of the plate. Comparison of the boundary element results for this problem with corresponding results from an analytical model show a difference of less than 1%.

Smeltzer, Stanley S.↗

Parallel, iterative solution of sparse linear systems - Models and architectures

Solving large, sparse, linear systems of equations is a fundamental problem in large scale scientific and engineering computation. A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. A data transfer model predicting both the probability that data must be transferred between two tasks and the amount of data to be transferred is presented. This model is used to derive an execution time model for predicting parallel execution time and an optimal number of tasks given the dimension and sparsity of the coefficient matrix and the costs of computation, synchronization, and communication. The suitability of different parallel architectures for solving randomly sparse linear systems is discussed. Based on the complexity of task scheduling, one parallel architecture, based on a broadcast bus, is presented and analyzed.

Reed, D. A.↗

Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems

Systems of linear equations with Toeplitz coefficient matrices arise in many important applications. The classical Levinson algorithm computes solutions of Toeplitz systems with only O(n(sub 2)) arithmetic operations, as compared to O(n(sub 3)) operations that are needed for solving general linear systems. However, the Levinson algorithm in its original form requires that all leading principal submatrices are nonsingular. An extension of the Levinson algorithm to general Toeplitz systems is presented. The algorithm uses look-ahead to skip over exactly singular, as well as ill-conditioned leading submatrices, and, at the same time, it still fully exploits the Toeplitz structure. In our derivation of this algorithm, we make use of the intimate connection of Toeplitz matrices with formally biorthogonal polynomials.

Freund, Roland W.↗

The effect of adhesive layer on crack propagation in laminates

The effect of the adhesive layer on crack propagation in composite materials is investigated. The composite medium consists of parallel load carrying laminates and buffer strips arranged periodically and bonded with thin adhesive layers. The strips, assumed to be isotropic and linearly elastic, contain symmetric cracks of arbitrary lengths located normal to the interfaces. Two problems are considered: (1) thin adhesive layers are approximated by uncoupled tension and shear springs distributed along the interfaces of the strips for which only the case of internal cracks can be treated rigorously; (2) broken laminates and the true singular behavior in the presence of the adhesive layer are studied. The adhesive is then treated as an isotropic, linearly elastic continuum. General expressions for field quantities are obtained in terms of infinite Fourier integrals. These expressions give a system of singular integral equations in terms of the crack surface displacement derivatives. By using appropriate quadrature formulas, the integral equations reduce to a system of linear algebraic equations which are solved numerically.

Gecit, M. R.↗

Finite difference procedure for boundary layers including effects of longitudinal and transverse curvatures

A second order viscous layer solution procedure has been developed that does in a consistent way include curvature effects and the corresponding normal pressure gradients. In the present system, the normal momentum equation is retained. The parabolic system of nonlinear partial differential equations is converted by linear finite differencing procedures to a system of linear algebraic equations and solved in primitive coordinates. The solutions have been shown to give smooth stable distributions for all the variables, most particularly the normal velocity which plays an important role in the interaction procedure. An algorithm for matching the viscous layer solution with a rotational characteristics outer solution has been developed.

Tassa, Y.↗

Interpolation using surface splines.

A surface spline is a mathematical tool for interpolating a function of two variables. It is based upon the small deflection equation of an infinite plate. The surface spline depends upon the solution of a system of linear equations, and thus, will ordinarily require the use of a digital computer. The closed form solution involves no functions more complicated than logarithms, and is easily coded. Several modifications which can be incorporated are discussed.

Harder, R. L.↗

Practical Scalability of LuGo: Benchmarking the HHL Algorithm Using an Enhanced QPE Algorithm

The HHL algorithm is a prominent quantum algorithm that offers exponential speedup over its classical counterparts for solving a system of linear equations. However, synthesizing and executing HHL circuits demand significant computational resources from both classical and quantum systems. In this paper, we benchmark the HHL algorithm using the optimized Quantum Phase Estimation (QPE) generation algorithm, LuGo \cite{lu2025lugo}, to enhance its scalability and efficiency. We leverage the National Energy Research Scientific Computing Center's (NERSC) Perlmutter supercomputer to evaluate the scalability of generating HHL circuits and to measure the time to simulate the generated circuits. Additionally, we provide a comprehensive analysis of the algorithm's performance on various state-of-the-art superconducting and trapped-ion quantum devices, including studies on qubit connectivity, fidelity comparisons, and hardware compatibility and robustness. Our results offer preliminary insights into potential practical applications of the HHL algorithm enabled by LuGo and the performance of various types of quantum hardware.

Lu, Chao [ORNL] (ORCID:0000000179346933)↗

Parallel solution of pentadiagonal systems using generalized odd-even elimination

A method for the solution of pentadiagonal systems of linear equations is presented. The method is a generalization of ordinary odd-even elimination used for tridiagonal systems. Using n processors, an n x n pentadiagonal system can be solved using the new method (generalized odd-even elimination) in time proportional to log(2) n.

Levit, Creon↗

A method for exponential propagation of large systems of stiff nonlinear differential equations

A new time integrator for large, stiff systems of linear and nonlinear coupled differential equations is described. For linear systems, the method consists of forming a small (5-15-term) Krylov space using the Jacobian of the system and carrying out exact exponential propagation within this space. Nonlinear corrections are incorporated via a convolution integral formalism; the integral is evaluated via approximate Krylov methods as well. Gains in efficiency ranging from factors of 2 to 30 are demonstrated for several test problems as compared to a forward Euler scheme and to the integration package LSODE.

Friesner, Richard A.↗