The rate of convergence of Hermite function series
Explore the source record for details and available documents.
Boyd, J. P.↗
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.
The rate of convergence of Chebyshev polynomials for functions which have asymptotic power series about one endpoint
Explore the source record for details and available documents.
Boyd, J. P.↗
The coupling of fluids, dynamics, and controls on advanced architecture computers
This grant provided for the demonstration of coupled controls, body dynamics, and fluids computations in a workstation cluster environment; and an investigation of the impact of peer-peer communication on flow solver performance and robustness. The findings of these investigations were documented in the conference articles.The attached publication, 'Towards Distributed Fluids/Controls Simulations', documents the solution and scaling of the coupled Navier-Stokes, Euler rigid-body dynamics, and state feedback control equations for a two-dimensional canard-wing. The poor scaling shown was due to serialized grid connectivity computation and Ethernet bandwidth limits. The scaling of a peer-to-peer communication flow code on an IBM SP-2 was also shown. The scaling of the code on the switched fabric-linked nodes was good, with a 2.4 percent loss due to communication of intergrid boundary point information. The code performance on 30 worker nodes was 1.7 (mu)s/point/iteration, or a factor of three over a Cray C-90 head. The attached paper, 'Nonlinear Fluid Computations in a Distributed Environment', documents the effect of several computational rate enhancing methods on convergence. For the cases shown, the highest throughput was achieved using boundary updates at each step, with the manager process performing communication tasks only. Constrained domain decomposition of the implicit fluid equations did not degrade the convergence rate or final solution. The scaling of a coupled body/fluid dynamics problem on an Ethernet-linked cluster was also shown.
Atwood, Christopher↗
Initial Results of an MDO Method Evaluation Study
The NASA Langley MDO method evaluation study seeks to arrive at a set of guidelines for using promising MDO methods by accumulating and analyzing computational data for such methods. The data are collected by conducting a series of re- producible experiments. In the first phase of the study, three MDO methods were implemented in the SIGHT: framework and used to solve a set of ten relatively simple problems. In this paper, we comment on the general considerations for conducting method evaluation studies and report some initial results obtained to date. In particular, although the results are not conclusive because of the small initial test set, other formulations, optimality conditions, and sensitivity of solutions to various perturbations. Optimization algorithms are used to solve a particular MDO formulation. It is then appropriate to speak of local convergence rates and of global convergence properties of an optimization algorithm applied to a specific formulation. An analogous distinction exists in the field of partial differential equations. On the one hand, equations are analyzed in terms of regularity, well-posedness, and the existence and unique- ness of solutions. On the other, one considers numerous algorithms for solving differential equations. The area of MDO methods studies MDO formulations combined with optimization algorithms, although at times the distinction is blurred. It is important to
Alexandrov, Natalia M.↗
An Algebraic Multigrid Solver for Navier-Stokes Problems in the Discrete Second-Order Approximation
An algebraic multigrid scheme is presented for solving the discrete Navier-Stokes equations to second-order accuracy using the defect-correction method. Solutions have been obtained for problems involving both structured and unstructured meshes, with the resolution and resolution grading controlled by global and local mesh refinements. The solver is efficient and robust to the extent that no underrelaxation of variables has been required to ensure convergence, but rates of convergence can be improved with small amounts of underrelaxation of the velocity-pressure coupling. Provided that the computational mesh can resolve the flow field, convergence characteristics are almost mesh independent. Rates of convergence actually improve with refinement, asymptotically approaching mesh independent values. For extremely coarse meshes where dispersive truncation errors would be expected to prevent convergence (or even induce divergence), solutions can still be obtained by using explicit underrelaxation in the iterative cycle.
Webster, R.↗
Vortex breakdown simulation
In this paper, steady, axisymmetric inviscid, and viscous (laminar) swirling flows representing vortex breakdown phenomena are simulated using a stream function-vorticity-circulation formulation and two numerical methods. The first is based on an inverse iteration, where a norm of the solution is prescribed and the swirling parameter is calculated as a part of the output. The second is based on direct Newton iterations, where the linearized equations, for all the unknowns, are solved simultaneously by an efficient banded Gaussian elimination procedure. Several numerical solutions for inviscid and viscous flows are demonstrated, followed by a discussion of the results. Some improvements on previous work have been achieved: first order upwind differences are replaced by second order schemes, line relaxation procedure (with linear convergence rate) is replaced by Newton's iterations (which converge quadratically), and Reynolds numbers are extended from 200 up to 1000.
Hafez, M.↗
An efficient method for solving the steady Euler equations
An efficient numerical procedure for solving a set of nonlinear partial differential equations is given, specifically for the steady Euler equations. Solutions of the equations were obtained by Newton's linearization procedure, commonly used to solve the roots of nonlinear algebraic equations. In application of the same procedure for solving a set of differential equations we give a theorem showing that a quadratic convergence rate can be achieved. While the domain of quadratic convergence depends on the problems studied and is unknown a priori, we show that firstand second-order derivatives of flux vectors determine whether the condition for quadratic convergence is satisfied. The first derivatives enter as an implicit operator for yielding new iterates and the second derivatives indicates smoothness of the flows considered. Consequently flows involving shocks are expected to require larger number of iterations. First-order upwind discretization in conjunction with the Steger-Warming flux-vector splitting is employed on the implicit operator and a diagonal dominant matrix results. However the explicit operator is represented by first- and seond-order upwind differencings, using both Steger-Warming's and van Leer's splittings. We discuss treatment of boundary conditions and solution procedures for solving the resulting block matrix system. With a set of test problems for one- and two-dimensional flows, we show detailed study as to the efficiency, accuracy, and convergence of the present method.
Liou, M. S.↗
A Chebyshev spectral collocation method using a staggered grid for the stability of cylindrical flows
A staggered spectral collocation method for the stability of cylindrical flows is developed. In this method the pressure is evaluated at different nodal points than the three velocity components. These modified nodal points do not include the two boundary nodes; therefore the need for the two artificial pressure boundary conditions employed by Khorrami et al. is eliminated. It is shown that the method produces very accurate results and has a better convergence rate than the spectral tau formulation. However, through extensive convergence tests it was found that elimination of the artificial pressure boundary conditions does not result in any significant change in the convergence behavior of spectral collocation methods.
Khorrami, Mehdi R.↗
Eigenmode analysis of unsteady one-dimensional Euler equations
The initial boundary value problem describing the evolution of unsteady linearized perturbations of a steady, uniform subsonic flow is analyzed. The eigenmodes and eigenfrequencies of the system are derived and several examples are presented to illustrate the effect of different boundary conditions on the exponential decay rate of the eigenmodes. The resultant implications for the stability and convergence rates of finite difference computations are discussed.
Giles, M.↗
On a numerical sufficiency test for monotonic convergence of finite element models
Finite element analyses characterized by monotonic convergence include the discipline for meaningful measurements of convergence rate and consequently economical extrapolation. Few proposers of element models guarantee monotonic convergence for their elements. Thus, a need exists for an automatic test to classify available element models. This paper describes such a test - a test can be performed using a digital computer to guarantee that a particular element model imbues monotonicity. It describes the test and its basis. It examines seven element models for a rectangular membrane to illustrate the value of the tests. Besides confirming results already known, the application yields new data. It 'proves' monotonicity for two improved models, defines the range of element proportions for which another element can be guaranteed to exhibit monotonicity, and suggests that another element is deficient. In the special case of absolutely convergent membrane displacement models, proof of monotonicity is a necessary and sufficient condition to insure that upper bound estimates of strain energy are developed. Accordingly, the test furnishes a proof of bound solutions independently of requirements on displacement continuity the element basis may or may not satisfy.
Melosh, R. J.↗
Development of a boundary-layer-type solver based on simultaneous iteration technique for axisymmetric separated flows
A boundary-layer-type solver is developed for the numerical solution of axisymmetric separated flows. A new fully implicit coupling scheme for the viscous and inviscid regions is demonstrated. This fully implicit coupling technique is similar to the work of Carter, Veldman, and an extension of an earlier work of Halim and Hafez. A comparison is made for the convergence rate using this new fully implicit coupling technique and the semiimplicit coupling of Halim and Hafez. Numerical results using the fully implicit coupling are obtained for laminar incompressible separated flows, including a boattail and a series of trough geometries. Also, the near-wake flow problem is considered using the present formulation. A clear conclusion of this investigation is that the present scheme using the fully implicit coupling method converges at a faster rate than the semiimplicit coupling and the partially parabolized Navier-Stokes (PPNS) procedures.
Halim, A. A. M.↗
A parallel algorithm for the eigenvalues and eigenvectors for a general complex matrix
A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex matrix. Most parallel methods for this parallel typically display only linear convergence. Sequential norm-reducing algorithms also exit and they display quadratic convergence in most cases. The new algorithm is a parallel form of the norm-reducing algorithm due to Eberlein. It is proven that the asymptotic convergence rate of this algorithm is quadratic. Numerical experiments are presented which demonstrate the quadratic convergence of the algorithm and certain situations where the convergence is slow are also identified. The algorithm promises to be very competitive on a variety of parallel architectures.
Shroff, Gautam↗
Convergence of Defect-Correction and Multigrid Iterations for Inviscid Flows
Convergence of multigrid and defect-correction iterations is comprehensively studied within different incompressible and compressible inviscid regimes on high-density grids. Good smoothing properties of the defect-correction relaxation have been shown using both a modified Fourier analysis and a more general idealized-coarse-grid analysis. Single-grid defect correction alone has some slowly converging iterations on grids of medium density. The convergence is especially slow for near-sonic flows and for very low compressible Mach numbers. Additionally, the fast asymptotic convergence seen on medium density grids deteriorates on high-density grids. Certain downstream-boundary modes are very slowly damped on high-density grids. Multigrid scheme accelerates convergence of the slow defect-correction iterations to the extent determined by the coarse-grid correction. The two-level asymptotic convergence rates are stable and significantly below one in most of the regions but slow convergence is noted for near-sonic and very low-Mach compressible flows. Multigrid solver has been applied to the NACA 0012 airfoil and to different flow regimes, such as near-tangency and stagnation. Certain convergence difficulties have been encountered within stagnation regions. Nonetheless, for the airfoil flow, with a sharp trailing-edge, residuals were fast converging for a subcritical flow on a sequence of grids. For supercritical flow, residuals converged slower on some intermediate grids than on the finest grid or the two coarsest grids.
Diskin, Boris↗
Aspects and applications of patched grid calculations
Patched grid calculations within the framework of an implicit, flux vector split upwind/relaxation algorithm for the Euler equations are presented. Aspects of computing on patched grids are discussed including the effect of a metric-discontinuous interface on the convergence rate of the algorithm, and the effect of curvature along an interface. Applications to a converging-diverging nozzle including effects of choking and bypass slots in two dimensions are presented.
Walters, Robert W.↗
Vectorizable multigrid algorithms for transonic-flow calculations
The analysis and the incorporation into a multigrid scheme of several vectorizable algorithms are discussed. von Neumann analyses of vertical-line, horizontal-line, and alternating-direction ZEBRA algorithms were performed; and the results were used to predict their multigrid damping rates. The algorithms were then successfully implemented in a transonic conservative full-potential computer program. The convergence acceleration effect of multiple grids is shown, and the convergence rates of the vectorizable algorithms are compared with those of standard successive-line overrelaxation (SLOR) algorithms.
Melson, N. D.↗
Implicit solution of three-dimensional internal turbulent flows
The scalar form of the approximate factorization method was used to develop a new code for the solution of three-dimensional internal laminar and turbulent compressible flows. The Navier-Stokes equations in their Reynolds-averaged form are iterated in time until a steady solution is reached. Evidence is given to the implicit and explicit artificial damping schemes that proved to be particularly efficient in speeding up convergence and enhancing the algorithm robustness. A conservative treatment of these terms at domain boundaries is proposed in order to avoid undesired mass and/or momentum artificial fluxes. Turbulence effects are accounted for by the zero-equation Baldwin-Lomax turbulence model and the q-omega two-equation model. For the first, an investigation on the model behavior in case of multiple boundaries is performed. The flow in a developing S-duct is then solved in the laminar regime at Reynolds number (Re) 790 and in the turbulent regime at Re=40,000 using the Baldwin-Lomax model . The Stanitz elbow is then solved using an inviscid version of the same code at M(sub inlet)=0.4. Grid dependence and convergence rate are investigated showing that for this solver the implicit damping scheme may play a critical role for convergence characteristics. The same flow at Re=2.5x10(exp 6) is solved with the Baldwin-Lomax and the q-omega models. Both approaches showed satisfactory agreement with experiments, although the q-omega model is slightly more accurate.
Michelassi, V.↗
Implicit solution of three-dimensional internal turbulent flows
The scalar form of the approximate factorization method was used to develop a new code for the solution of three dimensional internal laminar and turbulent compressible flows. The Navier-Stokes equations in their Reynolds-averaged form were iterated in time until a steady solution was reached. Evidence was given to the implicit and explicit artificial damping schemes that proved to be particularly efficient in speeding up convergence and enhancing the algorithm robustness. A conservative treatment of these terms at the domain boundaries was proposed in order to avoid undesired mass and/or momentum artificial fluxes. Turbulence effects were accounted for by the zero-equation Baldwin-Lomax turbulence model and the q-omega two-equation model. The flow in a developing S-duct was then solved in the laminar regime in a Reynolds number (Re) of 790 and in the turbulent regime at Re equals 40,000 by using the Baldwin-Lomax model. The Stanitz elbow was then solved by using an invicid version of the same code at M sub inlet equals 0.4. Grid dependence and convergence rate were investigated, showing that for this solver the implicit damping scheme may play a critical role for convergence characteristics. The same flow at Re equals 2.5 times 10(exp 6) was solved with the Baldwin-Lomax and the q-omega models. Both approaches show satisfactory agreement with experiments, although the q-omega model was slightly more accurate.
Michelassi, V.↗
An Analytical Investigation of Three General Methods of Calculating Chemical-Equilibrium Compositions
The Brinkley, Huff, and White methods for chemical-equilibrium calculations were modified and extended in order to permit an analytical comparison. The extended forms of these methods permit condensed species as reaction products, include temperature as a variable in the iteration, and permit arbitrary estimates for the variables. It is analytically shown that the three extended methods can be placed in a form that is independent of components. In this form the Brinkley iteration is identical computationally to the White method, while the modified Huff method differs only'slightly from these two. The convergence rates of the modified Brinkley and White methods are identical; and, further, all three methods are guaranteed to converge and will ultimately converge quadratically. It is concluded that no one of the three methods offers any significant computational advantages over the other two.
Zeleznik, Frank J.↗