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 1,387 records · Page 77

Recovery time in quantum dynamics of wave packets

A wave packet formed by a linear superposition of bound states with an arbitrary energy spectrum returns arbitrarily close to the initial state after a quite long time. A method in which quantum recovery times are calculated exactly is developed. In particular, an exact analytic expression is derived for the recovery time in the limiting case of a two-level system. In the general case, the reciprocal recovery time is proportional to the Gauss distribution that depends on two parameters (mean value and variance of the return probability). The dependence of the recovery time on the mean excitation level of the system is established. The recovery time is the longest for the maximal excitation level.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A two-level GPU-accelerated incomplete LU preconditioner for general sparse linear systems

This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block-Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors by targeting an algebraically smooth vector. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods on challenging anisotropic diffusion problems and a collection of general sparse matrices.

97 MATHEMATICS AND COMPUTING↗

Large liquid rocket engine transient performance simulation system

A simulation system, ROCETS, was designed and developed to allow cost-effective computer predictions of liquid rocket engine transient performance. The system allows a user to generate a simulation of any rocket engine configuration using component modules stored in a library through high-level input commands. The system library currently contains 24 component modules, 57 sub-modules and maps, and 33 system routines and utilities. FORTRAN models from other sources can be operated in the system upon inclusion of interface information on comment cards. Operation of the simulation is simplified for the user by run, execution, and output processors. The simulation system makes available steady-state trim balance, transient operation, and linear partial generation. The system utilizes a modern equation solver for efficient operation of the simulations. Transient integration methods include integral and differential forms for the trapezoidal, first order Gear, and second order Gear corrector equations. A detailed technology test bed engine (TTBE) model was generated to be used as the acceptance test of the simulation system. The general level of model detail was that reflected in the Space Shuttle Main Engine DTM. The model successfully obtained steady-state balance in main stage operation and simulated throttle transients, including engine starts and shutdown. A NASA FORTRAN control model was obtained, ROCETS interface installed in comment cards, and operated with the TTBE model in closed-loop transient mode.

Mason, J. R.↗

The Vertical Linear Fractional Initialization Problem

This paper presents a solution to the initialization problem for a system of linear fractional-order differential equations. The scalar problem is considered first, and solutions are obtained both generally and for a specific initialization. Next the vector fractional order differential equation is considered. In this case, the solution is obtained in the form of matrix F-functions. Some control implications of the vector case are discussed. The suggested method of problem solution is shown via an example.

Lorenzo, Carl F.↗

Numerical Differentiation for Adaptively Refined Finite Element Meshes

Postprocessing of point-wise data is a fundamental process in many fields of research. Numerical differentiation is a key operation in computational electromagnetics. In the case of data obtained from a finite element method with automatic mesh refinement much work needs still to be done. This paper addresses some issues in differentiating data obtained from a finite element electromagnetic code with adaptive mesh refinement, and it proposes a methodology for deriving the electric field given the magnetic field on a mesh of linear triangular elements. The procedure itself is nevertheless more general and might be extended for numerically differentiating any point-wise solution based on triangular meshes.

Borgioli, Andrea↗

Using Remote Sensing Data to Evaluate Surface Soil Properties in Alabama Ultisols

Evaluation of surface soil properties via remote sensing could facilitate soil survey mapping, erosion prediction and allocation of agrochemicals for precision management. The objective of this study was to evaluate the relationship between soil spectral signature and surface soil properties in conventionally managed row crop systems. High-resolution RS data were acquired over bare fields in the Coastal Plain, Appalachian Plateau, and Ridge and Valley provinces of Alabama using the Airborne Terrestrial Applications Sensor multispectral scanner. Soils ranged from sandy Kandiudults to fine textured Rhodudults. Surface soil samples (0-1 cm) were collected from 163 sampling points for soil organic carbon, particle size distribution, and citrate dithionite extractable iron content. Surface roughness, soil water content, and crusting were also measured during sampling. Two methods of analysis were evaluated: 1) multiple linear regression using common spectral band ratios, and 2) partial least squares regression. Our data show that thermal infrared spectra are highly, linearly related to soil organic carbon, sand and clay content. Soil organic carbon content was the most difficult to quantify in these highly weathered systems, where soil organic carbon was generally less than 1.2%. Estimates of sand and clay content were best using partial least squares regression at the Valley site, explaining 42-59% of the variability. In the Coastal Plain, sandy surfaces prone to crusting limited estimates of sand and clay content via partial least squares and regression with common band ratios. Estimates of iron oxide content were a function of mineralogy and best accomplished using specific band ratios, with regression explaining 36-65% of the variability at the Valley and Coastal Plain sites, respectively.

Sullivan, Dana G.↗

Spatial and Temporal Variations in Titan's Surface Temperatures from Cassini CIRS Observations

We report a wide-ranging study of Titan's surface temperatures by analysis of the Moon's outgoing radiance through a spectral window in the thermal infrared at 19 mm (530/cm) characterized by lower atmospheric opacity. We begin by modeling Cassini Composite Infrared Spectrometer (CIRS) far infrared spectra collected in the period 2004-2010, using a radiative transfer forward model combined with a non-linear optimal estimation inversion method. At low-latitudes, we agree with the HASI near-surface temperature of about 94 K at 101S (Fulchignoni et al., 2005). We find a systematic decrease from the equator toward the poles, hemispherically asymmetric, of approx. 1 K at 60 deg. south and approx. 3 K at 60 deg. north, in general agreement with a previous analysis of CIRS data and with Voyager results from the previous northern winter. Subdividing the available database, corresponding to about one Titan season, into 3 consecutive periods, small seasonal changes of up to 2 K at 60 deg N became noticeable in the results. In addition, clear evidence of diurnal variations of the surface temperatures near the equator are observed for the first time: we find a trend of slowly increasing temperature from the morning to the early afternoon and a faster decrease during the night. The diurnal change is approx. 1.5 K, in agreement with model predictions for a surface with a thermal inertia between 300 and 600 J/ sq. m s (exp -1/2) / K. These results provide important constraints on coupled surface-atmosphere models of Titan's meteorology and atmospheric dynamic.

titan↗

A weighted Shifted Boundary Method for free surface flow problems

The Shifted Boundary Method (SBM) belongs to the class of unfitted (or immersed, or embedded) finite element methods and was recently introduced for the Poisson, linear advection/diffusion, Stokes, Navier-Stokes, acoustics, and shallow-water equations. By reformulating the original boundary value problem over a surrogate (approximate) computational domain, the SBM avoids integration over cut cells and the associated problematic issues regarding numerical stability and matrix conditioning. Accuracy is maintained by modifying the original boundary conditions using Taylor expansions. Hence the name of the method, that shifts the location and values of the boundary conditions. In this article, we extend the SBM to the simulation of incompressible Navier-Stokes flows with moving free-surfaces, by appropriately weighting its variational form with the elemental volume fraction of active fluid. This approach prevents spurious pressure oscillations in time, which would otherwise be produced if the total active fluid volume were to change abruptly over a time step. In fact, the proposed weighted SBM method induces small mass (i.e., volume) conservation errors, which converge quadratically in the case of piecewise-linear finite element interpolations, as the grid is refined. Finally, we present an extensive set of two- and three-dimensional tests to demonstrate the robustness and accuracy of the method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

How to Host An Effective Data Competition: Statistical Advice for Competition Design and Analysis

Data competitions rely on real-time leaderboards to rank competitor entries and stimulate algorithm improvement. While such competitions have become quite popular and prevalent, particularly in supervised learning formats, their implementations by the host are highly variable. Without careful planning, a supervised learning competition is vulnerable to overfitting, where the winning solutions are so closely tuned to the particular set of provided data that they cannot generalize to the underlying problem of interest to the host. This paper outlines some important considerations for strategically designing relevant and informative data sets to maximize the learning outcome from hosting a competition based on our experience. It also describes a postcompetition analysis that enables robust and efficient assessment of the strengths and weaknesses of solutions from different competitors, as well as greater understanding of the regions of the input space that are well-solved. The postcompetition analysis, which complements the leaderboard, uses exploratory data analysis and generalized linear models (GLMs). The GLMs not only expand the range of results we can explore, they also provide more detailed analysis of individual subquestions including similarities and differences between algorithms across different types of scenarios, universally easy or hard regions of the input space, and different learning objectives. When coupled with a strategically planned data generation approach, the methods provide richer and more informative summaries to enhance the interpretation of results beyond just the rankings on the leaderboard. The methods are illustrated with a recently completed competition to evaluate algorithms capable of detecting, identifying, and locating radioactive materials in an urban environment.

97 MATHEMATICS AND COMPUTING↗

Fast and slow magnetosonic waves in two-dimensional spin-1/2 quantum plasma

Using the spin-1/2 resistive quantum magnetohydrodynamics model, linear and nonlinear relations for slow and fast magnetosonic modes are derived. Spin effects are incorporated via spin force and macroscopic spin magnetization current. The plasma resistivity is shown to play a role of dissipation in the system. With the aid of tanh method the traveling wave solution of Kadomstev-Petviashvili-Burgers is obtained. The solution shows a general shock wave profile superposed by a perturbative solitary-wave contribution. The dynamics of fast and slow magnetosonic shock and soliton, respectively, in the presence and absence of dissipation is investigated with respect to electron spin magnetization, quantum diffraction, and plasma statistic. It is found that results obtained from the spin quantum plasmas differ significantly from the nonspin quantum plasmas. The relevance of the present work to dense astrophysical plasmas such as pulsar magnetosphere is pointed out.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Constraints on scalar-tensor theories of gravity from observations

In spite of their original discrepancy, both dark energy and modified theory of gravity can be parameterized by the effective equation of state (EOS) ω for the expansion history of the Universe. A useful model independent approach to the EOS of them can be given by so-called Chevallier-Polarski-Linder (CPL) parametrization where two parameters of it (ω{sub 0} and ω{sub a}) can be constrained by the geometrical observations which suffer from degeneracies between models. The linear growth of large scale structure is usually used to remove these degeneracies. This growth can be described by the growth index parameter γ and it can be parameterized by γ{sub 0}+γ{sub a}(1−a) in general. We use the scalar-tensor theories of gravity (STG) and show that the discernment between models is possible only when γ{sub a} is not negligible. We show that the linear density perturbation of the matter component as a function of redshift severely constrains the viable subclasses of STG in terms of ω and γ. From this method, we can rule out or prove the viable STG in future observations. When we use Z(φ) = 1, F shows the convex shape of evolution in a viable STG model. The viable STG models with Z(φ) = 1 are not distinguishable from dark energy models when we strongly limit the solar system constraint.

79 ASTRONOMY AND ASTROPHYSICS↗

Spin relaxation and linear-in-electric-field frequency shift in an arbitrary, time-independent magnetic field

A method is presented to calculate the spin relaxation times T 1 , T 2 due to a nonuniform magnetic field, and the linear-in-electric-field precession frequency shift δω E when an electric field is present, in the diffusion approximation for spins confined to a rectangular cell. It is found that the rectangular cell geometry admits of a general result for T 1 , T 2 , and δω E

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

High-precision quantum algorithms for partial differential equations

Quantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary differential equations are well established, the best previous quantum algorithms for linear partial differential equations (PDEs) have complexity poly(1/ϵ), where ϵ is the error tolerance. By developing quantum algorithms based on adaptive-order finite difference methods and spectral methods, we improve the complexity of quantum algorithms for linear PDEs to be poly(d,log(1/ϵ)), where d is the spatial dimension. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound. We develop a finite difference algorithm for the Poisson equation and a spectral algorithm for more general second-order elliptic equations.

97 MATHEMATICS AND COMPUTING↗

Rotorcraft derivative identification from analytical models and flight test data

A general procedure is presented for systematic development of rotorcraft models for use in systems identification, which includes fuselage and rotor degrees of freedom (DOF). Formulations for rigid blade flap and lag as well as the normal mode representation of an elastic blade are developed for hingeless and articulated rotor systems. The method of multiblade coordinates is used to obtain linear constant coefficient state variable models of various levels of approximation. Two of the approximate models, a 6 DOF, are identified from a nonlinear articulated helicopter computer simulation. The results demonstrate the accuracy attainable for each model. Advanced results outline the status of rotorcraft modeling and systems identification and indicate areas that require further investigation.

Molusis, J. A.↗

Measures and models for angular correlation and angular-linear correlation

Population models for dependence between two angular measurements and for dependence between an angular and a linear observation are proposed. The method of canonical correlations first leads to new population and sample measures of dependence in this latter situation. An example relating wind direction to the level of a pollutant is given. Next, applied to pairs of angular measurements, the method yields previously proposed sample measures in some special cases and a new sample measure in general.

Johnson, R. A.↗

Efficient probabilistic fracture mechanics analysis

A systematic and efficient method for probabilistic fracture mechanics analysis is proposed. The method is based on a most-probable-point-locus concept. The locus is obtained iteratively where the initial locus is determined using the linear approximation of the service life N(X) function about the mean values of the random variables X. Linear and quadratic approximations of N(X) are established locally at the most probable points, and the reliability analysis methods are used to compute the cumulative probabilities. By using two examples, the proposed method is demonstrated to be efficient and accurate. One example involved a random loading and N(X) was computed using cycle-by-cycle integration. The method is general and can be applied to other performance functions. It is particularly suitable when the computation of the performance function is time consuming such that Monte Carlo simulation is prohibitively costly.

Wu, Y.-T.↗

Prediction and causal reasoning in planning

Nonlinear planners are often touted as having an efficiency advantage over linear planners. The reason usually given is that nonlinear planners, unlike their linear counterparts, are not forced to make arbitrary commitments to the order in which actions are to be performed. This ability to delay commitment enables nonlinear planners to solve certain problems with far less effort than would be required of linear planners. Here, it is argued that this advantage is bought with a significant reduction in the ability of a nonlinear planner to accurately predict the consequences of actions. Unfortunately, the general problem of predicting the consequences of a partially ordered set of actions is intractable. In gaining the predictive power of linear planners, nonlinear planners sacrifice their efficiency advantage. There are, however, other advantages to nonlinear planning (e.g., the ability to reason about partial orders and incomplete information) that make it well worth the effort needed to extend nonlinear methods. A framework is supplied for causal inference that supports reasoning about partially ordered events and actions whose effects depend upon the context in which they are executed. As an alternative to a complete but potentially exponential-time algorithm, researchers provide a provably sound polynomial-time algorithm for predicting the consequences of partially ordered events.

Dean, T.↗

Improving Fidelity of Launch Vehicle Liftoff Acoustic Simulations

Launch vehicles experience high acoustic loads during ignition and liftoff affected by the interaction of rocket plume generated acoustic waves with launch pad structures. Application of highly parallelized Computational Fluid Dynamics (CFD) analysis tools optimized for application on the NAS computer systems such as the Loci/CHEM program now enable simulation of time-accurate, turbulent, multi-species plume formation and interaction with launch pad geometry and capture the generation of acoustic noise at the source regions in the plume shear layers and impingement regions. These CFD solvers are robust in capturing the acoustic fluctuations, but they are too dissipative to accurately resolve the propagation of the acoustic waves throughout the launch environment domain along the vehicle. A hybrid Computational Fluid Dynamics and Computational Aero-Acoustics (CFD/CAA) modeling framework has been developed to improve such liftoff acoustic environment predictions. The framework combines the existing highly-scalable NASA production CFD code, Loci/CHEM, with a high-order accurate discontinuous Galerkin (DG) solver, Loci/THRUST, developed in the same computational framework. Loci/THRUST employs a low dissipation, high-order, unstructured DG method to accurately propagate acoustic waves away from the source regions across large distances. The DG solver is currently capable of solving up to 4th order solutions for non-linear, conservative acoustic field propagation. Higher order boundary conditions are implemented to accurately model the reflection and refraction of acoustic waves on launch pad components. The DG solver accepts generalized unstructured meshes, enabling efficient application of common mesh generation tools for CHEM and THRUST simulations. The DG solution is coupled with the CFD solution at interface boundaries placed near the CFD acoustic source regions. Both simulations are executed simultaneously with coordinated boundary condition data exchange.

Liever, Peter↗