牛顿第二定律实验中的误差分析

本文是通过对加速度的实验值和理论值进行比较和分析,给出误差的合理范围。     

Effects of laser intensity on the emission direction of fast electrons in laser-solid interactions

The dependence of emission direction of fast electrons on the laser intensity has been investigated. The experimental results show that, at nonrelativistic laser intensities, the emission of fast electrons is mainly in the polarization plane. With the increase of the laser intensity, fast electrons emit towards the laser propagation direction from laser polarization direction. At relativistic laser intensities, fast electrons move away from the laser polarization plane, closely to the reflection direction of the incident laser beam.     

Acceleration waves analyzed by a new continuum model of solids incorporating microscopic thermal vibrations

Acceleration waves propagating in isotropic solids at finite temperatures are studied by applying the method of singular surfaces to a new continuum model derived statistical-mechanically from a three-dimensional lattice model. The continuum model explicitly takes into account the microscopic thermal vibrations of the constituent atoms as one of the field variables. The propagation speeds and the ratios of mechanical and thermal amplitudes for both longitudinal and transverse waves are consistently determined. The differential equations that govern the time variation of the amplitudes of the waves are also derived. The analytical results, which are valid over a wide temperature range that includes the melting point, are evaluated numerically for several materials, and their physical implications are discussed. One of the findings to be emphasized is that of the singularities of the characteristic quantities at the melting point.Received: 13 March 2003, Accepted: 20 June 2003PACS: 62.30. + d, 65.40.-bM. Sugiyama: Correspondence to Dedicated to Prof. Ingo Müller on the occasion of his 65th birthday.     

Convergence acceleration of segregated algorithms using dynamic tuning additive correction multigrid strategy

A convergence acceleration method based on an additive correction multigrid–SIMPLEC (ACM‐S) algorithm with dynamic tuning of the relaxation factors is presented. In the ACM‐S method, the coarse grid velocity correction components obtained from the mass conservation (velocity potential) correction equation are included into the fine grid momentum equations before the coarse grid momentum correction equations are formed using the additive correction methodology. Therefore, the coupling between the momentum and mass conservation equations is obtained on the coarse grid, while maintaining the segregated structure of the single grid algorithm. This allows the use of the same solver (smoother) on the coarse grid. For turbulent flows with heat transfer, additional scalar equations are solved outside of the momentum–mass conservation equations loop. The convergence of the additional scalar equations is accelerated using a dynamic tuning of the relaxation factors. Both a relative error (RE) scheme and a local Reynolds/Peclet (ER/P) relaxation scheme methods are used. These methodologies are tested for laminar isothermal flows and turbulent flows with heat transfer over geometrically complex two‐ and three‐dimensional configurations. Savings up to 57% in CPU time are obtained for complex geometric domains representative of practical engineering problems. Copyright © 1999 John Wiley & Sons, Ltd.     

复振型导数计算的移位多次模态加速法

本文研究了含粘性阻尼结构的复振型导数计算问题，将导数计算问题看成是一个简谐激振的响应计算问题，采用多次模态加速法和移位法，导出了复振型导数计算的移位多次模态加速法。该方法具有明确的数学和物理意义，可导出已有的各种计算方法。算例表明本方法计算复振型导数只需用很少几个模态即可保证精度，计算量大大减少。     

Accelerating infinite products

Slowly convergent infinite products are considered, where is a sequence of numbers, or a sequence of linear operators. Using an asymptotic expansion for the “remainder” of the infinite product a method for convergence acceleration is suggested. The method is in the spirit of the d-transformation for series. It is very simple and efficient for some classes of sequences . For complicated sequences it involves the solution of some linear systems, but it is still effective. This revised version was published online in June 2006 with corrections to the Cover Date.     

Convergence Acceleration of Taylor Sections by Convolution

Taylor sections S _n (f) of an entire function f often provide easy computable polynomial approximants of f . However, while the rate of convergence of (S _n (f)) _n is nearly optimal on circles around the origin, this is no longer true for other plane sets as, for example, real compact intervals. The aim of this paper is to construct for certain families of (entire) functions sequences of polynomial approximants which are computable with essentially the same effort as Taylor sections and which have a better rate of convergence on some parts of the plane. The resulting method may be applied, for example, to (modified) Bessel functions, to confluent hypergeometric functions, or to parabolic cylinder functions. October 2, 1997. Date revised: March 12, 1998. Date accepted: April 28, 1998.     

An efficient algorithm for accelerating the convergence of oscillatory series,useful for computing the polylogarithm and Hurwitz zeta functions

This paper sketches a technique for improving the rate of convergence of a general oscillatory sequence, and then applies this series acceleration algorithm to the polylogarithm and the Hurwitz zeta function. As such, it may be taken as an extension of the techniques given by Borwein’s “An efficient algorithm for computing the Riemann zeta function” by Borwein for computing the Riemann zeta function, to more general series. The algorithm provides a rapid means of evaluating Li _s (z) for general values of complex s and a kidney-shaped region of complex z values given by ∣z ²/(z–1)∣<4. By using the duplication formula and the inversion formula, the range of convergence for the polylogarithm may be extended to the entire complex z-plane, and so the algorithms described here allow for the evaluation of the polylogarithm for all complex s and z values. Alternatively, the Hurwitz zeta can be very rapidly evaluated by means of an Euler–Maclaurin series. The polylogarithm and the Hurwitz zeta are related, in that two evaluations of the one can be used to obtain a value of the other; thus, either algorithm can be used to evaluate either function. The Euler–Maclaurin series is a clear performance winner for the Hurwitz zeta, while the Borwein algorithm is superior for evaluating the polylogarithm in the kidney-shaped region. Both algorithms are superior to the simple Taylor’s series or direct summation. The primary, concrete result of this paper is an algorithm allows the exploration of the Hurwitz zeta in the critical strip, where fast algorithms are otherwise unavailable. A discussion of the monodromy group of the polylogarithm is included.      

The double deflating technique for irreducible singular M-matrix algebraic Riccati equations in the critical case

As is known, Alternating-Directional Doubling Algorithm (ADDA) is quadratically convergent for computing the minimal nonnegative solution of an irreducible singular M-matrix algebraic Riccati equation (MARE) in the noncritical case or a nonsingular MARE, but ADDA is only linearly convergent in the critical case. The drawback can be overcome by deflating techniques for an irreducible singular MARE so that the speed of quadratic convergence is still preserved in the critical case and accelerated in the noncritical case. In this paper, we proposed an improved deflating technique to accelerate further the convergence speed – the double deflating technique for an irreducible singular MARE in the critical case. We proved that ADDA is quadratically convergent instead of linearly when it is applied to the deflated algebraic Riccati equation (ARE) obtained by a double deflating technique. We also showed that the double deflating technique is better than the deflating technique from the perspective of dimension of the deflated ARE. Numerical experiments are provided to illustrate that our double deflating technique is effective.     

A robust algorithm for blind total variation restoration

Image restoration is a fundamental problem in image processing. Blind image restoration has a great value in its practical application. However, it is not an easy problem to solve due to its complexity and difficulty. In this paper, we combine our robust algorithm for known blur operator with an alternating minimization implicit iterative scheme to deal with blind deconvolution problem, recover the image and identify the point spread function（PSF）. The only assumption needed is satisfy the practical physical sense. Numerical experiments demonstrate that this minimization algorithm is efficient and robust over a wide range of PSF and have almost the same results compared with known PSF algorithm.