538 research outputs found
Preconditioning iterative algorithm for the electromagnetic scattering from a large cavity
A preconditioning iterative algorithm is proposed for solving electromagnetic scattering from an open cavity embedded in an infinite ground plane. In this iterative algorithm, a physical model with a vertically layered medium is employed as a preconditioner of the model of general media. A fast algorithm developed in (SIAM J. Sci. Comput. 2005; 27:553-574) is applied for solving the model of layered media and classical Krylov subspace methods, restarted GMRES, COCG, and BiCGstab are employed for solving the preconditioned system. Our numerical experiments on cavity models with large numbers of mesh points and large wave numbers show that the algorithm is efficient and the number of iterations is independent of the number of mesh points and dependent upon the wave number. Copyright (C) 2008 John Wiley & Sons, Ltd
A simple preconditioned domain decomposition method for electromagnetic scattering problems
We present a domain decomposition method (DDM) devoted to the iterative
solution of time-harmonic electromagnetic scattering problems, involving large
and resonant cavities. This DDM uses the electric field integral equation
(EFIE) for the solution of Maxwell problems in both interior and exterior
subdomains, and we propose a simple preconditioner for the global method, based
on the single layer operator restricted to the fictitious interface between the
two subdomains.Comment: 23 page
Combining Analytic Preconditioner and Fast Multipole Method for the 3-D Helmholtz Equation
International audienceThe paper presents a detailed numerical study of an iterative solution to 3-D sound-hard acoustic scattering problems at high frequency considering the Combined Field Integral Equation (CFIE). We propose a combination of an OSRC preconditioning technique and a Fast Multipole Method which leads to a fast and efficient algorithm independently of both a frequency increase and a mesh refinement. The OSRC-preconditioned CFIE exhibits very interesting spectral properties even for trapping domains. Moreover, this analytic preconditioner shows highly-desirable advantages: sparse structure, ease of implementation and low additional computational cost. We first investigate the numerical behavior of the eigenvalues of the related integral operators, CFIE and OSRC-preconditioned CFIE, in order to illustrate the influence of the proposed preconditioner. We then apply the resolution algorithm to various and significant test-cases using a GMRES solver. The OSRC-preconditioning technique is combined to a Fast Multipole Method in order to deal with high-frequency 3-D cases. This variety of tests validates the effectiveness of the method and fully justifies the interest of such a combination
Parallel computation of 3-D electromagnetic scattering using finite elements
The finite element method (FEM) with local absorbing boundary conditions has been recently applied to compute electromagnetic scattering from large 3-D geometries. In this paper, we present details pertaining to code implementation and optimization. Various types of sparse matrix storage schemes are discussed and their performance is examined in terms of vectorization and net storage requirements. The system of linear equations is solved using a preconditioned biconjugate gradient (BCG) algorithm and a fairly detailed study of existing point and block preconditioners (diagonal and incomplete LU) is carried out. A modified ILU preconditioning scheme is also introducted which works better than the traditional version for our matrix systems. The parallelization of the iterative sparse solver and the matrix generation/assembly as implemented on the KSR1 multiprocessor is described and the interprocessor communication patterns are analysed in detail. Near-linear speed-up is obtained for both the iterative solver and the matrix generation/assembly phases. Results are presented for a problem having 224,476 unknowns and validated by comparison with measured data.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/50413/1/1660070504_ftp.pd
Recommended from our members
Randomized Computations for Efficient and Robust Finite Element Domain Decomposition Methods in Electromagnetics
Numerical modeling of electromagnetic (EM) phenomenon has proved to become an effective and efficient tool in design and optimization of modern electronic devices, integrated circuits (IC) and RF systems. However the generality, efficiency and reliability/resilience of the computational EM solver is often criticised due to the fact that the underlying characteristics of the simulated problems are usually different, which makes the development of a general, \u27\u27black-box\u27\u27 EM solver to be a difficult task.
In this work, we aim to propose a reliable/resilient, scalable and efficient finite elements based domain decomposition method (FE-DDM) as a general CEM solver to tackle such ultimate CEM problems to some extent. We recognize the rank deficiency property of the Dirichlet-to-Neumann (DtN) operators involved in the previously proposed FETI-2 DDM formulation and apply such principle to improve the computational efficiency and robustness of FETI-2 DDM. Specifically, the rank deficient DtN operator is computed by a randomized computation method that was originally proposed to approximate matrix singular value decomposition (SVD). Numerical results show a up to 35\% run-time and 75% memory saving of the DtN operators computation can be achieved on a realistic example. Later, such rank deficiency principle is incorporated into a new global DDM preconditioner (W-FETI) that is inspired by the matrix Woodbury identity. Numerical study of the eigenspectrum shows the validity of the proposed W-FETI global preconditioner. Several industrial-scaled examples show significant iterative convergence advantage of W-FETI that uses 35%-80% matrix-vector-products (MxVs) than state-of-the-art DDM solvers
- …