能动反射镜低频像差补偿能力分析

 采用Algor软件包并利用有限元法对37单元能动反射镜低频误差补偿能力进行了分析计算，确定了镜面厚度8mm，驱动器间距46mm，极头直径12mm等能动反射镜制造的关键参数。通过计算机仿真分析证明，基于这些参数所设计的能动反射镜可以对低频误差进行有效校正，校正精度的均方根值小于等于λ／８，从而可以为能动反射镜的制造提供理论依据。     

重力场与静电场特点的比较

“场”是一种客观存在的物质，但由于“场”具有不易直接感受的特殊存在形态，同学们对“场”的物质性的理解不够深刻，解决“场”的相关问题时也感到棘手．笔者就高中阶段最典型的两种场——“重力场”和“静电场”的力学性质与能量特点进行比较，使同学们对“场”的概念有更深刻的认识．     

自主探索实验教学法--中学物理教学法实验课的教学改革

以“自主探索”的方式开展中学物理教学法实验课教学活动，在调动学生学习积极性、主动性，提高学生实验操作、设计、改进能力，培养师范生的教学素质等方面都优于传统的实验课开展方式．     

热线法测定气体导热系数实验的探讨与改进

在准静态低气压下测量气体的热传导系数时，理论上在低压强范围内应得到Q^-1低-p^-1线性关系图象，但实验数据所绘出的图象出现明显的非线性．本文着重分析出现非线性的原因，并提出实验改进的方法。     

The inverse problem of the calculus of variations for scalar fourth-order ordinary differential equations

A simple invariant characterization of the scalar fourth-order ordinary differential equations which admit a variational multiplier is given. The necessary and sufficient conditions for the existence of a multiplier are expressed in terms of the vanishing of two relative invariants which can be associated with any fourth-order equation through the application of Cartan's equivalence method. The solution to the inverse problem for fourth-order scalar equations provides the solution to an equivalence problem for second-order Lagrangians, as well as the precise relationship between the symmetry algebra of a variational equation and the divergence symmetry algebra of the associated Lagrangian.

     

Band Toeplitz preconditioners for block Toeplitz systems

We consider the solutions of block Toeplitz systems with Toeplitz blocks by the preconditioned conjugate gradient (PCG) method. Here the block Toeplitz matrices are generated by nonnegative functions f(x,y). We use band Toeplitz matrices as preconditioners. The generating functions g(x,y) of the preconditioners are trigonometric polynomials of fixed degree and are determined by minimizing (f − g)/f∞. We prove that the condition number of the preconditioned system is O(1). An a priori bound on the number of iterations for convergence is obtained.     

Some remarks on the modulus of continuity of a conformal mapping of the disk onto a Jordan domain

Letd(;z, t) be the smallest diameter of the arcs of a Jordan curve with endsz andt. Consider the rapidity of decreasing ofd(;)=sup{d(;z, t):z, t , ¦z–t¦} (as 0,0) as a measure of nicety of . Letg(x) (x0) be a continuous and nondecreasing function such thatg(x)x,g(0)=0. Put¯g(x)=g(x)+x, h(x)=(¯g(x))². LetH(x) be an arbitrary primitive of 1/h ^–1(x). Note that the functionH ^–1 x is positive and increasing on (–, +),H ^–1 0 asx– andH ^–1+ asx +. The following statement is proved in the paper.Translated fromMatematicheskie Zametki, Vol. 60, No. 2, pp. 176–184, August, 1996.This research was supported by the Russian Foundation for Basic Research under grant No. 93-01-00236 and by the International Science Foundation under grant No. NCF000.     

Symmetric form of the Hudson-Parthasarathy stochastic equation

We prove that the Hudson-Parthasarathy equation corresponds, up to unitary equivalence, to the strong resolvent limit of Schrödinger Hamiltonians in Fock space and that the symmetric form of this equation corresponds to the weak limit of the Schrödinger Hamiltonians.Translated fromMatematicheskie Zametki, Vol. 60, No. 5, pp. 726–750, November, 1996.     

The Padé-Rayleigh-Ritz method for solving large hermitian eigenproblems

We make use of the Padé approximants and the Krylov sequencex, Ax,,...,A ^m–1 x in the projection methods to compute a few Ritz values of a large hermitian matrixA of ordern. This process consists in approaching the poles ofR _x()=((I–A)^–1 x,x), the mean value of the resolvant ofA, by those of [m–1/m]_Rx(), where [m–1/m]_Rx() is the Padé approximant of orderm of the functionR _x(). This is equivalent to approaching some eigenvalues ofA by the roots of the polynomial of degreem of the denominator of [m–1/m]_Rx(). This projection method, called the Padé-Rayleigh-Ritz (PRR) method, provides a simple way to determine the minimum polynomial ofx in the Krylov subspace methods for the symmetrical case. The numerical stability of the PRR method can be ensured if the projection subspacem is sufficiently small. The mainly expensive portion of this method is its projection phase, which is composed of the matrix-vector multiplications and, consequently, is well suited for parallel computing. This is also true when the matrices are sparse, as recently demonstrated, especially on massively parallel machines. This paper points out a relationship between the PRR and Lanczos methods and presents a theoretical comparison between them with regard to stability and parallelism. We then try to justify the use of this method under some assumptions.     

Model reduction of state space systems via an implicitly restarted Lanczos method

The nonsymmetric Lanczos method has recently received significant attention as a model reduction technique for large-scale systems. Unfortunately, the Lanczos method may produce an unstable partial realization for a given, stable system. To remedy this situation, unexpensive implicit restarts are developed which can be employed to stabilize the Lanczos generated model.This work was supported in part by ARPA (US Army ORA4466.01), by ARPA (Grant 60NANB2D1272), by the Department of Energy (Contract DE-FG0f-91ER25103) and by the National Science Foundation (Grants CCR-9209349 and CCR-9120008).