SEARCH · Search NASA

Results for “Computer Algebra”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,549 records · Page 86

All sources NASA NTRS DOE OSTI

NASA NTRS1986

Computation of turbulent supersonic flows around pointed bodies having crossflow separation

The numerical method developed by Schiff and Sturek (1980) on the basis of the thin-layer parabolized Navier-Stokes equations of Schiff and Steger (1980) is extended to the case of turbulent supersonic flows on pointed bodies at high angles of attack. The governing equations, the numerical scheme, and modifications to the algebraic eddy-viscosity turbulence model are described; and results for three cones and one ogive-cylinder body (obtained using grids of 50 nonuniformly spaced points in the radial direction between the body and the outer boundary) are presented graphically and compared with published experimental data. The grids employed are found to provide sufficient spatial resolution of the leeward-side vortices; when combined with the modified turbulence model, they are shown to permit accurate treatment of flows with large regions of crossflow separation.

Degani, D.↗

NASA NTRS1986

On recent advances and future research directions for computational fluid dynamics

This paper highlights some recent accomplishments regarding CFD numerical algorithm constructions for generation of discrete approximate solutions to classes of Reynolds-averaged Navier-Stokes equations. Following an overview of turbulent closure modeling, and development of appropriate conservation law systems, a Taylor weak-statement semi-discrete approximate solution algorithm is developed. Various forms for completion to the final linear algebra statement are cited, as are a range of candidate numerical linear algebra solution procedures. This development sequence emphasizes the key building blocks of a CFD RNS algorithm, including solution trial and test spaces, integration procedure and added numerical stability mechanisms. A range of numerical results are discussed focusing on key topics guiding future research directions.

Baker, A. J.↗

NASA NTRS1990

Computation and turbulence modeling for three-dimensional boundary layers including turbomachinery rotor flows

A method is developed for predicting the behavior of three-dimensional, turbulent boundary layers occurring in internal flows, including those on turbomachinery rotor blades. These boundary layers are complex, turbulent, and subject to Coriolis and centrifugal forces. The major thrust of this paper is the development and use of an algebraic Reynolds stress model (ARSM) that captures the changes in turbulent flow structure arising from curvature, rotation, and three dimensionality. The prediction of pressure-driven secondary flow agrees well with the measured data, and all three turbulence models (k-epsilon, algebraic eddy viscosity, and ARSM) show the same level of agreement. The prediction of boundary-layer development on rotor blades shows much better agreement with measurements with the ARSM. It is essential to employ higher-order turbulence models to capture the effects of rotation, curvature, and three dimensionality on boundary layers in turbomachinery.

Zhang, J.↗

DOE OSTI2016

Fourier Analysis of the Multilevel QD Method with {alpha}-Approximation For Time-Dependent Radiative Transfer Problems

Thermal radiation transfer (TRT) problems describe interaction of photon radiation with matter. They are defined by the time-dependent radiative transfer (RT) equation for the specific intensity I coupled with the energy balance (EB) equation. This class of problems is characterised by high dimensionality, multiple scales and strong nonlinearity. In this paper we analyze the multilevel quasi-diffusion (QD) method for solving TRT problems. This is a nonlinear method of moments with exact closures. The QD method enables one to reduce dimensionality of the original radiative transfer problem. It is formulated by a nonlinear system of equations consisting of (i) the high-order RT (HORT) equation for the intensity of photon radiation and (ii) low-order equations for the angular and energy moments of the intensity. The nonlinear closures are formulated by means of stable factors. The low-order problem brings the radiative transfer model to the level of multi-physics equations. The multilevel QD (MLQD) method possesses attractive features for efficient multi-physics coupling. To calculate the high-order RT solution we apply the {alpha}-approximation which assumes that the intensity changes exponentially in time over a time step. The {alpha}-approximation leads to the steady-state RT equation with a modified opacity and enables one to avoid storing the high-dimensional solution from the previous time step. The rate of change is evaluated by the solution of the time-dependent low-order QD (LOQD) equations for moments. We note that the HORT equation in the {alpha}-approximation contains an extra nonlinear term. It affects the iterative behaviour of the MLQD method. The obtained computational results indicated that the rate of convergence is slower compared to the rate when the time-dependent HORT is used to calculate the intensity. In this paper we perform an iterative stability analysis of the MLQD method in a discretized form and analyze convergence of outer (transport) iterations on a time step. We consider multigroup TRT problems in 1D slab geometry. The fully implicit scheme is used to discretize equations in time. The HORT equation is approximated with the method of step characteristics. A finite volume method is applied for spatial discretization of multigroup LOQD equations. The grey (one-group) LOQD equations are algebraically consistent with the multigroup LOQD equations. To perform Fourier analysis a model TRT problem in an infinite homogeneous medium is considered. The system of nonlinear equations of the MLQD method is linearized near an equilibrium solution at some given temperature. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2024

Comments on the double cone wormhole

In this paper we revisit the double cone wormhole introduced by Saad, Shenker and Stanford (SSS), which was shown to reproduce the ramp in the spectral form factor. As a first approximation we can say that this solution computes Tr[e –iKT ], a trace of the “evolution” operator that generates Schwarzschild time translations on the two sided wormhole geometry. This point of view leads to a simple way to compute the normalization factor of the wormhole. When we have bulk matter fields, SSS suggested using a modified evolution K ~ which involves a slightly complex geometry, so that we are really computing Tr[e –iK ~ T ]. We argue that, for general black holes, the spectrum of K ~ is given by quasinormal mode frequencies. We explain that this reproduces various features that were previously predicted from the spectral form factor on hydrodynamics grounds. We also give a general algebraic construction of the modified boost in terms of operators constructed from half sided modular inclusions. For the special case of JT gravity, we work out the backreaction of matter on the geometry of the double cone and find that it deforms the geometry in an undesirable direction. We finally give some comments on the possible physical interpretation of K ~ .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2015

Decreasing the temporal complexity for nonlinear, implicit reduced-order models by forecasting

Implicit numerical integration of nonlinear ODEs requires solving a system of nonlinear algebraic equations at each time step. Each of these systems is often solved by a Newton-like method, which incurs a sequence of linear-system solves. Most model-reduction techniques for nonlinear ODEs exploit knowledge of system's spatial behavior to reduce the computational complexity of each linear-system solve. However, the number of linear-system solves for the reduced-order simulation often remains roughly the same as that for the full-order simulation. We propose exploiting knowledge of the model's temporal behavior to (1) forecast the unknown variable of the reduced-order system of nonlinear equations at future time steps, and (2) use this forecast as an initial guess for the Newton-like solver during the reduced-order-model simulation. To compute the forecast, we propose using the Gappy POD technique. As a result, the goal is to generate an accurate initial guess so that the Newton solver requires many fewer iterations to converge, thereby decreasing the number of linear-system solves in the reduced-order-model simulation.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

SIRT-FILTER v1.0.0

Small Python package to compute tomographic reconstructions using a reconstruction method published in: Pelt, D.M., & De Andrade, V. (2017). Improved tomographic reconstruction of large-scale real-world data by filter optimization. Advanced Structural and Chemical Imaging 2: 17; and Pelt, D. M., & Batenburg, K. J. (2015). Accurately approximating algebraic tomographic reconstruction by filtered backprojection. In Proceedings of The 13th International Meeting on Fully Three-Dimensional Image Reconstruction in Radiology and Nuclear Medicine (pp. 158-161).

PELT, DANIEL↗

DOE OSTI2019

Randomized methods to characterize large-scale vortical flow networks

We demonstrate the effective use of randomized methods for linear algebra to perform network-based analysis of complex vortical flows. Network theoretic approaches can reveal the connectivity structures among a set of vortical elements and analyze their collective dynamics. These approaches have recently been generalized to analyze high-dimensional turbulent flows, for which network computations can become prohibitively expensive. In this work, we propose efficient methods to approximate network quantities, such as the leading eigendecomposition of the adjacency matrix, using randomized methods. Specifically, we use the Nyström method to approximate the leading eigenvalues and eigenvectors, achieving significant computational savings and reduced memory requirements. The effectiveness of the proposed technique is demonstrated on two high-dimensional flow fields: two-dimensional flow past an airfoil and two-dimensional turbulence. We find that quasi-uniform column sampling outperforms uniform column sampling, while both feature the same computational complexity.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1983

Numerical analysis of a scramjet inlet flow field using the three-dimensional Navier-Stokes equations

A computer program has been developed to analyze supersonic combustion ramjet (scramjet) inlet flow fields. The program solves the three-dimensional Euler or Navier-Stokes equations in full conservation form by a well-known explicit, predictor-corrector technique. Turbulence is modeled by an algebraic eddy-viscosity model. Detailed laminar and turbulent flow results are presented for a symmetric wedge corner and a comparison is made with the available experimental results to allow assessment of the program. Results are then presented for an actual scramjet inlet configuration.

Kumar, A.↗

NASA NTRS1985

Iterative solution of large, sparse linear systems on a static data flow architecture - Performance studies

The applicability of static data flow architectures to the iterative solution of sparse linear systems of equations is investigated. An analytic performance model of a static data flow computation is developed. This model includes both spatial parallelism, concurrent execution in multiple PE's, and pipelining, the streaming of data from array memories through the PE's. The performance model is used to analyze a row partitioned iterative algorithm for solving sparse linear systems of algebraic equations. Based on this analysis, design parameters for the static data flow architecture as a function of matrix sparsity and dimension are proposed.

Reed, D. A.↗

NASA NTRS1988

GaussFit - A system for least squares and robust estimation

GaussFit is a new computer program for solving least-squares and robust estimation problems. It has a number of unique features, including a complete programming language designed especially to formulate estimation problems, a built-in compiler and interpreter to support the programming language, and a built-in algebraic manipulator for calculating the required partial derivatives analytically. These features make GaussFit very easy to use, so that even complex problems can be set up and solved with minimal effort. GaussFit can correctly handle many cases of practical interest: nonlinear models, exact constraints, correlated observations, and models where the equations of condition contain more than one observed quantity. An experimental robust estimation capability is built into GaussFit so that data sets contaminated by outliers can be handled simply and efficiently.

Jefferys, W. H.↗

NASA NTRS1991

Unified formulation of dynamics for serial rigid multibody systems

There has been a growing interest in the development of new and efficient algorithms for multibody dynamics in recent years. Serial rigid multibody systems form the basic subcomponents of general multibody systems, and a variety of algorithms to solve the serial chain forward dynamics problem have been proposed. In this paper, the economy of representation and analysis tools provided by the spatial operator algebra are used to clarify the inherent structure of these algorithms, to identify those that are similar, and to study the relationships among the ones that are distinct. For the purposes of this study, the algorithms are categorized into three classes: algorithms that require the explicit computation of the mass matrix, algorithms that are completely recursive in nature, and algorithms of intermediate complexity. In addition, alternative factorizations for the mass matrix and closed form expressions for its inverse are derived. These results provide a unifying perspective, within which these diverse dynamics algorithms arise naturally as a consequence of a progressive exploitation of the structure of the mass matrix.

Jain, Abhinandan↗

NASA NTRS1996

Symmetries in Turbulent Boundary Layer Flows

The objective is the development of a new theory which enables the algorithmic computation of all self-similar mean velocity profiles. The theory is based on Liegroup analysis and unifies a large set of self-similar solutions for the mean velocity of stationary parallel turbulent shear flows. The results include the logarithmic law of the wall, an algebraic law, the viscous sublayer, the linear region in the middle of a Couette flow and in the middle of a rotating channel flow, and a new exponential mean velocity profile not previously reported. Experimental results taken in the outer parts of a high Reynolds number flat-plate boundary layer, strongly support the exponential profile. From experimental as well as from DNS data of a turbulent channel flow the algebraic scaling law could be confirmed in both the center region and in the near wall region. In the case of the logarithmic law of the wall, the scaling with the wall distance arises as a result of the analysis and has not been assumed in the derivation. The crucial part of the derivation of all the different mean velocity profiles is to consider the invariance of the equation for the velocity fluctuations at the same time as the invariance of the equation for the velocity product equations. The latter is the dyad product of the velocity fluctuations with the equation for the velocity fluctuations. It has been proven that all the invariant solutions are also consistent with similarity of all velocity moment equations up to any arbitrary order.

Oberlack, M.↗

NASA NTRS1998

A Parallel Non-Overlapping Domain-Decomposition Algorithm for Compressible Fluid Flow Problems on Triangulated Domains

This paper considers an algebraic preconditioning algorithm for hyperbolic-elliptic fluid flow problems. The algorithm is based on a parallel non-overlapping Schur complement domain-decomposition technique for triangulated domains. In the Schur complement technique, the triangulation is first partitioned into a number of non-overlapping subdomains and interfaces. This suggests a reordering of triangulation vertices which separates subdomain and interface solution unknowns. The reordering induces a natural 2 x 2 block partitioning of the discretization matrix. Exact LU factorization of this block system yields a Schur complement matrix which couples subdomains and the interface together. The remaining sections of this paper present a family of approximate techniques for both constructing and applying the Schur complement as a domain-decomposition preconditioner. The approximate Schur complement serves as an algebraic coarse space operator, thus avoiding the known difficulties associated with the direct formation of a coarse space discretization. In developing Schur complement approximations, particular attention has been given to improving sequential and parallel efficiency of implementations without significantly degrading the quality of the preconditioner. A computer code based on these developments has been tested on the IBM SP2 using MPI message passing protocol. A number of 2-D calculations are presented for both scalar advection-diffusion equations as well as the Euler equations governing compressible fluid flow to demonstrate performance of the preconditioning algorithm.

Barth, Timothy J.↗

NASA NTRS1967

Matrix Analysis of Longitudinal and Torsional Vibrations in Nonuniform Multibranch Beams

Since longitudinal modes and frequencies provide basic data for dynamic analyses of arbitrary beam-like structures and since closed-form solutions for the modes are generally not feasible to obtain, an approximate method is developed for computing the natural frequencies and the corresponding mode shapes for a variable-section, unconstrained multibranch beam. A lumped mass analogy employing influence coefficients is used to represent the beam. The simultaneous equations of motion for the lumped mass system are derived in matrix form and algebraically manipulated to yield a classical eigenvalue equation solvable by standard procedures. The orthogonality relationship of the natural modes is derived and used to form the basis of an orthogonal sweeping process for determination of modes above the fundamental. Numerical examples including an application to a solid-fuel launch system are presented. Also, a detailed discussion is devoted to the theoretical verifications of the approximate modes and frequencies.

Wingate, Robert T.↗

NASA NTRSDate not supplied

Interval Predictor Models for Robust System Identification

This paper proposes a framework for the identification and uncertainty quantification of plant models according to multivariable data. The only restriction imposed upon such models is for their outputs to depend continuously on their parameters. An Interval Predictor Model (IPM) prescribes the parameters of a computational model as a path-connected set thereby making each predicted output an interval-valued function of its inputs. The formulation proposed seeks the parameter set for which the predicted outputs tightly enclose the data. This set, which is modeled as a semi-algebraic set of low-degree polynomials, enables the characterization of possibly strong parameter dependencies commonly found in practice. This uncertainty characterization makes the resulting plant model amenable to robust control approaches using polynomial optimization. Furthermore, we use non-convex scenario theory to assess the reliability of the resulting IPM. This assessment yields a distribution-free upper bound on the probability that future data will fall outside the predicted intervals.

interval↗

DOE OSTI2017

SIRT-FILTER v1.0.0

PELT, DANIEL↗

DOE OSTI2024

Scalable Multiphysics Block Preconditioning for Low Mach Number Compressible Resistive MHD with Application to Magnetic Confinement Fusion

This study investigates multiphysics block preconditioners that are critical in devising scalable Newton–Krylov iterative solvers for longer time-scale fully implicit fluid plasma models. The specific model of interest is the visco-resistive, low Mach number, compressible magnetohydrodynamics (MHD) model. This model describes the dynamics of conducting fluids in the presence of electromagnetic fields and can be used to study aspects of astrophysical phenomena, important science and technology applications, and basic plasma physics. The specific application of interest that motivates this study is the macroscopic simulation of longer time-scale stability and disruptions of magnetic confinement fusion devices, specifically the ITER Tokamak. The computational solution of the governing balance equations for mass, momentum, heat transfer, and magnetic induction for resistive MHD systems can be extremely challenging. These difficulties arise from both the strong nonlinear, nonsymmetric coupling of fluid and electromagnetic phenomena as well as the significant range of time and length scales that the interactions of these physical mechanisms produce. To handle the range of time and spatial scales of interest, a fully implicit unstructured variational multiscale finite element formulation is employed. For the scalable solution of the Newton linearized systems, fully coupled block preconditioners are designed to leverage algebraic multigrid subsolves. In conclusion, results are presented for the strong and weak scaling of the method as well as the robustness of these techniques for a large range of Lundquist numbers.

97 MATHEMATICS AND COMPUTING↗