All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2

Displaying 21 – 30 of 30

Showing per page

Finite difference operators from moving least squares interpolation

Hennadiy Netuzhylov, Thomas Sonar, Warisa Yomsatieankul (2007)

ESAIM: Mathematical Modelling and Numerical Analysis

In a foregoing paper [Sonar, ESAIM: M2AN39 (2005) 883–908] we analyzed the Interpolating Moving Least Squares (IMLS) method due to Lancaster and Šalkauskas with respect to its approximation powers and derived finite difference expressions for the derivatives. In this sequel we follow a completely different approach to the IMLS method given by Kunle [Dissertation (2001)]. As a typical problem with IMLS method we address the question of getting admissible results at the boundary by introducing “ghost...

Finite element methods on non-conforming grids by penalizing the matching constraint

Eric Boillat (2003)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

The present paper deals with a finite element approximation of partial differential equations when the domain is decomposed into sub-domains which are meshed independently. The method we obtain is never conforming because the continuity constraints on the boundary of the sub-domains are not imposed strongly but only penalized. We derive a selection rule for the penalty parameter which ensures a quasi-optimal convergence.

Finite element methods on non-conforming grids by penalizing the matching constraint

Eric Boillat (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

The present paper deals with a finite element approximation of partial differential equations when the domain is decomposed into sub-domains which are meshed independently. The method we obtain is never conforming because the continuity constraints on the boundary of the sub-domains are not imposed strongly but only penalized. We derive a selection rule for the penalty parameter which ensures a quasi-optimal convergence.

Finite-difference preconditioners for superconsistent pseudospectral approximations

Lorella Fatone, Daniele Funaro, Valentina Scannavini (2007)

ESAIM: Mathematical Modelling and Numerical Analysis

The superconsistent collocation method, which is based on a collocation grid different from the one used to represent the solution, has proven to be very accurate in the resolution of various functional equations. Excellent results can be also obtained for what concerns preconditioning. Some analysis and numerous experiments, regarding the use of finite-differences preconditioners, for matrices arising from pseudospectral approximations of advection-diffusion boundary value problems, are presented...

Fourier analysis of iterative aggregation-disaggregation methods for nearly circulant stochastic matrices

Pultarová, Ivana (2013)

Programs and Algorithms of Numerical Mathematics

We introduce a new way of the analysis of iterative aggregation-disaggregation methods for computing stationary probability distribution vectors of stochastic matrices. This new approach is based on the Fourier transform of the error propagation matrix. Exact formula for its spectrum can be obtained if the stochastic matrix is circulant. Some examples are presented.

Frequency analysis of preconditioned waveform relaxation iterations

Andrzej Augustynowicz, Zdzisław Jackiewicz (1999)

Applicationes Mathematicae

The error analysis of preconditioned waveform relaxation iterations for differential systems is presented. This analysis extends and refines previous results by Burrage, Jackiewicz, Nørsett and Renaut by incorporating all terms in the expansion of the error of waveform relaxation iterations in the Laplace transform domain. Lower bounds for the size of the window of rapid convergence are also obtained. The theory is illustrated for waveform relaxation methods applied to differential systems resulting...

Currently displaying 21 – 30 of 30

Previous Page 2