Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 217 records · Page 12

Computational mechanics analysis tools for parallel-vector supercomputers

Computational algorithms for structural analysis on parallel-vector supercomputers are reviewed. These parallel algorithms, developed by the authors, are for the assembly of structural equations, 'out-of-core' strategies for linear equation solution, massively distributed-memory equation solution, unsymmetric equation solution, general eigensolution, geometrically nonlinear finite element analysis, design sensitivity analysis for structural dynamics, optimization search analysis and domain decomposition. The source code for many of these algorithms is available.

Storaasli, Olaf O.↗

Computational mechanics analysis tools for parallel-vector supercomputers

Computational algorithms for structural analysis on parallel-vector supercomputers are reviewed. These parallel algorithms, developed by the authors, are for the assembly of structural equations, 'out-of-core' strategies for linear equation solution, massively distributed-memory equation solution, unsymmetric equation solution, general eigen-solution, geometrically nonlinear finite element analysis, design sensitivity analysis for structural dynamics, optimization algorithm and domain decomposition. The source code for many of these algorithms is available from NASA Langley.

Storaasli, O. O.↗

Multigrid and Krylov Subspace Methods for the Discrete Stokes Equations

Discretization of the Stokes equations produces a symmetric indefinite system of linear equations. For stable discretizations, a variety of numerical methods have been proposed that have rates of convergence independent of the mesh size used in the discretization. In this paper, we compare the performance of four such methods: variants of the Uzawa, preconditioned conjugate gradient, preconditioned conjugate residual, and multigrid methods, for solving several two-dimensional model problems. The results indicate that where it is applicable, multigrid with smoothing based on incomplete factorization is more efficient than the other methods, but typically by no more than a factor of two. The conjugate residual method has the advantage of being both independent of iteration parameters and widely applicable.

Elman, Howard C.↗

Recent Turbulence Model Advances Applied to Multielement Airfoil Computations

A one-equation linear turbulence model and a two-equation nonlinear explicit algebraic stress model (EASM) are applied to the flow over a multielement airfoil. The effect of the K-epsilon and K-omega forms of the two-equation model are explored, and the K-epsilon form is shown to be deficient in the wall-bounded regions of adverse pressure gradient flows. A new K-omega form of EASM is introduced. Nonlinear terms present in EASM are shown to improve predictions of turbulent shear stress behind the trailing edge of the main element and near midflap. Curvature corrections are applied to both the one- and two-equation turbulence models and yield only relatively small local differences in the flap region, where the flow field undergoes the greatest curvature. Predictions of maximum lift are essentially unaffected by the turbulence model variations studied.

Rumsey, Christopher L.↗

Sensitivity derivatives for three dimensional supersonic Euler code using incremental iterative strategy

In a recent work, an incremental strategy was proposed to iteratively solve the very large systems of linear equations that are required to obtain quasianalytical sensitivity derivatives from advanced computational fluid dynamics (CFD) codes. The technique was sucessfully demonstrated for two large two-dimensional problems: a subsonic and a transonic airfoil. The principal feature of this incremental iterative stategy is that it allows the use of the identical approximate coefficient matrix operator and algorithm to solve the nonlinear flow and the linear sensitivity equations; at convergence, the accuracy of the sensitivity derivatives is not compromised. This feature allows a comparatively straightforward extension of the methodology to three-dimensional problems; this extension is successfully demonstrated in the present study for a space-marching solution of the three-dimensional Euler equations over a Mach 2.4 blended wing-body configuration.

Korivi, Vamshi Mohan↗

An Evaluation of Linear Instability Waves as Sources of Sound in a Supersonic Turbulent Jet

Mach wave radiation from supersonic jets is revisited to better quantify the extent to which linearized equations represent the details of the actual mechanism. To this end, we solve the linearized Navier-Stokes equations (LNS) with precisely the same mean flow and inflow disturbances as a previous direct numerical simulation (DNS) of a perfectly expanded turbulent M = 1.92 jet. We restrict our attention to the first two azimuthal modes, n = 0 and n = 1, which constitute most of the acoustic field. The direction of peak radiation and the peak Strouhal number matches the DNS reasonably well, which is in accord with previous experimental justification of the linear theory. However, it is found that the sound pressure level predicted by LNS is significantly lower than that from DNS. In order to investigate the discrepancy, individual frequency components of the solution are examined. These confirm that near the peak Strouhal number, particularly for the first helical mode n = 1, the amplification of disturbances in the LNS closely matches the DNS. However, away from the peak frequency (and generally for the azimuthal mode n = 0), modes in the LNS are damped while those in the DNS grow at rates comparable to those at the peak Strouhal number.

Mohseni, Kamran↗

Analysis and design of steady transonic flow over airfoils by the method of parametric differentiation

The results reported here are based on applying the method of parametric differentiation (MPD) to transform the nonlinear differential equation governing small-disturbance transonic flow to a linear equation. Implicit approximate factorization and monotone methods were used to accelerate convergence of the linear problem by an order of magnitude over successive line over-relaxation. The relative merits of using MPD are discussed in comparison to conventional small-disturbance applications. Several MPD analyses are performed on an array of airfoils. A design procedure utilizing MPD is discussed and demonstrated for two nonlifting cases.

Halt, D. W.↗

Automatic flare transition penetrating wind shears

In this paper, the development of a digital three-dimensional automatic control law designated to achieve an optimal transition of a large commercial aircraft between the glideslope conditions and the desired final touchdown condition is presented. The linearized equations representing the perturbed motion of the aircraft from the nominal glideslope trajectory are presented. A method of incorporating the spatial, low-level wind shears into these perturbed equations of motion is indicated. It is shown that the system equations then assume the familiar form of the linear regulator problem, acted upon by a constant disturbance. A design procedure is presented to compute a digital, time-invariant, optimal control law for the discrete regulator problem acted upon by a constant disturbance. The response trajectories presented demonstrate the capability of this controller to perform optimal flare maneuvers in the presence of various wind shear conditions.

Nadkarni, A. A.↗

Support-electrode torque on a spherical superconducting gyroscope

The simplest case of a single electrode is considered. Determination of the mixed boundary condition for this potential leads to dual series equations. Collins' solution to a Fredholm integral equation of the second kind is discussed. This equation is transformed into an infinite set of linear equations from which the coefficients in the dual series equation can be calculated using standard techniques.

Holdeman, L. B.↗

Planar Cubics Through a Point in a Direction

It is shown that the planar cubics through three points and the associated tangent directions can be found by solving a cubic equation and a 2 x 2 system of linear equations. The result is combined with a previous published scheme to produce a better curve-fitting method.

Chou, J. J.↗

Rapid Aeroelastic Analysis of Blade Flutter in Turbomachines

The LINFLUX-AE computer code predicts flutter and forced responses of blades and vanes in turbomachines under subsonic, transonic, and supersonic flow conditions. The code solves the Euler equations of unsteady flow in a blade passage under the assumption that the blades vibrate harmonically at small amplitudes. The steady-state nonlinear Euler equations are solved by a separate program, then equations for unsteady flow components are obtained through linearization around the steady-state solution. A structural-dynamics analysis (see figure) is performed to determine the frequencies and mode shapes of blade vibrations, a preprocessor interpolates mode shapes from the structural-dynamics mesh onto the LINFLUX computational-fluid-dynamics mesh, and an interface code is used to convert the steady-state flow solution to a form required by LINFLUX. Then LINFLUX solves the linearized equations in the frequency domain to calculate the unsteady aerodynamic pressure distribution for a given vibration mode, frequency, and interblade phase angle. A post-processor uses the unsteady pressures to calculate generalized aerodynamic forces, response amplitudes, and eigenvalues (which determine the flutter frequency and damping). In comparison with the TURBO-AE aeroelastic-analysis code, which solves the equations in the time domain, LINFLUX-AE is 6 to 7 times faster.

Trudell, J. J.↗

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↗

Runge-Kutta Methods for Linear Ordinary Differential Equations

Three new Runge-Kutta methods are presented for numerical integration of systems of linear inhomogeneous ordinary differential equations (ODES) with constant coefficients. Such ODEs arise in the numerical solution of the partial differential equations governing linear wave phenomena. The restriction to linear ODEs with constant coefficients reduces the number of conditions which the coefficients of the Runge-Kutta method must satisfy. This freedom is used to develop methods which are more efficient than conventional Runge-Kutta methods. A fourth-order method is presented which uses only two memory locations per dependent variable, while the classical fourth-order Runge-Kutta method uses three. This method is an excellent choice for simulations of linear wave phenomena if memory is a primary concern. In addition, fifth- and sixth-order methods are presented which require five and six stages, respectively, one fewer than their conventional counterparts, and are therefore more efficient. These methods are an excellent option for use with high-order spatial discretizations.

Zingg, David W.↗