On the Stability of Bifurcation Diagrams of Vanishing Flattening Points

On a smooth surface in Euclidean 3-space, we consider vanishing curves whose projections on a given plane are small circles centered at the origin. The bifurcations diagram of a parameter-dependent surface is the set of parameters and radii of the circles corresponding to curves with degenerate flattening points. Solving a problem due to Arnold, we find a normal form of the first nontrivial example of a flattening bifurcation diagram, which contains one continuous invariant.     

Linearisation and potential symmetries of certain systems of diffusion equations

We consider systems of two pure one-dimensional diffusion equations that have considerable interest in Soil Science and Mathematical Biology. We construct non-local symmetries for these systems. These are determined by expressing the equations in a partially and wholly conserved form, and then by performing a potential symmetry analysis on those systems that can be linearised. We give several examples of such systems, and in a specific case we show how linearising and hodograph-type mappings can lead to new solutions of the diffusion system.     

单调和Fuzzy单调变分不等式的补偿方法

在实自反Banach空间,用补偿方法研究单调和Fuzzy单调广义非线性变分不等式,得到了几个解的存在性定理.改进和推广了Browder,Pascali-Sburlan,Zhang等人的各种结果.     

Fixed point theorems under the interior condition

We show a fixed point theorem for condensing mappings under a new condition of the Leray-Schauder type. We call it the Interior Condition. We also discuss examples that demonstrate the independence of these two conditions.

     

Continuous time collocation methods for Volterra-Fredholm integral equations

Summary Integral equations of mixed Volterra-Fredholm type arise in various physical and biological problems. In the present paper we study continuous time collocation, time discretization and their global and discrete convergence properties.     

Optimality relationships forp-cyclic SOR

Summary The optimality question for blockp-cyclic SOR iterations discussed in Young and Varga is answered under natural conditions on the spectrum of the block Jacobi matrix. In particular, it is shown that repartitioning a blockp-cyclic matrix into a blockq-cyclic form,q, results in asymptotically faster SOR convergence for the same amount of work per iteration. As a consequence block 2-cyclic SOR is optimal under these conditions.Research supported in part by the US Air Force under Grant no. AFOSR-88-0285 and the National Science Foundation under grant no. DMS-85-21154 Present address: Boeing Computer Services, P.O. Box 24346, MS 7L-21, Seattle, WA 98124-0346, USA     

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.     

两类拟共形映射的掩盖定理

In this paper we define two classes of quasiconformal mappings,and study their covering properties by methods of module.We obtain some new results.In the meantime,we give new methods to prove Koebe 1/2 covering theorem on convex conformal mappings.     

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.     

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