A robust and efficient algorithm to solve the scattering problems with impedance condition

Author(s):  
F. Millot ◽  
S. Pernet
2014 ◽  
Vol 15 (5) ◽  
pp. 1431-1460 ◽  
Author(s):  
D. Levadoux ◽  
F. Millot ◽  
S. Pernet

AbstractThis paper concerns the electromagnetic scattering by arbitrary shaped three dimensional imperfectly conducting objects modeled with non-constant Leontovitch impedance boundary condition. It has two objectives. Firstly, the intrinsically well-conditioned integral equation (noted GCSIE) proposed in [30] is described focusing on its discretization. Secondly, we highlight the potential of this method by comparison with two other methods, the first being a two currents formulation in which the impedance condition is implicitly imposed and whose the convergence is quasi-optimal for Lipschitz polyhedron, the second being a CFIE-like formulation [14]. In particular, we prove that the new approach is less costly in term of CPU time and gives a more accurate solution than that obtained from the CFIE formulation. Finally, as expected, It is demonstrated that no preconditioner is needed for this formulation.


2007 ◽  
Vol 15 (01) ◽  
pp. 95-121 ◽  
Author(s):  
ALFREDO BERMÚDEZ ◽  
LUIS HERVELLA-NIETO ◽  
ANDRÉS PRIETO ◽  
RODOLFO RODRÍGUEZ

The aim of this paper is to study the time-harmonic scattering problem in a coupled fluid-porous medium system. We consider two different models for the treatment of porous materials: the Allard–Champoux equations and an approximate model based on a wall impedance condition. Both models are compared by computing analytically their respective solutions for unbounded planar obstacles, considering successively plane and spherical waves. A numerical method combining an optimal bounded PML and finite elements is also introduced to compute the solutions of both problems for more general axisymmetric geometries. This method is used to compare the solutions for a spherical absorber.


Author(s):  
P.J. Phillips ◽  
J. Huang ◽  
S. M. Dunn

In this paper we present an efficient algorithm for automatically finding the correspondence between pairs of stereo micrographs, the key step in forming a stereo image. The computation burden in this problem is solving for the optimal mapping and transformation between the two micrographs. In this paper, we present a sieve algorithm for efficiently estimating the transformation and correspondence.In a sieve algorithm, a sequence of stages gradually reduce the number of transformations and correspondences that need to be examined, i.e., the analogy of sieving through the set of mappings with gradually finer meshes until the answer is found. The set of sieves is derived from an image model, here a planar graph that encodes the spatial organization of the features. In the sieve algorithm, the graph represents the spatial arrangement of objects in the image. The algorithm for finding the correspondence restricts its attention to the graph, with the correspondence being found by a combination of graph matchings, point set matching and geometric invariants.


2016 ◽  
Vol 2016 (7) ◽  
pp. 1-6
Author(s):  
Sergey Makov ◽  
Vladimir Frantc ◽  
Viacheslav Voronin ◽  
Igor Shrayfel ◽  
Vadim Dubovskov ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document