Inverse Source Identification for Poisson Equation
|
|
- Ferdinand Price
- 5 years ago
- Views:
Transcription
1 Inverse Source Identification for Poisson Equation Leevan Ling, Y. C. Hon, and M. Yamamoto March 1, 2005 Abstract A numerical method for identifying the unknown point sources for a two-dimensional Poisson problem from Dirichlet boundary data is proposed. Under an assumption that the total number and estimate positions of the point sources are known, the exact positions and corresponding strengths of the distinct point sources can be identified from scattered (noisy) observed Dirichlet boundary data. Numerical verification indicated that the method is efficient and robust. 1 Introduction Let Ω be a bounded domain in R 2 and Γ := Ω be the boundary of Ω. Consider the following Poisson equation u = f in Ω, (1) under the Dirichlet boundary condition u Γ = g on Ω. (2) Preprint submitted to Inverse Problems in Science and Engineering. c All rights reserved to the authors. Generated by LATEX on March 1, Department of Mathematical Sciences, University of Tokyo, Japan. Department of Mathematics, City University of Hong Kong, Hong Kong. Department of Mathematical Sciences, University of Tokyo, Japan. Key words and phrases. Inverse problem, Sources identification, Point mass model, Poisson equation AMS 1991 subject classifications. Primary 15A29, Secondary 35J05 1
2 If f L 2 (Ω) and g H 1 2 (Γ) are known, the direct problem specified by (1) (2) has a unique solution u H 1 (Ω). The aim of this paper is to determine the unknown point sources function f in (1) from some scattered observed boundary data in (2): g f. This is referred as an inverse source identification problem. Inverse source identification problems are important in many branches of engineering sciences: for examples, crack determination [2, 3], heat source determination [5], heat conduction problems [10, 15], electromagnetic theory [17], Stefan design problems [9] and etc. The investigation of the traditional inverse potential problem can be found in [4, 13]. The studies of such problems give a complete analysis of experimental data. In general, a full source f in (1) is not solely attainable from boundary measurements. The inverse source identification problem becomes solvable if some a priori knowledge is assumed. For instances, when one of the products in the separation of variables is known [6, 15]; or the base area of a cylindrical source is known [6]; or a non-separable type is in the form of a moving front [15], the boundary data g can then uniquely determine the unknown sources f. Furthermore, when both u and f are relatively smooth, some standard regularization techniques can be employed, see [7] for more detailed overview. It is noted here that for the approximation of a general forcing function, we can use basis other than the cylindrical function, e.g., the Gaussian function. The cylindrical function to be used in this paper, however, is more practical and feasible in the view of engineering applications. To simulate the unknown point sources from given dirac delta functions, we define the following cylindrical functions Φ with base radius ρ > 0 by: 1 (0 r < ρ), Φ(r; ρ) := 0 (r ρ). (3) Denoting the exact positions of the N distinct point sources by {ξ j } N j=1 Ω, we now assume that the unknown source function f L 2 (Ω) is a linear combination of Φ in (3). Furthermore, we prescribe the following conditions on the source function: all point sources are located inside Ω, 2
3 i.e., supp f := {x Ω; f(x) 0} Ω. (4) Therefore, the source function can be expressed as N f(x) = f j Φ( x ξ j ; ρ j ), ξ j Ω\Γ, x Ω Γ, (5) j=1 where denotes the Euclidean distance in R 2. The function f given in (5) can reasonably approximate the weighted sums of the point sources centered at ξ j with ρ j 1, j = 1,..., N. The approximation (5) not only is appropriate for computation, it is also equivalent (up to constant factors) to the logarithmic potential problem with point mass distribution [18, 20]. In the logarithmic potential problem, the unknown source function f is determined from observed data in the form of logarithmic potential given by u L (x) = 1 f(x) log ( x x ) dω(x), x, x R 2. 2π Ω The uniqueness result for the solution had been proven which further justifies our choice of using the cylindrical basis (3). In this paper, we will establish a numerical scheme for identifying the source strengths and exact positions of the point sources from user-input estimated source locations and scattered boundary data. 2 Methodology for Noise-free Boundary Data Firstly, we note that the following single source problem v = Φ( ξ ; ρ) in Ω, (6) 3
4 has an H 1 -solution given by v = ( 14 ξ 2 12 ρ2 log ρ + 14 ρ2 ) Φ( ξ ; ρ) (7) 1 2 ρ2 log( ξ ) (1 Φ( ξ ; ρ)) + C( ), where C( ) is an arbitrary harmonic function in R 2 (see [19]). Following the idea of using fundamental solutions for solving inverse boundary determination problems [12], we express the solution of the multiple point sources model (1) (2) as a linear combination of the single source solutions with different base radii ρ j (7). The solution to the problem is therefore given by the following superposition u = N f j ( 1 4 ξ j ρ2 j log ρ j + 1 ) 4 ρ2 j Φ( ξ j ; ρ j ) (8) j=1 1 2 N N s j log( ξ j )(1 Φ( ξ j ; ρ j )) + f j C j ( ), j=1 j=1 where the source strength of the jth point source is defined to be s j := f j ρ 2 j for j = 1,..., N. Due to the ill-posed nature of the inverse source identification problem, we assume ρ j 1 for all j = 1,..., N so that the cylindrical function Φ in (3) approximates the dirac delta function. Using the property of (3), we then have u Γ = N j=1 ( s j 1 ) 2 log( ξ j ) + c j ( ), (9) along the boundary Γ where c j = C j /ρ 2 j, j = 1,..., N, are arbitrary harmonic functions. Since the solution on the boundary Γ in (9) only depends on the source strengths and locations, we cannot identify the heights f j and the radii ρ j separately. In other words, through observing the boundary data, we cannot recognize the differences between the different shapes of two cylinders if 4
5 the volumes of these cylinders are the same. Note that log r completely vanishes when r = 1. We consider this to be a special case when Ω is the unit circle (or a shifted unit circle in general). If the constant term C j ( ) in (8) equals zero, then it is impossible to identify the unknown source if it is located at the center of the circle. In this case, some extra conditions must be imposed: for example, if the overall flux is a constant: f dω = constant, (10) Ω then it is sufficient to recover the missing source. In this paper, we will consider the special case of unit circular domain and assume that the overall flux is zero: Ω f dω = 0. (11) A constant function c j λ R for all j = 1,..., N is appended in (9). If there is a nonzero overall flux, we can set λ = 0 to compute all the source strengths except the one located at the center of the circle. The source strength at the center can be recovered by using the information on the overall flux. This complicated case occurs only when Ω is the unit circle. Suppose that the set of user-input (estimated) locations of the source points in (5), X N := { ξ j : 0 < ξ j ξ j ε ξ, j = 1,..., N}, (12) are known. Here, ε ξ can be interpreted as the measurement errors of the source positions and treated as an upper bound to all errors in the user-input locations for all j = 1,..., N. It is challenging to identify the unknown source strengths in (8) (i.e., the volume of the cylinder) and their locations (hopefully a better estimation) of the Poisson problem (1) from only scattered Dirichlet boundary data. In the following we first explain the method for the case when noise-free boundary data are available. 5
6 Denote Ball(o, r) to be a ball centered at o with radius r and B = Ball( X N N, ε ξ ) := B j, B j := Ball( ξ j, ε ξ ) Ω. (13) The set B must then contain all the exact positions by assumption: j=1 X N := {ξ j } N j=1 B. Motivated by the method of fundamental solutions [1], we choose a sequence of trial centers, Y P := {y k, k = 1, 2,..., P } B, (14) with P N and approximate the solution restricted to the boundary (9) by u Γ û := P k=1 ( σ k 1 ) 2 log( y k ) + λ. (15) Here, λ R is a constant and σ k is the (numerical) source strength to y k Y P. Our goal is to determine the strength sources s j from user-input estimated position B( ξ j, ε ξ ) and the following set of boundary data, G M := {x i Γ, i = 1,..., M}, (16) where M P. Refer Figure 1 for the problem setting. As shown in Figure 1(a), we consider a case with three source points in Ω and the boundary data are observed at some collocation points in G M. Figure 1(b) shows the case when the ball B j defined by (13) contains an exact source position ξ j. The approximation uses different trial centers (indicated by ) uniformly distributed in the ball to approximate the dirac delta source. The union of all these trial centers contained in all balls B j, j = 1,..., N, forms the set Y P in (14). As shown in Figure 1(b), the exact source position ξ j may not coincide to any of the trial centers. 6
7 We first consider the case when the boundary data in (16) are exact. Collocating (15) at the M distinct collocation points, which are distributed uniformly on Γ or part of Γ, yields û(x i ) = 1 P ( σ k log( xi y k ) + λ ) = g(x i ), x i G M, (17) 2 k=1 where x i G M and y k Y P. The M P resultant system of (17) has the form A σ = g, (18) where [A] ik := ( 1 ) 2 log x i y k + λ, (19) with g = [g(x 1 ),..., g(x M )] T and σ = [ s 1,..., s k ] T denoting the unknown strength sources. The solution process here is commonly referred as asymmetric radial basis function (RBFs) collocation or simply Kansa s method originated by Kansa [14]. Although the technique introduced by Kansa is very successful in engineering applications, there is no proven results so far for the method. Recently, the asymptotic solvability for a generalized Kansa s method is proven by Ling et al. [16]. Our proposed method does not explicitly require the resultant matrix A to be non-singular. In fact, the resultant A can be extremely ill-conditioned (if not non-singular) due to the ill-posed nature of the problem. In our numerical computations, the resultant system (18), exactly determined or over-determined, will be solved by using the singular value decomposition (SVD): A = U Σ V σ = V Σ U g, (20) where U and V are orthogonal matrices and Σ is the diagonal matrix containing the singular values. 7
8 The stabilized inverse of Σ, denoted by Σ, is defined to be [Σ ] ii = [Σ] 1 ii if [Σ] ii τ, 0 Otherwise, for i = 1,..., P and some user defined tolerance τ. In other words, any singular value of A with magnitude less than τ will be ignored. The method described above is also commonly referred as the Truncated singular value decomposition (TSVD), see [11]. After computing all the σ k in û by using (17), we transform the solution in each ball to a single source point. The jth computed source strength associated with each ball B j is then given by ŝ j := σ k, (21) {k : y k B j} which corresponds to the computed location ˆξ j := 1 ŝ j σ k y k. (22) {k : y k B j} In the computation for each source point, we first obtain the input estimation of location ξ. The proposed method provides an estimate of the source strength by (21) and also gives a new estimation to the source position by (22). We then regard the output ˆξ as a new input ξ and continue the computation until a better estimate can be found. We summarize the methodology for the case of noise-free boundary data g in Algorithm 1. 3 Methodology for Noisy Boundary Data For ill-posed problems like the one considered here, computational results are usually very sensitive to errors in the input data. In real-life problems, one can never obtain exact boundary data and hence the investigation for the inverse source identification problem with noisy boundary data is extremely important. 8
9 Algorithm 1 Algorithm for source identification Noise-free boundary data case Ensure: The given N estimated source positions in (12) are distinct in Ω Ensure: The total number of trial centers in B defined by (13) is P Ensure: A total of M P boundary data are observed at Γ for j = 1,..., N do Place equally distributed trial centers y k in ball B j to form the set Y P as defined in (14) end for Compute the resultant matrix by (19) Compute the unknown source strength associated with Y by (20) for j = 1,..., N do Compute the unknown source strength ŝ by (21) Compute the unknown source position ˆξ by (22) end for RETURN ŝ and ˆξ To handle noisy boundary data, we given in the following a mechanism to reject bad trials so that an acceptable approximation to the unknown strengths and source locations can be obtained. As discussed in the last section, the condition ˆξ j ξ j < 2 ε ξ indicates a criterion for deciding the computed locations of Algorithm 1. On the other hand, it is impossible to further verify the quality of the numerical approximation of Algorithm 1 if only one set of noisy boundary data is available. It is reasonable to assume that the noises contained in G M are white noise and hence the mean of all successive computations are expected to converge to the one found in the noise-free case. This can be achieved by introducing to the procedure in Algorithm 2 with a user-defined parameter 1 θ 2 to obtain the following revised algorithm. The following theorem justifies the convergence of the mean in the revised algorithm. Theorem 1. For a fixed set of input locations, if the noise in the boundary data has zero expected value, then the numerical mean computed in Algorithm 2 will converge to the noise-free result. Proof. By assumption, the matrix A in (18) is noise-free. We can write down the resultant system with noise as A (σ + dσ) = (g + dg). The mean values g + dg = g + 0 = g implies dσ = 0. 9
10 Algorithm 2 Algorithm for source identification Noisy boundary data case Given a set of estimate source positions in (12) Pick a parameter θ such that 1 θ 2 while mean(ŝ) and mean(ˆξ) do not converge do Observe a new set of noisy boundary data at G M Use Algorithm 1 to obtain the numerical source strength ŝ and numerical source position ˆξ if ˆξ ξ < θ ε ξ then Store ŝ and ˆξ Compute the mean of the stored ŝ and ˆξ end if end while RETURN mean(ŝ) and mean(ˆξ) In other words, each problem in the noise-free boundary data case will be replaced by a sequence of problems in the noisy boundary data case. Note that the choice of θ has no effect to the proof of Algorithm 2 except the efficiency of the algorithm. The value of θ determines the size of the trust region. If the value of θ is too large, a result of poor estimations in ŝ and ˆξ is expected and hence it affects the convergence of the mean(ŝ) and mean(ˆξ). If θ is too small, much more computed results will be classified as poor or unsuccessful and therefore more iterations are needed. 4 Numerical Verification 4.1 Noise-free Boundary Data In this section, the effectiveness of the proposed computational method will be verified by solving several numerical experiments: In (17), we take λ = 0.1 in these numerical experiments for simplicity. Let Ω be the unit disc the special case. The source function in (5) contains three source points whose exact locations are X 3 = { (0, 0), ( 0.5, 0.5), ( 0.7, 0.3) }. 10
11 We demonstrate the performance of Algorithm 1 under two error levels: ε ξ = 0.05 and Computation for each test problem was repeated ten times to avoid the randomness of the input data. The input source locations are randomly chosen such that ξ j ξ j < ε ξ for j = 1, 2, 3, whose strengths are 3, 4, and 7, respectively. The computations were performed by using a total of 23 to 346 trial centers in each ball. It was observed that the total number of trial centers plays no role in the convergence of the scheme. This observation agrees with the high convergence rate of RBFs [8] only a small number of trial centers (or basis) is sufficient to approximate the unknown function. In the following, we only report the numerical result when 102 trial centers was used in each ball. The boundary data in (16) is exact and the number of boundary data is the same as the number of trial centers, i.e., M = P. In the context of TSVD, one can apply a sophisticated scheme for finding τ. For simplicity, the stabilization parameter for TSVD is chosen to be τ = In general, the approximated source strengths are more sensitive to τ than the source locations. Numerical results are reported graphically in Figure 2 and Figure 3. For ε ξ = 0.05, Figure 2(a) indicates that Algorithm 1 is very accurate. The largest relative error over all test runs in the computed source strengths ŝ was only 2%. The errors of computed source locations can be found in Figure 2(b). Among the ten test runs, the maximum error in the input positions was It shows that the use of Algorithm 1 reduced the maximum error down to Note that the computational results for Source 1 at [0, 0] were more accurate since Source 1 was placed relatively far away from the other two. For ε ξ = 0.10, however, the computed source strength was not so accurate, see Figure 3(a). The relative error in the third run was as large as 37% which of course cannot be accepted. We, however, observed that Algorithm 1 always improves the estimation of the unknown locations, see Figure 3(b). To improve the accuracy of the result for the case of large location errors ε ξ, we propose an 11
12 Algorithm 3 Iterative Algorithm for source identification Noise-free boundary data case while ŝ and ˆξ does not converge do if First iteration or Strategy 1 then r := ε ξ else if Strategy 2 then r r/γ for some constant γ > 0 end if Use Ball(, r) to cover the estimated source position Run Algorithm 1 to obtain numerical source strength ŝ and numerical source position ˆξ Use current output as new guess: s ŝ and ξ ˆξ end while RETURN ŝ and ˆξ iterative scheme that updates the source positions with the most currently available estimates. Two strategies are imposed to handle the location errors: Strategy 1 uses the initial covering B for all iterations without modifications, whereas Strategy 2 reduces the radii of the containing balls in (13) by a factor of γ at every iteration. In comparison to Algorithm 1, the new scheme is less sensitive to the choice of the SVD stabilization parameter τ. The pseudo-code is outlined in Algorithm 3. For illustration, Algorithm 3 was employed to continue the third run in Figure 3. The constant γ in Strategy 2 was chosen to be 2. Results of both strategies are shown in Table 1 and Table 2. The superscript in Table 2 indicates that a computed source position ˆξ j for this particular iteration was located out of the containing ball. In this example, this situation occurred at Source 2 where ˆξ 2 ξ 2 = 1.28 r, r = 0.05, for this particular iteration. The above situation is still acceptable in comparing with Figure 1(a) when the distance between the input location and the computed location ˆξ j ξ j was greater than 2 ε ξ since ˆξ j ξ j must be greater than ε ξ. Both Strategy 1 and Strategy 2 showed convergence in this example. Clearly, Strategy 2 showed faster convergence than Strategy 1. On the other hand, we do not have a robust strategy or any theoretical justification for picking the value γ. In fact, there will be a problem in using Strategy 2 when the value of γ is too small such that some exact source positions no longer lie in the balls. A hybrid of these strategies should be considered: reduce r (as in Strategy 2) only if convergence in Strategy 1 is detected. 12
13 Iteration Radius of B j Max. relative error in ŝ Max. error in ˆξ % % % % % Table 1: Numerical results of Algorithm 3 Strategy 1 on noise-free boundary data Iteration Radius of B j Max. relative error in ŝ Max. error in ˆξ % % % % 1.05E E-3% 1.37E-5 Table 2: Numerical results of Algorithm 3 Strategy 2 on noise-free boundary data 4.2 Noisy Boundary Data Although the study of exhaustive numerical examples is not in the scope of this paper, our intention here is to provide some insights about the performance and behavior of Algorithm 2. Consider the same problem given in Section 4.1 but now with position error ε ξ = The total number of collocation points was taken to be twice as much as the number of trial centers, i.e., M = 2P. The input locations were X 3 = {( , ), ( 0.510, 0.472), ( 0.669, 0.301)}, with maximum location error The parameter θ in Algorithm 2 was chosen to be 2. Random errors with different noise levels were added to the boundary data for each iteration. Again, Algorithm 2 was repeated for ten successful runs. The numerical results are listed in Table 3 where the total runs indicates the number of test runs in order to have ten successful runs. As the error level increased, more runs were required as expected. The maximum (relative) error in the mean(ŝ) increased rapidly with the increase in noise level. In conclusion, improvement in location estimation for all tested noise level had been observed. Note that one can improve the performance of 13
14 Noise level Total runs Max. error in mean(ŝ) Max. error in mean( ˆξ) % % % Table 3: Numerical results for Algorithm 2 on noisy boundary data Algorithm 2 by introducing the iterative strategy as given in Algorithm 3 and an adaptive strategy in choosing θ. Let us consider the worst case in Table 3 when the noise level in boundary data was Suppose that (for some reason) we believe the result based on ten successful runs was trustworthy. Motivated by Algorithm 3, we can take the output mean( ˆξ) as a new guess position and reduce the radius of each ball B j to ε ξ /2 = It was observed that ξ j B j for some j as the maximum error in position was according to Table 3. Without any a priori knowledge, similar situation will very likely happen in practice. The result after running Algorithm 2 for another ten successful runs: (1) the maximum error in the source strength mean(ŝ) was 3.02%, which was comparable to the best case in Table 3; and (2) the maximum error in the position mean( ˆξ) was 5.10E-3, which was the best result among all estimations found in Table 3. Due to the poor placement of some B j, several good runs were rejected. A total of 26 total runs were taken before having the required successful runs. From the numerical experiments, we found that even with the presence of noise in the boundary data, the proposed method can actually capture both the source strengths and their exact locations. 4.3 Example with 6 Source Points Finally, we gave the results of Algorithm 3 with 6 source points: ξ j = { [ 0.2, 0.8], [0.7, 0.5], [ 0.2, 0.2], [0.4, 0.3], [ 0.7, 0.5], [ 0.3, 0.8] }, where the source strengths equal s j = {+12, +2, 5, 5, 10, +5}. 14
15 Iteration Radius of B j Max. relative error in ŝ Max. error in ˆξ % % % 2.04E % 1.41E % 1.37E-4 Table 4: Numerical results for problem with 6 source points and ε ξ = 0.05 Iteration Radius of B j Max. relative error in ŝ Max. error in ˆξ % % % 8.57E % 4.76E % 5.43E-4 Table 5: Numerical results for problem with 6 source points and ε ξ = 0.10 All parameters remained the same as in the previous example, except that the coefficient λ in (17) was set to 0 to reflect the fact that the sum of source strengths is not equal to zero. The computation by Algorithm 3 was repeated for 5 iterations and the results for noise levels ε ξ = 0.05 and ε ξ = 0.10 are displayed in Table 4 and Table 5, respectively. The results are all comparable with Table 1 (the case of 3 source points). 5 Conclusion We proposed a numerical method for inverse source identification problem for Poisson equation. The method only requires an estimated locations of source points and scattered Dirichlet boundary data (with noise) to compute both the unknown source strengths and locations. Numerical experiments indicates that the proposed algorithms is robust and accurate. In fact, if the algorithms converge, the results are very accurate. Most importantly, the algorithms allow high tolerance to wrong algorithmic decisions that makes the method practical to handle real-life problems. 15
16 Acknowledgement The first named author was supported partially by a Postdoctoral Fellowship from the Japan Society for the Promotion of Science. The work of the second named author described in this paper was fully supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. CityU 1185/03E). The third named author was supported partially by Grant from the Japan Society for the Promotion of Science and Grant from the Ministry of Education, Cultures, Sports and Technology. References [1] C. J. S. Alves, C. S. Chen, and B. Săler. The method of fundamental solutions for solving Poisson problems. In Boundary elements, XXIV (Sintra, 2002), volume 13 of Int. Ser. Adv. Bound. Elem., pages WIT Press, Southampton, [2] Carlos J. S. Alves, Jalel Ben Abdallah, and Mohamed Jaoua. Recovery of cracks using a point-source reciprocity gap function. Inverse Probl. Sci. Eng., 12(5): , [3] Stéphane Andrieux and Amel Ben Abda. Identification of planar cracks by complete overdetermined data: inversion formulae. Inverse Problems, 12(5): , [4] Yu. E. Anikonov, B. A. Bubnov, and G. N. Erokhin. Inverse and ill-posed sources problems. Inverse and Ill-posed Problems Series. VSP, Utrecht, [5] J. M. Barry. Heat source determination in waste rock dumps, pages World Scientific Publishing Co. Inc., River Edge, NJ, Papers from the 8th Biennial Conference held at the University of Adelaide, Adelaide, September 29 October 1, [6] A. El Badia and T. Ha Duong. Some remarks on the problem of source identification from boundary measurements. Inverse Problems, 14(4): ,
17 [7] Heinz W. Engl, Martin Hanke, and Andreas Neubauer. Regularization of inverse problems, volume 375 of Mathematics and its Applications. Kluwer Academic Publishers Group, Dordrecht, [8] A. I. Fedoseyev, M. J. Friedman, and E. J. Kansa. Improved multiquadric method for elliptic partial differential equations via PDE collocation on the boundary. Comput. Math. Appl., 43(3-5): , Radial basis functions and partial differential equations. [9] J. I. Frankel. Constraining inverse Stefan design problems. Z. Angew. Math. Phys., 47(3): , [10] J. I. Frankel. Residual-minimization least-squares method for inverse heat conduction. Comput. Math. Appl., 32(4): , [11] Per Christian Hansen. Regularization tools: a Matlab package for analysis and solution of discrete ill-posed problems. Numer. Algorithms, 6(1-2):1 35, [12] Y. C. Hon and Z. Wu. A numerical computation for inverse boundary determination problem. Eng. Anal. Bound. Elem., 24(7 8): , September [13] Victor Isakov. Inverse source problems, volume 34 of Mathematical Surveys and Monographs. American Mathematical Society, Providence, RI, [14] E. J. Kansa. Multiquadrics a scattered data approximation scheme with applications to computational fluid-dynamics. I. Surface approximations and partial derivative estimates. Comput. Math. Appl., 19(8-9): , [15] G. A. Kriegsmann and W. E. Olmstead. Source identification for the heat equation. Appl. Math. Lett., 1(3): , [16] L. Ling, R. Opfer, and R. Schaback. Results on meshless collocation techniques. Int. J. Comput. Methods (submitted), [17] N. Magnoli and G. A. Viano. The source identification problem in electromagnetic theory. J. Math. Phys., 38(5): ,
18 [18] Takaaki Nara and Shigeru Ando. A projective method for an inverse source problem of the Poisson equation. Inverse Problems, 19(2): , [19] Takemi Shigeta and Y. C. Hon. Numerical source identification for Poisson equation. In M. Tanaka, editor, Engineering Mechanics IV, pages , Nagano, Japan, Elsevier Science. [20] V. N. Strakhov and M. A. Brodsky. On the uniqueness of the inverse logarithmic potential problem. SIAM J. Appl. Math., 46(2): ,
19 B B 3 Γ B 1 Ω (a) Three exact source positions ( ) and their surrounding balls B j centered at some estimated locations. ξ j ε ξ ~ ξ j B j (b) Trial centers ( ) in B j = Ball(ξ j, ε ξ ) as a circle centered at ξ j with radius ε ξ. Here, ξ j denotes an exact source position and ξ j ξ j < ε ξ. Figure 1: Graphical display of problem setting. 19
20 +2% +1% 0 % 1% 2% Source strength error Source 1 Source 2 Source 3 (a) Relative error for the computed source strength (ŝ s)/s Input position error Output position error Source 1 Source 2 Source 3 (b) Input position errors ξ ξ and output position errors ˆξ ξ Figure 2: Numerical results of ten runs for ε ξ = 0.05 with ten randomly chosen estimated source positions 20
21 +40% Source strength error +30% +20% +10% 0 % 10% Source 1 Source 2 Source 3 (a) Relative error for the computed source strength (ŝ s)/s Input position error Output position error Source 1 Source 2 Source 3 (b) Input position errors ξ ξ and output position errors ˆξ ξ Figure 3: Numerical results of ten runs for ε ξ = 0.10 with ten randomly chosen estimated source positions 21
22 List of Tables 1 Numerical results of Algorithm 3 Strategy 1 on noise-free boundary data Numerical results of Algorithm 3 Strategy 2 on noise-free boundary data Numerical results for Algorithm 2 on noisy boundary data Numerical results for problem with 6 source points and ε ξ = Numerical results for problem with 6 source points and ε ξ = List of Figures 1 Graphical display of problem setting Numerical results of ten runs for ε ξ = 0.05 with ten randomly chosen estimated source positions Numerical results of ten runs for ε ξ = 0.10 with ten randomly chosen estimated source positions
Solving the 3D Laplace Equation by Meshless Collocation via Harmonic Kernels
Solving the 3D Laplace Equation by Meshless Collocation via Harmonic Kernels Y.C. Hon and R. Schaback April 9, Abstract This paper solves the Laplace equation u = on domains Ω R 3 by meshless collocation
More informationDIRECT ERROR BOUNDS FOR SYMMETRIC RBF COLLOCATION
Meshless Methods in Science and Engineering - An International Conference Porto, 22 DIRECT ERROR BOUNDS FOR SYMMETRIC RBF COLLOCATION Robert Schaback Institut für Numerische und Angewandte Mathematik (NAM)
More informationNEW INVESTIGATIONS INTO THE MFS FOR 2D INVERSE LAPLACE PROBLEMS. Received June 2015; revised October 2015
International Journal of Innovative Computing, Information and Control ICIC International c 2016 ISSN 1349-4198 Volume 12, Number 1, February 2016 pp. 55 66 NEW INVESTIGATIONS INTO THE MFS FOR 2D INVERSE
More informationThe Method of Fundamental Solutions applied to the numerical calculation of eigenfrequencies and eigenmodes for 3D simply connected domains
ECCOMAS Thematic Conference on Meshless Methods 2005 C34.1 The Method of Fundamental Solutions applied to the numerical calculation of eigenfrequencies and eigenmodes for 3D simply connected domains Carlos
More informationTwo-parameter regularization method for determining the heat source
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 8 (017), pp. 3937-3950 Research India Publications http://www.ripublication.com Two-parameter regularization method for
More informationA Truly Boundary-Only Meshfree Method Applied to Kirchhoff Plate Bending Problems
Advances in Applied Mathematics and Mechanics June 2009 Adv. Appl. Math. Mech., Vol. 1, No. 3, pp. 341-352 (2009) A Truly Boundary-Only Meshfree Method Applied to Kirchhoff Plate Bending Problems Zhuojia
More informationAn improved subspace selection algorithm for meshless collocation methods
An improved subspace selection algorithm for meshless collocation methods Leevan Ling 1 and Robert Schaback 2 1 Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong. 2 Institut
More informationBOUNDARY PARTICLE METHOD FOR INVERSE CAUCHY PROBLEMS OF INHOMOGENEOUS HELMHOLTZ EQUATIONS
Journal of Marine Science and Technology, Vol. 7, No. 3, pp. 57-63 (9) 57 BOUNDARY PARTICLE METHOD FOR INVERSE CAUCHY PROBLEMS OF INHOMOGENEOUS HELMHOLTZ EQUATIONS Wen Chen* and Zhuojia Fu* Key words:
More information1 Comparison of Kansa s method versus Method of Fundamental Solution (MFS) and Dual Reciprocity Method of Fundamental Solution (MFS- DRM)
1 Comparison of Kansa s method versus Method of Fundamental Solution (MFS) and Dual Reciprocity Method of Fundamental Solution (MFS- DRM) 1.1 Introduction In this work, performances of two most widely
More informationConvergence of Rump s Method for Inverting Arbitrarily Ill-Conditioned Matrices
published in J. Comput. Appl. Math., 205(1):533 544, 2007 Convergence of Rump s Method for Inverting Arbitrarily Ill-Conditioned Matrices Shin ichi Oishi a,b Kunio Tanabe a Takeshi Ogita b,a Siegfried
More informationA MODIFIED TSVD METHOD FOR DISCRETE ILL-POSED PROBLEMS
A MODIFIED TSVD METHOD FOR DISCRETE ILL-POSED PROBLEMS SILVIA NOSCHESE AND LOTHAR REICHEL Abstract. Truncated singular value decomposition (TSVD) is a popular method for solving linear discrete ill-posed
More informationA Meshless Method for the Laplace and Biharmonic Equations Subjected to Noisy Boundary Data
Copyright c 4 Tech Science Press CMES, vol.6, no.3, pp.3-61, 4 A Meshless Method for the Laplace and Biharmonic Equations Subjected to Noisy Boundary Data B. Jin 1, Abstract: In this paper, we propose
More informationDOUBLY STOCHASTIC RADIAL BASIS FUNCTION METHODS
DOUBLY STOCHASTIC RADIAL BASIS FUNCTION METHODS FENGLIAN YANG, LIANG YAN, AND LEEVAN LING Abstract. We propose a doubly stochastic radial basis function (DSRBF) method for function recoveries. Instead
More informationInitial inverse problem in heat equation with Bessel operator
International Journal of Heat and Mass Transfer 45 (22) 2959 2965 www.elsevier.com/locate/ijhmt Initial inverse problem in heat equation with Bessel operator Khalid Masood *, Salim Messaoudi, F.D. Zaman
More informationLeast Squares Approximation
Chapter 6 Least Squares Approximation As we saw in Chapter 5 we can interpret radial basis function interpolation as a constrained optimization problem. We now take this point of view again, but start
More informationREGULARIZATION PARAMETER SELECTION IN DISCRETE ILL POSED PROBLEMS THE USE OF THE U CURVE
Int. J. Appl. Math. Comput. Sci., 007, Vol. 17, No., 157 164 DOI: 10.478/v10006-007-0014-3 REGULARIZATION PARAMETER SELECTION IN DISCRETE ILL POSED PROBLEMS THE USE OF THE U CURVE DOROTA KRAWCZYK-STAŃDO,
More informationDetermination of a source term and boundary heat flux in an inverse heat equation
ISSN 1746-7659, England, UK Journal of Information and Computing Science Vol. 8, No., 013, pp. 3-114 Determination of a source term and boundary heat flux in an inverse heat equation A.M. Shahrezaee 1
More informationKernel B Splines and Interpolation
Kernel B Splines and Interpolation M. Bozzini, L. Lenarduzzi and R. Schaback February 6, 5 Abstract This paper applies divided differences to conditionally positive definite kernels in order to generate
More informationA one-shot inpainting algorithm based on the topological asymptotic analysis
Volume, N. 2-3, pp. 1 267, 06 Copyright 06 SBMAC ISSN 01-8 www.scielo.br/cam A one-shot inpainting algorithm based on the topological asymptotic analysis DIDIER AUROUX and MOHAMED MASMOUDI Laboratoire
More informationScattering of electromagnetic waves by thin high contrast dielectrics II: asymptotics of the electric field and a method for inversion.
Scattering of electromagnetic waves by thin high contrast dielectrics II: asymptotics of the electric field and a method for inversion. David M. Ambrose Jay Gopalakrishnan Shari Moskow Scott Rome June
More informationRBF-FD Approximation to Solve Poisson Equation in 3D
RBF-FD Approximation to Solve Poisson Equation in 3D Jagadeeswaran.R March 14, 2014 1 / 28 Overview Problem Setup Generalized finite difference method. Uses numerical differentiations generated by Gaussian
More informationA FAST SOLVER FOR ELLIPTIC EQUATIONS WITH HARMONIC COEFFICIENT APPROXIMATIONS
Proceedings of ALGORITMY 2005 pp. 222 229 A FAST SOLVER FOR ELLIPTIC EQUATIONS WITH HARMONIC COEFFICIENT APPROXIMATIONS ELENA BRAVERMAN, MOSHE ISRAELI, AND ALEXANDER SHERMAN Abstract. Based on a fast subtractional
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 39: Non-Symmetric RBF Collocation in MATLAB Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu MATH 590 Chapter
More informationNumerical analysis of heat conduction problems on 3D general-shaped domains by means of a RBF Collocation Meshless Method
Journal of Physics: Conference Series PAPER OPEN ACCESS Numerical analysis of heat conduction problems on 3D general-shaped domains by means of a RBF Collocation Meshless Method To cite this article: R
More informationThe Linear Sampling Method and the MUSIC Algorithm
CODEN:LUTEDX/(TEAT-7089)/1-6/(2000) The Linear Sampling Method and the MUSIC Algorithm Margaret Cheney Department of Electroscience Electromagnetic Theory Lund Institute of Technology Sweden Margaret Cheney
More informationIntegrating ODE's in the Complex Plane-Pole Vaulting
MATHEMATICS OF COMPUTATION, VOLUME 35, NUMBER 152 OCTOBER 1980, PAGES 1181-1189 Integrating ODE's in the Complex Plane-Pole Vaulting By George F. Corliss Abstract. Most existing algorithms for solving
More informationA finite difference Poisson solver for irregular geometries
ANZIAM J. 45 (E) ppc713 C728, 2004 C713 A finite difference Poisson solver for irregular geometries Z. Jomaa C. Macaskill (Received 8 August 2003, revised 21 January 2004) Abstract The motivation for this
More informationAdaptive methods for control problems with finite-dimensional control space
Adaptive methods for control problems with finite-dimensional control space Saheed Akindeinde and Daniel Wachsmuth Johann Radon Institute for Computational and Applied Mathematics (RICAM) Austrian Academy
More informationQ. Zou and A.G. Ramm. Department of Mathematics, Kansas State University, Manhattan, KS 66506, USA.
Computers and Math. with Applic., 21 (1991), 75-80 NUMERICAL SOLUTION OF SOME INVERSE SCATTERING PROBLEMS OF GEOPHYSICS Q. Zou and A.G. Ramm Department of Mathematics, Kansas State University, Manhattan,
More informationIn this chapter we study elliptical PDEs. That is, PDEs of the form. 2 u = lots,
Chapter 8 Elliptic PDEs In this chapter we study elliptical PDEs. That is, PDEs of the form 2 u = lots, where lots means lower-order terms (u x, u y,..., u, f). Here are some ways to think about the physical
More informationAN ELEMENTARY PROOF OF THE OPTIMAL RECOVERY OF THE THIN PLATE SPLINE RADIAL BASIS FUNCTION
J. KSIAM Vol.19, No.4, 409 416, 2015 http://dx.doi.org/10.12941/jksiam.2015.19.409 AN ELEMENTARY PROOF OF THE OPTIMAL RECOVERY OF THE THIN PLATE SPLINE RADIAL BASIS FUNCTION MORAN KIM 1 AND CHOHONG MIN
More informationSOLVING HELMHOLTZ EQUATION BY MESHLESS RADIAL BASIS FUNCTIONS METHOD
Progress In Electromagnetics Research B, Vol. 24, 351 367, 2010 SOLVING HELMHOLTZ EQUATION BY MESHLESS RADIAL BASIS FUNCTIONS METHOD S. J. Lai and B. Z. Wang Institute of Applied Physics University of
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 34: Improving the Condition Number of the Interpolation Matrix Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu
More informationCubic spline Numerov type approach for solution of Helmholtz equation
Journal of Linear and Topological Algebra Vol. 03, No. 01, 2014, 47-54 Cubic spline Numerov type approach for solution of Helmholtz equation J. Rashidinia a, H. S. Shekarabi a and M. Aghamohamadi a a Department
More informationA Comparison between Solving Two Dimensional Integral Equations by the Traditional Collocation Method and Radial Basis Functions
Applied Mathematical Sciences, Vol. 5, 2011, no. 23, 1145-1152 A Comparison between Solving Two Dimensional Integral Equations by the Traditional Collocation Method and Radial Basis Functions Z. Avazzadeh
More informationNonrobust and Robust Objective Functions
Nonrobust and Robust Objective Functions The objective function of the estimators in the input space is built from the sum of squared Mahalanobis distances (residuals) d 2 i = 1 σ 2(y i y io ) C + y i
More informationIn the Name of God. Lectures 15&16: Radial Basis Function Networks
1 In the Name of God Lectures 15&16: Radial Basis Function Networks Some Historical Notes Learning is equivalent to finding a surface in a multidimensional space that provides a best fit to the training
More informationA hybrid Marquardt-Simulated Annealing method for solving the groundwater inverse problem
Calibration and Reliability in Groundwater Modelling (Proceedings of the ModelCARE 99 Conference held at Zurich, Switzerland, September 1999). IAHS Publ. no. 265, 2000. 157 A hybrid Marquardt-Simulated
More informationSurvey of Inverse Problems For Hyperbolic PDEs
Survey of Inverse Problems For Hyperbolic PDEs Rakesh Department of Mathematical Sciences University of Delaware Newark, DE 19716, USA Email: rakesh@math.udel.edu January 14, 2011 1 Problem Formulation
More informationA Lower Bound Theorem. Lin Hu.
American J. of Mathematics and Sciences Vol. 3, No -1,(January 014) Copyright Mind Reader Publications ISSN No: 50-310 A Lower Bound Theorem Department of Applied Mathematics, Beijing University of Technology,
More informationFirst- and second-order sensitivity analysis schemes by collocation-type Trefftz method
Computer Assisted Mechanics and Engineering Sciences, 4: 477 489, 1997 Copyright c 1997 by Polska Akademia Nauk First- and second-order sensitivity analysis schemes by collocation-type Trefftz method Eisuke
More informationApplied Mathematics 205. Unit II: Numerical Linear Algebra. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit II: Numerical Linear Algebra Lecturer: Dr. David Knezevic Unit II: Numerical Linear Algebra Chapter II.3: QR Factorization, SVD 2 / 66 QR Factorization 3 / 66 QR Factorization
More informationOptimal Interface Conditions for an Arbitrary Decomposition into Subdomains
Optimal Interface Conditions for an Arbitrary Decomposition into Subdomains Martin J. Gander and Felix Kwok Section de mathématiques, Université de Genève, Geneva CH-1211, Switzerland, Martin.Gander@unige.ch;
More informationA Simple Compact Fourth-Order Poisson Solver on Polar Geometry
Journal of Computational Physics 182, 337 345 (2002) doi:10.1006/jcph.2002.7172 A Simple Compact Fourth-Order Poisson Solver on Polar Geometry Ming-Chih Lai Department of Applied Mathematics, National
More informationSOLVING INHOMOGENEOUS PROBLEMS BY SINGULAR BOUNDARY METHOD
8 Journal of Marine Science and Technology Vol. o. pp. 8-4 03) DOI: 0.69/JMST-0-0704- SOLVIG IHOMOGEEOUS PROBLEMS BY SIGULAR BOUDARY METHOD Xing Wei Wen Chen and Zhuo-Jia Fu Key words: singular boundary
More informationA Singular Integral Transform for the Gibbs-Wilbraham Effect in Inverse Fourier Transforms
Universal Journal of Integral Equations 4 (2016), 54-62 www.papersciences.com A Singular Integral Transform for the Gibbs-Wilbraham Effect in Inverse Fourier Transforms N. H. S. Haidar CRAMS: Center for
More informationarxiv: v1 [physics.comp-ph] 28 Jan 2008
A new method for studying the vibration of non-homogeneous membranes arxiv:0801.4369v1 [physics.comp-ph] 28 Jan 2008 Abstract Paolo Amore Facultad de Ciencias, Universidad de Colima, Bernal Díaz del Castillo
More informationImplicitely and Densely Discrete Black-Box Optimization Problems
Implicitely and Densely Discrete Black-Box Optimization Problems L. N. Vicente September 26, 2008 Abstract This paper addresses derivative-free optimization problems where the variables lie implicitly
More informationTHE METHOD OF FUNDAMENTAL SOLUTION FOR SOLVING MULTIDIMENSIONAL INVERSE HEAT CONDUCTION PROBLEMS
THE METHOD OF FUNDAMENTAL SOLUTION FOR SOLVING MULTIDIMENSIONAL INVERSE HEAT CONDUCTION PROBLEMS Y.C. HON AND T.WEI Abstract. We propose in this paper an effective meshless and integration-free method
More informationPDEs, part 1: Introduction and elliptic PDEs
PDEs, part 1: Introduction and elliptic PDEs Anna-Karin Tornberg Mathematical Models, Analysis and Simulation Fall semester, 2013 Partial di erential equations The solution depends on several variables,
More informationIrregular Solutions of an Ill-Posed Problem
Irregular Solutions of an Ill-Posed Problem Peter Linz University of California at Davis Richard L.C. Wang Clearsight Systems Inc. Abstract: Tikhonov regularization is a popular and effective method for
More informationDevelopment of an algorithm for the problem of the least-squares method: Preliminary Numerical Experience
Development of an algorithm for the problem of the least-squares method: Preliminary Numerical Experience Sergey Yu. Kamensky 1, Vladimir F. Boykov 2, Zakhary N. Khutorovsky 3, Terry K. Alfriend 4 Abstract
More informationInverse Gravimetry Problem
Inverse Gravimetry Problem Victor Isakov September 21, 2010 Department of M athematics and Statistics W ichita State U niversity W ichita, KS 67260 0033, U.S.A. e mail : victor.isakov@wichita.edu 1 Formulation.
More informationA new meshless method for steady-state heat conduction problems in anisotropic and inhomogeneous media
Archive of Applied Mechanics 74 25 563--579 Springer-Verlag 25 DOI 1.17/s419-5-375-8 A new meshless method for steady-state heat conduction problems in anisotropic and inhomogeneous media H. Wang, Q.-H.
More informationA Posteriori Error Bounds for Meshless Methods
A Posteriori Error Bounds for Meshless Methods Abstract R. Schaback, Göttingen 1 We show how to provide safe a posteriori error bounds for numerical solutions of well-posed operator equations using kernel
More informationA New Trust Region Algorithm Using Radial Basis Function Models
A New Trust Region Algorithm Using Radial Basis Function Models Seppo Pulkkinen University of Turku Department of Mathematics July 14, 2010 Outline 1 Introduction 2 Background Taylor series approximations
More informationTrefftz type method for 2D problems of electromagnetic scattering from inhomogeneous bodies.
Trefftz type method for 2D problems of electromagnetic scattering from inhomogeneous bodies. S. Yu. Reutsiy Magnetohydrodynamic Laboratory, P. O. Box 136, Mosovsi av.,199, 61037, Kharov, Uraine. e mail:
More informationWhy the QR Factorization can be more Accurate than the SVD
Why the QR Factorization can be more Accurate than the SVD Leslie V. Foster Department of Mathematics San Jose State University San Jose, CA 95192 foster@math.sjsu.edu May 10, 2004 Problem: or Ax = b for
More informationChapter 5 HIGH ACCURACY CUBIC SPLINE APPROXIMATION FOR TWO DIMENSIONAL QUASI-LINEAR ELLIPTIC BOUNDARY VALUE PROBLEMS
Chapter 5 HIGH ACCURACY CUBIC SPLINE APPROXIMATION FOR TWO DIMENSIONAL QUASI-LINEAR ELLIPTIC BOUNDARY VALUE PROBLEMS 5.1 Introduction When a physical system depends on more than one variable a general
More informationConsistency Estimates for gfd Methods and Selection of Sets of Influence
Consistency Estimates for gfd Methods and Selection of Sets of Influence Oleg Davydov University of Giessen, Germany Localized Kernel-Based Meshless Methods for PDEs ICERM / Brown University 7 11 August
More informationarxiv: v1 [physics.comp-ph] 29 Sep 2017
Meshfree Local Radial Basis Function Collocation Method with Image Nodes Seung Ki Baek and Minjae Kim arxiv:179.124v1 [physics.comp-ph] 29 Sep 217 Department of Physics, Pukyong National University, Busan
More informationRank-Deficient Nonlinear Least Squares Problems and Subset Selection
Rank-Deficient Nonlinear Least Squares Problems and Subset Selection Ilse Ipsen North Carolina State University Raleigh, NC, USA Joint work with: Tim Kelley and Scott Pope Motivating Application Overview
More informationAll Well Posed Problems have Uniformly Stable and Convergent Discretizations
Noname manuscript No. (will be inserted by the editor) All Well Posed Problems have Uniformly Stable and Convergent Discretizations Robert Schaback Received: date / Accepted: date Abstract This paper considers
More informationBoundary. DIFFERENTIAL EQUATIONS with Fourier Series and. Value Problems APPLIED PARTIAL. Fifth Edition. Richard Haberman PEARSON
APPLIED PARTIAL DIFFERENTIAL EQUATIONS with Fourier Series and Boundary Value Problems Fifth Edition Richard Haberman Southern Methodist University PEARSON Boston Columbus Indianapolis New York San Francisco
More informationAn eigenvalue method using multiple frequency data for inverse scattering problems
An eigenvalue method using multiple frequency data for inverse scattering problems Jiguang Sun Abstract Dirichlet and transmission eigenvalues have important applications in qualitative methods in inverse
More informationSignal Identification Using a Least L 1 Norm Algorithm
Optimization and Engineering, 1, 51 65, 2000 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Signal Identification Using a Least L 1 Norm Algorithm J. BEN ROSEN Department of Computer
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 33: Adaptive Iteration Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu MATH 590 Chapter 33 1 Outline 1 A
More informationApproximation of inverse boundary value problems by phase-field methods
Approximation of inverse boundary value problems by phase-field methods Luca RONDI Università degli Studi di Trieste Dipartimento di Matematica e Informatica MSRI Berkeley, 3 December 2010 Luca RONDI (Università
More informationAn Accurate Fourier-Spectral Solver for Variable Coefficient Elliptic Equations
An Accurate Fourier-Spectral Solver for Variable Coefficient Elliptic Equations Moshe Israeli Computer Science Department, Technion-Israel Institute of Technology, Technion city, Haifa 32000, ISRAEL Alexander
More informationCLASS NOTES Computational Methods for Engineering Applications I Spring 2015
CLASS NOTES Computational Methods for Engineering Applications I Spring 2015 Petros Koumoutsakos Gerardo Tauriello (Last update: July 27, 2015) IMPORTANT DISCLAIMERS 1. REFERENCES: Much of the material
More information6.3 Fundamental solutions in d
6.3. Fundamental solutions in d 5 6.3 Fundamental solutions in d Since Lapalce equation is invariant under translations, and rotations (see Exercise 6.4), we look for solutions to Laplace equation having
More informationIntroduction to Bayesian methods in inverse problems
Introduction to Bayesian methods in inverse problems Ville Kolehmainen 1 1 Department of Applied Physics, University of Eastern Finland, Kuopio, Finland March 4 2013 Manchester, UK. Contents Introduction
More informationEvolutionary Multiobjective. Optimization Methods for the Shape Design of Industrial Electromagnetic Devices. P. Di Barba, University of Pavia, Italy
Evolutionary Multiobjective Optimization Methods for the Shape Design of Industrial Electromagnetic Devices P. Di Barba, University of Pavia, Italy INTRODUCTION Evolutionary Multiobjective Optimization
More informationA COUNTEREXAMPLE TO AN ENDPOINT BILINEAR STRICHARTZ INEQUALITY TERENCE TAO. t L x (R R2 ) f L 2 x (R2 )
Electronic Journal of Differential Equations, Vol. 2006(2006), No. 5, pp. 6. ISSN: 072-669. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu (login: ftp) A COUNTEREXAMPLE
More informationAn Accelerated Block-Parallel Newton Method via Overlapped Partitioning
An Accelerated Block-Parallel Newton Method via Overlapped Partitioning Yurong Chen Lab. of Parallel Computing, Institute of Software, CAS (http://www.rdcps.ac.cn/~ychen/english.htm) Summary. This paper
More informationSTA 4273H: Statistical Machine Learning
STA 4273H: Statistical Machine Learning Russ Salakhutdinov Department of Statistics! rsalakhu@utstat.toronto.edu! http://www.utstat.utoronto.ca/~rsalakhu/ Sidney Smith Hall, Room 6002 Lecture 3 Linear
More informationOn spherical-wave scattering by a spherical scatterer and related near-field inverse problems
IMA Journal of Applied Mathematics (2001) 66, 539 549 On spherical-wave scattering by a spherical scatterer and related near-field inverse problems C. ATHANASIADIS Department of Mathematics, University
More informationA PROJECTED HESSIAN GAUSS-NEWTON ALGORITHM FOR SOLVING SYSTEMS OF NONLINEAR EQUATIONS AND INEQUALITIES
IJMMS 25:6 2001) 397 409 PII. S0161171201002290 http://ijmms.hindawi.com Hindawi Publishing Corp. A PROJECTED HESSIAN GAUSS-NEWTON ALGORITHM FOR SOLVING SYSTEMS OF NONLINEAR EQUATIONS AND INEQUALITIES
More informationThe purpose of this lecture is to present a few applications of conformal mappings in problems which arise in physics and engineering.
Lecture 16 Applications of Conformal Mapping MATH-GA 451.001 Complex Variables The purpose of this lecture is to present a few applications of conformal mappings in problems which arise in physics and
More informationElectrostatic Imaging via Conformal Mapping. R. Kress. joint work with I. Akduman, Istanbul and H. Haddar, Paris
Electrostatic Imaging via Conformal Mapping R. Kress Göttingen joint work with I. Akduman, Istanbul and H. Haddar, Paris Or: A new solution method for inverse boundary value problems for the Laplace equation
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 33: Adaptive Iteration Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu MATH 590 Chapter 33 1 Outline 1 A
More informationTuning of Fuzzy Systems as an Ill-Posed Problem
Tuning of Fuzzy Systems as an Ill-Posed Problem Martin Burger 1, Josef Haslinger 2, and Ulrich Bodenhofer 2 1 SFB F 13 Numerical and Symbolic Scientific Computing and Industrial Mathematics Institute,
More informationMS&E 318 (CME 338) Large-Scale Numerical Optimization
Stanford University, Management Science & Engineering (and ICME) MS&E 318 (CME 338) Large-Scale Numerical Optimization 1 Origins Instructor: Michael Saunders Spring 2015 Notes 9: Augmented Lagrangian Methods
More informationDyson series for the PDEs arising in Mathematical Finance I
for the PDEs arising in Mathematical Finance I 1 1 Penn State University Mathematical Finance and Probability Seminar, Rutgers, April 12, 2011 www.math.psu.edu/nistor/ This work was supported in part by
More informationResearch Article A Note on the Solutions of the Van der Pol and Duffing Equations Using a Linearisation Method
Mathematical Problems in Engineering Volume 1, Article ID 693453, 1 pages doi:11155/1/693453 Research Article A Note on the Solutions of the Van der Pol and Duffing Equations Using a Linearisation Method
More informationA novel method for estimating the distribution of convective heat flux in ducts: Gaussian Filtered Singular Value Decomposition
A novel method for estimating the distribution of convective heat flux in ducts: Gaussian Filtered Singular Value Decomposition F Bozzoli 1,2, L Cattani 1,2, A Mocerino 1, S Rainieri 1,2, F S V Bazán 3
More informationAN ALGORITHM FOR COMPUTING FUNDAMENTAL SOLUTIONS OF DIFFERENCE OPERATORS
AN ALGORITHM FOR COMPUTING FUNDAMENTAL SOLUTIONS OF DIFFERENCE OPERATORS HENRIK BRANDÉN, AND PER SUNDQVIST Abstract We propose an FFT-based algorithm for computing fundamental solutions of difference operators
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics ON A THEOREM OF LANCASTER AND SIEGEL Danzhu Shi and Robert Finn Volume 13 No. 1 January 004 PACIFIC JOURNAL OF MATHEMATICS Vol. 13, No. 1, 004 ON A THEOREM OF LANCASTER
More informationIntroduction. J.M. Burgers Center Graduate Course CFD I January Least-Squares Spectral Element Methods
Introduction In this workshop we will introduce you to the least-squares spectral element method. As you can see from the lecture notes, this method is a combination of the weak formulation derived from
More informationInterpolation by Basis Functions of Different Scales and Shapes
Interpolation by Basis Functions of Different Scales and Shapes M. Bozzini, L. Lenarduzzi, M. Rossini and R. Schaback Abstract Under very mild additional assumptions, translates of conditionally positive
More informationPenalty and Barrier Methods General classical constrained minimization problem minimize f(x) subject to g(x) 0 h(x) =0 Penalty methods are motivated by the desire to use unconstrained optimization techniques
More informationMeshfree Approximation Methods with MATLAB
Interdisciplinary Mathematical Sc Meshfree Approximation Methods with MATLAB Gregory E. Fasshauer Illinois Institute of Technology, USA Y f? World Scientific NEW JERSEY LONDON SINGAPORE BEIJING SHANGHAI
More informationSolving Pure Torsion Problem and Modelling Radionuclide Migration Using Radial Basis Functions
International Workshop on MeshFree Methods 3 1 Solving Pure Torsion Problem and Modelling Radionuclide Migration Using Radial Basis Functions Leopold Vrankar (1), Goran Turk () and Franc Runovc (3) Abstract:
More informationRegularization methods for large-scale, ill-posed, linear, discrete, inverse problems
Regularization methods for large-scale, ill-posed, linear, discrete, inverse problems Silvia Gazzola Dipartimento di Matematica - Università di Padova January 10, 2012 Seminario ex-studenti 2 Silvia Gazzola
More informationDUAL REGULARIZED TOTAL LEAST SQUARES SOLUTION FROM TWO-PARAMETER TRUST-REGION ALGORITHM. Geunseop Lee
J. Korean Math. Soc. 0 (0), No. 0, pp. 1 0 https://doi.org/10.4134/jkms.j160152 pissn: 0304-9914 / eissn: 2234-3008 DUAL REGULARIZED TOTAL LEAST SQUARES SOLUTION FROM TWO-PARAMETER TRUST-REGION ALGORITHM
More informationHeat Transfer in a Medium in Which Many Small Particles Are Embedded
Math. Model. Nat. Phenom. Vol. 8, No., 23, pp. 93 99 DOI:.5/mmnp/2384 Heat Transfer in a Medium in Which Many Small Particles Are Embedded A. G. Ramm Department of Mathematics Kansas State University,
More informationInitial Temperature Reconstruction for a Nonlinear Heat Equation: Application to Radiative Heat Transfer.
Proceedings of the 5th International Conference on Inverse Problems in Engineering: Theory and Practice, Cambridge, UK, 11-15th July 2005 Initial Temperature Reconstruction for a Nonlinear Heat Equation:
More informationNumerical solution of Maxwell equations using local weak form meshless techniques
Journal of mathematics and computer science 13 2014), 168-185 Numerical solution of Maxwell equations using local weak form meshless techniques S. Sarabadan 1, M. Shahrezaee 1, J.A. Rad 2, K. Parand 2,*
More informationAccelerating Nesterov s Method for Strongly Convex Functions
Accelerating Nesterov s Method for Strongly Convex Functions Hao Chen Xiangrui Meng MATH301, 2011 Outline The Gap 1 The Gap 2 3 Outline The Gap 1 The Gap 2 3 Our talk begins with a tiny gap For any x 0
More informationANALYSIS AND NUMERICAL METHODS FOR SOME CRACK PROBLEMS
INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING, SERIES B Volume 2, Number 2-3, Pages 155 166 c 2011 Institute for Scientific Computing and Information ANALYSIS AND NUMERICAL METHODS FOR SOME
More information