Search NASA⌕ Search

SEARCH · Search NASA

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 415 records · Page 23

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↗

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.↗

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↗

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↗

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 to be obtained with both turbulence models. 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 equation in the latter may be responsible. Computed results with both turbulence models are compared to experimental data for a pair of opposed jets in crossflow. Both models yield reasonable agreement for the mean flow velocity, but RSM yields better predictions of the Reynolds stresses.

Demuren, A. O.↗

Distributed parallel processing applied to an implicit multigrid Euler/Navier-Stokes algorithm

An implicit multigrid algorithm for the solution of the Euler and Navier-Stokes equations has been implemented within the framework of multiple block-structured grids in which the physical domain is spatially decomposed into several blocks and the solution is advanced in parallel on each block. Utilities have been developed to implement such a scheme in a distributed computing environment. The multi-block algorithm is designed so that the explicit residual calculation is identical to that of single-block scheme, and therefore converged solutions for both schemes must be the same. To accelerate convergence, synchronous and asynchronous multigrid strategies are implemented. Significant speedups have been achieved in a multiple processor environment, while convergence rates similar to those of the single-block scheme are observed.

Tysinger, T. L.↗

Non-oscillatory and non-diffusive solution of convection problems by the iteratively reweighted least-squares finite element method

A comparative description is presented for the least-squares FEM (LSFEM) for 2D steady-state pure convection problems. In addition to exhibiting better control of the streamline derivative than the streamline upwinding Petrov-Galerkin method, numerical convergence rates are obtained which show the LSFEM to be virtually optimal. The LSFEM is used as a framework for an iteratively reweighted LSFEM yielding nonoscillatory and nondiffusive solutions for problems with contact discontinuities; this method is shown to convect contact discontinuities without error when using triangular and bilinear elements.

Jiang, Bo-Nan↗

The application of preconditioning in viscous flows

The present time-derivative preconditioning algorithm is effective in flow conditions ranging from inviscid to very diffusive flows, as well as low subsonic to supersonic flow velocities. By means of a preconditioning matrix that (1) introduces well-conditioned eigenvalues and (2) avoids nonphysical time reversals for viscous flows, a mechanism is obtained which controls the inviscid and viscous time-step parameters at very diffusive flows. These capabilities are demonstrated for a variety of sample problems; convergence rates of solutions that are indistinguishable from those obtained without preconditioning are shown to be accelerated by as much as two orders of magnitude.

Choi, Y.-H.↗

Laplace's equation and the Dirichlet-Neumann map in multiply connected domains

A variety of problems in material science and fluid dynamics require the solution of Laplace's equation in multiply connected domains. Integral equation methods are natural candidates for such problems, since they discretize the boundary alone, require no special effort for free boundaries, and achieve superalgebraic convergence rates on sufficiently smooth domains in two space dimensions, regardless of shape. Current integral equation methods for the Dirichlet problem, however, require the solution of M independent problems of dimension N, where M is the number of boundary components and N is the total number of points in the discretization. In this paper, we present a new boundary integral equation approach, valid for both interior and exterior problems, which requires the solution of a single linear system of dimension N + M. We solve this system by making use of an iterative method (GMRES) combined with the last multipole method for the rapid calculation of the necessary matrix vector products. For a two-dimensional system with 200 components and 100 points on each boundary, we gain a speedup of a factor of 100 from the new analytic formulation and a factor of 50 from the fast multipole method. The resulting scheme brings large scale calculations in extremely complex domains within practical reach.

Greenbaum, A.↗

The L sub 1 finite element method for pure convection problems

The least squares (L sub 2) finite element method is introduced for 2-D steady state pure convection problems with smooth solutions. It is proven that the L sub 2 method has the same stability estimate as the original equation, i.e., the L sub 2 method has better control of the streamline derivative. Numerical convergence rates are given to show that the L sub 2 method is almost optimal. This L sub 2 method was then used as a framework to develop an iteratively reweighted L sub 2 finite element method to obtain a least absolute residual (L sub 1) solution for problems with discontinuous solutions. This L sub 1 finite element method produces a nonoscillatory, nondiffusive and highly accurate numerical solution that has a sharp discontinuity in one element on both coarse and fine meshes. A robust reweighting strategy was also devised to obtain the L sub 1 solution in a few iterations. A number of examples solved by using triangle and bilinear elements are presented.

Jiang, Bo-Nan↗

Characteristics of three-dimensional 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.↗

Quasi-optical grids with thin rectangular patch/aperture elements

Theoretical analysis is presented for an efficient and accurate performance evaluation of quasi-optical grids comprised of thin rectangular patch/aperture elements with/without a dielectric substrate/superstrate. The convergence rate of this efficient technique is improved by an order of magnitude with the approximate edge conditions incorporated in the basis functions of the integral equation solution. Also presented are the interesting applications of this efficient analytical technique to the design and performance evaluation of the coupling grids and beam splitters in the optical systems as well as thermal protection sunshields used in the communication systems of satellites and spacecrafts.

Wu, Te-Kao↗

Implicit multigrid Euler solutions with symmetric Total-Variation-Diminishing dissipation

A symmetric Total-Variation-Diminishing (TVD) formulation of the numerical dissipation terms has been incorporated into a diagonalized alternating direction implicit multigrid algorithm to solve the Euler equations of inviscid compressible flow. The new treatment of the dissipation makes is possible to capture both very strong and very weak shocks, virtually without oscillation for the steady flows of interest here. In addition, the TVD constraint fixes one of the two previously arbitrary constants in the formulation of the dissipation, and results in both converged solutions and convergence rates which are relatively insensitive to the choice of the remaining dissipation parameter.

Caughey, David A.↗

Multi-zonal Navier-Stokes code with the LU-SGS scheme

The LU-SGS (lower upper symmetric Gauss Seidel) algorithm has been implemented into the Compressible Navier-Stokes, Finite Volume (CNSFV) code and validated with a multizonal Navier-Stokes simulation of a transonic turbulent flow around an Onera M6 transport wing. The convergence rate and robustness of the code have been improved and the computational cost has been reduced by at least a factor of 2 over the diagonal Beam-Warming scheme.

Klopfer, G. H.↗

A viscous-inviscid interaction method for 2-D unsteady, compressible flows

A Navier-Stokes/potentia/flow interactive solution method suitable for the solution of steady-state and unsteady flowfields around airfoils has been developed. The Navier-Stokes equations are solved in the close proximity of an airfoil and in its wake. The inviscid flowfield surrounding the viscous flow regions is assumed to be irrotational and isentropic. In the inviscid flow region, the potential flow equations, which are based on distributed sources and vortices, are solved. The two solutions are strongly coupled through the application of their boundary conditions. The strongly coupled Navier-Stokes/potential flow interactive solution method confines computations to a small domain in the proximity of an airfoil. For steady flow solutions, the computational domain may be confined to a region which extends less than one-fifth of a chord length distance away from the airfoil surface. Computed solutions have the same accuracy as the full domain NavierStokes solutions. Yet, as a result of the significantly reduced computational domain and increased convergence rates, the Navier-Stokes/potential flow interactive solution method is about 40 percent more efficient computationally.

Tuncer, Ismail H.↗

Spectrum formation in supernovae - Numerical techniques

The study combines several novel techniques for spectrum simulation in the Eddington computer program which solves the comoving frame equation of transfer coupled with the statistical and radiative equilibrium equations. One of these is a generalization of the accelerated lambda iteration (ALI) scheme to include an approximate frequency-derivative operator. This greatly enhances the convergence rate of ALI in optically thick, high-velocity shear flows. Another is a partial linearization technique which is capable of efficiently solving a very large number of rate equations on a moderately sized computer. An expansion opacity and emissivity approximation is derived which makes it possible to determine the effect on the transfer and statistical equilibrium of a very large number of lines not explicitly represented in the frequency grid and additionally to treat line-blanketing from species not explicitly included in the rate equations. The utility of these techniques is illustrated with models of two supernovae.

Eastman, Ronald G.↗

Fabrication of the first pair of optics for the Advanced X-ray Astrophysics Facility (AXAF)

The first two mirrors for the Advanced X-Ray Astrophysics Facility (AXAF) have been successfully fabricated and tested. The methodology developed has demonstrated figure convergence rates previously unseen on large area, precision optics. These results were based on developing a unified systems approach to fabrication and testing aided by the extensive use of analytical models. This paper presents a summary of the optic requirements, an overview of the fabrication process, the metrology used, and a summary of the results.

Reid, P. B.↗

General purpose optimization software for engineering design

The author has developed several general purpose optimization programs over the past twenty years. The earlier programs were developed as research codes and served that purpose reasonably well. However, in taking the formal step from research to industrial application programs, several important lessons have been learned. Among these are the importance of clear documentation, immediate user support, and consistent maintenance. Most important has been the issue of providing software that gives a good, or at least acceptable, design at minimum computational cost. Here, the basic issues developing optimization software for industrial applications are outlined and issues of convergence rate, reliability, and relative minima are discussed. Considerable feedback has been received from users, and new software is being developed to respond to identified needs. The basic capabilities of this software are outlined. A major motivation for the development of commercial grade software is ease of use and flexibility, and these issues are discussed with reference to general multidisciplinary applications. It is concluded that design productivity can be significantly enhanced by the more widespread use of optimization as an everyday design tool.

Vanderplaats, G. N.↗