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 595 records · Page 33

A relaxation approach to patched-grid calculations with the Euler equations

A conservative zonal-boundary condition that was used with explicit integration schemes is extended to implicit, upwind, relaxation schemes; in particular to the Osher scheme. The rate of convergence was found to increase considerably with the use of the implicit, relaxation-zonal scheme when compared to the explicit scheme. The relaxation-zonal scheme has also been used in a time-accurate mode. Results demonstrating the time accuracy of the scheme and the feasibility of performing calculations in cases where some parts of the given system move relative to others (for example, rotor-stator configurations) are presented.

Rai, M. M.↗

An implicit, conservative, zonal-boundary scheme for Euler equation calculations

A 'zonal', or 'patched-grid', approach is one in which the flow region of interest is divided into subregions which are then discretized independently, using existing grid generators. The equations of motion are integrated in each subregion in conjunction with zonal-boundary schemes which allow proper information transfer across interfaces that separate subregions. The zonal approach greatly simplifies the treatment of complex geometries and also the addition of grid points to selected regions of the flow. In this study a conservative, zonal-boundary condition that could be used with explicit schemes has been extended so that it can be used with existing second-order-accurate implicit integration schemes such as the Beam-Warming and Osher schemes. In the test case considered, the implicit schemes increased the rate of convergence considerably (by a factor of about 30 over that of the explicit scheme). Results demonstrating the time-accuracy of the zonal scheme and the feasibility of performing calculations on zones that move relative to each other are also presented.

Rai, M. M.↗

The application of Legendre-tau approximation to parameter identification for delay and partial differential equations

Approximation schemes based on Legendre-tau approximation are developed for application to parameter identification problem for delay and partial differential equations. The tau method is based on representing the approximate solution as a truncated series of orthonormal functions. The characteristic feature of the Legendre-tau approach is that when the solution to a problem is infinitely differentiable, the rate of convergence is faster than any finite power of 1/N; higher accuracy is thus achieved, making the approach suitable for small N.

Ito, K.↗

Application of adaptive control to space stations

The space station will be deployed and assembled in low earth orbit with multiple Shuttle trips. Several construction phases will be required involving both ground and in-orbit operations. In this paper, the construction process of a four-panel space station and its control problems are discussed. The applicability of a direct model reference adaptive control technique with plant augmentation is investigated. Control during several key assembly operation periods has been simulated. These include Shuttle docking with initial-phase station, habitat module mating, and Shuttle docking with operational station. High rate of convergence and robust performance have been observed for all the simulated cases even with 40 percent model parameter errors and model truncations and more than 100 percent instant mass property variations. Controller with severe gain saturations is also discussed and results show only slight performance deterioration.

Ih, C.-H. C.↗

Extensions of the Ritz-Galerkin method for the forced, damped vibrations of structural elements

The Ritz-Galerkin methods were used to obtain approximate solutions for free undamped, vibration problems. It is demonstrated that these same methods may be used straightforwardly to analyze forced vibrations with damping without requiring the free vibration eigenfunctions. It was shown that the Galerkin method is an effective technique for these types of problems. The Ritz method has the advantage that it does not need to satisfy the force-type boundary conditions, which is particularly important for plates and shells. Proper functionals representing the forcing and damping terms were developed. Two types of damping--viscous and material (hysteretic) are discussed. Distributed and concentrated exciting forces are treated. Numerical results are obtained for cantilevered beams and rectangular plates. The rates of convergence of the solutions are shown. Approximate solutions from the present methods are compared with the exact solutions for the cantilever beam.

Leissa, A. W.↗

Adaptive Inverse Control for Rotorcraft Vibration Reduction

This thesis extends the Least Mean Square (LMS) algorithm to solve the mult!ple-input, multiple-output problem of alleviating N/Rev (revolutions per minute by number of blades) helicopter fuselage vibration by means of adaptive inverse control. A frequency domain locally linear model is used to represent the transfer matrix relating the higher harmonic pitch control inputs to the harmonic vibration outputs to be controlled. By using the inverse matrix as the controller gain matrix, an adaptive inverse regulator is formed to alleviate the N/Rev vibration. The stability and rate of convergence properties of the extended LMS algorithm are discussed. It is shown that the stability ranges for the elements of the stability gain matrix are directly related to the eigenvalues of the vibration signal information matrix for the learning phase, but not for the control phase. The overall conclusion is that the LMS adaptive inverse control method can form a robust vibration control system, but will require some tuning of the input sensor gains, the stability gain matrix, and the amount of control relaxation to be used. The learning curve of the controller during the learning phase is shown to be quantitatively close to that predicted by averaging the learning curves of the normal modes. For higher order transfer matrices, a rough estimate of the inverse is needed to start the algorithm efficiently. The simulation results indicate that the factor which most influences LMS adaptive inverse control is the product of the control relaxation and the the stability gain matrix. A small stability gain matrix makes the controller less sensitive to relaxation selection, and permits faster and more stable vibration reduction, than by choosing the stability gain matrix large and the control relaxation term small. It is shown that the best selections of the stability gain matrix elements and the amount of control relaxation is basically a compromise between slow, stable convergence and fast convergence with increased possibility of unstable identification. In the simulation studies, the LMS adaptive inverse control algorithm is shown to be capable of adapting the inverse (controller) matrix to track changes in the flight conditions. The algorithm converges quickly for moderate disturbances, while taking longer for larger disturbances. Perfect knowledge of the inverse matrix is not required for good control of the N/Rev vibration. However it is shown that measurement noise will prevent the LMS adaptive inverse control technique from controlling the vibration, unless the signal averaging method presented is incorporated into the algorithm.

Jacklin, Stephen A.↗

Multigrid applied to singular perturbation problems

The solution of the singular perturbation problem by a multigrid algorithm is considered. Theoretical and experimental results for a number of different discretizations are presented. The theoretical and observed rates agree with the results developed in an earlier work of Kamowitz and Parter. In addition, the rate of convergence of the algorithm when the coarse grid operator is the natural finite difference analog of the fine grid operator is presented. This is in contrast to the case in the previous work where the Galerkin choice (I sup H sub h L sub h,I sup h sub H) was used for the coarse grid operators.

Kamowitz, David↗

Simple numerical method for predicting steady compressible flows

A numerical method for solving the isenthalpic form of the governing equations for compressible viscous and inviscid flows was developed. The method was based on the concept of flux vector splitting in its implicit form. The method was tested on several demanding inviscid and viscous configurations. Two different forms of the implicit operator were investigated. The time marching to steady state was accelerated by the implementation of the multigrid procedure. Its various forms very effectively increased the rate of convergence of the present scheme. High quality steady state results were obtained in most of the test cases; these required only short computational times due to the relative efficiency of the basic method.

Vonlavante, Ernst↗

Multigrid solution of inviscid transonic flow through rotating blade passages

A fast Euler solver for three dimensional inviscid transonic flow in rotating domains is described. The time dependent Euler equations are discretized spatially with finite volumes, and are advanced temporally with a multiple stage time stepping scheme. A dramatic increase in the rate of convergence for steady solutions is achieved with a multigrid algorithm that employs the multistage scheme as its smoothing procedure. The effectiveness of the multistage scheme as a multigrid driver is enhanced by the utilization of analytically determined combinations of the governing parameters.

Smith, Wayne A.↗

Multigrid acceleration of the isenthalpic form of the compressible flow equations

A numerical method for solving the isenthalpic form of the governing equations for compressible inviscid flows was developed. The method is based on the concept of flux vector splitting in its implicit form and was tested on several demanding configurations. Time marching to steady state was accelerated by the implementation of the multigrid procedure which very effectively increased the rate of convergence. High quality steady-state results were obtained for various test cases and required only short computational times due to the relative efficiency of the basic method.

Melson, N. Duane↗

CONDIF - A modified central-difference scheme with unconditional stability and very low numerical diffusion

This paper describes a method, called CONDIF, which retains the essential nature of the central difference scheme (CDS) but eliminates the over- and under-shoots. It modifies the CDS by introducing a controlled amount of numerical diffusion based on local gradients. The results obtained for a number of test problems show that the CONDIF is significantly more accurate than the hybrid scheme when the Peclet number is very high and the flow is at large angles to the grid. In the worst case, it yields results similar to those of the hybrid scheme. Though the CONDIF is unconditionally stable, under some conditions the rate of convergence deteriorates as the grid Peclet number is increased. Efforts are currently underway to develop a faster converging variation of CONDIF.

Runchal, Akshai K.↗

Solution methods for one-dimensional viscoelastic problems

A recently developed differential methodology for solution of one-dimensional nonlinear viscoelastic problems is presented. Using the example of an eccentrically loaded cantilever beam-column, the results from the differential formulation are compared to results generated using a previously published integral solution technique. It is shown that the results obtained from these distinct methodologies exhibit a surprisingly high degree of correlation with one another. A discussion of the various factors affecting the numerical accuracy and rate of convergence of these two procedures is also included. Finally, the influences of some 'higher order' effects, such as straining along the centroidal axis are discussed.

Stubstad, John M.↗

Relaxation schemes for spectral multigrid methods

The effectiveness of relaxation schemes for solving the systems of algebraic equations which arise from spectral discretizations of elliptic equations is examined. Iterative methods are an attractive alternative to direct methods because Fourier transform techniques enable the discrete matrix-vector products to be computed almost as efficiently as for corresponding but sparse finite difference discretizations. Preconditioning is found to be essential for acceptable rates of convergence. Preconditioners based on second-order finite difference methods are used. A comparison is made of the performance of different relaxation methods on model problems with a variety of conditions specified around the boundary. The investigations show that iterations based on incomplete LU decompositions provide the most efficient methods for solving these algebraic systems.

Phillips, Timothy N.↗

SOR and MGR(nu) experiments on the Crystal multicomputer

This report describes distributed implementations of the red/black SOR algorithm and of the MGR(nu) multigrid algorithm on the Crystal multicomputer. Rates of convergence and observed efficiencies for both algorithms are compared.

Kamowitz, David↗

Three dimensional numerical scattering from ocean-like surfaces

A new method of calculating the electric field scattered from two-dimensional conducting rough surfaces is presented. This method uses the operator conjugate gradients technique and the extended boundary condition equation. This avoids the build-up of round-off errors encountered in the inversion of large matrices. It also avoids the singularities of the integral kernels usually encountered in the method of moments. Techniques for improving the rate of convergence by applying physical constraints are discussed. This method is presently being used to calculate the polarization signatures from simulated ocean-like surfaces.

Rodriguez, Ernesto↗

Multigrid acceleration of the isenthalpic form of the compressible flow equations

A numerical method for solving the isenthalpic form of the governing equations for compressible inviscid flows was developed. The method is based on the concept of flux vector splitting in its implicit form and was tested on several demanding configurations. Time marching to steady state was accelerated by the implementation of the multigrid procedure which very effectively increased the rate of convergence. High quality steady-state results were obtained for various test cases and required only short computational times due to the relative efficiency of the basic method.

Melson, N. Duane↗

Simple numerical method for solving the steady Euler equations

A numerical method for solving the isenthalpic form of the governing equations for compressible inviscid flows is developed. The method is based on the concept of flux vector splitting in its implicit form and is tested on several demanding configurations. Time marching to steady state is accelerated by the implementation of the multigrid procedure which very effectively increases the rate of convergence. Steady-state results are obtained for various test cases. Only short computational times are required due to the relative efficiency of the basic method.

Von Lavante, E.↗

Least-squares finite elements for Stokes problem

A least-squares method based on the first-order velocity-pressure-vorticity formulation for the Stokes problem is proposed. This method leads to a minimization problem rather than to a saddle-point problem. The choice of the combinations of elements is thus not subject to the Ladyzhenskaya-Babuska-Brezzi (LBB) condition. Numerical results are given for the optimal rate of convergence for equal-order interpolations.

Jiang, Bo-Nan↗