Tchebychev acceleration technique for large scale nonsymmetric matrices

Summary The acceleration by Tchebychev iteration for solving nonsymmetric eigenvalue problems is dicussed. A simple algorithm is derived to obtain the optimal ellipse which passes through two eigenvalues in a complex plane relative to a reference complex eigenvalue. New criteria are established to identify the optimal ellipse of the eigenspectrum. The algorithm is fast, reliable and does not require a search for all possible ellipses which enclose the spectrum. The procedure is applicable to nonsymmetric linear systems as well.     

Effect of Ru crystal orientation on the adhesion characteristics of Cu for ultra-large scale integration interconnects

The adhesion of Cu on Ru substrates with different crystal orientations was evaluated. The crystal orientation of sputter deposited Ru could be changed from (1 0 0) to (0 0 1) by annealing at 650 °C for 20 min. The adhesion of Cu was evaluated by the degree of Cu agglomeration on Ru. Cu films on annealed Ru films with the (0 0 1) crystal orientation showed 28% lower RMS values and 50% lower Ru surface coverage than Cu as-deposited on Ru having the (1 0 0) crystal orientation after annealing at 550 °C for 30 min, which suggest that Cu wettability on the Ru(0 0 1) was better than that on the Ru(1 0 0) plane. The low lattice misfit of 4% between Cu(1 1 1) and Ru(0 0 1) may be the reason for this good adhesion property.     

Mappings of finite distortion: Hausdorff measure of zero sets

We prove that a for a mapping f of finite distortion , the -Hausdorff measure of any point preimage is zero provided is integrable, with , and the multiplicity function of f is essentially bounded. As a consequence for we obtain that the mapping is then open and discrete. Received: 18 June 2001 / Revised version: 31 January 2002 / Published online: 27 June 2002     

瑞香狼毒防治仓储害虫活性物质的研究

瑞香狼毒 (ＳｔｅｌｌｅｒａｃｈａｍｅｊａｓｍｅＬ .)又名断肠草 ,为瑞香科狼毒属植物。瑞香狼毒在我国大部分地区均有分布 ,盛产于四川、河北、山西等地。其性苦、平、辛、有毒 ,有逐水、祛痰、破积、杀虫之功效。据文献报道 ,瑞香狼毒除了可作为中药外 ,还可以用来防治菜青虫、蚜虫、松毛虫 ,甚至可以用来杀蚊、驱蝇、灭蛆等。作者前期工作曾以瑞香狼毒根为材料 ,初步研究了根及根粉粗提物对米象、玉米象、谷蠹的防治效果。发现瑞香狼毒对米象、玉米象、谷蠹等仓储害虫均有较好的防治功效[1] 。本文以米象为试虫 ,以生物活性跟踪法对瑞…     

Estimating the largest singular values of large sparse matrices via modified moments

We describe a procedure for determining a few of the largest singular values of a large sparse matrix. The method by Golub and Kent which uses the method of modified moments for estimating the eigenvalues of operators used in iterative methods for the solution of linear systems of equations is appropriately modified in order to generate a sequence of bidiagonal matrices whose singular values approximate those of the original sparse matrix. A simple Lanczos recursion is proposed for determining the corresponding left and right singular vectors. The potential asynchronous computation of the bidiagonal matrices using modified moments with the iterations of an adapted Chebyshev semi-iterative (CSI) method is an attractive feature for parallel computers. Comparisons in efficiency and accuracy with an appropriate Lanczos algorithm (with selective re-orthogonalization) are presented on large sparse (rectangular) matrices arising from applications such as information retrieval and seismic reflection tomography. This procedure is essentially motivated by the theory of moments and Gauss quadrature.This author's work was supported by the National Science Foundation under grants NSF CCR-8717492 and CCR-910000N (NCSA), the U.S. Department of Energy under grant DOE DE-FG02-85ER25001, and the Air Force Office of Scientific Research under grant AFOSR-90-0044 while at the University of Illinois at Urbana-Champaign Center for Supercomputing Research and Development.This author's work was supported by the U.S. Army Research Office under grant DAAL03-90-G-0105, and the National Science Foundation under grant NSF DCR-8412314.     

A Monte Carlo method for high dimensional integration

Summary A new method for the numerical integration of very high dimensional functions is introduced and implemented based on the Metropolis' Monte Carlo algorithm. The logarithm of the high dimensional integral is reduced to a 1-dimensional integration of a certain statistical function with respect to a scale parameter over the range of the unit interval. The improvement in accuracy is found to be substantial comparing to the conventional crude Monte Carlo integration. Several numerical demonstrations are made, and variability of the estimates are shown.     

Eigenvalues of Two Parameter Polynomial Operator Pencils of Waveguide Type

The spectral structure of two parameter unbounded operator pencils of waveguide type is studied. Theorems on discreteness of the spectrum for a fixed parameter are proved. Variational principles for real eigenvalues in some parts of the root zones are established. In the case of n = 1 (quadratic pencils) domains containing the spectrum are described (see Fig. 1–3). Conditions in the definition of the pencils of waveguide type arise naturally from physical problems and each of them has a physical meaning. In particular a connection between the energetic stability condition and a perturbation problem for the coefficients is given.     

Well-posed absorbing layer for hyperbolic problems

Summary. The perfectly matched layer (PML) is an efficient tool to simulate propagation phenomena in free space on unbounded domain. In this paper we consider a new type of absorbing layer for Maxwell's equations and the linearized Euler equations which is also valid for several classes of first order hyperbolic systems. The definition of this layer appears as a slight modification of the PML technique. We show that the associated Cauchy problem is well-posed in suitable spaces. This theory is finally illustrated by some numerical results. It must be underlined that the discretization of this layer leads to a new discretization of the classical PML formulation. Received May 5, 2000 / Published online November 15, 2001     

A posteriori error estimators for the Stokes equations

Summary We present two a posteriori error estimators for the mini-element discretization of the Stokes equations. One is based on a suitable evaluation of the residual of the finite element solution. The other one is based on the solution of suitable local Stokes problems involving the residual of the finite element solution. Both estimators are globally upper and locally lower bounds for the error of the finite element discretization. Numerical examples show their efficiency both in estimating the error and in controlling an automatic, self-adaptive mesh-refinement process. The methods presented here can easily be generalized to the Navier-Stokes equations and to other discretization schemes.This work was accomplished at the Universität Heidelberg with the support of the Deutsche Forschungsgemeinschaft     

Error estimate for a stabilised domain decomposition method with nonmatching grids

Summary. In this paper, we analyse a stabilisation technique for the so-called three-field formulation for nonoverlapping domain decomposition methods. The stabilisation is based on boundary bubble functions in each subdomain which are then eliminated by static condensation. The discretisation grids in the subdomains can be chosen independently as well as the grid for the final interface problem. We present the analysis of the method and we construct a set of bubble functions which guarantees the optimal rate of convergence. Received May 12, 1998 / Revised version received November 21, 2000 / Published online June 7, 2001