Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “iterative 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,549 records · Page 86
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

Advanced Applications of Adifor 3.0 for Efficient Calculation of First-and Second-Order CFD Sensitivity Derivatives

This final report will document the accomplishments of the work of this project. 1) The incremental-iterative (II) form of the reverse-mode (adjoint) method for computing first-order (FO) aerodynamic sensitivity derivatives (SDs) has been successfully implemented and tested in a 2D CFD code (called ANSERS) using the reverse-mode capability of ADIFOR 3.0. These preceding results compared very well with similar SDS computed via a black-box (BB) application of the reverse-mode capability of ADIFOR 3.0, and also with similar SDs calculated via the method of finite differences. 2) Second-order (SO) SDs have been implemented in the 2D ASNWERS code using the very efficient strategy that was originally proposed (but not previously tested) of Reference 3, Appendix A. Furthermore, these SO SOs have been validated for accuracy and computational efficiency. 3) Studies were conducted in Quasi-1D and 2D concerning the smoothness (or lack of smoothness) of the FO and SO SD's for flows with shock waves. The phenomenon is documented in the publications of this study (listed subsequently), however, the specific numerical mechanism which is responsible for this unsmoothness phenomenon was not discovered. 4) The FO and SO derivatives for Quasi-1D and 2D flows were applied to predict aerodynamic design uncertainties, and were also applied in robust design optimization studies.

Taylor, Arthur C., III↗
NASA NTRS2012

Rate-compatible protograph LDPC code families with linear minimum distance

Digital communication coding methods are shown, which generate certain types of low-density parity-check (LDPC) codes built from protographs. A first method creates protographs having the linear minimum distance property and comprising at least one variable node with degree less than 3. A second method creates families of protographs of different rates, all having the linear minimum distance property, and structurally identical for all rates except for a rate-dependent designation of certain variable nodes as transmitted or non-transmitted. A third method creates families of protographs of different rates, all having the linear minimum distance property, and structurally identical for all rates except for a rate-dependent designation of the status of certain variable nodes as non-transmitted or set to zero. LDPC codes built from the protographs created by these methods can simultaneously have low error floors and low iterative decoding thresholds, and families of such codes of different rates can be decoded efficiently using a common decoding architecture.

Divsalar, Dariush↗
NASA NTRS2012

Rate-compatible protograph LDPC code families with linear minimum distance

Digital communication coding methods are shown, which generate certain types of low-density parity-check (LDPC) codes built from protographs. A first method creates protographs having the linear minimum distance property and comprising at least one variable node with degree less than 3. A second method creates families of protographs of different rates, all structurally identical for all rates except for a rate-dependent designation of certain variable nodes as transmitted or non-transmitted. A third method creates families of protographs of different rates, all structurally identical for all rates except for a rate-dependent designation of the status of certain variable nodes as non-transmitted or set to zero. LDPC codes built from the protographs created by these methods can simultaneously have low error floors and low iterative decoding thresholds.

Divsalar, Dariush↗
NASA NTRS2017

Radiation, Smoke and Clouds Observed in the Southeastern Atlantic With the Research Scanning Polarimeter During ORACLES

The ObseRvations of Aerosols above Clouds and their interactions (ORACLES) project is making a series of field deployments to the southeastern Atlantic with NASA ER-2 and P3 aircraft to acquire both detailed remote sensing observations and in situ measurements of the aerosols and clouds in that region. This area is home to one of the largest low-level cloud decks on Earth that is seasonally affected by vast plumes of smoke from biomass burning, which in effect provides a natural experiment testing the radiative and microphysical interactions between the smoke and the clouds. The downward solar radiation at the surface, or cloud top, is always reduced by the presence of smoke. However, whether the amount of sunlight reflected back out to space is increased, or decreased by the presence of smoke is sensitively dependent on the brightness of the clouds and the fraction of light that the smoke absorbs each time light hits a smoke particle. In this study we use data from the Research Scanning Polarimeter, an along track scanning instrument, that provides measurements of the Stokes parameters I, Q and U at 410, 470, 555, 670, 865, 960, 1590, 1880 and 2260 nm at 150 viewing angles over a range of +/- 60° from nadir for each contiguous sub-aircraft pixel (~ 300 m in size). A retrieval algorithm is applied to the data acquired with a table look up technique, similar to that of the operational POLDER algorithm, to provide a first guess of the complex refractive index, optical depth and size distribution of the smoke particles together with cloud droplet size and optical depth. A subsequent iterative fitting procedure, where the fact that the doubling/adding method allows the construction of the Green's function for the radiative transfer equation, is used to obtain an efficient and statistically optimal estimate of the aerosol and cloud retrieval parameters. These retrieval parameters are evaluated against in situ observations, when available, and the optical depth and intensive lidar variables that are measured by the High Spectral Resolution Lidar 2. Finally, the aerosol and cloud retrievals are used to evaluate the variations in top of the atmosphere, surface/cloud top shortwave radiative forcing and atmospheric absorption that are caused by variations in the smoke and clouds.

Cairns, Brian↗
NASA NTRS2020

Predicting Gate Conflicts at Charlotte Douglas International Airport Using NASA ATD-2 Fused Data Sources

NASA is conducting the Airspace Technology Demonstration-2 to evaluate an Integrated Arrival, Departure, and Surface (IADS) traffic management system. The IADS system is powered by real-time System Wide Information Management feeds which provide an accurate and high fidelity view of the lifecycle of a flight. This data can be leveraged to drive efficiencies in the National Airspace System. For non safety critical applications there is opportunity for third party service providers to offer this type of data-driven prediction service in near real-time. This paper investigates the gate conflict prediction problem as a concrete use case which could help drive efficiencies. We model gate conflicts as a regression problem and describe the iterative process of model building, model validation, and evaluation used to assess the efficacy of our approach. We quantify our predictive accuracy and identify paths for improvement. Through this iterative process we hope to evolve our models and methods to a near real-time prediction service.

Airspace Technology Demonstration 2↗
NASA NTRS2019

Point-to-CAD 3D registration algorithm for relative navigation using depth-based maps

This paper presents an end-to-end 3D registration algorithm for relative navigation between known objects based on a point-to-CAD iterative closest point (ICP) principle. The objective of this method is to take in a measured point cloud extracted from a depth or disparity map – such as the ones obtained from stereo cameras, time-of-flight cameras, LiDARs, or depth from defocus sensors – and calculate the rigid body transformation that best aligns the measured data with a corresponding 3D CAD model.

Setterfield, Timothy P.↗
NASA NTRSDate not supplied

Combined Bernstein Polynomial, Optimal Reciprocal Collision Avoidance, Differential Dynamic Programming for Trajectory Replanning and Collision Avoidance for UAM Vehicles

This paper presents an integration of Differential Dynamic Programming (DDP) with the Optimal Reciprocal Collision Avoidance (ORCA) algorithm as the basis for a new algorithm, titled Combined Bernstein Polynomial Optimal Reciprocal Collision Avoidance DDP (COBRA-DDP), for trajectory replanning and collision avoidance for Urban Air Mobility (UAM) vehicles. State-constrained variants of DDP provide the ability to plan trajectories while avoiding obstacles, but these methods require a large increase in computational time per iteration which hinders the overall speed of the algorithm. ORCA utilizes simplified dynamics to recognize potential collisions along a trajectory and provides an optimal velocity for the avoidance of multiple vehicles. These velocity commands, however, may not result in a dynamically feasible trajectory for DDP to plan around. As such, a Bernstein polynomial curve that considers the general dynamic constraints of the vehicle is generated to approximate a trajectory based on the velocity commands. COBRA-DDP optimizes this suggested trajectory via unconstrained DDP to provide a dynamically feasible trajectory that provides collision avoidance. This new trajectory can be applied to the vehicle or used to warm start the state constrained DDP algorithms to decrease computation time. Its benefits and effectiveness of the algorithm are demonstrated on a UAM Vertical Takeoff and Landing (VTOL) vehicle simulation with highly nonlinear dynamics.

Optimal Reciprocal Collision Avoidance↗
DOE OSTI2020

Designing a parallel Feel-the-Way clustering algorithm on HPC systems

This paper introduces a new parallel clustering algorithm, named Feel-the-Way clustering algorithm, that provides better or equivalent convergence rate than the traditional clustering methods by optimizing the synchronization and communication costs. Our algorithm design centers on how to optimize three factors simultaneously: reduced synchronizations, improved convergence rate, and retained same or comparable optimization cost. To compare the optimization cost, we use the Sum of Square Error (SSE) cost as the metric, which is the sum of the square distance between each data point and its assigned clusters. Compared with the traditional MPI k-means algorithm, the new Feel-the-Way algorithm requires less communications among participating processes. As for the convergence rate, the new algorithm requires fewer number of iterations to converge. As for the optimization cost, it obtains the SSE costs that are close to the k-means algorithm. In the paper, we first design the full-step Feel-the-Way k-means clustering algorithm that can significantly reduce the number of iterations that are required by the original k-means clustering method. Next, we improve the performance of the full-step algorithm by adopting an optimized sampling-based approach, named reassignment-history-aware sampling. Our experimental results show that the optimized sampling-based Feel-the-Way method is significantly faster than the widely used k-means clustering method, and can provide comparable optimization costs. More extensive experiments with several synthetic datasets and real-world datasets (e.g., MNIST, CIFAR-10, ENRON, and PLACES-2) show that the new parallel algorithm can outperform the open source MPI k-means library by up to 110% on a high-performance computing system using 4,096 CPU cores. In addition, the new algorithm can take up to 51% fewer iterations to converge than the k-means clustering algorithm.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

The MHOST finite element program: 3-D inelastic analysis methods for hot section components. Volume 3: Systems' manual

The internal structure is discussed of the MHOST finite element program designed for 3-D inelastic analysis of gas turbine hot section components. The computer code is the first implementation of the mixed iterative solution strategy for improved efficiency and accuracy over the conventional finite element method. The control structure of the program is covered along with the data storage scheme and the memory allocation procedure and the file handling facilities including the read and/or write sequences.

Nakazawa, Shohei↗
NASA NTRS1990

Shape optimization for maximum stability and dynamic stiffness

Any optimization of structures for maximum stability or for maximum dynamic stiffness deals with an eigenvalue problem. The goal of this optimization is to raise the lowest eigenvalue (or eigenvalues) of the problem to its highest (optimal) level at a constant volume of the structure. Likely the lowest eigenvalue may be either inherently multi-modal or it can become multi-modal as a result of the optimization process. The multimodeness introduces some ambiguity to the eigenvalue problem and make the optimization difficult to handle. Thus far, only the simplest cases of multi-modal structures have been effectively optimized using rather elaborate analytical methods. Numerous publications report design of a minimum volume structure with different eigenvalues constraints, in which, however, the modality of the problem is assumed a priori. The method presented here utilizes a multi-modal optimality criteria and allows for inclusion of an arbitrary number of buckling or vibrations modes which might influence the optimization process. The real multi-modality of the problem, that is the number of modes participating in the final optimal design is determined iteratively. Because of a natural use of the FEM technique the method is easy to program and might be helpful in design of large flexible space structures.

Szyszkowski, W.↗
NASA NTRS1976

A study of sound transmission in curved duct bends by the Galerkin method

A computational procedure based on the Galerkin method is developed to study the sound transmission and reflection characteristics of circularly curved bends of rectangular ducts. This procedure is adaptable to routine computer calculation. An important component of the computer program consists of a QR iterative algorithm which solves the matrix eigenvalue problem generated by the Galerkin method. The present procedure produced very satisfactory convergent results when applied even to cases where the incident wave has high frequency and high wave mode numbers. Some properties of the Galerkin solution are investigated. Its relationship to the classical solution by the method of separation of variables is discussed.

Tam, C. K. W.↗
NASA NTRS1993

A multigrid method for steady Euler equations on unstructured adaptive grids

A flux-difference splitting type algorithm is formulated for the steady Euler equations on unstructured grids. The polynomial flux-difference splitting technique is used. A vertex-centered finite volume method is employed on a triangular mesh. The multigrid method is in defect-correction form. A relaxation procedure with a first order accurate inner iteration and a second-order correction performed only on the finest grid, is used. A multi-stage Jacobi relaxation method is employed as a smoother. Since the grid is unstructured a Jacobi type is chosen. The multi-staging is necessary to provide sufficient smoothing properties. The domain is discretized using a Delaunay triangular mesh generator. Three grids with more or less uniform distribution of nodes but with different resolution are generated by successive refinement of the coarsest grid. Nodes of coarser grids appear in the finer grids. The multigrid method is started on these grids. As soon as the residual drops below a threshold value, an adaptive refinement is started. The solution on the adaptively refined grid is accelerated by a multigrid procedure. The coarser multigrid grids are generated by successive coarsening through point removement. The adaption cycle is repeated a few times. Results are given for the transonic flow over a NACA-0012 airfoil.

Riemslagh, Kris↗
NASA NTRS1973

Iterative techniques to estimate signature vectors for mixture processing of multispectral data

Two methods for obtaining the required spectral signatures for a particular mixture model are considered. For the model considered, the spectral signatures become signature vectors. The first method is based upon determination of the signature vectors in such a way that a measure of the inconsistency between the mixture model and the observed data is minimized. The second method is based upon determination of the signature vectors in such a way that the estimated mean percentage coverage of individual species matches apriori or ground truth estimates. The two methods proposed are applied to actual multispectral data in order to verify the concepts presented.

Salvato, P., Jr.↗
DOE OSTI2025

Fast and Invertible Simplicial Approximation of Magnetic‐Following Interpolation for Visualizing Fusion Plasma Simulation Data

We introduce a fast and invertible approximation for fusion plasma simulation data represented as 2D planar meshes with connectivities approximating magnetic field lines along the toroidal dimension in deformed 3D toroidal spaces. Scientific variables (e.g., density and temperature) in these fusion data are interpolated following a complex magnetic-field-line-following scheme in the toroidal space represented by a cylindrical coordinate system. This deformation in the 3D space poses challenges for root-finding and interpolation. To this end, we propose a novel paradigm for visualizing and analyzing such data based on a newly developed algorithm for constructing a 3D simplicial mesh within the deformed 3D space. Our algorithm generates a tetrahedral mesh that connects the 2D meshes using tetrahedra while adhering to the constraints on node connectivities imposed by the magnetic field-line scheme. Specifically, we first divide the space into smaller partitions to reduce complexity based on the input geometries and constraints on connectivities. Then, we independently search for a feasible tetrahedralization of each partition, considering nonconvexity. We demonstrate our method with two X-Point Gyrokinetic Code (XGC) simulation datasets on the International Thermonuclear Experimental Reactor (ITER) and Wendelstein 7-X (W7-X), and use an ocean simulation dataset to substantiate broader applicability of our method. An open source implementation of our algorithm is available at https://github.com/rcrcarissa/DeformedSpaceTet.

Ren, Congrong [The Ohio State Univ., Columbus, OH ↗
DOE OSTI2025

One-shot learning for solution operators of partial differential equations

Learning and solving governing equations of a physical system, represented by partial differential equations (PDEs), from data is a central challenge in many areas of science and engineering. Traditional numerical methods can be computationally expensive for complex systems and require complete governing equations. Existing data-driven machine learning methods require large datasets to learn a surrogate solution operator, which could be impractical. Here, we propose a solution operator learning method that requires only one PDE solution, i.e., one-shot learning, along with suitable initial and boundary conditions. Leveraging the locality of derivatives, we define a local solution operator in small local domains, train it using a neural network, and use it to predict solutions of new input functions via mesh-based fixed-point iteration or meshfree neural-network based approaches. We test our method on various PDEs, complex geometries, and a practical spatial infection spread application, demonstrating its effectiveness and generalization capabilities.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2002

Finite-Strain Fractional-Order Viscoelastic (FOV) Material Models and Numerical Methods for Solving Them

Fraction-order viscoelastic (FOV) material models have been proposed and studied in 1D since the 1930's, and were extended into three dimensions in the 1970's under the assumption of infinitesimal straining. It was not until 1997 that Drozdov introduced the first finite-strain FOV constitutive equations. In our presentation, we shall continue in this tradition by extending the standard, FOV, fluid and solid, material models introduced in 1971 by Caputo and Mainardi into 3D constitutive formula applicable for finite-strain analyses. To achieve this, we generalize both the convected and co-rotational derivatives of tensor fields to fractional order. This is accomplished by defining them first as body tensor fields and then mapping them into space as objective Cartesian tensor fields. Constitutive equations are constructed using both variants for fractional rate, and their responses are contrasted in simple shear. After five years of research and development, we now possess a basic suite of numerical tools necessary to study finite-strain FOV constitutive equations and their iterative refinement into a mature collection of material models. Numerical methods still need to be developed for efficiently solving fraction al-order integrals, derivatives, and differential equations in a finite element setting where such constitutive formulae would need to be solved at each Gauss point in each element of a finite model, which can number into the millions in today's analysis.

Freed, Alan D.↗
NASA NTRS1994

An implicit numerical scheme for the simulation of internal viscous flows on unstructured grids

The Navier-Stokes equations are solved numerically for two-dimensional steady viscous laminar flows. The grids are generated based on the method of Delaunay triangulation. A finite-volume approach is used to discretize the conservation law form of the compressible flow equations written in terms of primitive variables. A preconditioning matrix is added to the equations so that low Mach number flows can be solved economically. The equations are time marched using either an implicit Gauss-Seidel iterative procedure or a solver based on a conjugate gradient like method. A four color scheme is employed to vectorize the block Gauss-Seidel relaxation procedure. This increases the memory requirements minimally and decreases the computer time spent solving the resulting system of equations substantially. A factor of 7.6 speed up in the matrix solver is typical for the viscous equations. Numerical results are obtained for inviscid flow over a bump in a channel at subsonic and transonic conditions for validation with structured solvers. Viscous results are computed for developing flow in a channel, a symmetric sudden expansion, periodic tandem cylinders in a cross-flow, and a four-port valve. Comparisons are made with available results obtained by other investigators.

Jorgenson, Philip C. E.↗