Monotone scheme for finite difference equations concerning steady-state competing-species interactions
We consider the Laplace equation posed in a three-dimensional axisymmetric domain. We reduce the original problem by a Fourier expansion in the angular variable to a countable family of two-dimensional problems. We decompose the meridian domain, assumed polygonal, in a finite number of rectangles and we discretize by a spectral method. Then we describe the main features of the mortar method and use the algorithm Strang Fix to improve the accuracy of our discretization.
We consider the Laplace equation posed in a three-dimensional axisymmetric domain. We reduce the original problem by a Fourier expansion in the angular variable to a countable family of two-dimensional problems. We decompose the meridian domain, assumed polygonal, in a finite number of rectangles and we discretize by a spectral method. Then we describe the main features of the mortar method and use the algorithm Strang Fix to improve the accuracy...
In this paper we present some recent results concerning convergence rate estimates for finite-difference schemes approximating boundary-value problems. Special attention is given to the problem of minimal smoothness of coefficients in partial differential equations necessary for obtaining the results.
Singularly perturbed problems of convection-diffusion type cannot be solved numerically in a completely satisfactory manner by standard numerical methods. This indicates the need for robust or -uniform methods. In this paper we derive new conditions for such schemes with special emphasize to parabolic layers.
The paper deals with error estimates and lower bound approximations of the Steklov eigenvalue problems on convex or concave domains by nonconforming finite element methods. We consider four types of nonconforming finite elements: Crouzeix-Raviart, , and enriched Crouzeix-Raviart. We first derive error estimates for the nonconforming finite element approximations of the Steklov eigenvalue problem and then give the analysis of lower bound approximations. Some numerical results are presented to...
Compared to conforming P1 finite elements, nonconforming P1 finite element discretizations are thought to be less sensitive to the appearance of distorted triangulations. E.g., optimal-order discrete norm best approximation error estimates for functions hold for arbitrary triangulations. However, the constants in similar estimates for the error of the Galerkin projection for second-order elliptic problems show a dependence on the maximum angle of all triangles in the triangulation. We demonstrate...
The paper deals with boundary value problems for systems of nonlinear elliptic equations in a relatively general form. Theorems based on monotone operator theory and concerning the existence of weak solutions of such a system, as well as the convergence of discretized problem solutions are presented. As an example, the approach is applied to the stationary Van Roosbroeck’s system, arising in semiconductor device modelling. A convergent algorithm suitable for solving sets of algebraic equations generated...
The Shape-From-Shading (SFS) problem is a fundamental and classic problem in computer vision. It amounts to compute the 3-D depth of objects in a single given 2-D image. This is done by exploiting information about the illumination and the image brightness. We deal with a recent model for Perspective SFS (PSFS) for Lambertian surfaces. It is defined by a Hamilton–Jacobi equation and complemented by state constraints boundary conditions. In this paper we investigate and compare three state-of-the-art...
The meshless element-free Galerkin method is developed for numerical analysis of hyperbolic initial-boundary value problems. In this method, only scattered nodes are required in the domain. Computational formulae of the method are analyzed in detail. Error estimates and convergence are also derived theoretically and verified numerically. Numerical examples validate the performance and efficiency of the method.
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...
In this paper, we present a numerical homogenization scheme for indefinite, timeharmonic Maxwell’s equations involving potentially rough (rapidly oscillating) coefficients. The method involves an H(curl)-stable, quasi-local operator, which allows for a correction of coarse finite element functions such that order optimal (w.r.t. the mesh size) error estimates are obtained. To that end, we extend the procedure of [D. Gallistl, P. Henning, B. Verfürth, Numerical homogenization for H(curl)-problems,...
We examine the effect of numerical integration on the accuracy of high order conforming pyramidal finite element methods. Non-smooth shape functions are indispensable to the construction of pyramidal elements, and this means the conventional treatment of numerical integration, which requires that the finite element approximation space is piecewise polynomial, cannot be applied. We develop an analysis that allows the finite element approximation space to include non-smooth functions and show that,...
We examine the effect of numerical integration on the accuracy of high order conforming pyramidal finite element methods. Non-smooth shape functions are indispensable to the construction of pyramidal elements, and this means the conventional treatment of numerical integration, which requires that the finite element approximation space is piecewise polynomial, cannot be applied. We develop an analysis that allows the finite element approximation space to include non-smooth functions and show that,...
Natural superconvergence of the least-squares finite element method is surveyed for the one- and two-dimensional Poisson equation. For two-dimensional problems, both the families of Lagrange elements and Raviart-Thomas elements have been considered on uniform triangular and rectangular meshes. Numerical experiments reveal that many superconvergence properties of the standard Galerkin method are preserved by the least-squares finite element method.
Over the last three decades Computational Fluid Dynamics (CFD) has gradually joined the wind tunnel and flight test as a primary flow analysis tool for aerodynamic designers. CFD has had its most favorable impact on the aerodynamic design of the high-speed cruise configuration of a transport. This success has raised expectations among aerodynamicists that the applicability of CFD can be extended to the full flight envelope. However, the complex nature...