Displaying similar documents to “3D domain decomposition method coupling conforming and nonconforming finite elements”

Error estimates in the Fast Multipole Method for scattering problems Part 2: Truncation of the Gegenbauer series

Quentin Carayol, Francis Collino (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

We perform a complete study of the truncation error of the Gegenbauer series. This series yields an expansion of the Green kernel of the Helmholtz equation, e i | u - v | 4 π i | u - v | , which is the core of the Fast Multipole Method for the integral equations. We consider the truncated series where the summation is performed over the indices L . We prove that if v = | v | is large enough, the truncated series gives rise to an error lower than as soon as satisfies L + 1 2 v + C W 2 3 ( K ( α ) ϵ - δ v γ ) v 1 3 where  is the Lambert function, K ( α ) depends...

Error estimates in the fast multipole method for scattering problems Part 1: Truncation of the Jacobi-Anger series

Quentin Carayol, Francis Collino (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

We perform a complete study of the truncation error of the Jacobi-Anger series. This series expands every plane wave e i s ^ · v in terms of spherical harmonics { Y , m ( s ^ ) } | m | . We consider the truncated series where the summation is performed over the ( , m ) 's satisfying | m | L . We prove that if v = | v | is large enough, the truncated series gives rise to an error lower than as soon as satisfies L + 1 2 v + C W 2 3 ( K ϵ - δ v γ ) v 1 3 where is the Lambert function and C , K , δ , γ are pure positive constants. Numerical experiments show that this asymptotic...

Improved Lower Bounds on the Approximability of the Traveling Salesman Problem

Hans-Joachim Böckenhauer, Sebastian Seibert (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

This paper deals with lower bounds on the approximability of different subproblems of the Traveling Salesman Problem (TSP) which is known not to admit any polynomial time approximation algorithm in general (unless 𝒫 = 𝒩𝒫 ). First of all, we present an improved lower bound for the Traveling Salesman Problem with Triangle Inequality, -TSP for short. Moreover our technique, an extension of the method of Engebretsen [11], also applies to the case of relaxed and sharpened triangle inequality, respectively,...