Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical algorithms”

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 253 records · Page 14

Initial Results of an MDO Method Evaluation Study

The NASA Langley MDO method evaluation study seeks to arrive at a set of guidelines for using promising MDO methods by accumulating and analyzing computational data for such methods. The data are collected by conducting a series of re- producible experiments. In the first phase of the study, three MDO methods were implemented in the SIGHT: framework and used to solve a set of ten relatively simple problems. In this paper, we comment on the general considerations for conducting method evaluation studies and report some initial results obtained to date. In particular, although the results are not conclusive because of the small initial test set, other formulations, optimality conditions, and sensitivity of solutions to various perturbations. Optimization algorithms are used to solve a particular MDO formulation. It is then appropriate to speak of local convergence rates and of global convergence properties of an optimization algorithm applied to a specific formulation. An analogous distinction exists in the field of partial differential equations. On the one hand, equations are analyzed in terms of regularity, well-posedness, and the existence and unique- ness of solutions. On the other, one considers numerous algorithms for solving differential equations. The area of MDO methods studies MDO formulations combined with optimization algorithms, although at times the distinction is blurred. It is important to

Alexandrov, Natalia M.↗

Cross-correlation analysis of X-ray photon correlation spectroscopy to extract rotational diffusion coefficients

Coefficients for translational and rotational diffusion characterize the Brownian motion of particles. Emerging X-ray photon correlation spectroscopy (XPCS) experiments probe a broad range of length scales and time scales and are well-suited for investigation of Brownian motion. While methods for estimating the translational diffusion coefficients from XPCS are well-developed, there are no algorithms for measuring the rotational diffusion coefficients based on XPCS, even though the required raw data are accessible from such experiments. In this paper, we propose angular-temporal cross-correlation analysis of XPCS data and show that this information can be used to design a numerical algorithm (Multi-Tiered Estimation for Correlation Spectroscopy [MTECS]) for predicting the rotational diffusion coefficient utilizing the cross-correlation: This approach is applicable to other wavelengths beyond this regime. We verify the accuracy of this algorithmic approach across a range of simulated data.

97 MATHEMATICS AND COMPUTING↗

Numerical solutions of 2-D multi-stage rotor/stator unsteady flow interactions

The Rai method of single-stage rotor/stator flow interaction is extended to handle multistage configurations. In this study, a two-dimensional Navier-Stokes multi-zone approach was used to investigate unsteady flow interactions within two multistage axial turbines. The governing equations are solved by an iterative, factored, implicit finite-difference, upwind algorithm. Numerical accuracy is checked by investigating the effect of time step size, the effect of subiteration in the Newton-Raphson technique, and the effect of full viscous versus thin-layer approximation. Computer results compared well with experimental data. Unsteady flow interactions, wake cutting, and the associated evolution of vortical entities are discussed.

Yang, R.-J.↗

Bayesian design of decision rules for failure detection

The formulation of the decision making process of a failure detection algorithm as a Bayes sequential decision problem provides a simple conceptualization of the decision rule design problem. As the optimal Bayes rule is not computable, a methodology that is based on the Bayesian approach and aimed at a reduced computational requirement is developed for designing suboptimal rules. A numerical algorithm is constructed to facilitate the design and performance evaluation of these suboptimal rules. The result of applying this design methodology to an example shows that this approach is potentially a useful one.

Chow, E. Y.↗

Use of the quasilinearization algorithm for the simulation of LSS slewing

The use of the Maximum Principle for the large angle slewing of large space structures (LSS) usually results in the so-called two-point boundary-value problem, in which many requirements (e.g., minimum time, small amplitude, and limited control power, etc.) must be satisfied simultaneously. The successful solution of this problem depends largely on the use of an efficient numerical algorithm. There are many candidate algorithms available for this problem (e.g., quasilinearization, gradient, etc.). Here researchers discuss only the quasilinearization method which has been used for several cases of large angle slewing of LSS. The basic idea of this algorithm is to make a series of successive approximations of the solution from a particular solvable case (linear or nonlinear) to a more general practical case. For the rigid spacecraft slewing problem with no constraints on the controls, the solution procedure can be found in the literature. This procedure needs to be modified if a minimum time for the slewing problem is desired with control limits given. Recently, an indirect method for finding the minimum time was developed to meet all these requirements. For the general mixed (including both rigid and flexible parts) problem, an additional constraint of small vibrational amplitude on the flexible parts is imposed.

Li, Feiyue↗

Halo orbit station keeping for International Sun-Earth Explorer-C /ISEE-C/

The ISEE-C spacecraft must be kept close to an unstable 'halo' orbit with a series of discrete orbital maneuvers set at intervals at least one month apart. A numerical algorithm has been developed to compute a velocity correction at any point on the trajectory which will minimize the distance between the satellite orbit and the nominal halo path. This algorithm is used to generate a number of station keeping histories with fixed time intervals between maneuvers to ascertain bounds on fuel cost, tightness of fit to nominal path and expected duration between thrust applications. The difference between a third order analytic representation of the halo orbit and a numerically improved nominal path as a reference orbit in the station keeping scheme is investigated as well as the distinction between a tight control and a loose control. A simulation of an operational approach to station keeping is also presented which shows that intermittant propulsive maneuvers can be used to control the spacecraft with very modest fuel expenditure.

Heuberger, H.↗

Frequency domain synthesis of optimal inputs for adaptive identification and control

The input design problem of selecting appropriate inputs for use in SISO adaptive identification and model reference adaptive control algorithms is considered. Averaging theory is used to characterize the optimal inputs in the frequency domain. The design problem is formulated as an optimization problem which maximizes the smallest eigenvalue of the average information matrix over power constrained signals, and the global optimal solution is obtained using a convergent numerical algorithm. A bound on the frequency search range required in the design algorithm has been determined in terms of the desired performance.

Fu, Li-Chen↗

Enhanced thermochemical nonequilibrium computations of flow around the aeroassist flight experiment vehicle

A three-dimensional explicit, finite-rate, shock-capturing numerical algorithm is used to calculate thermochemical nonequilibrium flowfields about the Aeroassist Flight Experiment vehicle at one of its flight trajectory points. The full Navier-Stokes equations and an eleven species chemical model with the latest reaction rates are incorporated into the code. Results are compared against experimental data and other numerical solutions. The effects of changes to the physical model on the stagnation line and base region flow and surface quantities on the forebody are investigated.

Palmer, Grant↗

An efficient reconstruction algorithm for diffusion on triangular grids using the nodal discontinuous Galerkin method

High-energy-density (HED) hydrodynamics studies such as those relevant to inertial confinement fusion and astrophysics require highly disparate densities, temperatures, viscosities, and other diffusion parameters over relatively short spatial scales. This presents a challenge for high-order accurate methods to effectively resolve the hydrodynamics at these scales, particularly in the presence of highly disparate diffusion. A significant volume of engineering and physics applications use an unstructured discontinuous Galerkin (DG) method developed based on the finite element mesh generation and algorithmic framework. This work discusses the application of an affine reconstructed nodal DG method for unstructured grids of triangles. Solving the diffusion terms in the DG method is non-trivial due to the solution representations being piecewise continuous. Hence, the diffusive flux is not defined on the interface of elements. The proposed numerical approach reconstructs a smooth solution in a parallelogram that is enclosed by the quadrilateral formed by two adjacent triangle elements. The interface between these two triangles is the diagonal of the enclosed parallelogram. Similar to triangles, the mapping of parallelograms from a physical domain to a reference domain is an affine mapping, which is necessary for an accurate and efficient implementation of the numerical algorithm. Thus, all computations can still be performed on the reference domain, which promotes efficiency in computation and storage. This reconstruction does not make assumptions on choice of polynomial basis. Reconstructed DG algorithms have previously been developed for modal implementations of the convection–diffusion equations. However, to the best of the authors’ knowledge, this is the first practical guideline that has been proposed for applying the reconstructed algorithm on a nodal discontinuous Galerkin method with a focus on accuracy and efficiency. As a result, the algorithm is demonstrated on a number of benchmark cases as well as a challenging substantive problem in HED hydrodynamics with highly disparate diffusion parameters.

Computational efficiency↗

Numerical arc segmentation algorithm for a radio conference: A software tool for communication satellite systems planning

The Numerical Arc Segmentation Algorithm for a Radio Conference (NASARC) provides a method of generating predetermined arc segments for use in the development of an allotment planning procedure to be carried out at the 1988 World Administrative Radio Conference (WARC) on the Use of the Geostationary Satellite Orbit and the Planning of Space Services Utilizing It. Through careful selection of the predetermined arc (PDA) for each administration, flexibility can be increased in terms of choice of system technical characteristics and specific orbit location while reducing the need for coordination among administrations. The NASARC software determines pairwise compatibility between all possible service areas at discrete arc locations. NASARC then exhaustively enumerates groups of administrations whose satellites can be closely located in orbit, and finds the arc segment over which each such compatible group exists. From the set of all possible compatible groupings, groups and their associated arc segments are selected using a heuristic procedure such that a PDA is identified for each administration. Various aspects of the NASARC concept and how the software accomplishes specific features of allotment planning are discussed.

Whyte, W. A.↗

Numerical Solutions to the Third CAA Workshop Benchmark Problems

This paper presents numerical solutions to the problems of propagation of sound waves through a transonic nozzle, shock-sound interactions, and automobile noise involving feedback of the third NASA Computational Aeroacoustics (CAA) Workshop on benchmark problems. The numerical algorithm is based on a dual time scheme for temporal discretization and a third-order finite volume scheme for spatial discretization. The aims of this study are to apply a dual time stepping scheme to treat aeroacoustic problems of sound propagation and to validate our CAA solver with the benchmark problems for developing a numerical tool for noise analysis and control.

Loh, Roy H.↗

Advances and trends in computational structures technology

The major goals of computational structures technology (CST) are outlined, and recent advances in CST are examined. These include computational material modeling, stochastic-based modeling, computational methods for articulated structural dynamics, strategies and numerical algorithms for new computing systems, multidisciplinary analysis and optimization. The role of CST in the future development of structures technology and the multidisciplinary design of future flight vehicles is addressed, and the future directions of CST research in the prediction of failures of structural components, the solution of large-scale structural problems, and quality assessment and control of numerical simulations are discussed.

Noor, A. K.↗

Updating finite element dynamic models using an element-by-element sensitivity methodology

A sensitivity-based methodology for improving the finite element model of a given structure using test modal data and a few sensors is presented. The proposed method searches for both the location and sources of the mass and stiffness errors and does not interfere with the theory behind the finite element model while correcting these errors. The updating algorithm is derived from the unconstrained minimization of the squared L sub 2 norms of the modal dynamic residuals via an iterative two-step staggered procedure. At each iteration, the measured mode shapes are first expanded assuming that the model is error free, then the model parameters are corrected assuming that the expanded mode shapes are exact. The numerical algorithm is implemented in an element-by-element fashion and is capable of 'zooming' on the detected error locations. Several simulation examples which demonstate the potential of the proposed methodology are discussed.

Farhat, Charbel↗

Martian thermal boundary layers: Subhourly variations induced by radiative-conductive heat transfer within the dust-laden atmosphere-ground system

Radiative-conductive heat transfer has been investigated for the ground-atmosphere system of the planet Mars. The basic goal was the quantitative determination of time dependent vertical distributions of temperature and static stability for Southern-Hemispheric summer season and middle and polar latitudes, for both dust-free and dust-laden atmospheric conditions. The numerical algorithm which models at high spatial and temporal resolution the thermal energy transports in the dual ground-atmosphere system, is based on solution of the applicable heating rate equation, including radiative and molecular-conductive heat transport terms. The two subsystems are coupled by an internal thermal boundary condition applied at the ground-atmosphere interface level. Initial data and input parameters are based on Mariner 4, 6, 7, and 9 measurements and the JPL Mars Scientific Model. Numerical experiments were run for dust-free and dust-laden conditions in the midlatitudes, as well as ice-free and ice-covered polar regions. Representative results and their interpretation are presented. Finally, the theoretical framework of the generalized problem with nonconservative Mie scattering and explicit thermal-convective heat transfer is formulated, and applicable solution algorithms are outlined.

Pallmann, A. J.↗

Inverse problems in diffraction

A two-dimensional problem of diffraction of a plane electromagnetic wave on a smooth 2 pi-periodic surface is considered. A numerical algorithm solving this problem is developed. An inverse problem of determination of the shape of 2 pi-periodic surface using the performance data of reverse scattering is considered. The inverse problem was solved by means of minimization of the residual functional with the help of the gradient descent method. The initial data were calculated with the help of the numerical method. On each step of the iterative method of minimization, the residual functional was calculated approximately with the help of the small slope method. The examples of the shape determination are considered.

Mikheev, Andrew G.↗

Polarized Bidirectional Reflectance of Optically Thick Sparse Particulate Layers: an Efficient Numerically Exact Radiative-Transfer Solution

We describe a simple yet efficient numerical algorithm for computing polarized bidirectional reflectance of an optically thick (semi-infinite), macroscopically flat layer composed of statistically isotropic and mirror symmetric random particles. The spatial distribution of the particles is assumed to be sparse, random, and statistically uniform. The 44 Stokes reflection matrix is calculated by iterating the Ambartsumian's vector nonlinear integral equation. The result is a numerically exact solution of the vector radiative transfer equation and as such fully satisfies the energy conservation law and the fundamental reciprocity relation. Since this technique bypasses the computation of the internal radiation field, it is very fast and highly accurate. The FORTRAN implementation of the technique is publicly available on the World Wide Web at http://www.giss.nasa.gov/staff/ mmishchenko/brf. It can be combined with several existing computer programs providing the requisite single-scattering properties of spherical or morphologically complex particles and applied to a wide range of optical characterization problems. Benchmark results obtained with this program can be used for testing alternative solvers of the vector radiative transfer equation.

radiative transfer↗

Numerical Simulations of Homogeneous Turbulence Using Lagrangian-Averaged Navier-Stokes Equations

The Lagrangian-averaged Navier-Stokes (LANS) equations are numerically evaluated as a turbulence closure. They are derived from a novel Lagrangian averaging procedure on the space of all volume-preserving maps and can be viewed as a numerical algorithm which removes the energy content from the small scales (smaller than some a priori fixed spatial scale alpha) using a dispersive rather than dissipative mechanism, thus maintaining the crucial features of the large scale flow. We examine the modeling capabilities of the LANS equations for decaying homogeneous turbulence, ascertain their ability to track the energy spectrum of fully resolved direct numerical simulations (DNS), compare the relative energy decay rates, and compare LANS with well-accepted large eddy simulation (LES) models.

Mohseni, Kamran↗

GentenMPI: Distributed Memory Sparse Tensor Decomposition

GentenMPl is a toolkit of sparse canonical polyadic (CP) tensor decomposition algorithms that is designed to run effectively on distributed-memory high-performance computers. Its use of distributed-memory parallelism enables it to efficiently decompose tensors that are too large for a single compute node's memory. GentenMPl leverages Sandia's decades-long investment in the Trilinos solver framework for much of its parallel-computation capability. Trilinos contains numerical algorithms and linear algebra classes that have been optimized for parallel simulation of complex physical phenomena. This work applies these tools to the data science problem of sparse tensor decomposition. In this report, we describe the use of Trilinos in GentenMPl, extensions needed for sparse tensor decomposition, and implementations of the CP-ALS (CP via alternating least squares) and GCP-SGD (generalized CP via stochastic gradient descent) sparse tensor decomposition algorithms. We show that GentenMPl can decompose sparse tensors of extreme size, e.g., a 12.6-terabyte tensor on 8192 computer cores. We demonstrate that the Trilinos backbone provides good strong and weak scaling of the tensor decomposition algorithms.

97 MATHEMATICS AND COMPUTING↗