Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “convergence rate”

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Sinc-Galerkin estimation of diffusivity in parabolic problems

A fully Sinc-Galerkin method for the numerical recovery of spatially varying diffusion coefficients in linear partial differential equations is presented. Because the parameter recovery problems are inherently ill-posed, an output error criterion in conjunction with Tikhonov regularization is used to formulate them as infinite-dimensional minimization problems. The forward problems are discretized with a sinc basis in both the spatial and temporal domains thus yielding an approximate solution which displays an exponential convergence rate and is valid on the infinite time interval. The minimization problems are then solved via a quasi-Newton/trust region algorithm. The L-curve technique for determining an approximate value of the regularization parameter is briefly discussed, and numerical examples are given which show the applicability of the method both for problems with noise-free data as well as for those whose data contains white noise.

Smith, Ralph C.↗
NASA NTRS1991

Numerical algorithm comparison for the accurate and efficient computation of high-incidence vortical flow

Computations from two Navier-Stokes codes, NSS and F3D, are presented for a tangent-ogive-cylinder body at high angle of attack. Features of this steady flow include a pair of primary vortices on the leeward side of the body as well as secondary vortices. The topological and physical plausibility of this vortical structure is discussed. The accuracy of these codes are assessed by comparison of the numerical solutions with experimental data. The effects of turbulence model, numerical dissipation, and grid refinement are presented. The overall efficiency of these codes are also assessed by examining their convergence rates, computational time per time step, and maximum allowable time step for time-accurate computations. Overall, the numerical results from both codes compared equally well with experimental data, however, the NSS code was found to be significantly more efficient than the F3D code.

Chaderjian, Neal M.↗
NASA NTRS1991

Multigrid solution of compressible turbulent flow on unstructured meshes using a two-equation model

The system of equations consisting of the full Navier-Stokes equations and two turbulence equations has been solved for in the steady-state using a multigrid strategy on unstructured meshes. The flow equations and turbulence equations are solved in a loosely coupled manner. The flow equations are advanced in time using a multistage Runge-Kutta time stepping scheme with a stability bound local time-step, while the turbulence equations are advanced in a point-implicit scheme with a time-step which guarantees stability and positivity. Low Reynolds number modifications to the original two-equation model are incorporated in a manner which results in well behaved equations for arbitrarily small wall distances. A variety of aerodynamic flows are solved for, initializing all quantities with uniform freestream values, and resulting in rapid and uniform convergence rates for the flow and turbulence equations.

Mavriplis, D. J.↗
NASA NTRS1990

An isoparametric finite-element Stokes flow test problem

Two-dimensional Stokes flow of an incompressible Newtonian fluid about a horizontal cylinder situated next to a moving wall is presented and suggested as a nontrivial benchmark problem. Both the primitive variable Galerkin finite-element and the exact solutions are generated on a sequence of refined meshes. Error norms and convergence rates are presented for the C(o) bilinear-velocity/C(-1) piecewise constant-pressure and the C(o) biquadratic-velocity/C(-1) linear-pressure quadrilateral elements.

Maslanik, Miriam K.↗
NASA NTRS1991

Computational study of duct and pipe flows using the method of pseudocompressibility

A viscous, three-dimensional, incompressible, Navier-Stokes Computational Fluid Dynamics code employing pseudocompressibility is used for the prediction of laminar primary and secondary flows in two 90-degree bends of constant cross section. Under study are a square cross section duct bend with 2.3 radius ratio and a round cross section pipe bend with 2.8 radius ratio. Sensitivity of predicted primary and secondary flow to inlet boundary conditions, grid resolution, and code convergence is investigated. Contour and velocity versus spanwise coordinate plots comparing prediction to experimental data flow components are shown at several streamwise stations before, within, and after the duct and pipe bends. Discussion includes secondary flow physics, computational method, computational requirements, grid dependence, and convergence rates.

Williams, Robert W.↗
NASA NTRS1991

Iterative solution techniques in boundary element analysis

Iterative techniques for the solution of the algebraic equations associated with the direct boundary element analysis (BEA) method are discussed. Continuum structural response analysis problems are considered, employing single- and multizone boundary element models with and without zone condensation. The impact on convergence rate and computer resource requirements associated with the sparse and blocked matrices, resulting in multizone BEA, is studied. Both conjugate gradient and generalized minimum residual preconditioned iterative solvers are applied for these problems and the performance of these algorithms is reported. Included is a quantification of the impact of the preconditioning utilized to render the boundary element matrices solvable by the respective iterative methods in a time competitive with direct methods.

Kane, J. H.↗
NASA NTRS1990

Extended Kalman Filter for attitude estimation of the Earth Radiation Budget Satellite

The design and testing of an Extended Kalman Filter (EKF) for ground attitude determination, misalignment estimation and sensor calibration of the Earth Radiation Budget Satellite (ERBS) are described. Attitude is represented by the quaternion of rotation and the attitude estimation error is defined as an additive error. Quaternion normalization is used for increasing the convergence rate and for minimizing the need for filter tuning. The development of the filter dynamic model, the gyro error model and the measurement models of the sun sensors, the IR horizon scanner and the magnetometers which are used to generate vector measurements are also presented. The filter is applied to real data transmitted by ERBS sensors. Results are presented and analyzed and the EKF advantages as well as sensitivities are discussed. On the whole the filter meets the expected synergism, accuracy and robustness.

Deutschmann, Julie↗
NASA NTRS1990

Characteristics of 3D turbulent jets in crossflow

Three dimensional turbulent jets in crossflow at low to medium jet-to-crossflow velocity ratios are computed with a finite volume numerical procedure which utilizes a second-moment closure model to approximate the Reynolds stresses. A multigrid method is used to accelerate the convergence rate of the procedure. Comparison of the computations to measured data show good qualitative agreement. All trends are correctly predicted, though there is some uncertainty on the height of penetration of the jet. The evolution of the vorticity field is used to explore the jet-crossflow interaction.

Demuren, A. O.↗
NASA NTRS1991

Progress with multigrid schemes for hypersonic flow problems

Several multigrid schemes are considered for the numerical computation of viscous hypersonic flows. For each scheme, the basic solution algorithm uses upwind spatial discretization with explicit multistage time stepping. Two level versions of the various multigrid algorithms are applied to the two dimensional advection equation, and Fourier analysis is used to determine their damping properties. The capabilities of the multigrid methods are assessed by solving three different hypersonic flow problems. Some new multigrid schemes based on semicoarsening strategies are shown to be quite effective in relieving the stiffness caused by the high aspect ratio cells required to resolve high Reynolds number flows. These schemes exhibit good convergence rates for Reynolds numbers up to 200 x 10(exp 6) and Mach numbers up to 25.

Radespiel, R.↗
NASA NTRS1991

Multigrid acceleration and turbulence models for computations of 3D turbulent jets in crossflow

A multigrid method is presented for the calculation of three-dimensional turbulent jets in crossflow. Turbulence closure is achieved with either the standard k-epsilon model or a Reynolds Stress Model (RSM). Multigrid acceleration enables convergence rates which are far superior to that for a single grid method. With the k-epsilon model the rate approaches that for laminar flow, but with RSM it is somewhat slower. The increased stiffness of the system of equations in the latter may be responsible. Computed results with both turbulence models are compared with experimental data for a pair of opposed jets in crossflow. Both models yield reasonable agreement with mean flow velocity but RSM yields better prediction of the Reynolds stresses.

Demuren, A. O.↗
NASA NTRS1992

Development of a multigrid transonic potential flow code for cascades

Finite-volume methods for discretizing transonic potential flow equations have proven to be very flexible and accurate for both two and three dimensional problems. Since they only use local properties of the mapping, they allow decoupling of the grid generation from the rest of the problem. A very effective method for solving the discretized equations and converging to a solution is the multigrid-ADI technique. It has been successfully applied to airfoil problems where O type, C type and slit mappings have been used. Convergence rates for these cases are more than an order of magnitude faster than with relaxation techniques. In this report, we describe a method to extend the above methods, with the C type mappings, to airfoil cascade problems.

Steinhoff, John↗
NASA NTRS1990

Acceleration, transport of and radiation by electrons in impulsive phase of flares

Recent work carried out in connection with various manifestations of the impulsive phase of solar flares is reviewed. Characteristics of accelerated electrons are determined, taking into account various possible interactions that electrons undergo as they traverse the flare plasma, and the expected radiation is evaluated via several mechanisms. Constraints are set on the characteristics of the accelerated electrons and on some properties of the flare plasma. Results obtained from comparisons with SMM and other observations of flares during the past solar cycle are described. It is shown that limits can be set on the range and distribution of the accelerated electron spectrum and pitch angle distribution, and on the column depth and field convergence rate of the flaring loop.

Petrosian, Vahe↗
NASA NTRS1992

Improved method for solving the viscous shock layer equations

An improved method for solving the viscous shock layer equations for supersonic/hypersonic flows past blunt-nosed bodies is presented. The method is capable of handling slender to thick bodies. The solution is obtained by solving a coupled set of five equations, built of the four basic viscous shock layer equations and an additional equation for the standoff distance. The coupling of the equations prevents the local iterations divergence problems encountered by previous methods of solution far downstream on slender bodies. It also eliminates the need for local iterations, which were required by previous methods of solution, for a first-order scheme in the streamwise direction. A new global iteration procedure is employed to impose the shock boundary conditions. The procedure prevents the global iteration instability encountered by the basic method of solution and improves the convergence rate of the global iteration procedure of later methods devised to overcome this difficulty. The new technique reduces the computation time by 65-95 percent as compared to previous methods of solution. The method can efficiently be implemented in vector/parallel computers.

Gordon, Rachel↗
NASA NTRS1992

Evaluation of a multigrid-based Navier-Stokes solver for aerothermodynamic computations

A multigrid acceleration technique developed for solving the three-dimensional Navier-Stokes equations is used for computing high Mach number flows over configurations of practical interest. An explicit multistage Runge-Kutta type of time-stepping scheme is used as the basic algorithm. Solutions are presented for a spherically blunted cone at Mach 10 and a modified shuttle orbiter at Mach 6. The computed surface heat-transfer distributions are shown to compare favorably with the experimental data. Effect of grid-refinement on computed heat-transfer distributions is also examined to assess the numerical accuracy of the computed solutions. The rapid convergence rate associated with multigrid schemes in previous applications at transonic speeds is observed at the higher Mach number flows investigated here.

Vatsa, Veer N.↗
NASA NTRS1993

Development of an unstructured solution adaptive method for the quasi-three-dimensional Euler and Navier-Stokes equations

A general solution adaptive scheme based on a remeshing technique is developed for solving the two-dimensional and quasi-three-dimensional Euler and Favre-averaged Navier-Stokes equations. The numerical scheme is formulated on an unstructured triangular mesh utilizing an edge-based pointer system which defines the edge connectivity of the mesh structure. Jameson's four-stage hybrid Runge-Kutta scheme is used to march the solution in time. The convergence rate is enhanced through the use of local time stepping and implicit residual averaging. As the solution evolves, the mesh is regenerated adaptively using flow field information. Mesh adaptation parameters are evaluated such that an estimated local numerical error is equally distributed over the whole domain. For inviscid flows, the present approach generates a complete unstructured triangular mesh using the advancing front method. For turbulent flows, the approach combines a local highly stretched structured triangular mesh in the boundary layer region with an unstructured mesh in the remaining regions to efficiently resolve the important flow features. One-equation and two-equation turbulence models are incorporated into the present unstructured approach. Results are presented for a wide range of flow problems including two-dimensional multi-element airfoils, two-dimensional cascades, and quasi-three-dimensional cascades. This approach is shown to gain flow resolution in the refined regions while achieving a great reduction in the computational effort and storage requirements since solution points are not wasted in regions where they are not required.

Jiang, Yi-Tsann↗
NASA NTRS1992

A conjugate gradients/trust regions algorithms for training multilayer perceptrons for nonlinear mapping

This paper addresses the issue of applying a globally convergent optimization algorithm to the training of multilayer perceptrons, a class of Artificial Neural Networks. The multilayer perceptrons are trained towards the solution of two highly nonlinear problems: (1) signal detection in a multi-user communication network, and (2) solving the inverse kinematics for a robotic manipulator. The research is motivated by the fact that a multilayer perceptron is theoretically capable of approximating any nonlinear function to within a specified accuracy. The algorithm that has been employed in this study combines the merits of two well known optimization algorithms, the Conjugate Gradients and the Trust Regions Algorithms. The performance is compared to a widely used algorithm, the Backpropagation Algorithm, that is basically a gradient-based algorithm, and hence, slow in converging. The performances of the two algorithms are compared with the convergence rate. Furthermore, in the case of the signal detection problem, performances are also benchmarked by the decision boundaries drawn as well as the probability of error obtained in either case.

Madyastha, Raghavendra K.↗
NASA NTRS1993

On waveform multigrid method

Waveform multigrid method is an efficient method for solving certain classes of time dependent PDEs. This paper studies the relationship between this method and the analogous multigrid method for steady-state problems. Using a Fourier-Laplace analysis, practical convergence rate estimates of the waveform multigrid iterations are obtained. Experimental results show that the analysis yields accurate performance prediction.

Taasan, Shlomo↗
NASA NTRS1993

Mapping robust parallel multigrid algorithms to scalable memory architectures

The convergence rate of standard multigrid algorithms degenerates on problems with stretched grids or anisotropic operators. The usual cure for this is the use of line or plane relaxation. However, multigrid algorithms based on line and plane relaxation have limited and awkward parallelism and are quite difficult to map effectively to highly parallel architectures. Newer multigrid algorithms that overcome anisotropy through the use of multiple coarse grids rather than line relaxation are better suited to massively parallel architectures because they require only simple point-relaxation smoothers. The parallel implementation of a V-cycle multiple semi-coarsened grid (MSG) algorithm or distributed-memory architectures such as the Intel iPSC/860 and Paragon computers is addressed. The MSG algorithms provide two levels of parallelism: parallelism within the relaxation or interpolation on each grid and across the grids on each multigrid level. Both levels of parallelism must be exploited to map these algorithms effectively to parallel architectures. A mapping of an MSG algorithm to distributed-memory architectures that demonstrate how both levels of parallelism can be exploited is described. The results is a robust and effective multigrid algorithm for distributed-memory machines.

Overman, Andrea↗