Some new nonlinear inequalities and applications to boundary value problems

In this paper, we establish some new nonlinear integral inequalities of the Gronwall–Bellman–Ou-Iang-type in two variables. These on the one hand generalizes and on the other hand furnish a handy tool for the study of qualitative as well as quantitative properties of solutions of differential equations. We illustrate this by applying our new results to certain boundary value problem.     

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     

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.     

Extremal positive and self-adjoint extensions of suboperators

This work is supported in part by the fund OTKA (No. 5-134).     

Global Existence and Exponential Stability of Smooth Solutions to a Full Hydrodynamic Model to Semiconductors

 We study a full hydrodynamic semiconductor model in multi-space dimension. The global existence of smooth solutions is established and the exponential stability of the solutions as is investigated. Received November 14, 2000; in revised form March 25, 2002 Published online August 5, 2002     

The existence of smooth densities for the prediction filtering and smoothing problems

The qualitative behavior of buckled states of two different models of elastic beams is studied. It is assumed that random imperfections affect the governing nonlinear equations. It is shown that near the first critical value of the buckling load the stochastic bifurcation is described asymptotically by an algebraic equation whose coeffficients are Gaussian random variables. The corresponding asymptotic expansion for the displacement is to lowest order a Gaussian stochastic process.Work supported by NSF Grant No. DCR81-14726.Work supported by NSF Grant No. DMS87-01895.     

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     

The dual of a finitely generated multiplication module

This paper is based on the M. Sc. thesis written by the third author under the supervision of the first two authors. It was submitted to the University of Baghdad in 1986.     

On the augmented system approach to sparse least-squares problems

Summary We study the augmented system approach for the solution of sparse linear least-squares problems. It is well known that this method has better numerical properties than the method based on the normal equations. We use recent work by Arioli et al. (1988) to introduce error bounds and estimates for the components of the solution of the augmented system. In particular, we find that, using iterative refinement, we obtain a very robust algorithm and our estimates of the error are accurate and cheap to compute. The final error and all our error estimates are much better than the classical or Skeel's error analysis (1979) indicates. Moreover, we prove that our error estimates are independent of the row scaling of the augmented system and we analyze the influence of the Björck scaling (1967) on these estimates. We illustrate this with runs both on large-scale practical problems and contrived examples, comparing the numerical behaviour of the augmented systems approach with a code using the normal equations. These experiments show that while the augmented system approach with iterative refinement can sometimes be less efficient than the normal equations approach, it is comparable or better when the least-squares matrix has a full row, and is, in any case, much more stable and robust.This author was visiting Harwell and was funded by a grant from the Italian National Council of Research (CNR), Istituto di Elaborazione dell'Informazione-CNR, via S. Maria 46, I-56100 Pisa, ItalyThis author was visiting Harwell from Faculty of Mathematics and Computer Science of the University of Amsterdam