Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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,171 records · Page 65

Air-to-Fuel Ratio Calculation Methods for Oxygenated Fuels in Two-Stroke Engines

In 1990, Roy Douglas developed an analytical method to calculate the global air-to-fuel ratio of a two-stroke engine from exhaust gas emissions. While this method has considerable application to two-stroke engines, it does not permit the calculation of air-to-fuel ratios for oxygenated fuels. This study proposed modifications to the Roy Douglas method such that it can be applied to oxygenated fuels. The ISO #16183 standard, the modified Spindt method, and the Brettschneider method were used to evaluate the modifications to the Roy Douglas method. In addition, a trapped air-to-fuel ratio, appropriate for two-stroke engines, was also modified to incorporate oxygenated fuels. To validate the modified calculation method, tests were performed using a two-stroke carbureted and two-stroke direct injected marine outboard engine over a five-mode marine test cycle running indolene and low level blends of ethanol and iso-butanol fuels. Results indicate that the modified air-fuel ratio method closely relates to the ISO #16183 standard. The modified Spindt method over-estimated the global air-to-fuel ratio. While the Brettschneider is considered an advancement over the Spindt method, it still provided an over-estimate of the air-to-fuel ratio. Applying a trapped air-to-fuel ratio calculation to the modified Roy Douglas method provided a calculation for trapped air-to-fuel ratio for two-stroke engine operation, which correlated with engine-out CO emissions. The trapped air-to-fuel ratio calculation also provided improvements in air-to-fuel ratio predictions, especially during idle conditions.

Sevik, James Michael↗

An historical survey of computational methods in optimal control.

Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.

Polak, E.↗

Comparison of three explicit multigrid methods for the Euler and Navier-Stokes equations

Three explicit multigrid methods, Ni's method, Jameson's finite-volume method, and a finite-difference method based on Brandt's work, are described and compared for two model problems. All three methods use an explicit multistage Runge-Kutta scheme on the fine grid, and this scheme is also described. Convergence histories for inviscid flow over a bump in a channel for the fine-grid scheme alone show that convergence rate is proportional to Courant number and that implicit residual smoothing can significantly accelerate the scheme. Ni's method was slightly slower than the implicitly-smoothed scheme alone. Brandt's and Jameson's methods are shown to be equivalent in form but differ in their node versus cell-centered implementations. They are about 8.5 times faster than Ni's method in terms of CPU time. Results for an oblique shock/boundary layer interaction problem verify the accuracy of the finite-difference code. All methods slowed considerably on the stretched viscous grid but Brandt's method was still 2.1 times faster than Ni's method.

Chima, Rodrick V.↗

Comparison of three explicit multigrid methods for the Euler and Navier-Stokes equations

Three explicit multigrid methods, Ni's method, Jameson's finite-volume method, and a finite-difference method based on Brandt's work, are described and compared for two model problems. All three methods use an explicit multistage Runge-Kutta scheme on the fine grid, and this scheme is also described. Convergence histories for inviscid flow over a bump in a channel for the fine-grid scheme alone show that convergence rate is proportional to Courant number and that implicit residual smoothing can significantly accelerate the scheme. Ni's method was slightly slower than the implicitly-smoothed scheme alone. Brandt's and Jameson's methods are shown to be equivalent in form but differ in their node versus cell-centered implementations. They are about 8.5 times faster than Ni's method in terms of CPU time. Results for an oblique shock/boundary layer interaction problem verify the accuracy of the finite-difference code. All methods slowed considerably on the stretched viscous grid but Brandt's method was still 2.1 times faster than Ni's method.

Chima, Rodrick V.↗

Leapfrog variants of iterative methods for linear algebra equations

Two iterative methods are considered, Richardson's method and a general second order method. For both methods, a variant of the method is derived for which only even numbered iterates are computed. The variant is called a leapfrog method. Comparisons between the conventional form of the methods and the leapfrog form are made under the assumption that the number of unknowns is large. In the case of Richardson's method, it is possible to express the final iterate in terms of only the initial approximation, a variant of the iteration called the grand-leap method. In the case of the grand-leap variant, a set of parameters is required. An algorithm is presented to compute these parameters that is related to algorithms to compute the weights and abscissas for Gaussian quadrature. General algorithms to implement the leapfrog and grand-leap methods are presented. Algorithms for the important special case of the Chebyshev method are also given.

Saylor, Paul E.↗

A hybrid perturbation-Galerkin method for differential equations containing a parameter

A two-step hybrid perturbation-Galerkin method to solve a variety of differential equations which involve a parameter is presented and discussed. The method consists of: (1) the use of a perturbation method to determine the asymptotic expansion of the solution about one or more values of the parameter; and (2) the use of some of the perturbation coefficient functions as trial functions in the classical Bubnov-Galerkin method. This hybrid method has the potential of overcoming some of the drawbacks of the perturbation method and the Bubnov-Galerkin method when they are applied by themselves, while combining some of the good features of both. The proposed method is illustrated first with a simple linear two-point boundary value problem and is then applied to a nonlinear two-point boundary value problem in lubrication theory. The results obtained from the hybrid method are compared with approximate solutions obtained by purely numerical methods. Some general features of the method, as well as some special tips for its implementation, are discussed. A survey of some current research application areas is presented and its degree of applicability to broader problem areas is discussed.

Geer, James F.↗

Nonequilibrium radiative heating prediction method for aeroassist flowfields with coupling to flowfield solvers

A method for predicting radiation adsorption and emission coefficients in thermochemical nonequilibrium flows is developed. The method is called the Langley optimized radiative nonequilibrium code (LORAN). It applies the smeared band approximation for molecular radiation to produce moderately detailed results and is intended to fill the gap between detailed but costly prediction methods and very fast but highly approximate methods. The optimization of the method to provide efficient solutions allowing coupling to flowfield solvers is discussed. Representative results are obtained and compared to previous nonequilibrium radiation methods, as well as to ground- and flight-measured data. Reasonable agreement is found in all cases. A multidimensional radiative transport method is also developed for axisymmetric flows. Its predictions for wall radiative flux are 20 to 25 percent lower than those of the tangent slab transport method, as expected, though additional investigation of the symmetry and outflow boundary conditions is indicated. The method was applied to the peak heating condition of the aeroassist flight experiment (AFE) trajectory, with results comparable to predictions from other methods. The LORAN method was also applied in conjunction with the computational fluid dynamics (CFD) code LAURA to study the sensitivity of the radiative heating prediction to various models used in nonequilibrium CFD. This study suggests that radiation measurements can provide diagnostic information about the detailed processes occurring in a nonequilibrium flowfield because radiation phenomena are very sensitive to these processes.

Hartung, Lin C.↗

Tensor-GMRES method for large sparse systems of nonlinear equations

This paper introduces a tensor-Krylov method, the tensor-GMRES method, for large sparse systems of nonlinear equations. This method is a coupling of tensor model formation and solution techniques for nonlinear equations with Krylov subspace projection techniques for unsymmetric systems of linear equations. Traditional tensor methods for nonlinear equations are based on a quadratic model of the nonlinear function, a standard linear model augmented by a simple second order term. These methods are shown to be significantly more efficient than standard methods both on nonsingular problems and on problems where the Jacobian matrix at the solution is singular. A major disadvantage of the traditional tensor methods is that the solution of the tensor model requires the factorization of the Jacobian matrix, which may not be suitable for problems where the Jacobian matrix is large and has a 'bad' sparsity structure for an efficient factorization. We overcome this difficulty by forming and solving the tensor model using an extension of a Newton-GMRES scheme. Like traditional tensor methods, we show that the new tensor method has significant computational advantages over the analogous Newton counterpart. Consistent with Krylov subspace based methods, the new tensor method does not depend on the factorization of the Jacobian matrix. As a matter of fact, the Jacobian matrix is never needed explicitly.

Feng, Dan↗

Non-LTE line-blanketed model atmospheres of hot stars. 1: Hybrid complete linearization/accelerated lambda iteration method

A new munerical method for computing non-Local Thermodynamic Equilibrium (non-LTE) model stellar atmospheres is presented. The method, called the hybird complete linearization/accelerated lambda iretation (CL/ALI) method, combines advantages of both its constituents. Its rate of convergence is virtually as high as for the standard CL method, while the computer time per iteration is almost as low as for the standard ALI method. The method is formulated as the standard complete lineariation, the only difference being that the radiation intensity at selected frequency points is not explicity linearized; instead, it is treated by means of the ALI approach. The scheme offers a wide spectrum of options, ranging from the full CL to the full ALI method. We deonstrate that the method works optimally if the majority of frequency points are treated in the ALI mode, while the radiation intensity at a few (typically two to 30) frequency points is explicity linearized. We show how this method can be applied to calculate metal line-blanketed non-LTE model atmospheres, by using the idea of 'superlevels' and 'superlines' introduced originally by Anderson (1989). We calculate several illustrative models taking into accont several tens of thosands of lines of Fe III to Fe IV and show that the hybrid CL/ALI method provides a robust method for calculating non-LTE line-blanketed model atmospheres for a wide range of stellar parameters. The results for individual stellar types will be presented in subsequent papers in this series.

Hubeny, I.↗

New Laboratory Methods for Characterizing the Immersion Factors for Irradiance

The experimental determination of the immersion factor, I(sub f)(lambda), of irradiance collectors is a requirement of any in-water radiometer. The eighth SeaWiFS Intercalibration Round-Robin Experiment (SIRREX-8) showed different implementations, at different laboratories, of the same I(sub f)(lambda) measurement protocol. The different implementations make use of different setups, volumes, and water types. Consequently, they exhibit different accuracies and require different execution times for characterizing an irradiance sensor. In view of standardizing the characterization of I(sub f)(lambda) values for in-water radiometers, together with an increase in the accuracy of methods and a decrease in the execution time, alternative methods are presented, and assessed versus the traditional method. The proposed new laboratory methods include: a) the continuous method, in which optical measurements taken with discrete water depths are substituted by continuous profiles created by removing the water from the water vessel at a constant flow rate (which significantly reduces the time required for the characterization of a single radiometer); and b) the Compact Portable Advanced Characterization Tank (ComPACT) method, in which the commonly used large tanks are replaced by a small water vessel, thereby allowing the determination of I(sub f)(lambda) values with a small water volume, and more importantly, permitting I(sub f)(lambda) characterizations with pure water. Intercomparisons between the continuous and the traditional method showed results within the variance of I(sub f) (lambda) determinations. The use of the continuous method, however, showed a much shorter realization time. Intercomparisons between the ComPACT and the traditional method showed generally higher I(sub f)(lambda) values for the former. This is in agreement with the generalized expectations of a reduction in scattering effects, because of the use of pure water with the ComPACT method versus the use of tap water with the traditional method.

Hooker, Stanford B.↗

Less-Complex Method of Classifying MPSK

An alternative to an optimal method of automated classification of signals modulated with M-ary phase-shift-keying (M-ary PSK or MPSK) has been derived. The alternative method is approximate, but it offers nearly optimal performance and entails much less complexity, which translates to much less computation time. Modulation classification is becoming increasingly important in radio-communication systems that utilize multiple data modulation schemes and include software-defined or software-controlled receivers. Such a receiver may "know" little a priori about an incoming signal but may be required to correctly classify its data rate, modulation type, and forward error-correction code before properly configuring itself to acquire and track the symbol timing, carrier frequency, and phase, and ultimately produce decoded bits. Modulation classification has long been an important component of military interception of initially unknown radio signals transmitted by adversaries. Modulation classification may also be useful for enabling cellular telephones to automatically recognize different signal types and configure themselves accordingly. The concept of modulation classification as outlined in the preceding paragraph is quite general. However, at the present early stage of development, and for the purpose of describing the present alternative method, the term "modulation classification" or simply "classification" signifies, more specifically, a distinction between M-ary and M'-ary PSK, where M and M' represent two different integer multiples of 2. Both the prior optimal method and the present alternative method require the acquisition of magnitude and phase values of a number (N) of consecutive baseband samples of the incoming signal + noise. The prior optimal method is based on a maximum- likelihood (ML) classification rule that requires a calculation of likelihood functions for the M and M' hypotheses: Each likelihood function is an integral, over a full cycle of carrier phase, of a complicated sum of functions of the baseband sample values, the carrier phase, the carrier-signal and noise magnitudes, and M or M'. Then the likelihood ratio, defined as the ratio between the likelihood functions, is computed, leading to the choice of whichever hypothesis - M or M'- is more likely. In the alternative method, the integral in each likelihood function is approximated by a sum over values of the integrand sampled at a number, 1, of equally spaced values of carrier phase. Used in this way, 1 is a parameter that can be adjusted to trade computational complexity against the probability of misclassification. In the limit as 1 approaches infinity, one obtains the integral form of the likelihood function and thus recovers the ML classification. The present approximate method has been tested in comparison with the ML method by means of computational simulations. The results of the simulations have shown that the performance (as quantified by probability of misclassification) of the approximate method is nearly indistinguishable from that of the ML method (see figure).

Hamkins, Jon↗

Simple Test Functions in Meshless Local Petrov-Galerkin Methods

Two meshless local Petrov-Galerkin (MLPG) methods based on two different trial functions but that use a simple linear test function were developed for beam and column problems. These methods used generalized moving least squares (GMLS) and radial basis (RB) interpolation functions as trial functions. These two methods were tested on various patch test problems. Both methods passed the patch tests successfully. Then the methods were applied to various beam vibration problems and problems involving Euler and Beck's columns. Both methods yielded accurate solutions for all problems studied. The simple linear test function offers considerable savings in computing efforts as the domain integrals involved in the weak form are avoided. The two methods based on this simple linear test function method produced accurate results for frequencies and buckling loads. Of the two methods studied, the method with radial basis trial functions is very attractive as the method is simple, accurate, and robust.

Raju, Ivatury S.↗

Monthly Mean DNI and GTI Derived from Monthly Mean GHI and DHI Using Two Methods: Comparisons with the BSRN Data and the Results Derived from the CERES Hourly Data

Monthly mean Global Horizontal Irradiances (GHI) and Diffuse Horizontal Irradiances (DHI) are more widely available than monthly mean Direct Normal Irradiances (DNI) and Global Tilted Irradiances (GTI). Empirical methods have been developed to derive monthly mean DNI and GTI from monthly mean GHI or from GHI and DHI. In this paper, we evaluate two such methods. The first one was the Whitlock Method developed by Charles H. Whitlock (2005) for the NASA POWER project by means of regression of the BSRN data. The method expresses the monthly mean DHI-to-GHI ratio as polynomial functions of monthly mean clearness index, sunset hour angle and noon solar elevation angle on the monthly-average-day. The monthly mean DNI is calculated by dividing the monthly mean GHI-DHI difference, or DirHI, by the cosine of the solar zenith angle at the mid-time between sunrise and solar noon on the monthly-average-day. The second method is the LJCR Method developed by Liu and Jorden (1960) and Collares-Pereira and Rabl (1979), and this method empirically splits monthly mean GHI and DHI into hourly means on the monthly-average-day, and the resulting hourly mean GHI and DHI and their difference, DirHI, can then be used to compute the monthly mean DNI, GTI and the global solar tracker irradiance (GTrI). This method is also used by RETScreen. We recently produced a set of hourly DNI and DHI by bias-correcting the CERES hourly DNI and DHI, and computed hourly GTI and GTrI as well. The data span twenty plus years from March 2000 to near present on a 1 by 1 grid system. The monthly mean CERES GHI and the corrected DHI are used as inputs to the above two methods to compute monthly mean DNI, GTI and GTrI. Through comparisons with the BSRN data, it is found that the Whitlock Method, with slight modification, and the LJCR Method can produce results that are nearly as good as the results derived from the CERES hourly data.

Taiping Zhang↗

J-R Curve Determination for Disk-shaped Compact Specimens Based on the Normalization Method and Direct Current Potential Drop Technique

Material ductile fracture toughness can be described by J-integral versus crack extension relationship (J-R curve). As a conventional J-R curve measurement method, unloading compliance (UC) becomes impractical in elevated temperature testing due to relaxation of the material and a friction induced back-up shape of the J-R curve. In addition, the UC method may underpredict the crack extension for standard disk-shaped compact (DC(T)) specimens. In order to address these issues, the normalization method and direct current potential drop (DCPD) technique were applied for determining J-R curves at 24 C and 500 C for 0.18T DC(T) specimens made from type 316L stainless steel. For comparison purchase, the UC method was also applied in 24 C tests. The normalization method was able to yield valid J-R curves in all tests. The J-R curves from the DCPD technique need adjustment to account for the potential drop induced by plastic deformation, crack blunting, etc. and after applying a newly-developed DCPD adjustment procedure, the post-adjusted DCPD J-R curves essentially matched J-R curves from the normalization method. In contrast, the UC method underpredicted the crack extension in all tests resulting in substantial deviation in the derived J-R curves manifested by high Jq values than the normalization or DCPD method. Only for tests where the UC method underpredicted the crack extension by a very small value, J-R curves determined by the UC method were similar to those determined by the normalization or DCPD method.

DCPD↗

Meshfree Methods

Meshfree methods have undergone substantial development and have received much attention in the last two decades. This new family of numerical methods is designed to inherit the main advantages of the finite element method such as compact supports of shape functions and good approximation properties while, at the same time, overcome the main disadvantages of the finite element method caused by the mesh dependence. The meshfree methods share a common feature that no mesh is needed and shape functions are constructed from sets of points, thus eliminating the need for time consuming mesh generation. The most significant advantage of meshfree methods is the flexibility in customizing approximation functions for desired regularity and for capturing essential physics and features of the particular problems of interest. Adaptivity formulation and multiple-scale solution strategies also can be implemented with relative ease. It has become clear that the meshfree methods provide considerable advantages over the conventional finite element methods in solving problems involving moving discontinuities, evolving material interfaces, multiple-scale phenomena, large material distortion and structural deformation, and fracture and damage processes. This Chapter gives an overview of many classes of meshfree methods, with more detailed discussions on Smoothed Particle Hydrodynamics (SPH), the Reproducing Kernel Particle Method (RKPM), Peridynamics (PD), the Material Point Method (MPM), as well as their applications in various challenging engineering problems.2

Chen, Jiun-Shyan↗

A Reconstructed Discontinuous Galerkin Method for the Compressible Navier-Stokes Equations on Arbitrary Grids

A reconstruction-based discontinuous Galerkin (RDG) method is presented for the solution of the compressible Navier-Stokes equations on arbitrary grids. The RDG method, originally developed for the compressible Euler equations, is extended to discretize viscous and heat fluxes in the Navier-Stokes equations using a so-called inter-cell reconstruction, where a smooth solution is locally reconstructed using a least-squares method from the underlying discontinuous DG solution. Similar to the recovery-based DG (rDG) methods, this reconstructed DG method eliminates the introduction of ad hoc penalty or coupling terms commonly found in traditional DG methods. Unlike rDG methods, this RDG method does not need to judiciously choose a proper form of a recovered polynomial, thus is simple, flexible, and robust, and can be used on arbitrary grids. The developed RDG method is used to compute a variety of flow problems on arbitrary meshes to demonstrate its accuracy, efficiency, robustness, and versatility. The numerical results indicate that this RDG method is able to deliver the same accuracy as the well-known Bassi-Rebay II scheme, at a half of its computing costs for the discretization of the viscous fluxes in the Navier-Stokes equations, clearly demonstrating its superior performance over the existing DG methods for solving the compressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗

A Reconstructed Discontinuous Galerkin Method for the Compressible Navier-Stokes Equations on Arbitrary Grids

A reconstruction-based discontinuous Galerkin (RDG) method is presented for the solution of the compressible Navier–Stokes equations on arbitrary grids. The RDG method, originally developed for the compressible Euler equations, is extended to discretize viscous and heat fluxes in the Navier–Stokes equations using a so-called inter-cell reconstruction, where a smooth solution is locally reconstructed using a least-squares method from the underlying discontinuous DG solution. Similar to the recovery-based DG (rDG) methods, this reconstructed DG method eliminates the introduction of ad hoc penalty or coupling terms commonly found in traditional DG methods. Unlike rDG methods, this RDG method does not need to judiciously choose a proper form of a recovered polynomial, thus is simple, flexible, and robust, and can be used on arbitrary grids. The developed RDG method is used to compute a variety of flow problems on arbitrary meshes to demonstrate its accuracy, efficiency, robustness, and versatility. The numerical results indicate that this RDG method is able to deliver the same accuracy as the well-known Bassi–Rebay II scheme, at a half of its computing costs for the discretization of the viscous fluxes in the Navier–Stokes equations, clearly demonstrating its superior performance over the existing DG methods for solving the compressible Navier–Stokes equations.

97 MATHEMATICS AND COMPUTING↗

Multiple-time-stepping generalized hybrid Monte Carlo methods

Performance of the generalized shadow hybrid Monte Carlo (GSHMC) method [1], which proved to be superior in sampling efficiency over its predecessors [2–4], molecular dynamics and hybrid Monte Carlo, can be further improved by combining it with multi-time-stepping (MTS) and mollification of slow forces. We demonstrate that the comparatively simple modifications of the method not only lead to better performance of GSHMC itself but also allow for beating the best performed methods, which use the similar force splitting schemes. In addition we show that the same ideas can be successfully applied to the conventional generalized hybrid Monte Carlo method (GHMC). The resulting methods, MTS-GHMC and MTS-GSHMC, provide accurate reproduction of thermodynamic and dynamical properties, exact temperature control during simulation and computational robustness and efficiency. MTS-GHMC uses a generalized momentum update to achieve weak stochastic stabilization to the molecular dynamics (MD) integrator. MTS-GSHMC adds the use of a shadow (modified) Hamiltonian to filter the MD trajectories in the HMC scheme. We introduce a new shadow Hamiltonian formulation adapted to force-splitting methods. The use of such Hamiltonians improves the acceptance rate of trajectories and has a strong impact on the sampling efficiency of the method. Both methods were implemented in the open-source MD package ProtoMol and were tested on a water and a protein systems. Results were compared to those obtained using a Langevin Molly (LM) method [5] on the same systems. The test results demonstrate the superiority of the new methods over LM in terms of stability, accuracy and sampling efficiency. This suggests that putting the MTS approach in the framework of hybrid Monte Carlo and using the natural stochasticity offered by the generalized hybrid Monte Carlo lead to improving stability of MTS and allow for achieving larger step sizes in the simulation of complex systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗