Search NASA⌕ Search

SEARCH · Search NASA

Results for “general linear methods”

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 235 records · Page 13

Multi-flexible-body dynamics capturing motion-induced stiffness

A multi-flexible-body dynamics formulation incorporating a recently developed theory for capturing motion induced stiffness for a arbitrary structure undergoing large rotation and translation accompanied by small vibrations is presented. In essence, the method consists of correcting prematurely linearized dynamical equations for an arbitrary flexible body with generalized active forces due to geometric stiffness corresponding to a system of twelve inertia forces and nine inertia couples distributed over the body. Equations of motion are derived by means of Kane's method. A useful feature of the formulation is its treatment of prescribed motions and interaction forces. Results of simulations of motions of three flexible spacecraft, involving stiffening during spinup motion, dynamic buckling, and a repositioning maneuver, demonstrate the validity and generality of the theory.

Banerjee, Arun K.↗

Sparse Linear Algebra Toolkit for Computational Aerodynamics

Finding solutions to sparse linear systems of equations is an essential step in Computational Engineering applications of interest to NASA. Linear systems of equations are composed and solved in almost every computational engineering application. The characteristics of linear systems vary greatly from one application to another. Accordingly, there are a wide variety of methods for the solution of linear systems of equations. The operations and methods prepared by the authors are focused on linear systems of interest to NASA, primarily those associated with Computational Fluid Dynamics (CFD), Aeroelasticity, and Aeroacoustics. The Sparse Linear Algebra Toolkit (SLAT) is a coordinated collection of software featuring operations, methods, and data structures that are useful when solving sparse linear systems of equations on modern computer architectures. The implemented operations and methods are designed and tuned for parallelism in shared memory, in distributed memory, and across the hybrid combination of distributed-shared memory. The toolkit includes novel methods and implementations for modern architectures and facilitates development of new approaches for meeting NASA’s evolving computational engineering challenges using evolving computer architectures that are not available in vendor libraries. In this paper, significant features and interfaces within SLAT are presented and verified for simulations performed with NASA’s CFD solver, FUN3D. The runtime and scaling performance of the Generalized Minimum Residual (GMRES) method implemented in SLAT is analyzed for the linear subproblems within the solution of turbulent Navier-Stokes equations employed in the simulation of high-lift configurations. Prior to this work, the SPARSKIT GMRES implementation was the only Krylov subspace method available within FUN3D. A strong scaling study shows the SLAT GMRES implementation facilitates accurate Reynolds-averaged Navier-Stokes CFD solutions between 15% and 56% faster than the SPARSKIT GMRES implementation.

Stephen L Wood↗

Simple Test Functions in Meshless Local Petrov-Galerkin Methods

Two meshless local Petrov-Galerkin (MLPG) methods based on two different trial functions but that use a simple linear test function were developed for beam and column problems. These methods used generalized moving least squares (GMLS) and radial basis (RB) interpolation functions as trial functions. These two methods were tested on various patch test problems. Both methods passed the patch tests successfully. Then the methods were applied to various beam vibration problems and problems involving Euler and Beck's columns. Both methods yielded accurate solutions for all problems studied. The simple linear test function offers considerable savings in computing efforts as the domain integrals involved in the weak form are avoided. The two methods based on this simple linear test function method produced accurate results for frequencies and buckling loads. Of the two methods studied, the method with radial basis trial functions is very attractive as the method is simple, accurate, and robust.

Raju, Ivatury S.↗

Stochastic Galerkin methods for the steady-state Navier–Stokes equations

We study the steady-state Navier–Stokes equations in the context of stochastic finite element discretizations. Specifically, we assume that the viscosity is a random field given in the form of a generalized polynomial chaos expansion. For the resulting stochastic problem, we formulate the model and linearization schemes using Picard and Newton iterations in the framework of the stochastic Galerkin method, and we explore properties of the resulting stochastic solutions. We also propose a preconditioner for solving the linear systems of equations arising at each step of the stochastic (Galerkin) nonlinear iteration and demonstrate its effectiveness for solving a set of benchmark problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computer Model Calibration Based on Image Warping Metrics: An Application for Sea Ice Deformation

Arctic sea ice plays an important role in the global climate. Sea ice models governed by physical equations have been used to simulate the state of the ice including characteristics such as ice thickness, concentration, and motion. More recent models also attempt to capture features such as fractures or leads in the ice. These simulated features can be partially misaligned or misshapen when compared to observational data, whether due to numerical approximation or incomplete physics. In order to make realistic forecasts and improve understanding of the underlying processes, it is necessary to calibrate the numerical model to field data. Traditional calibration methods based on generalized least-square metrics are flawed for linear features such as sea ice cracks. We develop a statistical emulation and calibration framework that accounts for feature misalignment and misshapenness, which involves optimally aligning model output with observed features using cutting-edge image registration techniques. Here, this work can also have application to other physical models which produce coherent structures.

54 ENVIRONMENTAL SCIENCES↗

Effect of neutral collision and radiative heat-loss function on self-gravitational instability of viscous thermally conducting partially-ionized plasma

The problem of thermal instability and gravitational instability is investigated for a partially ionized self-gravitating plasma which has connection in astrophysical condensations. We use normal mode analysis method in this problem. The general dispersion relation is derived using linearized perturbation equations of the problem. Effects of collisions with neutrals, radiative heat-loss function, viscosity, thermal conductivity and magnetic field strength, on the instability of the system are discussed. The conditions of instability are derived for a temperature-dependent and density-dependent heat-loss function with thermal conductivity. Numerical calculations have been performed to discuss the effect of various physical parameters on the growth rate of the gravitational instability. The temperature-dependent heat-loss function, thermal conductivity, viscosity, magnetic field and neutral collision have stabilizing effect, while density-dependent heat-loss function has a destabilizing effect on the growth rate of the gravitational instability. With the help of Routh-Hurwitz's criterion, the stability of the system is discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Nuclear data covariances are critical input to determine upper sub-critical limits and to design experiments to increase it [Slides]

This presentation discusses how Upper Subcritical Limits (USL) are key parameters to determine operational limits in nuclear criticality safety evaluations. It also discusses an example of plutonium casting operation using tantalum at LANL PF-4. The Whisper tool at Los Alamos relies on many inputs, including covariance data, leading the presentation to ask if an existing benchmark data be used in Whisper to adjust nuclear data and covariances to justify a higher USL. If not, Whisper can be used to help design an optimal new benchmark experiment. The presentation also seeks to determine what the possible impacts are on USL and operational limits for plutonium casting. In conclusion, nuclear data covariances are used for by Whisper for: GSSL adjustment of nuclear data and covariances, identification of most similar existing benchmark experiments to application, simulation of Upper Subcritical Limit of application, and input to optimization techniques for designing most appropriate new benchmark experiment(s) to meet requirements. This requires a complete set of nuclear data covariances, benchmarks and k-effective sensitivity profiles (for both benchmarks and applications). The presentation concludes by asking if end users should trust results that depend on current covariance data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Classification and Evaluation of Coherent Synchronous Sampled-Data Telemetry Systems

This paper analyzes the various types of continuous wave and pulse modulation for the transmission of sampled data over channels perturbed by white gaussian noise. Optimal coherent synchronous detection schemes for all the different modulation methods are shown to belong to one of two general classes: linear synchronous detection and correlation detection. The figures of merit, mean-square signal-to-error ratio and bandwidth occupancy, are determined for each system and compared.

Viterbi, Andrew↗

Aspect of cumulative fatigue damage under multiaxial strain cycling.

The concept of order of loading and its effect on cumulative fatigue damage under multiaxial strain cyclings was investigated. The effect is illustrated through nonlinear relationships between biaxial fatigue damage and cycle-ratio diagrams. Uniaxial theories such as Miner's method, the convergence method, and the double linear damage rule in its special and generalized form, were examined and extended to the biaxial case through the octahedral shear strain theory. The generalized double linear damage rule was found more applicable to biaxial cumulative fatigue damage.

Zamrik, S. Y.↗

Stability of viscous flow past a circular cylinder

A spectral method which employs trigonometric functions and Chebyshev polynomials is used to compute the steady, incompressible laminar flow past a circular cylinder. Linear stability methods are used to formulate a pair of decoupled generalized eigenvalue problems for the growth of symmetric and asymmetric (about the dividing streamline) perturbations. It is shown that, while the symmetric disturbances are stable, the asymmetric perturbations become unstable at a Reynolds number about 40 with a Strouhal number about 0.12. The critical conditions are found to depend on the size of the computational domain in a manner similar to that observed in the laboratory.

Zebib, A.↗

Exact finite element method analysis of viscoelastic tapered structures to transient loads

A general method is presented for determining the dynamic torsional/axial response of linear structures composed of either tapered bars or shafts to transient excitations. The method consists of formulating and solving the dynamic problem in the Laplace transform domain by the finite element method and obtaining the response by a numerical inversion of the transformed solution. The derivation of the torsional and axial stiffness matrices is based on the exact solution of the transformed governing equation of motion, and it consequently leads to the exact solution of the problem. The solution permits treatment of the most practical cases of linear tapered bars and shafts, and employs modeling of structures with only one element per member which reduces the number of degrees of freedom involved. The effects of external viscous or internal viscoelastic damping are also taken into account.

Spyrakos, Constantine Chris↗

Three-dimensional elliptic grid generation technique with application to turbomachinery cascades

Described is a numerical method for generating 3-D grids for turbomachinery computational fluid dynamic codes. The basic method is general and involves the solution of a quasi-linear elliptic partial differential equation via pointwise relaxation with a local relaxation factor. It allows specification of the grid point distribution on the boundary surfaces, the grid spacing off the boundary surfaces, and the grid orthogonality at the boundary surfaces. A geometry preprocessor constructs the grid point distributions on the boundary surfaces for general turbomachinery cascades. Representative results are shown for a C-grid and an H-grid for a turbine rotor. Two appendices serve as user's manuals for the basic solver and the geometry preprocessor.

Chen, S. C.↗

Vibration analysis of rotor systems using reduced subsystem models

A general impedance method using reduced submodels has been developed for the linear dynamic analysis of rotor systems. Formulated in terms of either modal or physical coordinates of the subsystems, the method enables imbalance responses at specific locations of the rotor systems to be efficiently determined from a small number of 'master' degrees of freedom. To demonstrate the capability of this impedance approach, the Space Shuttle Main Engine high-pressure oxygen turbopump has been investigated to determine the bearing loads due to imbalance. Based on the same formulation, an eigenvalue analysis has been performed to study the system stability. A small 5-DOF model has been utilized to illustrate the application of the method to eigenvalue analysis. Because of its inherent characteristics of allowing formulation of reduced submodels, the impedance method can significantly increase the computational speed.

Fan, Uei-Jiun↗

Direct handling of equality constraints in multilevel optimization

In recent years there have been several hierarchic multilevel optimization algorithms proposed and implemented in design studies. Equality constraints are often imposed between levels in these multilevel optimizations to maintain system and subsystem variable continuity. Equality constraints of this nature will be referred to as coupling equality constraints. In many implementation studies these coupling equality constraints have been handled indirectly. This indirect handling has been accomplished using the coupling equality constraints' explicit functional relations to eliminate design variables (generally at the subsystem level), with the resulting optimization taking place in a reduced design space. In one multilevel optimization study where the coupling equality constraints were handled directly, the researchers encountered numerical difficulties which prevented their multilevel optimization from reaching the same minimum found in conventional single level solutions. The researchers did not explain the exact nature of the numerical difficulties other than to associate them with the direct handling of the coupling equality constraints. The coupling equality constraints are handled directly, by employing the Generalized Reduced Gradient (GRG) method as the optimizer within a multilevel linear decomposition scheme based on the Sobieski hierarchic algorithm. Two engineering design examples are solved using this approach. The results show that the direct handling of coupling equality constraints in a multilevel optimization does not introduce any problems when the GRG method is employed as the internal optimizer. The optimums achieved are comparable to those achieved in single level solutions and in multilevel studies where the equality constraints have been handled indirectly.

Renaud, John E.↗

Multiparameter linear least-squares fitting to Poisson data one count at a time

A standard problem in gamma-ray astronomy data analysis is the decomposition of a set of observed counts, described by Poisson statistics, according to a given multicomponent linear model, with underlying physical count rates or fluxes which are to be estimated from the data. Despite its conceptual simplicity, the linear least-squares (LLSQ) method for solving this problem has generally been limited to situations in which the number n(sub i) of counts in each bin i is not too small, conventionally more than 5-30. It seems to be widely believed that the failure of the LLSQ method for small counts is due to the failure of the Poisson distribution to be even approximately normal for small numbers. The cause is more accurately the strong anticorrelation between the data and the wieghts w(sub i) in the weighted LLSQ method when square root of n(sub i) instead of square root of bar-n(sub i) is used to approximate the uncertainties, sigma(sub i), in the data, where bar-n(sub i) = E(n(sub i)), the expected value of N(sub i). We show in an appendix that, avoiding this approximation, the correct equations for the Poisson LLSQ (PLLSQ) problems are actually identical to those for the maximum likelihood estimate using the exact Poisson distribution. We apply the method to solve a problem in high-resolution gamma-ray spectroscopy for the JPL High-Resolution Gamma-Ray Spectrometer flown on HEAO 3. Systematic error in subtracting the strong, highly variable background encountered in the low-energy gamma-ray region can be significantly reduced by closely pairing source and background data in short segments. Significant results can be built up by weighted averaging of the net fluxes obtained from the subtraction of many individual source/background pairs. Extension of the approach to complex situations, with multiple cosmic sources and realistic background parameterizations, requires a means of efficiently fitting to data from single scans in the narrow (approximately = 1.2 keV, HEAO 3) energy channels of a Ge spectrometer, where the expected number of counts obtained per scan may be very low. Such an analysis system is discussed and compared to the method previously used.

Wheaton, Wm. A.↗

A Quantum Algorithm to Simulate Open Quantum Systems

Given the advent of quantum algorithms for a wide array of problems in linear algebra and machine learning, it is important to develop general methods for the simulation of arbitrary (ie non-unitary) operators on quantum hardware. In this talk, we present a novel quantum algorithm based on the quantum singular value transformation (QSVT) to apply an arbitrary operator K to some input state and subsequently estimate the expectation value of some observable. Our construction then immediately yields a route to estimating observables of states undergoing open quantum dynamics, whose effect is captured by a set of non-unitary Kraus operators. Our algorithm succeeds deterministically given the Sz-Nagy dilation, and we provide details on the algorithm's query and gate complexity, numerical verification, and comparisons with prior methods.

Quantum computing↗

Using Whisper-1.1 to Guide Improvements to Nuclear Data Evaluations [Slides]

This presentation covers the use of Whisper-1.1 to guide improvements to nuclear data evaluations. This presentation provides a brief overview on what Whisper-1.1 is. Additionally covered is the benchmark selection: using benchmark and application correlations (ck) computed using nuclear data sensitivity profiles and covariance data. Next the presentation touches on compute bias and bias uncertainty based on selected benchmarks using Extreme Value Theory Finally the presentation shows the additional margin for nuclear data uncertainty estimated by GLLS.

97 MATHEMATICS AND COMPUTING↗

Domain decomposition methods for systems of conservation laws: Spectral collocation approximations

Hyperbolic systems of conversation laws are considered which are discretized in space by spectral collocation methods and advanced in time by finite difference schemes. At any time-level a domain deposition method based on an iteration by subdomain procedure was introduced yielding at each step a sequence of independent subproblems (one for each subdomain) that can be solved simultaneously. The method is set for a general nonlinear problem in several space variables. The convergence analysis, however, is carried out only for a linear one-dimensional system with continuous solutions. A precise form of the error reduction factor at each iteration is derived. Although the method is applied here to the case of spectral collocation approximation only, the idea is fairly general and can be used in a different context as well. For instance, its application to space discretization by finite differences is straight forward.

Quarteroni, Alfio↗