SEARCH · Engineering Papers

Results for “Decomposition algorithm”

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

All sources NASA NTRS DOE OSTI

NASA NTRS1998

Real Gas Computation Using an Energy Relaxation Method and High-Order WENO Schemes

In this paper, we use a recently developed energy relaxation theory by Coquel and Perthame and high order weighted essentially non-oscillatory (WENO) schemes to simulate the Euler equations of real gas. The main idea is an energy decomposition into two parts: one part is associated with a simpler pressure law and the other part (the nonlinear deviation) is convected with the flow. A relaxation process is performed for each time step to ensure that the original pressure law is satisfied. The necessary characteristic decomposition for the high order WENO schemes is performed on the characteristic fields based on the first part. The algorithm only calls for the original pressure law once per grid point per time step, without the need to compute its derivatives or any Riemann solvers. Both one and two dimensional numerical examples are shown to illustrate the effectiveness of this approach.

Montarnal, Philippe↗

NASA NTRS1999

How to Estimate Attitude from Vector Observations

The most robust estimators minimizing Wahba's loss function are Davenport's q method and the Singular Value Decomposition (SVD) method. The q method is faster than the SVD method with three or more measurements. The other algorithms are less robust since they solve the characteristic polynomial equation to find the maximum eigenvalue of Davenport's K matrix. They are only preferable when speed or processor power is an important consideration. Of these, Fast Optimal Attitude Matrix (FOAM) is the most robust and faster than the q method. Robustness is only an issue for measurements with widely differing accuracies, so the fastest algorithms, Quaternion ESTimator (QUEST), EStimator of the Optimal Quaternion (ESOQ), and ESOQ2, are well suited to star sensor applications.

Markley, F. Landis↗

NASA NTRS2000

New Developments in Quaternion Estimation from Vector Observations

This paper contains a critical comparison of estimators minimizing Wahba's loss function. Some new results are presented for the QUaternion ESTimator (QUEST) and EStimators of the Optimal Quaternion (ESOQ and ESOQ2) to avoid the computational burden of sequential rotations in these algorithms. None of these methods is as robust in principle as Davenport's q method or the Singular Value Decomposition (SVD) method, which are significantly slower. Robustness is only an issue for measurements with widely differing accuracies, so the fastest estimators, the modified ESOQ and ESOQ2, are well suited to sensors that track multiple stars with comparable accuracies. More robust forms of ESOQ and ESOQ2 are developed that are intermediate in speed.

Markley, F. Landis↗

NASA NTRS2007

Application of the Hilbert-Huang Transform to the Search for Gravitational Waves

We present the application of a novel method of time-series analysis, the Hilbert-Huang Transform, to the search for gravitational waves. This algorithm is adaptive and does not impose a basis set on the data, and thus the time-frequency decomposition it provides is not limited by time-frequency uncertainty spreading. Because of its high time-frequency resolution it has important applications to both signal detection and instrumental characterization. Applications to the data analysis of the ground and space based gravitational wave detectors, LIGO and LISA, are described.

Camp, Jordan B.↗

NASA NTRS2024

A Convexification-Based Outer-Approximation Method for Convex and Nonconvex MINLP

The advancement of domain reduction techniques has significantly enhanced the performance of solvers in mathematical programming. This paper delves into the impact of integrating convexification and domain reduction techniques within the Outer-Approximation method. We propose a refined convexification-based Outer-Approximation method alongside a Branch-and-Bound method for both convex and nonconvex Mixed-Integer Nonlinear Programming problems. These methods have been developed and incorporated into the open-source Mixed-Integer Nonlinear Decomposition Toolbox for Pyomo-MindtPy. Comprehensive benchmark tests were conducted, validating the effectiveness and reliability of our proposed algorithms. These tests highlight the improvements achieved by incorporating convexification and domain reduction techniques into the Outer-Approximation and Branch-and-Bound methods.

Optimization↗

NASA NTRS1992

Approximation, abstraction and decomposition in search and optimization

In this paper, I discuss four different areas of my research. One portion of my research has focused on automatic synthesis of search control heuristics for constraint satisfaction problems (CSPs). I have developed techniques for automatically synthesizing two types of heuristics for CSPs: Filtering functions are used to remove portions of a search space from consideration. Another portion of my research is focused on automatic synthesis of hierarchic algorithms for solving constraint satisfaction problems (CSPs). I have developed a technique for constructing hierarchic problem solvers based on numeric interval algebra. Another portion of my research is focused on automatic decomposition of design optimization problems. We are using the design of racing yacht hulls as a testbed domain for this research. Decomposition is especially important in the design of complex physical shapes such as yacht hulls. Another portion of my research is focused on intelligent model selection in design optimization. The model selection problem results from the difficulty of using exact models to analyze the performance of candidate designs.

Ellman, Thomas↗

NASA NTRS1992

Transonic solutions of a wing/pylon/finned store using hybrid domain decomposition

Transonic Euler calculations about a complex multicomponent configuration are presented. The 3D Euler equations are solved utilizing an upwind-biased, alternating direction implicit, approximately factored, multigrid algorithm. Computational results are compared to experimental data of the finned store in a carriage position.

Newman, James C., III↗

NASA NTRS1974

Earth resources data analysis program, phase 2

The efforts and findings of the Earth Resources Data Analysis Program are summarized. Results of a detailed study of the needs of EOD with respect to an applications development system (ADS) for the analysis of remotely sensed data, including an evaluation of four existing systems with respect to these needs are described. Recommendations as to possible courses for EOD to follow to obtain a viable ADS are presented. Algorithmic development comprised of several subtasks is discussed. These subtasks include the following: (1) two algorithms for multivariate density estimation; (2) a data smoothing algorithm; (3) a method for optimally estimating prior probabilities of unclassified data; and (4) further applications of the modified Cholesky decomposition in various calculations. Little effort was expended on task 3, however, two reports were reviewed.

Source record↗

NASA NTRS1987

An eigensystem realization algorithm using data correlations (ERA/DC) for modal parameter identification

A modification to the Eigensystem Realization Algorithm (ERA) for modal parameter identification is presented in this paper. The ERA minimum order realization approach using singular value decomposition is combined with the philosophy of the Correlation Fit method in state space form such that response data correlations rather than actual response values are used for modal parameter identification. This new method, the ERA using data correlations (ERA/DC), reduces bias errors due to noise corruption significantly without the need for model overspecification. This method is tested using simulated five-degree-of-freedom system responses corrupted by measurement noise. It is found for this case that, when model overspecification is permitted and a minimum order solution obtained via singular value truncation, the results from the two methods are of similar quality.

Juang, Jer-Nan↗

NASA NTRS1990

An overlapped grid method for multigrid, finite volume/difference flow solvers: MaGGiE

The objective is to develop a domain decomposition method via overlapping/embedding the component grids, which is to be used by upwind, multi-grid, finite volume solution algorithms. A computer code, given the name MaGGiE (Multi-Geometry Grid Embedder) is developed to meet this objective. MaGGiE takes independently generated component grids as input, and automatically constructs the composite mesh and interpolation data, which can be used by the finite volume solution methods with or without multigrid convergence acceleration. Six demonstrative examples showing various aspects of the overlap technique are presented and discussed. These cases are used for developing the procedure for overlapping grids of different topologies, and to evaluate the grid connection and interpolation data for finite volume calculations on a composite mesh. Time fluxes are transferred between mesh interfaces using a trilinear interpolation procedure. Conservation losses are minimal at the interfaces using this method. The multi-grid solution algorithm, using the coaser grid connections, improves the convergence time history as compared to the solution on composite mesh without multi-gridding.

Baysal, Oktay↗

NASA NTRS2002

Progress in the Simulation of Steady and Time-Dependent Flows with 3D Parallel Unstructured Cartesian Methods

The proposed paper will present recent extensions in the development of an efficient Euler solver for adaptively-refined Cartesian meshes with embedded boundaries. The paper will focus on extensions of the basic method to include solution adaptation, time-dependent flow simulation, and arbitrary rigid domain motion. The parallel multilevel method makes use of on-the-fly parallel domain decomposition to achieve extremely good scalability on large numbers of processors, and is coupled with an automatic coarse mesh generation algorithm for efficient processing by a multigrid smoother. Numerical results are presented demonstrating parallel speed-ups of up to 435 on 512 processors. Solution-based adaptation may be keyed off truncation error estimates using tau-extrapolation or a variety of feature detection based refinement parameters. The multigrid method is extended to for time-dependent flows through the use of a dual-time approach. The extension to rigid domain motion uses an Arbitrary Lagrangian-Eulerlarian (ALE) formulation, and results will be presented for a variety of two- and three-dimensional example problems with both simple and complex geometry.

Aftosmis, M. J.↗

NASA NTRS1983

The computation of inviscid rotational gasdynamic flows using an alternate velocity decompositon

The present investigation has the objective to present a method which can be considered to be a modification of existing potential flow algorithms. The method can be employed for the accurate and efficient solution of rotational gasdynamic flows. The general approach to computing inviscid rotational flows considered makes use of a velocity decomposition discussed by Clebsch (1859). Recent applications of the Clebsch representation in inviscid flows have involved the convection of an externally generated vorticity. Attention is given to the case of a steady, inviscid flow of a perfect gas with a uniform incoming stream. The developed procedure makes it possible to obtain a rapid solution to inviscid, compressible, rotational flows with solution algorithms which are a modification of existing potential flow codes. An application of the procedure to supersonic rotational conical flow is discussed.

Grossman, B.↗

NASA NTRS2010

Algorithm for Stabilizing a POD-Based Dynamical System

This algorithm provides a new way to improve the accuracy and asymptotic behavior of a low-dimensional system based on the proper orthogonal decomposition (POD). Given a data set representing the evolution of a system of partial differential equations (PDEs), such as the Navier-Stokes equations for incompressible flow, one may obtain a low-dimensional model in the form of ordinary differential equations (ODEs) that should model the dynamics of the flow. Temporal sampling of the direct numerical simulation of the PDEs produces a spatial time series. The POD extracts the temporal and spatial eigenfunctions of this data set. Truncated to retain only the most energetic modes followed by Galerkin projection of these modes onto the PDEs obtains a dynamical system of ordinary differential equations for the time-dependent behavior of the flow. In practice, the steps leading to this system of ODEs entail numerically computing first-order derivatives of the mean data field and the eigenfunctions, and the computation of many inner products. This is far from a perfect process, and often results in the lack of long-term stability of the system and incorrect asymptotic behavior of the model. This algorithm describes a new stabilization method that utilizes the temporal eigenfunctions to derive correction terms for the coefficients of the dynamical system to significantly reduce these errors.

Kalb, Virginia L.↗

NASA NTRS1992

Neural network based decomposition in optimal structural synthesis

The present paper describes potential applications of neural networks in the multilevel decomposition based optimal design of structural systems. The generic structural optimization problem of interest, if handled as a single problem, results in a large dimensionality problem. Decomposition strategies allow for this problem to be represented by a set of smaller, decoupled problems, for which solutions may either be obtained with greater ease or may be obtained in parallel. Neural network models derived through supervised training, are used in two distinct modes in this work. The first uses neural networks to make available efficient analysis models for use in repetitive function evaluations as required by the optimization algorithm. In the second mode, neural networks are used to represent the coupling that exists between the decomposed subproblems. The approach is illustrated by application to the multilevel decomposition-based synthesis of representative truss and frame structures.

Hajela, P.↗

NASA NTRS1983

Algorithms for on-line parameter and mode shape estimation

Algorithms are presented for on-line parameter and mode-shape estimation. The approach used is based upon a modal decomposition of the dynamic response of the flexible structure and is designed to make use of the parallel processing features of modern minicomputers. Satisfactory performance of the parallel structure identification technique used can be achieved only when the approximation functions noted correspond to the natural modes of the flexible structure. The work summarized here presents a technique for estimating both mode shapes and modal parameters.

Thau, F. E.↗

NASA NTRS1986

Optimal design of structures with multiple design variables per group and multiple loading conditions on the personal computer

A finite element based programming system for minimum weight design of a truss-type structure subjected to displacement, stress, and lower and upper bounds on design variables is presented. The programming system consists of a number of independent processors, each performing a specific task. These processors, however, are interfaced through a well-organized data base, thus making the tasks of modifying, updating, or expanding the programming system much easier in a friendly environment provided by many inexpensive personal computers. The proposed software can be viewed as an important step in achieving a 'dummy' finite element for optimization. The programming system has been implemented on both large and small computers (such as VAX, CYBER, IBM-PC, and APPLE) although the focus is on the latter. Examples are presented to demonstrate the capabilities of the code. The present programming system can be used stand-alone or as part of the multilevel decomposition procedure to obtain optimum design for very large scale structural systems. Furthermore, other related research areas such as developing optimization algorithms (or in the larger level: a structural synthesis program) for future trends in using parallel computers may also benefit from this study.

Nguyen, D. T.↗

NASA NTRSDate not supplied

Application of an Affine Nonlinear Galerkin Reduced-order Model to Compressible Fluid Flows

Galerkin reduced-order models (ROMs) often struggle to accurately capture multiscale fluid physics in challenging flow regimes such as flows experiencing compressibility effects. This in part stems from the global nature of both the basis construction problem and the spectral formulation itself. In this work, a multi-basis ROM is developed in an affine space based on proper orthogonal decomposition (POD) by projecting the full Navier-Stokes equations expressed in terms of the specific volume, velocity, and pressure primitive variables. The model is applied to high-fidelity numerical simulation datasets obtained for a canonical compressible flow configuration: the flow over a backward facing step at different subsonic Mach numbers. It is observed that application of an eigenvalue reassignment (ER) stabilization method is required to avoid early divergence of the ROM predictions for this configuration in the three Mach numbers tested. The sensitivity of the POD-ROM results to the choice of parameters in the stabilization algorithm is discussed.

reduced-order model↗

NASA NTRSDate not supplied

Application of an Affine Nonlinear Galerkin Reduced-order Model to Compressible Fluid Flows

reduced-order model↗