Search

We propose and test the first Reduced Radial Basis Function Method (R$^2$BFM) for solving parametric partial differential equations on irregular domains. The two major ingredients are a stable Radial Basis Function (RBF) solver that has an optimized set of centers chosen through a reduced-basis-type greedy algorithm, and a collocation-based model reduction approach that systematically generates a reduced-order approximation whose dimension is orders of magnitude smaller than the total number of RBF centers. The resulting algorithm is efficient and accurate as demonstrated through two- and three-dimensional test problems.

The boundary value problems of a class of th-order nonlinear integrodifferential equations of mixed type in Banach space are considered, and the existence of three solutions is obtained by using the fixed-point index theory.

In this paper, we present the first reduced basis method well-suited for the collocation framework. Two fundamentally different algorithms are presented: the so-called Least Squares Reduced Collocation Method (LSRCM) and Empirical Reduced Collocation Method (ERCM). This work provides a reduced basis strategy to practitioners who {prefer} a collocation, rather than Galerkin, approach. Furthermore, the empirical reduced collocation method eliminates a potentially costly online procedure that is needed for non-affine problems with Galerkin approach. Numerical results demonstrate the high efficiency and accuracy of the reduced collocation methods, which match or exceed that of the traditional reduced basis method in the Galerkin framework.

We study nontrivial applications of the reduced basis method (RBM) for electromagnetic applications with an emphasis on scattering and the estimation of radar cross section (RCS). The method and several extensions are explained with two examples with different characteristics. Parameters that are allowed to vary within the model include frequency, incident angle and measurement angle as well as the geometry of the scatterers. With appropriate applications of the empirical interpolation method (EIM), transformation of the domain, configuration of perfectly matched layer, exponential convergence of the reduced basis solution over the entire parameter domain is achieved. Moreover, we demonstrate that this approach allows for the effective capture of the critical behavior, in this case through shapes that minimize scattering. This further highlights the robustness and quality of the greedy approximation and the reduced basis method approach. (C) 2012 Elsevier B.V. All rights reserved.

We present a reduced basis element method (RBEM) for the time-harmonic Maxwell’s equation. The RBEM is a Reduced Basis Method (RBM) with parameters describing the geometry of the computational domain, coupled with a domain decomposition method. The basic idea is the following. First, we decompose the computational domain into a series of subdomains, each of which is deformed from some reference domain. Then, we associate with each reference domain precomputed solutions to the same governing partial differential equation, but with different choices of deformations. Finally, one seeks the approximation on a new domain as a linear combination of the corresponding precomputed solutions on each subdomain. Unlike the work on RBEM for thermal fin and fluid flow problems, we do not need a mortar type method to “glue” the various local functions. This “gluing” is done “automatically” thanks to the use of a discontinuous Galerkin method. We present the rationale for the method together with numerical results showing exponential convergence for the simulation of a metallic pipe with both ends open.

We propose certified reduced basis methods for the efficient and reliable evaluation of a general output that is implicitly connected to a given parameterized input through the harmonic Maxwell's equations. The truth approximation and the development of the reduced basis through a greedy approach is based on a discontinuous Galerkin approximation of the linear partial differential equation. The formulation allows the use of different approximation spaces for solving the primal and the dual truth approximation problems to respect the characteristics of both problem types, leading to an overall reduction in the off-line computational effort. The main features of the method are the following: (i) rapid convergence on the entire representative set of parameters, (ii) rigorous a posteriori error estimators for the output, and (iii) a parameter independent off-line phase and a computationally very efficient on-line phase to enable the rapid solution of many-query problems arising in control, optimization, and design. The versatility and performance of this approach is shown through a numerical experiment, illustrating the modeling of material variations and problems with resonant behavior.

For accurate a posteriori error analysis of the reduced basis method for coercive and non-coercive problems, a critical ingredient lies in the evaluation of a lower bound for the coercivity or inf-sup constant. In this short Note, we generalize and improve the successive constraint method first presented by Huynh (2007) by providing a monotonic version of this algorithm that leads to both more stable evaluations and fewer offline computations. To cite this article: Y Chen et al., C. R. Acad. Sci. Paris, Ser. I 346 (2008). (C) 2008 Academie des sciences. Published by Elsevier Masson SAS. All rights reserved.

In this paper, the author discusses the multiple positive solutions for an infinite three-point boundary value problem of first-order impulsive superlinear singular integro-differential equations on the half line in a Banach space by means of the fixed-point theorem of cone expansion and compression with norm type. MSC: 45J05; 34G20; 47H10