Search NASA⌕ Search

SEARCH · Search NASA

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 325 records · Page 18

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↗

Toward efficient polynomial preconditioning for GMRES

Here, we present a polynomial preconditioner for solving large systems of linear equations. The polynomial is derived from the minimum residual polynomial (the GMRES polynomial) and is more straightforward to compute and implement than many previous polynomial preconditioners. Our current implementation of this polynomial using its roots is naturally more stable than previous methods of computing the same polynomial. We implement further stability control using added roots, and this allows for high degree polynomials. We discuss the effectiveness and challenges of root-adding and give an additional check for stability. In this article, we study the polynomial preconditioner applied to GMRES; however it could be used with any Krylov solver. This polynomial preconditioning algorithm can dramatically improve convergence for some problems, especially for difficult problems, and can reduce dot products by an even greater margin.

97 MATHEMATICS AND COMPUTING↗

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.↗

BPLU Completion and Verification Report

The Border Profile LU (BPLU) linear equation solver is the default solver for newer versions of RELAP5-3D. It can significantly reduce execution time compared to the previous default solver, MA18. Particularly for 3D cases, it can reduce run time by one to two orders of magnitude over MA18. However, because of some user reported failures, the MA18 solver currently must be used for coupled analyses. Over one dozen User Problems (UP) have been reported between 1999 and 2011 that involve the BPLU solver in RELAP5-3D. These issues can be combined into two categories of problems with the solver: • It fails when running multidimensional components with the nearly-implicit hydrodynamics advancement scheme. • It fails with some input models where the MA18 sparse solver does not fail. The sources of these UP have been found and corrected. The modified coding has been thoroughly tested with over 3000 test cases and on two different compute platforms. The updates are incorporated in RELAP5-3D, version 3.0.2.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

BPLU Completion and Verification Report

The Border Profile LU (BPLU) linear equation solver is the default solver for newer versions of RELAP5-3D. It can significantly reduce execution time compared to the previous default solver, MA18. Particularly for 3D cases, it can reduce run time by one to two orders of magnitude over MA18. However, because of some user reported failures, the MA18 solver currently must be used for coupled analyses. Over one dozen User Problems (UP) have been reported between 1999 and 2011 that involve the BPLU solver in RELAP5-3D. These issues can be combined into two categories of problems with the solver: (1) It fails when running multidimensional components with the nearly-implicit hydrodynamics advancement scheme. (2) It fails with some input models where the MA18 sparse solver does not fail. The sources of these UP have been found and corrected. The modified coding has been thoroughly tested with over 3000 test cases and on two different compute platforms. The updates are incorporated in RELAP5-3D, version 3.0.2.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Preconditioned Low-Rank Projection Method with a Rank-Reduction Scheme for Stochastic Partial Differential Equations

Herein, we consider the numerical solution of large systems of linear equations obtained from the stochastic Galerkin formulation of stochastic partial differential equations. We propose an iterative algorithm that exploits the Kronecker product structure of the linear systems. The proposed algorithm efficiently approximates the solutions in low-rank tensor format. Using standard Krylov subspace methods for the data in tensor format is computationally prohibitive due to the rapid growth of tensor ranks during the iterations. To keep tensor ranks low over the entire iteration process, we devise a rank-reduction scheme that can be combined with the iterative algorithm. The proposed rank-reduction scheme identifies an important subspace in the stochastic domain and compresses tensors of high rank on-the-fly during the iterations. The proposed reduction scheme is a coarse-grid method in that the important subspace can be identified inexpensively in a coarse spatial grid setting. The efficiency of the present method is displayed by numerical experiments on benchmark problems.

97 MATHEMATICS AND COMPUTING↗

Large deviations in stochastic heat-conduction processes provide a gradient-flow structure for heat conduction

We consider three one-dimensional continuous-time Markov processes on a lattice, each of which models the conduction of heat: the family of Brownian Energy Processes with parameter m (BEP(m)), a Generalized Brownian Energy Process, and the Kipnis-Marchioro-Presutti (KMP) process. The hydrodynamic limit of each of these three processes is a parabolic equation, the linear heat equation in the case of the BEP(m) and the KMP, and a nonlinear heat equation for the Generalized Brownian Energy Process with parameter a (GBEP(a)). We prove the hydrodynamic limit rigorously for the BEP(m), and give a formal derivation for the GBEP(a). We then formally derive the pathwise large-deviation rate functional for the empirical measure of the three processes. These rate functionals imply gradient-flow structures for the limiting linear and nonlinear heat equations. We contrast these gradient-flow structures with those for processes describing the diffusion of mass, most importantly the class of Wasserstein gradient-flow systems. The linear and nonlinear heat-equation gradient-flow structures are each driven by entropy terms of the form -log ρ; they involve dissipation or mobility terms of order ρ² for the linear heat equation, and a nonlinear function of ρ for the nonlinear heat equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

A moment approach for entropy solutions to nonlinear hyperbolic PDEs

We propose to solve hyperbolic partial differential equations(PDEs) with polynomial flux using a convex optimization strategy. This approach is based on a very weak notion of solution of the nonlinear equation, namely the measure-valued (mv) solution, satisfying a linear equation in the space of Borel measures. The aim of this paper is, first, to provide the conditions that ensure the equivalence between the two formulations and, second, to introduce a method which approximates the infinite-dimensional linear problem by a hierarchy of convex, finite-dimensional, semidefinite programming problems. This result is then illustrated on the celebrated Burgers equation. Here, we also compare our results with an existing numerical scheme, namely the Godunov scheme.

97 MATHEMATICS AND COMPUTING↗