Numerical integration of ordinary differential equations on manifolds

Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.     

CONCEPTUAL DESIGN STUDIES OF AN 84 GHz, 500 kW, CW GYROTRON

The feasibility of an 84 GHz, 500 kW, CW gyrotron for ECRH on an experimental tokamak will be presented in this paper. Mode competition and mode selection procedures are carefully investigated by considering various candidate modes and the TE_10,4 mode is chosen as the operating mode. A conventional cylindrical cavity resonator with weak input and output tapers and parabolic roundings is considered for interaction studies. Self-consistent, both single mode and time-dependent, calculations are carried out and power and efficiencies are computed for a typical set of beam parameters. The results show that an output power of well over 500 kW, CW and efficiency around 40% can be reached without a depressed collector.     

On a class of new and practical performance indexes for approximation of fold bifurcations of nonlinear power flow equations

Efficient measurement of the performance index (the distance of a loading parameter from the voltage collapse point) is one of the key problems in power system operations and planning and such an index indicates the severity of a power system with regard to voltage collapse. There exist many interesting methods and ideas to compute this index. However, some successful methods are not yet mathematically justified while other mathematically sound methods are often proposed directly based on the bifurcation theory and they require the initial stationary state to be too close to the unknown turning point to make the underlying methods practical.This paper first gives a survey of several popular methods for estimating the fold bifurcation point including the continuation methods, bifurcation methods and the test function methods (Seydel's direct solution methods, the tangent vector methods and the reduced Jacobian method) and discuss their relative advantages and problems. Test functions are usually based on scaling of the determinant of the Jacobian matrix and it is generally not clear how to determine the behaviour of such functions. As the underlying nonlinear equations are of a particular type, this allows us to do a new analysis of the determinants of the Jacobian and its submatrices in this paper. Following the analysis, we demonstrate how to construct a class of test functions with a predictable analytical behaviour so that a suitable index can be produced. Finally, examples of two test functions from this class are proposed. For several standard IEEE test systems, promising numerical results have been achieved.     

An efficient numerical scheme for precise time integration of a diffusion-dissolution/precipitation chemical system

A numerical scheme based on an operator splitting method and a dense output event location algorithm is proposed to integrate a diffusion-dissolution/precipitation chemical initial-boundary value problem with jumping nonlinearities. The numerical analysis of the scheme is carried out and it is proved to be of order 2 in time. This global order estimate is illustrated numerically on a test case.

     

非傍轴平顶高斯光束M2因子两种定义的比较研究

基于功率密度的二阶矩方法,推导出了非傍轴平顶高斯(FG)光束束宽和远场发散角的解析表达式·研究表明,当w0/λ→0时,远场发散角趋于渐近值θmax=63.435°,与阶数无关·使用非傍轴高斯光束代替傍轴高斯光束作为理想光束,研究了非傍轴FG光束的M2因子,并与传统定义的M2因子作了比较·在非傍轴范畴,非傍轴FG光束的M2因子不仅与阶数N有关,而且与w0/λ有关·按照定义,当w0/λ→0时,非傍轴FG光束的M2因子不等于0,对阶数N=1,2,3时,M2因子分别趋于0.913,0.882和0.886·当N→∞时,M2因子取最小值M2min=0.816·     

非傍轴平顶高斯光束M2因子两种定义的比较研究

基于功率密度的二阶矩方法，推导出了非傍轴平顶高斯(FG)光束束宽和远场发散角的解析表达式.研究表明，当w0/λ→0时，远场发散角趋于渐近值θmax=63.435°，与阶数无关.使用非傍轴高斯光束代替傍轴高斯光束作为理想光束，研究了非傍轴FG光束的M2因子，并与传统定义的M2因子作了比较.在非傍轴范畴，非傍轴FG光束的M2因子不仅与阶数N有关，而且与w0/λ有关.按照定义，当w0/λ→0时，非傍轴FG光束的M2因子不等于0，对阶数N=1, 2, 3时，M2因子分别趋于0.913,0.882和0.886.当N→∞时，M2因子取最小值M2min=0.816.     

Semi‐analytical integration of the 8‐node plane element stiffness matrix using symbolic computation

The semi‐analytical integration of an 8‐node plane strain finite element stiffness matrix is presented in this work. The element is assumed to be super‐parametric, having straight sides. Before carrying out the integration, the integral expressions are classified into several groups, thus avoiding duplication of calculations. Symbolic manipulation and integration is used to obtain the basic formulae to evaluate the stiffness matrix. Then, the resulting expressions are postprocessed, optimized, and simplified in order to reduce the computation time. Maple symbolic‐manipulation software was used to generate the closed expressions and to develop the corresponding Fortran code. Comparisons between semi‐analytical integration and numerical integration were made. It was demonstrated that semi‐analytical integration required less CPU time than conventional numerical integration (using Gaussian‐Legendre quadrature) to obtain the stiffness matrix. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Numerical solution of the three‐dimensional parabolic equation with an integral condition

Developement of numerical methods for obtaining approximate solutions to the three dimensional diffusion equation with an integral condition will be carried out. The numerical techniques discussed are based on the fully explicit (1,7) finite difference technique and the fully implicit (7,1) finite difference method and the (7,7) Crank‐Nicolson type finite difference formula. The new developed methods are tested on a problem. Truncation error analysis and numerical examples are used to illustrate the accuracy of the new algorithms. The results of numerical testing show that the numerical methods based on the finite difference techniques discussed in the present article produce good results. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 193–202, 2002; DOI 10.1002/num.1040     

Active long pulse shaping technique of pulsed CO2 laser using multi-pulse discharge control

We describe the pulse forming of pulsed CO₂ laser using multi-pulse superposition technique. Various pulse shapes, high duty cycle pulse forming network (PFN) are constructed by time sequence. This study shows a technology that makes it possible to make various long pulse shapes by activating SCRs of three PFN modules consecutively at a desirable delay time with the aid of a PIC one-chip microprocessor. The power supply for this experiment consists of three PFN modules. Each PFN module uses a capacitor, a pulse forming inductor, a SCR, a high voltage pulse transformer, and a bridge rectifier on each transformer secondary. The PFN modules operate at low voltage by driving the primary of HV pulse transformer. The secondary of the transformer has a full-wave rectifier, which passes the pulse energy to the load in a continuous sequence.We investigated various long pulse shapes as different trigger time intervals of SCRs among three PFN modules. As a result, we could obtain laser beam with various pulse shapes and durations from about 250 to 1000 μs.     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.