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.     

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).     

Approximating dominant singular triplets of large sparse matrices via modified moments

A procedure for determining a few of the largest singular values and corresponding singular vectors of large sparse matrices is presented. Equivalent eigensystems are solved using a technique originally proposed by Golub and Kent based on the computation of modified moments. The asynchronicity in the computations of moments and eigenvalues makes this method attractive for parallel implementations on a network of workstations. Although no obvious relationship between modified moments and the corresponding eigenvectors is known to exist, a scheme to approximate both eigenvalues and eigenvectors (and subsequently singular values and singular vectors) has been produced. This scheme exploits both modified moments in conjunction with the Chebyshev semi-iterative method and deflation techniques to produce approximate eigenpairs of the equivalent sparse eigensystems. The performance of an ANSI-C implementation of this scheme on a network of UNIX workstations and a 256-processor Cray T3D is presented.This research was supported in part by the National Science Foundation under grant numbers NSF-ASC-92-03004 and NSF-ASC-94-11394.     

Optimal error estimates of a locally one-dimensional method for the multidimensional heat equation

For the multidimensional heat equation in a parallelepiped, optimal error estimates inL ₂(Q) are derived. The error is of the order of +¦h¦² for any right-hand sidef L ₂(Q) and any initial function ; for appropriate classes of less regularf andu ₀, the error is of the order of ((+¦h¦² ), 1/2<1.Translated fromMatematicheskie Zametki, Vol. 60, No. 2, pp. 185–197, August, 1996.     

关于丢番图方程x^2±2^m=y^n

本文证明了：方程ｘ２＋２ｍ＝ｙｎ，ｘ，ｙ，ｍ，ｎ∈Ｎ，ｇｃｄ（ｘ，ｙ）＝１，ｎ＞２仅有有限多组解（ｘ，ｙ，ｍ，ｎ），而且当（ｘ，ｙ，ｍ，ｎ）≠（５，３，１，３），（１１，５，２，３），（７，３，５，４）时，ｎ是适合ｎ≡７（ｍｏｄ８）以及２３≤ｎ＜８．５·１０６的奇素数，ｍａｘ（ｘ，ｙ，ｍ）＜Ｃ１；方程ｘ２－２ｍ＝ｙｎ，ｘ，ｙ，ｍ，ｎ∈Ｎ，ｇｃｄ（ｘ，ｙ）＝１，ｙ＞１；ｎ＞２仅有有限多组解（ｘ，ｙ，ｍ，ｎ），而且这些解都满足ｎ＜２·１０９炉以及ｍａｘ（ｘ，ｙ，ｍ）＜Ｃ２，这里Ｃ１，Ｃ２是可有效计算的绝对常数．     

一类Schrodinger方程的周期解和谱方法

本文利用半群理论讨论了一类非线性非自共轭Ｓｃｈｒｏｄｉｎｇｅｒ方程周期初边值解的存在唯一性，以及它的Ｆｏｕｒｉｅｒ谱方法的可解性，稳定性和收敛性     

求解变系数非齐次亥姆霍茨方程的边界单元法

本文利用拉普拉斯方程的基本解作为权函数，给出求解交系数非齐次亥姆霍茨方程的迭代格式，进而得到求解这类方程的边界元迭代法．文中给出了算例．最后，把本文给出的边界元迭代法与作者早些时候提出的边界元耦合法进行了比较．     

考虑纤维端头脱粘的金属基复合材料轴向弹塑性拉伸性能的研究*

本文建立在广义自洽有限元迭代平均化方法的基础上,分析了纤维端头脱粘对SiC晶须增强铝基复合材料的轴向弹塑性拉伸性能的影响.分别计算了不同纤维长径比与体分比下有纤维端头脱粘情况的金属基复合材料的轴向拉伸性能.并与界面完好的情况相对比,得出了纤维端头脱粘的影响随纤维长径比增大而减小,和随纤维体分比增大而增大的结论.     

二维潜水运动方程的分裂解法

本文通过对二维潜水运动方程的变形，按其在形式上所代表的意义不同，用和分裂方法，把它分解成“对流”和“扩散”两部分．对前者，用交替方向有限差分法求解；对后者，用交替方向Ｐｉｃａｒｄ迭代法进行计算，从而达到获得整个问题的解的目的．最后，用数值例子验证了所提方法的有效性，并与线性化的有限差分法作了对比，证明本文所提方法在计算精度上有所提高。