In this paper, a multi-parameter error resolution technique is applied into a mixed finite element method for the Stokes problem. By using this technique and establishing a multi-parameter asymptotic error expansion for the mixed finite element method, an approximation of higher accuracy is obtained by multi-processor computers in parallel.
In this article, we present a mathematical model and numerical method for surface reconstruction from 3D point cloud data, using the level-set method. The presented method solves surface reconstruction by the computation of the distance function to the shape, represented by the point cloud, using the so called Fast Sweeping Method, and the solution of advection equation with curvature term, which creates the evolution of an initial condition to the final state. A crucial point for efficiency is...
In this paper we test the feasibility of coupling two heterogeneous mathematical modeling integrated within two different codes residing on distant sites. A prototype is developed using Schwarz type domain decomposition as the mathematical tool for coupling. The computing technology for coupling uses a CORBA environment to implement a distributed client-server programming model. Domain decomposition methods are well suited to reducing complex physical phenomena into a sequence of parallel subproblems...
In this paper we test the feasibility of coupling two heterogeneous mathematical modeling integrated within two different codes residing on distant sites. A prototype is developed using Schwarz type domain decomposition as the mathematical tool for coupling. The computing technology for coupling uses a CORBA environment to implement a distributed client-server programming model. Domain decomposition methods are well suited to reducing complex physical phenomena into a sequence of parallel subproblems...
Modifications of nonlinear conjugate gradient method are described and tested.
The method of projections onto convex sets to find a point in the intersection of a finite number of closed convex sets in an Euclidean space, sometimes leads to slow convergence of the constructed sequence. Such slow convergence depends both on the choice of the starting point and on the monotoneous behaviour of the usual algorithms. As there is normally no indication of how to choose the starting point in order to avoid slow convergence, we present in this paper a non-monotoneous parallel algorithm...
The Method of Fundamental Solutions (MFS) is a boundary-type meshless method for the solution of certain elliptic boundary value problems. In this work, we investigate the properties of the matrices that arise when the MFS is applied to the Dirichlet problem for Laplace’s equation in a disk. In particular, we study the behaviour of the eigenvalues of these matrices and the cases in which they vanish. Based on this, we propose a modified efficient numerical algorithm for the solution of the problem...
The Method of Fundamental Solutions (MFS) is a boundary-type meshless method for the solution of certain elliptic boundary value problems. In this work, we investigate the properties of the matrices that arise when the MFS is applied to the Dirichlet problem for Laplace's equation in a disk. In particular, we study the behaviour of the eigenvalues of these matrices and the cases in which they vanish. Based on this, we propose a modified efficient numerical algorithm for the solution of the problem...
We consider functionals of a potential energy corresponding to . We are dealing with with . Various types of the subsoil of the plate are described by various types of the nonlinear term . The aim of the paper is to find a suitable computational algorithm.
In this paper we propose a new numerical scheme to simulate the river flow in the presence of a variable bottom surface. We use the finite volume method, our approach is based on the technique described by D. L. George for shallow water equations. The main goal is to construct the scheme, which is well balanced, i.e. maintains not only some special steady states but all steady states which can occur. Furthermore this should preserve nonnegativity of some quantities, which are essentially nonnegative...
This contribution gives an overview of current research in applying object oriented programming to scientific computing at the computational mechanics laboratory (LABMEC) at the school of civil engineering – UNICAMP. The main goal of applying object oriented programming to scientific computing is to implement increasingly complex algorithms in a structured manner and to hide the complexity behind a simple user interface. The following areas are current topics of research and documented within the...
This contribution gives an overview of current research in applying object oriented programming to scientific computing at the computational mechanics laboratory (LABMEC) at the school of civil engineering – UNICAMP. The main goal of applying object oriented programming to scientific computing is to implement increasingly complex algorithms in a structured manner and to hide the complexity behind a simple user interface. The following areas are current topics of research and documented within the...
We discuss a parallel implementation of the domain decomposition method based on the macro-hybrid formulation of a second order elliptic equation and on an approximation by the mortar element method. The discretization leads to an algebraic saddle- point problem. An iterative method with a block- diagonal preconditioner is used for solving the saddle- point problem. A parallel implementation of the method is emphasized. Finally the results of numerical experiments are presented.