In this paper we study the finite element approximations to the Sobolev and viscoelasticity type equations and present a direct analysis for global superconvergence for these problems, without using Ritz projection or its modified forms.
We present a method that in certain sense stores the inverse of the stiffness matrix in memory places, where is the number of degrees of freedom and hence the matrix size. The setup of this storage format requires arithmetic operations. However, once the setup is done, the multiplication of the inverse matrix and a vector can be performed with operations. This approach applies to the first order finite element discretization of linear elliptic and parabolic problems in triangular domains,...
Many discrepancy principles are known for choosing the parameter α in the regularized operator equation , , in order to approximate the minimal norm least-squares solution of the operator equation Tx = y. We consider a class of discrepancy principles for choosing the regularization parameter when T*T and are approximated by Aₙ and respectively with Aₙ not necessarily self-adjoint. This procedure generalizes the work of Engl and Neubauer (1985), and particular cases of the results are applicable...
The aim of this paper is to develop a crowd motion model designed to handle highly packed situations. The model we propose rests on two principles: we first define a spontaneous velocity which corresponds to the velocity each individual would like to have in the absence of other people. The actual velocity is then computed as the projection of the spontaneous velocity onto the set of admissible velocities (i.e. velocities which do not violate the non-overlapping constraint). We describe here the...
The aim of this paper is to develop a crowd motion model designed to handle highly packed situations. The model we propose rests on two principles: we first define a spontaneous velocity which corresponds to the velocity each individual would like to have in the absence of other people. The actual velocity is then computed as the projection of the spontaneous velocity onto the set of admissible velocities (i.e. velocities which do not violate the non-overlapping constraint). We describe here...
In this paper we introduce a new class of numerical schemes for the incompressible Navier-Stokes equations, which are inspired by the theory of discrete kinetic schemes for compressible fluids. For these approximations it is possible to give a stability condition, based on a discrete velocities version of the Boltzmann H-theorem. Numerical tests are performed to investigate their convergence and accuracy.
The paper deals with an iterative method for numerical solving frictionless contact problems for two elastic bodies. Each iterative step consists of a Dirichlet problem for the one body, a contact problem for the other one and two Neumann problems to coordinate contact stresses. Convergence is proved by the Banach fixed point theorem in both continuous and discrete case. Numerical experiments indicate scalability of the algorithm for some choices of the relaxation parameter.
We present a domain decomposition theory on an interface problem for the linear transport equation between a diffusive and a non-diffusive region. To leading order, i.e. up to an error of the order of the mean free path in the diffusive region, the solution in the non-diffusive region is independent of the density in the diffusive region. However, the diffusive and the non-diffusive regions are coupled at the interface at the next order of approximation. In particular, our algorithm avoids iterating...
We present a domain decomposition theory on an interface problem for the linear transport equation between a diffusive and a non-diffusive region. To leading order, i.e. up to an error of the order of the mean free path in the diffusive region, the solution in the non-diffusive region is independent of the density in the diffusive region. However, the diffusive and the non-diffusive regions are coupled at the interface at the next order of approximation. In particular, our algorithm avoids iterating...