Copyright c1999 by Academia Scientiarum Fennica ISSN??????? ISBN??????? Received 4 October Mathematics Subject Classication: 35J5,35R3,78A7,

Size: px
Start display at page:

Download "Copyright c1999 by Academia Scientiarum Fennica ISSN??????? ISBN??????? Received 4 October Mathematics Subject Classication: 35J5,35R3,78A7,"

Transcription

1 ANNALES ACADEMISCIENTIARUM FENNIC MATHEMATICA DISSERTATIONES??? ELECTRICAL IMPEDANCE TOMOGRAPHY AND FADDEEV GREEN'S FUNCTIONS SAMULI SILTANEN Dissertation for the Degree of Doctor of Technology to be presented with due permission for public examination and debate in Auditorium N at Helsinki University of Technology (Espoo, Finland) on the 6th of November, at 1 o'clock noon. HELSINKI 1999 SUOMALAINEN TIEDEAKATEMIA

2 Copyright c1999 by Academia Scientiarum Fennica ISSN??????? ISBN??????? Received 4 October Mathematics Subject Classication: 35J5,35R3,78A7,65R1,65R. YLIOPISTOPAINO HELSINKI 1999

3 Acknowledgements I am grateful to Erkki Somersalo for being the advisor of my work and for introducing me to the international inverse problems research community. Also, our combined boxing and mathematics sessions with him and Lassi Paivarinta were extremely inspiring. I thank Petri Ola and Margaret Cheney for carefully reading my manuscript and giving valuable suggestions I also thank Rainer Kress for being my opponent. I am grateful to Adrian Nachman for his interest to this work and the enlightening discussions about his results. This work led to wonderful collaboration with Jennifer Mueller and David Isaacson. Thanks to them together with Jon Newell and Margaret Cheney, my stay at the Rensselaer Polytechnic Institute was very pleasant. I appreciate the opportunity to be measured with the ACT 3 impedance imaging device (it didn't hurt). I thank Gunther Uhlmann for discussions about the inverse conductivity problem and John Sylvester for his advice in the numerical aspects of my work. I wish to thank my dear friend Matti Lassas for always having time for my questions, mathematical and others. I thank all the people in the Finnish inverse problems research society for creating a great social atmosphere. I thank Eero Saksman, Hans-Olav Tylli and Juha Kinnunen for their help in questions related to singular integrals and functional analysis. I am grateful to my wife and friends for supporting me during this work. Finally, I thank Olavi Nevanlinna for arranging an excellent working environment at the Helsinki University of Technology and the Finnish Ministry of Education, Finnish Academy of Science and Letters, the Emil Aaltonen Foundation, the Instrumentarium Science Foundation and the Finnish Cultural Foundation for nancial support. Tuusula, October 1999 Samuli Siltanen

4 Contents 1 Introduction Electrical impedance tomography Mathematics of EIT A brief history of the problem Applying A. Nachman's method to EIT A. Nachman's reconstruction method 11.1 Denitions From to t From t to Conditional stability Practical aspects Theoretical observations Faddeev Green's functions Denitions and basic properties Derivatives Representation formulas Estimates An asymptotic expansion Determining H k () The scattering transform Large jkj estimates Behaviour near k = Symmetries Computational methods Evaluating Faddeev Green's functions Computing g 1 for jxj > 1= Computing g 1 in the unit disc Numerical results An alternative algorithm for g Computing and t from Finding in a bounded domain Description of the algorithm Proof of convergence Generating test problems Conclusion 5

5 1. Introduction 1.1. Electrical impedance tomography Magnetic resonance imaging (MRI and fmri), X-ray tomography or computed tomography (CT), magnetic encephalography (MEG) and ultrasound imaging are examples of medical imaging methods that produce a picture of a patient's inner organs without intruding into the body. Images coming from dierent systems complement each other since each of these methods measures the distribution of some specic physical parameter, such as mass density (CT) or sound speed (ultrasound imaging). Some of the methods are more harmful to the patient than others: X-ray measurements expose her to dangerous radiation whereas ultrasound imaging has little or no health risks. Another dierence between the systems is that some of the machines are very expensive. For these reasons it is valuable to have as many dierent imaging methods available as possible. Electrical impedance tomography (EIT) is a medical imaging system that produces a picture of electric conductivity distribution inside the patient. For the EIT measurement an array of electrodes is attached for instance around the chest of the patient as shown in Figure 1. Measurements are done by feeding electric currents Figure 1: EIT measurements can be done with an array of electrodes around the chest. through the electrodes and measuring the corresponding voltages at the electrodes. This measurement is repeated with several dierent choices of current patterns. The

6 6 Samuli Siltanen resulting image is an approximate map of the electric conductivity in a horizontal slice on the level of heart and lungs. To get a feeling about why this should be possible, note that if the lungs are full of air, no electric current will pass through them. On the other hand, empty lungs do conduct electricity to a somewhat greater extent, so at least these two situations will give dierent measurements. Of course it is a lot more challenging task to reconstruct every detail inside the chest this requires precise measurements and nontrivial mathematics. Measuring around the chest can be used in monitoring the heart or to improve ECG measurements. For other medical purposes of EIT, such as screening for breast cancer, see [4]. Attractive features of EIT include the possibility of harmless monitoring and good temporal resolution. Moreover, EIT gives complementary information to other imaging modalities. There are working EIT machines, most notably the Adaptive Current Tomography (ACT) system built in Rensselaer Polytechnic Institute (RPI). It is capable of real-time imaging and has been tested on people. See [11] for more details. Impedance imaging is also used in a commercial breast cancer detector called T- Scan that was launched recently. EIT is not yet in wide clinical use because practically reliable and fast imaging is extremely dicult and needs still more research. This work is part of a project aiming to produce a new imaging algorithm for EIT starting from the latest results of applied mathematics. Hopefully this will help the ongoing eort to build accurate, cheap and portable EIT devices. 1.. Mathematics of EIT The mathematical task of interpreting EIT measurements is an inverse boundaryvalue problem called the inverse electric conductivity problem. It is a challenging question in the theory of partial dierential equations since it is nonlinear (Figure ) and ill-posed. Designing a practical algorithm for EIT is hard because nonlinearity makes the mathematical solution theoretically dicult and ill-posedness means that a small error in the practical measurements may cause a large error in the reconstructed image. Due to its challenging theoretical nature and medical applications, EIT is a good problem in applied mathematics. + = Figure : EIT is a nonlinear problem. The boundary measurements corresponding to the two leftmost objects do not add up to the measurement corresponding to the rightmost object.

7 Electrical Impedance Tomography and Faddeev Green's Functions 7 Let us state the inverse conductivity problem in mathematical terms: let R be a bounded, simply connected Lipschitz domain and :! R a bounded, measurable real function with a strictly positive lower bound, that is, <c (x) a.e. The forward electric conductivity problem is to determine, given any f H 1= (@), the H 1 solution u of the Dirichlet problem rru = in = f: (1) Note that the boundary value problem (1) is elliptic due to the lower bound of and its solution under various assumptions on is discussed in [17, ]. Dene now the Dirichlet-to-Neumann map of by : H 1= (@)! H ;1= (@) h f gi = ru rv where v is any H 1 () function with trace g on the boundary. The inverse electric conductivity problem is to nd out if (satisfying perhaps some additional regularity assumptions) is uniquely determined from the knowledge of and if so, to reconstruct. Physically f represents a voltage distribution on the boundary of a two-dimensional physical body with an unknown inhomogeneous conductivity distribution. Furthermore, u is the electric potential inside the body that solves the conductivity equation (1) and agrees with f on the boundary. Thus the Dirichlet-to-Neumann map can be interpreted as the voltage-to-current map taking the boundary value of the voltage to the resulting electric current through the boundary. In this way represents static electric measurements done on the boundary of and the inverse conductivity problem is to determine the conductivity that caused those measurements. Let us make some observations: The physical signicance of the assumption that the conductivity is bounded away from zero is that there cannot appear annulus-shaped areas of zero conductivity this would make it impossible to reconstruct anything inside the annulus. As mentioned above, in practical measurements one feeds currents and measures voltages and not the other way around. This is due to the fact that although the two measurements are mathematically equivalent, the latter procedure is unstable to measure

8 8 Samuli Siltanen Although physical bodies are three-dimensional, from the point of view of EIT the problem of producing the picture of a horizontal slice of a person's chest is approximately two-dimensional. This is why we consider only the twodimensional case in this work. For an analysis of avoiding this simplication by using approximate Dirichlet-to-Neumann maps, see [33]. In addition to EIT, there are other physical applications of the inverse conductivity problem, such as geological prospecting and non-destructive material testing. All further references to applications will, however, concentrate on EIT A brief history of the problem Research on the inverse conductivity problem has two traditions: a purely mathematical one providing uniqueness and reconstruction results and a practical approach having as its goal algorithms that perform well on physical data. The theoretically oriented line of research was started by Calderon [8], who studied electrical engineering before changing to mathematics. He stated the inverse conductivity problem for the rst time in the above form (in dimensions n ) and gave some preliminary results for conductivities close to a constant. Mathematically his work continued the tradition of Gel'fand, Levitan and Borg [16, 6]. Once Calderon asked his question, new results started to appear. Kohn and Vogelius [35] showed that for piecewise analytic conductivities the Dirichlet-to- Neumann map uniquely determines the conductivity in dimensions or more. Sylvester and Uhlmann [5] showed in dimensions n 3 that is C 1 then uniquely determines C 1 (). The rst reconstruction method was published by A. Nachman [4] this result is valid in dimensions strictly greater than two. The work of R. G. Novikov [3] contains similar results. Meanwhile the case n = remained unsolved. Why is the two-dimensional case more dicult than the higher-dimensional ones? A naive reason for this is that in n dimensions the Schwartz kernel of depends on (n ; 1) variables while is a function of n variables this means that in a sense there is no overdeterminacy in two dimensions and all the data has to be used for the reconstruction. In 1996 A. Nachman published a reconstruction procedure for the two-dimensional problem [43]. This method is especially interesting because it is constructive in nature. The smoothness assumption in [43] is W p () for some p > 1 which implies that is continuous. This result was soon sharpened for conductivities in W 1 () < < 1 by R. Brown and G. Uhlmann [7]. These conductivities are also continuous. A more detailed introduction to the mathematical development of the problem is given in [43, 51]. Also V. Isakov's article [3] and book [31] are good references

9 Electrical Impedance Tomography and Faddeev Green's Functions 9 they cover also results aiming at partial answers such as nding domains with zero or innite conductivity. See also [6, 7]. The practical branch of EIT research started with papers like [], although the inverse conductivity problem has been treated earlier in the engineering literature [38, 9]. Since the inverse conductivity problem is very complicated mathematically, we can expect the the practical EIT imaging task to be dicult. In addition to the nonlinearity and ill-posedness of the theoretical model there are further problems: the Dirichlet-to-Neumann map is not given instead its inverse operator has to be approximated from noisy and nite-precision current-to-voltage measurements. Furthermore, only a nite number of current patterns can be applied through a nite number of electrodes. This situation places restrictions on the resolution of the images [9] and requires the physical model of the electrode system to be rened [46]. This leads to the notion of distinguishability [8] describing the resolution it is possible to obtain in principle with a given system. With these restrictions known, many algorithms have been developed and tested on real data. They fall roughly in three categories: 1. Solve the linearized inverse problem. This approach works best for conductivities close to constant examples include back-projection [3] and one-step Newton schemes like NOSER [14].. Solve the nonlinear problem by nding iteratively a conductivity distribution that matches the physical measurements best in the least squares sense. These methods require regularization due to the ill-posedness of the inverse problem. For a list of references to methods of this type see [11, p.9] note also [1, 34]. See [55, 56] for reports on using anatomical a priori information in iterative EIT imaging. 3. Solve the problem directly. The methods of this category are called direct methods as opposed to iterative ones they aim as well to solve the full nonlinear problem. An existing example of this type is layer stripping [47, 49]. The numerical realization of Nachman's reconstruction method will fall into this category. Some of these ideas combined with nontrivial electrical engineering make it possible to build reasonably working EIT devices. This has been done in several laboratories around the world, e.g. RPI, Sheeld, Oxford and Kuopio, Finland, see [11, 39, 56]. We mention that the ACT system of the RPI group performs imaging in real time and has been tested in a clinical environment. For ideas for dynamical measurements using Kalman lters see [57]. The above treatment of the practical aspects of EIT is far from complete. For a more thorough review see [59, 1, 11].

10 1 Samuli Siltanen 1.4. Applying A. Nachman's method to EIT The two main lines of EIT research, the purely mathematical and the applied one, have not beneted much from each other. The methods used by the theoretical reconstructions tend to be hard or impossible to realize on a computer. On the other hand it has turned out to be dicult to prove convergence results for the existing practical algorithms in addition it is not easy to describe the relation between the actual conductivity and a reconstruction computed with a convergent but regularized algorithm. Nevertheless, Nachman's mathematical proof [43] for the two-dimensional case is throughout constructive and seems not to have steps that are impossible to implement practically. This work is part of a project to develop a practical reconstruction algorithm based on Nachman's method, the scope being to provide both theoretical insight and numerical algorithms for various steps of the reconstruction. In this way this thesis helps to build a bridge between theory and practice of the inverse conductivity problem. The larger project of realizing Nachman's whole reconstruction scheme is carried out by the author in collaboration with professor David Isaacson and PhD Jennifer Mueller from Rensselaer Polytechnic Institute, NY, USA. The results of the project will be published later. We present here briey the contents of this work. In Chapter we give an introduction to Nachman's proof [43]. A more detailed treatment can be found in [45]. Chapter 3 presents new results of practical importance related to Nachman's method: estimates, representation formulas and symmetry properties for Faddeev fundamental solutions g k and G k information about the size, smoothness and asymptotic behaviour of the functions (x k) (important intermediate objects in Nachman's proof) observations on howvarious properties of the conductivity manifest themselves in the non-physical scattering transform t(k), another function needed in the reconstruction new estimates on jt(k)j for both large and small jkj. These ideas are used in Chapter 4 for designing numerical algorithms useful for various steps of the reconstruction, namely computing numerically values of the Faddeev Green's functions g k and G k, computing the functions (x k) and t(k) for given test conductivities. One radially symmetric example is computed numerically. The reason for choosing a symmetric example is to avoid intensive computations and utilize the symmetry theoretically the algorithms work for nonsymmetric cases, too.

11 Electrical Impedance Tomography and Faddeev Green's Functions 11. A. Nachman's reconstruction method.1. Denitions In 1996, A. Nachman published a constructive proof of the inverse conductivity problem in two-dimensional space. The main theorem of his work is Theorem.1 [43, Theorem 1] Let be a bounded, simply connected Lipschitz domain in R. Let 1 and be in W p () for some p > 1, and have positive lower bounds. If 1 = then 1 = : The proof gives a constructive procedure for recovering from the knowledge of. We will make some simplifying assumptions. The rst part of the proof of Nachman's theorem is to nd on the boundary of and reduce the problem to the case 1 in a neighbourhood the reduction is done in such a way that we can to be smooth. We will thus assume 1 near the C 1 Furthermore, we prefer working with smooth functions instead of the Sobolev ones whenever possible and will therefore consider only smooth conductivities: C 1 (): From the point of view of applications there is not much dierence in considering C 1 conductivities instead of W p ones since in practice the conductivities (inner organs of people) are discontinuous and by Sobolev imbedding theorem the W p functions are continuous. The solution of the inverse problem is based on the use of an intermediate object called the non-physical scattering transform t, which is not directly measurable in experiments. See Figure 3 for a schematic illustration. We give the denition of t and explain the two main steps of the procedure, namely nding t from the boundary measurements and determining from the knowledge of t. To dene t we consider the Schrodinger equation associated with the inverse conductivity problem. If u is a solution of rru = in, dening ~u = 1= u yields (;+q)~u =in () with the potential q C 1 () given by q = 1= : (3) 1= Moreover, our assumption that be one near allows us to extend smoothly by one and q by zero to the whole plane. The exponentially behaving solutions of () introduced by Faddeev [15] are the key to the reconstruction:

12 1 Samuli Siltanen (x) forward ; ; ; ; t(k) melborp esrevni Figure 3: Overall strategy of the proof. Theorem. [43, Theorem 1.1] Let q L p (R ) 1 <p< be such that there exists a real-valued L 1 (R ) with q = ;1= 1=, (x) c> and r L p (R ). Then for any k C n there is a unique solution (x k) of with ( k) ; 1 L ~p \ L 1. Moreover, ; 1 W 1 ~p and for s 1 and k suciently large. (;+q)e ikx (x k) = (4) k( k) ; 1k W s ~p cjkj s;1 kqk L p (5) Here e ikx = exp(i(k 1 + ik )(x 1 + ix )) and ~p is dened by 1=~p = 1=p ; 1=. The Sobolev space W 1 ~p is dened by W 1 ~p (R )=ff L ~p (R ) i f L ~p (R ) i =1 g and the space W s ~p is the interpolation space between L ~p and W 1 ~p [4]. Note that the condition ; 1 W 1 ~p combined with Sobolev imbedding theorem means that ; 1 is continuous and tends to zero asymptotically when jkj! 1. Furthermore, since 1, we see that the solutions (x k) :=e ikx (x k) e ikx have somesortof exponential behaviour. Perhaps the most important content of Theorem. is the existence of the Faddeev solutions for all nonzero k since this was known only for large jkj from [5]. We dene the non-physical scattering transform for all k 6= by t(k) := e k (x)(x k)q(x)dx (6) R where e k (x) = exp(i(kx + kx)). Note that because is asymptotically near to one, t(k) resembles the Fourier transform of q(x)evaluated at the point(;k 1 k ) R, for large jkj. We will take a closer look at the construction of the functions in section 3. and prove that they are smooth in x.

13 Electrical Impedance Tomography and Faddeev Green's Functions 13.. From to t First we want to nd a relation between the Dirichlet-to-Neumann maps of the original conductivity problem and the Schrodinger problem described above. It turns out that the maps coincide. Note that zero is not a Dirichlet eigenvalue of the operator ;+q, that is, there are no nontrivial solutions ~u of () with vanishing trace. This is evident because for any such ~u the function ;1= ~u would be a nonvanishing solution with trace zero of the conductivity equation, which is a contradiction to the unique solvability of the Dirichlet problem (1). Thus we can dene the Dirichlet-to-Neumann map q : H 1= (@)! H ;1= (@) for equation () by hg q fi = rv r~u + qv~u (7) where ~u H 1 () is the weak solution of () with Dirichlet data = f and v is any H 1 () function with trace g. Furthermore, ;1= u @ since Thus q =, so our task is to nd the scattering transform out of q. Dene a single-layer operator S k for k C n by (S k )(x) G k (x ; y)(y)d(y) (8) where the function G k (x)isfaddeev's exponential fundamental solution for ;. We will discuss this function in detail in section Denote the Dirichlet-to-Neumann map of the zero potential (corresponding to homogeneous conductivity 1) in by. We have Theorem.3 [43, Theorem 5] Let be a bounded Lipschitz domain in R and let q L p () for some p > 1. Assume is not a Dirichlet eigenvalue of ; +q in and denote (x k) = e ikx (x k) with given by Theorem.. Then, for any k C n : (i) S k ( q ; ) is a compact operator: H 1= (@)! H 1= (@) (ii) The trace of the function ( k) satises the integral equation ( = e ikx ; S k ( q ; ) ( k) (9) (iii) I +S k ( q ; ) is invertible on H 1= (@) if and only if the Schrodinger problem (4) has a solution (here q is extended to be zero outside )

14 14 Samuli Siltanen (iv) If ( has been determined, then t(k) can be recovered from the formula t(k) e i kx ( q ; ) ( k)d: (1) Clearly the numerical realization of Theorem.3 is an important application for the Faddeev Green's function algorithm developed in section 3.1. Moreover, the possibility to compute t(k) numerically from known presented in section 4. is vital in testing any algorithm for Theorem From t to The non-physical scattering transform (6) contains enough information to recover. Namely, Theorem.1 of [43] shows that k (x k) = 4k t(k)e ;k(x)(x k) k 6= (11) where e k (x) = exp(i(kx+ kx)), holds (with respect to the variable k) intheweighted Sobolev space W 1 ~p ; = fhi; f W 1 ~p g > =~p where 1=~p =1=p ; 1= andhi =(1+jj ) 1=. By Theorem 4.1 of [43] the solution of (11) is given by (x k) =1; 1 () for all x R k C nfg. Taking formally k to zero in (4) yields t(k ) R (k ; k) k e ;x(k )(x k )dk1dk (1) (;+q)(x ) = (;+ 1= )(x ) = 1= which suggests that lim k! (x k) =(x ) = p (x) because of the uniqueness in Theorem. and the fact that ; 1inL ~p \ L 1. Section 3 of [43] is devoted to the proof that this indeed is the case. Thus we can recover the conductivity by taking k to zero in (1): 1= (x) =lim k! (x k) =1; 1 4 C t(k) jkj e ;x(k)(x k)dk: (13) Note that to evaluate the last expression, (x k) is needed for all values of k C n. An application of the numerical methods presented in Chapter 4 is to compute and consequently t for known conductivities. This way a computational realization of this step can be tested.

15 Electrical Impedance Tomography and Faddeev Green's Functions Conditional stability G. Alessandrini showed in [] an example demonstrating the ill-posedness of the inverse conductivity problem: let be the unit disc in R and dene two conductivities r L 1 () by 1 and s for jxj r r (x) = 1forr<jxj 1 where <s<1 and <r<1. By explicitly calculating the Dirichlet-to-Neumann map for both conductivities he showed that k r ; k H 1= (@)!H ;1= (@) j1 ; sjr! r! while k ; r k L 1 () = j1 ; sj is independent of r. It follows that there can be no continuous real function with f() = and an inequality oftype k ; r k L 1 () f(k r ; k H 1= (@)!H ;1= (@)) (14) ensuring that a small error in measured data leads to small L 1 error in the reconstruction. From the practical point of view the above seems devastating. However, it is possible to derive stability estimates of the form (14) if there is a priori knowledge about the conductivity. This is in general a reasonable assumption because in medical EIT there is a lot of knowledge about the type of conductivity changes inside the patient. There is a stability analysis available for the reconstruction method at hand: the work of Nachman and Liu [43, 4] shows that Theorem.4 [4, Theorem 1] Let 1 satisfy the a priori assumptions k j k W p () M for some xed 1 < p < and j (x) 1=M in j = 1. If we have j j =@ =, then The function! is such that k r ; k L 1 () C M!(k r ; k H 1= (@)!H ;1= (@)): (15)!(") jlog "j ; (16) for every <<=p and suciently small " the constant C M depends only on M p and. It is interesting to note that, roughly speaking, the inversion step from to t(k) has logarithmic stability and the step from t(k) to has linear stability.

16 16 Samuli Siltanen.5. Practical aspects Nachman's conductivities are continuous, and so are the ones considered by Brown and Uhlmann [7]. In practice the interesting conductivities (inner organs of a person) are discontinuous, and it not clear how numerical realizations of these reconstruction methods will perform with data corresponding to conductivities with jumps. In Nachman's approach the boundary data is the Dirichlet-to-Neumann map, which cannot be measured practically in a stable way. Its smoothing inverse operator R, the Neumann-to-Dirichlet map, is the one that has to be used in physical experiments. From this map, can be computed after the measurements since the two are inverse maps to each other. It is easier to recover details of located near the In fact, as pointed out in [18] and the references therein, the contribution of conductivity details to the boundary measurements gets exponentially smaller as the distance from the boundary increases. This is one reason why exponentially growing solutions are needed in the reconstruction. However, in EIT measurements it is for safety reasons impossible to use arbitrary large electric currents, so the boundary values of the exponentially growing solutions have to be approximated. This process is numerically unstable for large jkj. The computational cost of Nachman's reconstruction will be great. This is a consequence of the four-dimensional nature of the method: both the x- and k- variables range in a D grid. It may not be a possible choice for a real-time EIT application, but in any case it provides a reliable initial choice for a faster iterative approach. 3. Theoretical observations The purpose of this chapter is to derive theoretical results that help the realization of Nachman's reconstruction scheme. Our goal is to answer such practical questions as How to compute eciently and accurately point values of Faddeev Green's functions G k and g k? Finding the functions from equation involves solving a weakly singular integral equation with t(k) appearing in the kernel. How singular is the kernel at k =? How much error does the truncation of the integral introduce? In other words, what is the exact rate of decay of jt(k)j when jkj grows? How much can we deduce qualitative information about from symmetries of t(k)?

17 Electrical Impedance Tomography and Faddeev Green's Functions 17 Section 3.1 is an analysis of the Faddeev Green's functions g k and G k. There are more results than needed in this work we believe that they are valuable for the eld of inverse problems in D electrical prospection or nonlinear evolution equations of Novikov-Veselov type [58, 53]. In section 3. we derive both quantitative and qualitative facts concerning t(k) and (x k) Faddeev Green's functions The two fundamental solutions g k (x)andg k (x) originally introduced byfaddeev [15] are in the core of Nachman's reconstruction procedure. In this section we dene and analyse these functions and use the results later in both analytical and numerical considerations. In this work we deal with functions g k (x) and G k (x) dened on R. Similar results on their three-dimensional analogues can be found in [44] Denitions and basic properties Dene the function g k (x) for all x R and k C n by the formula g k (x) = 1 () R e ix ( d (17) +k) where x = x 1 1 +x in the exponent and in the denominator we have = 1 +i and complex multiplication. The function g k (x) is a fundamental solution for the operator L k = ; ; 4ik@ = ; ; 4ik 1 + ) that is, L k g k (x) =(x): (19) This can be seen by noting that the Fourier symbol of L k is cl k () =jj +k( 1 + i )=( +k) and formula (17) is essentially the inverse Fourier transform of 1=c Lk understood in the sense of tempered distributions: g k (x) =F ;1 (( +k)) ;1 : In Nachman's reconstruction scheme the function g k is a key object. It is used to nd the exponentially behaving solutions (x k) =e ikx (x k)mentioned in Chapter we will discuss this construction in sections 3. and 4.. Another important application for g k (x) is going from the boundary measurements to the nonphysical scattering transform t(k) see Theorem.3 for details. The function G k (x) needed for this is dened for all x R and k C n by G k (x) :=e ikx g k (x): ()

18 18 Samuli Siltanen Note that we used again the complex notation kx = (k 1 + ik )(x 1 + ix ) so that the modulus of the exponential multiplier is not necessarily one. Given this way, G k will be a fundamental solution for the negative Laplacian: ;G k (x) ikx g k (x) =;4@e (x) =e ikx (; ; k (x) =(x) (1) where we used (19) and the fact ikx = since e ikx is complex analytic in x = x 1 + ix. To compare the Faddeev fundamental solution with the regular one, let G the standard fundamental solution for ;: G (x) =; 1 log jxj and denote the dierence between the two by H k (x) :=G k (x) ; G (x) k C n : () Now H k is a harmonic distribution since H k = ; + =,andby Weyl's lemma we know that H k (x) is a smooth, harmonic function in the whole plane. This helps us understand the behaviour of G k and g k at the origin: both have a logarithmic singularity there. This follows from equation () and the identity g k (x) =e ;ikx H k (x) ; e;ikx log jxj (3) respectively. For convenience, we collect our observations about H k together as a lemma. Lemma 3.1 Let x R and k C n. Then the function H k (x) given in R n by () is smooth and harmonic at every point x R. In section we will compute H k (). Change of variables in the dening integral (17) shows that the Faddeev fundamental solution g k has several symmetries: Theorem 3. Let x R n and k C n. The Faddeev Green's function g k given by (17) has the properties where e k (x) = exp(i(kx + kx)). g k (x) = g 1 (kx) (4) g k (x) = g k(;x) (5) g k (x) = e ;k (x)g k (x) (6)

19 Electrical Impedance Tomography and Faddeev Green's Functions 19 This together with the computation H k (x) =e ikx g 1 (kx)+ 1 1 log jkjjxj; log jkj = H 1(kx) ; 1 log jkj shows that we can restrict our attention to the functions g 1 G 1 and H 1 : G k (x) = G 1 (kx) (7) H k (x) = H 1 (kx) ; 1 log jkj: (8) The functions G k (x) and H k (x) are real-valued for all k C n. This is seen by computing G k (x) =e ;i kx g k (x) =e ;i kx e k (x)g k (x) =e ikx g k (x) =G k (x): 3.1. Derivatives In this section we will derive explicit formulas for the rst-order partial derivatives of g k (x): Theorem 3.3 Let x R n k C n and dene the function g k (x) by (17). The rst order partial derivatives of g k (x) are given by where e ;k (x) =exp(;i(kx + k (x) = ; 1 4x ; e ;k(x) 4x ; ikg k(x) k 1 (x) 4ix ; e ;k(x) 4ix + kg k(x) (3) Before the proof we need a couple of lemmas. Lemma 3.4 We have F ;1 i = 1 x and F ;1 i = 1 x (31) where x = x 1 + ix and the inverse Fourier transforms are taken in the sense of tempered distributions. Proof. We will prove the rst of the identities in (31). The second one follows from this by taking complex conjugates. Denote h(x) :=F ;1 i = F ;1 i( 1 + i ) and note that the properties of the Fourier transform imply that h is a tempered distribution =. On the other hand, it is well-known [5, Chapter III] that f(x) :=1=x is a fundamental solution for the that =. (3)

20 Samuli Siltanen Our calculations show that h(x) =f(x)+u(x), where u = h ; f = ; =: (33) By elliptic regularity we know that u is dierentiable and so (33) implies that u is an entire function. On the Fourier transform side (33) takes the form i ( 1 + i )^u = (34) which implies that ^u is supported in the origin, so u(x) is a polynomial of x 1 and x. Lemma in [5] states that if u S(R ) is homogeneous of degree ;1, then the Fourier transform ^u is also homogeneous of degree ;1. This is the case for f(x) and cannot be true for the sum of f and a nonzero polynomial so u and the proof is complete. Q.E.D. Lemma 3.5 Let x R n and dene the function g 1 by (17). We 1 (x) = ; e;ix 1 4x 1 (x) = ; 1 4x ; ig 1(x) (36) g 1 (x) = ie;ix 1 Proof. We start with 1 (x). Compute c@g 1 = x : (37) i= ( +) = i ( +) and use Lemma 3.4 and the translation property of the Fourier transform to 1 (x) = i F 1 )=;e;i( )x ;1 ( F ;1 + 4 i = 1 ;e;ix 4x (38) which is (35). The Laplacian of g 1 is now easily computed with aid of (38) and the fact that x ;1 is antiholomorphic at x 6= : g 1 (x) 1 (x) =;4@ e;i(x+x) 4x and identity (37)is proved. = ; e;ix = ie;ix1 x

21 Electrical Impedance Tomography and Faddeev Green's Functions 1 To 1 (x) atx 6=,take complex conjugate of equation (19) and apply equation (6) of Theorem 3. to get =;g 1 (x)+4i@g 1 (x) = ieix 1 x ; 4eix 1 g 1 (x)+4ie ix 1 (x): Now we can solve 1 and the claim follows. Q.E.D. Proof. (Theorem 3.3) We start with the special case k = 1. Then by Lemma 1 (x) 1 (x) =; 1 1 4x ; e;ix1 4x ; ig 1 (x) 1 (x) = 1 4ix ; e;ix1 4ix + g 1(x): Now the claim follows from g k (x) =g 1 (kx) and the chain rule. Q.E.D Representation formulas We use residue calculus to nd formulas similar to [5, formula (3.1)]. Theorem 3.6 Let x =(x 1 x ) R n with x 1 >. Then g 1 (x) is given by g 1 (x) = e;ix 1 1 Re e ix e ;t(x 1+ix ) 1 dt : (39) t ; i Formula (39) combined with a Laplace transform identity gives another representation of g k : Corollary 3.7 Let x R n x 1 >. Then g 1 (x) is given by g 1 (x) = e;ix 1 1 x 1 s cos s + x sin s ds: (4) s + x Proof. (Theorem 3.6) Write formally () g 1 (x) = 1 1 ;1 = e ;ix 1 ;1 1 ;1 To evaluate the inner integral note that f(z) = e i(x 1 1 +x ) ( 1 +1) +( + i) d 1d 1 e ix e ix 1t t +( + i) dt d : ;1 e ix 1z z +( + i) = e ix1z (z ; z )(z + z ) where z = ;1+i, is a meromorphic complex function. Dene for all R> the path ;(R) =[;R R] [fre i' : ' g with positive orientation. Observe that

22 Samuli Siltanen x 1 > implies the exponential decay of f(z) in the domain Im (z) >. Compute for > and large R i Res z=z f(z) = ;(R) Taking the limit R!1we see that 1 ;1 f(z)dz = R ;R e ix 1t dt + O(1=R): t +( + i) e ix 1t eix1(;1+i) dt =i t +( + i) (;+i ) = e;ix1;x1 + i In a similar fashion we obtain Thus for x 1 > 1 ;1 () g 1 (x) = e ;ix 1 = e ;ix 1 e ix 1t dt = ;eix1+x1 t +( + i) + i ; e ix 1 = e ;ix 1 Re e ix +ix 1 +x 1 + i ;1 1 e ;ix ;x 1 e ix 1 1 d + < : d + e ;ix 1 ; i e ;ix ;x 1 d ; i > : 1 e ix ;ix 1 ;x 1 1 d + i e ix ;x 1 d + i and the claim follows. Q.E.D. Proof. (Corollary 3.7) Notice that the Laplace transform of the constant function 1is1=z for Re (z) >, i.e. Using this we can compute z = e ;zw dw Re (z) > : e ;xt 1 1 t ; i dt = e iw e ;t(x 1+ix +w) dtdw = 1 e iw x 1 + ix + w dw: Substitution to formula (39) and a change of coordinates s = x 1 + w yield 1 e ix 1 e i(x 1+w) 1 g 1 (x) =Re ix +(x 1 + w) dw e is =Re ix + s ds = x 1 = 1 x 1 Re [(s ; ix )e is ] s + x ds = e;ix 1 1 x 1 s cos s + x sin s ds: s + x Q.E.D.

23 Electrical Impedance Tomography and Faddeev Green's Functions Estimates We start with a simple estimate for jg k (x)j which is a straightforward consequence of Theorem 3.6. Theorem 3.8 Let x R n and k C n. Then jg k (x)j 1 jkjjxj : (41) Combining this result with Theorem 3.3 yields immediately Corollary 3.9 Let k C n. For x R satisfying jxj 1 and an arbitrary multi-index we have j@ C( k) g k (x)j : jxj (4) The integral formula (17) is formal because the integrand belongs neither to L 1 (R ) nor L (R ). Using the Riesz-Thorin interpolation theorem, however, the inverse Fourier transform can be understood as an interpolated operator from L to L for 1 < <, << 1 and 1= +1= = 1. Since the integrand in (17) belongs to L, we see that g k L : Theorem 3.1 Let k C n and <<1. The Faddeev Green's function given by (17) satises the estimate where 1= +1= =1. kg k k L jkj;= ; = ; (43) We now turn to the proofs. Proof. (Theorem 3.8) Because g k (x) =g 1 (kx) forany k C n, it is enough to prove jg 1 (x)j 1 jxj x R n : (44) Let x 1 >. From formula (39) we see at once that jg 1 (x)j 1 1 e ;x 1t jt ; ij dt 1 1 e ;x 1t dt = 1 x 1 : To prove a similar estimate in terms of jx j we divide the consideration to the cases x > and x <. Let x >. The complex function f(z) = e ;ix z;x 1 z (z ; i) ;1 is analytic for z C n i and decays exponentially in the quadrant Re(z) > Im(z) <. Dene for any R>thepath ;(R) =[ ;ir] [fre i' : ;= ' g[[r ]:

24 4 Samuli Siltanen Then we have 1 This yields as before jg 1 (x)j 1 e ;ix t;x 1 t t ; i 1 dt = 1 e ;x s+ix 1 s ds: s +1 e ;x s ds = 1 x x > : (45) Let x <. In this case f(z) decays exponentially in the quadrant Re(z) > Im(z) >. Dene for any R>thepath Then we have 1 ;(R) =[ R] [fre i' : ' =4g[e i=4 [R ]: e ;ix t;x 1 t 1 dt =(1+i) t ; i and so, since js + is ; ij 1= p for all s>, jg 1 (x)j 1 1 p e s(x ;x 1 ) js + is ; ij ds e ;is(x +x 1 )+s(x ;x 1 ) 1 s + is ; i e s(x ;x 1) ds Now for points x satisfying x 1 > andjx jx 1 we have jg 1 (x)j 1 p x 1 jxj 1 jxj ds 1 p jx j : since jxj= p x 1 in this domain. For points satisfying x 1 > and jx j > x 1 we have by a similar argument jg 1 (x)j 1 p jx j 1 jxj : We have thus shown that the desired estimate holds for all (x 1 x ) satisfying x 1 >. By continuityofg 1 outside the origin and the particular case g 1 (;x 1 x )=g 1 (x 1 x ) of formula (5) we see that the estimate (44) is valid at all x 6=. Q.E.D. Proof. (Theorem 3.1) Note that kg k k L = kg jkj k L. Furthermore, by (4) we have R kg jkj k L = jg 1 (jkjx)j dx = jkj ; jg 1 (x)j dx = jkj ; kg 1 k L R and thus it is enough to prove the claim for g 1. By the Riesz-Thorin interpolation theorem we have acontinuous operator F ;1 : L! L kf ;1 k L!L 1=(): (46)

25 Electrical Impedance Tomography and Faddeev Green's Functions 5 Since <<1 we have 1 < <. We will nd a bound for the L norm of ^g 1 as follows: d k^g 1 k L =( + ) : (47) jj j +j jj>4 To estimate the rst integral in (47) note that in the domain of integration we have j + j (jj;) (jj;jj=) = jj=: Thus jj>4 d jj j +j For the second integral in (47) compute jj4 1 1 d jj j +j jj4 1 4 jj4 j+j>1 r 1; dr < d d + jj j+j1 j +j ; 1 : (48) 4 1 ( r 1; dr + r 1; dr) =( 4; ; + 1 ; ) < 1 ; : (49) Combining (48) and (49) with (46) yields the claim. Q.E.D An asymptotic expansion Integrating by parts in formula (39) yields for g 1 an asymptotic expansion with error estimate. This is especially suitable for numerical purposes indeed, we will take Theorem 3.11, below, as the starting point for the numerical algorithm for g k (x) developed in section Theorem 3.11 Let x = x 1 + ix R n x 1 >. For any integer N we have " # g 1 (x) = e;ix 1 NX Re ;e ix j! 1 + E N (x) (5) (ix) j+1 j= where the remainder E N (x) is given by E N (x) = e;ix 1 Re (N + 1)!e ix1 (;x) N +1 1 e ;tx (t ; i) dt N + (51) and satises the estimate je N (x)j (N + 1)!(N +1)= jxj N + : (5) Since g 1 (;x 1 x )=g 1 (x 1 x ) similar formulas hold for x 1 <.

26 6 Samuli Siltanen Proof. We claim that for any N 1 e ;xt t ; i dt = ; N X j= j! (N +1)! 1 + j+1 (ix) (;x) N +1 e ;xt dt: (53) (t ; i) N + We give an induction proof keeping carefully track of the signs. First we consider the case N =: 1 e ;xt t ; i dt = e ;xt 1 1 ;e ;xt ; (;x)(t ; i) (;x)(t ; i) dt = ; 1 ix ; 1 1 e ;xt x (t ; i) dt: Now we make the induction assumption: let the claim hold for all integers smaller or equal to M. Then the claim for M + 1 follows from ; MX j= 1 e ;xt X M t ; i dt = ; j= (;x) M +1 j! (M + 1)! + j+1 (ix) M +1 X ; j= j! (M + 1)! 1 + j+1 (ix) (;x) M +1 e ;xt (;x)(t ; i) M + 1 ; j! (M + )! 1 + j+1 (ix) (;x) M + e ;xt dt = (t ; i) M + (M + 1)! 1 ;(M +)e ;xt dt = (;x) M +1 (;x)(t ; i) M +3 e ;xt dt: (t ; i) M +3 We have thus established formulas (5) and (51). The error estimate follows similarly to the proof of Theorem 3.8. The choices of integration paths in the complex plane are the same, but this time we need the estimate js + is ; ij N + (1= p ) N + for all s>. Q.E.D Determining H k () Lemma 3.1 Let k C n. Then the value of the function H k (x) at the origin is where : is Euler's constant. H k () = ; ; 1 log jkj (54) Proof. Lemma 3.4 in [43] states that for any ", < "<1, there is a constant C " such that for all < jkj 1= there is an inequality jg k (x) + (log jkj + )= ; G (x)j C " jkj " hxi " (55) where hxi = (1 + jxj ) 1=. Fix now any x R n and let k C n be arbitrary. Then formula (4) gives H 1 (kx) =e ikx g k (x)+ 1 log jkjjxj =

27 Electrical Impedance Tomography and Faddeev Green's Functions 7 = e ikx (g k (x) + (log jkj + )= log jxj)+ (1 ; eikx )logjkjjxj; e ikx : (56) Choose now any sequence fk j g 1 j= of nonzero complex numbers converging to zero. Note that e ikx ; 1=O(jkxj) for kx! and that lim r!+ r log r =,so lim (1 ; j!1 eik jx )logjk j jjxj =: Then estimate (55) together with (56) imply H 1 () = lim j!1 H 1 (k j x)=; and the claim is proved for H 1. The general result follows from (8) combined with the continuity of H k (x) with respect to x. Q.E.D. Recall from Chapter the denition 3.. The scattering transform t(k) := e k (x)(x k)q(x)dx k C n (57) R of the non-physical scattering transform. Here the functions are the unique solutions of (;+q)e ikx (x k) = xr, satisfying ( k) ; 1 W 1 ~p (see Theorem.). The function t(k) isthekey intermediate object of the inversion procedure. We want to understand how the non-physical scattering transform represents the corresponding conductivity. It turns out that t(k) resembles closely the Fourier transform of q = ;1= 1= evaluated at (;k 1 k ) R. Roughly speaking, we can expect this since the exponential in (57) can be written in the form exp(;i(;k 1 k ) x) and the functions ( k)areclose to 1 asymptotically. That t(k) actually diers from the Fourier transform of q is evident from the fact that the map q 7! t(k) is nonlinear and 6 1ifq6. The results of this section are aimed to make these speculations more precise and prove such properties of t(k) that are important from the point of view of numerical work. The proof of Theorem 4 in [43] implies that t(k) iscontinuous outside the origin. We need additional information about its behaviour for both large and small jkj for solving equation (1) numerically. In Section 3..1 we present quantitative information about the dierence between t(k) and ^q which leads to an estimate of type jt(k)j Cjkj ;m for large jkj. This is a consequence of the smoothness of. In section 3.. we sharpen results of [43] to get the estimate jt(k)j Cjkj 1+" for any <"<1andjkj small. Thus when solving (1) numerically we don't have to deal with singularities at the origin also writing formula (13) in polar coordinates yields an integrand vanishing at jkj =. In Section 3..3 we see that symmetries of manifest themselves in the shape of t(k) almost as in the Fourier transform of q:

28 8 Samuli Siltanen if is rotationally symmetric, so is t(k) if is preserved in a reection, roughly the same is true for t(k). Two further properties of Fourier transform carry over to t(k): for any > the non-physical scattering transform corresponding to the scaled conductivity (x) ist(k=) translating results in multiplication of t(k) by an exponential function of modulus one. For a more precise statement see Theorem These results are valuable in numerical work for several reasons: given we have a priori knowledge about properties of t(k) and vice versa. This is important for both the forward and the inverse problem. On the other hand, it is possible to produce several examples of pairs ( t) out of one initial example this is useful for testing inversion algorithms Large jkj estimates Theorem 3.13 Let R be a bounded, simply connected C 1 domain. Let C m+ (R ) m 1 have a positive lower bound and satisfy ; 1 C m+ (). Dene q = ;1= 1= and let t(k) be given by (57). Then there is such a constant C = C(m jj kqk C m ) that jt(k)j Cjkj ;m for large jkj: (58) The rest of this section is devoted to the proof of Theorem Let us recall the construction of the functions appearing in (57). k C n and 1 <p<we want to nd a solution of For any (; ; + q)(x k) = x R (59) satisfying ( k) ; 1 W 1 ~p, where 1=~p = 1=p ; 1=. This is done in the spirit of classical scattering theory: we think of = i + s as a sum of an \incoming wave" i 1 and a \scattered wave" satisfying s W 1 ~p, an analogue of the Sommerfeld radiation condition. We will nd as the solution of the Lippmann-Schwinger type equation ; 1= s = ;g k (q): (6) Applying ; ; to (6) and recalling (19) shows that a solution of (6) solves (59), too. To solve (6), note that the operator I + g k (q ):W 1 ~p! W 1 ~p

29 Electrical Impedance Tomography and Faddeev Green's Functions 9 is Fredholm of index zero and injective [43, Theorem 1.1 and Lemma 1.5], thus invertible for every k C n. Furthermore, by Lemma 1.3 of [43] the function g k q W 1 ~p and we can dene ( k)=1; [I + g k (q )] ;1 (g k q): (61) Applying now I + g k (q ) to both sides of (61) yields (6). Since our potential is innitely smooth, we are able to prove stronger estimates with a simpler proof. For this we need a bound for the norm of the operator I + g k (q ) acting on the Sobolev spaces W m ~p for m 1. Denition 3.14 Let D R be a domain, m an integer and 1 r<1: The Sobolev space W m r (D) consists of distributions having all partial derivatives of order less or equal to m in L r (D). We X will use the norm kuk W m r (D) = k@ uk L r (D) : (6) jjm The Banach space L(W m r (D)) is normed with the operator norm induced by (6). Theorem 3.15 Let R be a bounded, simply connected C 1 domain. Let C 1 (R ) have a positive lower bound and satisfy ; 1 C 1 (). Dene q = ;1= 1= and Faddeev Green's function g k by (17), and let 1 <p<. Fix a k C n and let (x k) be the unique solution of (; ; + q)(x k) = x R ; 1 W 1 ~p : Then ; 1 W m ~p for all m 1. Furthermore, satises k( k) ; 1k W m ~p jkj ;=~p kqk W m 1 for large jkj: (63) Proof. We start by checking the invertibility of the operator I + g k (q ):W m ~p! W m ~p : (64) By [43, Theorem 1.1] we know that this holds for m = 1, and in particular we have injectivity W m ~p! W 1 ~p. The inequalities of Young and Holder imply for any multi-indices with jj + j j = j m kg k ((@ q)(@ f))k L ~p kg k k L ~pk(@ q)(@ f)k L 1 kg k k L ~pk@ qk L ~pk@ fk L ~p kg k k L ~pkqk W m ~pkfk W m ~p (65) so Theorem 3.1 shows that the restriction of I +g k (q )tow m ~p has W m ~p as target space. Thus it is enough to prove that g k (q ) is compact and invertibility of (64) follows by a Fredholm argument. Compactness is evident from the decomposition W m ~p ;! C m;1 q ;! W m;1 p g k ;! W m ~p

30 3 Samuli Siltanen where we used the Sobolev imbedding theorem and Lemma 1.3 of [43]. To prove (63) we estimate rst the operator norm of [I + g k (q )] ;1. Applying Theorem 3.1 to (65) gives kg k (q )k W m ~p!w m ~p Ckg kk L ~pkqk W m ~p Cjkj ;=~p kqk W m ~p: Thus k[i + g k (q )] ;1 k W m ~p!w m ~p for large jkj: (66) An application of X Young's inequality and Theorem 3.1 once more gives X kg k qk W m ~p = kg k (@ q)k L ~p kg k k L ~p k@ qk L 1 = Cjkj ;=~p kqk W m 1: (67) jjm jjm Substituting (66) and (67) to (61) yields the claim. Q.E.D. Proof. (Theorem 3.13) Let m 1 be arbitrary. It is enough to derive for large jkj = jk 1 + ik j an estimate of type Integration by parts gives k 1 jk m j t(k)j C = C (m jj kqk C m ) j =1 : (68) R e k (x) (x)dx = i R e 1 (x)dx C 1 (R ) and for k the same with aminus sign. Write q = q( ; 1) + q to get jkj m t(k)j ;m q(x) m jdx + ;m j m (((x k) ; 1)q(x))jdx: (69) j We can bound the rst term by jj sup m q(x) x. An application of m j 3.15 shows that for large enough jkj the integral in the second term of (69) is bounded by mx ((x k) ; 1)k L = m; q(x)k L ~p j Ck( k) ; 1k W m ~pkqk W m ~p Ckqk W m 1kqk W m ~p: (7) Estimating the absolute values of derivatives of q by supremums and xing a p satisfying 1 <p< in (7) yields the claim. Q.E.D. A digression. We remark that it is possible to follow a path nearer to Nachman's original proof. Namely, we can formally write using the resolvent identity g k f =(; ; ;1 f = ; 1 4 (@ + ;1 f = ; 1 4ik (I ; (@ ;1 f: Suppose we had an explicit estimate of type k@ ;1 fk L ~p A p kfk L p (71)

Reconstructing conductivities with boundary corrected D-bar method

Reconstructing conductivities with boundary corrected D-bar method Reconstructing conductivities with boundary corrected D-bar method Janne Tamminen June 24, 2011 Short introduction to EIT The Boundary correction procedure The D-bar method Simulation of measurement data,

More information

Proceedings of the 5th International Conference on Inverse Problems in Engineering: Theory and Practice, Cambridge, UK, 11-15th July 2005

Proceedings of the 5th International Conference on Inverse Problems in Engineering: Theory and Practice, Cambridge, UK, 11-15th July 2005 Proceedings of the 5th International Conference on Inverse Problems in Engineering: Theory and Practice, Cambridge, UK, 11-15th July 2005 SOME INVERSE SCATTERING PROBLEMS FOR TWO-DIMENSIONAL SCHRÖDINGER

More information

Complex geometrical optics solutions for Lipschitz conductivities

Complex geometrical optics solutions for Lipschitz conductivities Rev. Mat. Iberoamericana 19 (2003), 57 72 Complex geometrical optics solutions for Lipschitz conductivities Lassi Päivärinta, Alexander Panchenko and Gunther Uhlmann Abstract We prove the existence of

More information

Contributors and Resources

Contributors and Resources for Introduction to Numerical Methods for d-bar Problems Jennifer Mueller, presented by Andreas Stahel Colorado State University Bern University of Applied Sciences, Switzerland Lexington, Kentucky, May

More information

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................

More information

Calderón s inverse problem in 2D Electrical Impedance Tomography

Calderón s inverse problem in 2D Electrical Impedance Tomography Calderón s inverse problem in 2D Electrical Impedance Tomography Kari Astala (University of Helsinki) Joint work with: Matti Lassas, Lassi Päivärinta, Samuli Siltanen, Jennifer Mueller and Alan Perämäki

More information

f(z)dz = 0. P dx + Qdy = D u dx v dy + i u dy + v dx. dxdy + i x = v

f(z)dz = 0. P dx + Qdy = D u dx v dy + i u dy + v dx. dxdy + i x = v MA525 ON CAUCHY'S THEOREM AND GREEN'S THEOREM DAVID DRASIN (EDITED BY JOSIAH YODER) 1. Introduction No doubt the most important result in this course is Cauchy's theorem. Every critical theorem in the

More information

Stability and instability in inverse problems

Stability and instability in inverse problems Stability and instability in inverse problems Mikhail I. Isaev supervisor: Roman G. Novikov Centre de Mathématiques Appliquées, École Polytechnique November 27, 2013. Plan of the presentation The Gel fand

More information

A CALDERÓN PROBLEM WITH FREQUENCY-DIFFERENTIAL DATA IN DISPERSIVE MEDIA. has a unique solution. The Dirichlet-to-Neumann map

A CALDERÓN PROBLEM WITH FREQUENCY-DIFFERENTIAL DATA IN DISPERSIVE MEDIA. has a unique solution. The Dirichlet-to-Neumann map A CALDERÓN PROBLEM WITH FREQUENCY-DIFFERENTIAL DATA IN DISPERSIVE MEDIA SUNGWHAN KIM AND ALEXANDRU TAMASAN ABSTRACT. We consider the problem of identifying a complex valued coefficient γ(x, ω) in the conductivity

More information

What are inverse problems?

What are inverse problems? What are inverse problems? 6th Forum of Polish Mathematicians Warsaw University of Technology Joonas Ilmavirta University of Jyväskylä 8 September 2015 Joonas Ilmavirta (Jyväskylä) Inverse problems 8 September

More information

Short note on compact operators - Monday 24 th March, Sylvester Eriksson-Bique

Short note on compact operators - Monday 24 th March, Sylvester Eriksson-Bique Short note on compact operators - Monday 24 th March, 2014 Sylvester Eriksson-Bique 1 Introduction In this note I will give a short outline about the structure theory of compact operators. I restrict attention

More information

r( = f 2 L 2 (1.2) iku)! 0 as r!1: (1.3) It was shown in book [7] that if f is assumed to be the restriction of a function in C

r(  = f 2 L 2 (1.2) iku)! 0 as r!1: (1.3) It was shown in book [7] that if f is assumed to be the restriction of a function in C Inverse Obstacle Problem: Local Uniqueness for Rougher Obstacles and the Identication of A Ball Changmei Liu Department of Mathematics University of North Carolina Chapel Hill, NC 27599 December, 1995

More information

Garrett: `Bernstein's analytic continuation of complex powers' 2 Let f be a polynomial in x 1 ; : : : ; x n with real coecients. For complex s, let f

Garrett: `Bernstein's analytic continuation of complex powers' 2 Let f be a polynomial in x 1 ; : : : ; x n with real coecients. For complex s, let f 1 Bernstein's analytic continuation of complex powers c1995, Paul Garrett, garrettmath.umn.edu version January 27, 1998 Analytic continuation of distributions Statement of the theorems on analytic continuation

More information

The WENO Method for Non-Equidistant Meshes

The WENO Method for Non-Equidistant Meshes The WENO Method for Non-Equidistant Meshes Philip Rupp September 11, 01, Berlin Contents 1 Introduction 1.1 Settings and Conditions...................... The WENO Schemes 4.1 The Interpolation Problem.....................

More information

On uniqueness in the inverse conductivity problem with local data

On uniqueness in the inverse conductivity problem with local data On uniqueness in the inverse conductivity problem with local data Victor Isakov June 21, 2006 1 Introduction The inverse condictivity problem with many boundary measurements consists of recovery of conductivity

More information

Put Paper Number Here

Put Paper Number Here Proceedings of Proceedings of icipe : rd International Conference on Inverse Problems in Engineering June,, Port Ludlow, WA, USA Put Paper Number Here NEW RECONSTRUCTION ALGORITHMS IN ELECTRICAL IMPEDANCE

More information

is the normal derivative of u at the boundary. In general, the exists as an element H?1=2 ; i = ru r

is the normal derivative of u at the boundary. In general, the exists as an element H?1=2  ; i = ru r UNIQUENESS IN THE INVERSE CONDUCTIVITY PROBLEM FOR NONSMOOTH CONDUCTIVITIES IN TWO DIMENSIONS Russell M. Brown Department of Mathematics University of Kentucky Lexington, KY 40506 Gunther Uhlmann Department

More information

The best expert versus the smartest algorithm

The best expert versus the smartest algorithm Theoretical Computer Science 34 004 361 380 www.elsevier.com/locate/tcs The best expert versus the smartest algorithm Peter Chen a, Guoli Ding b; a Department of Computer Science, Louisiana State University,

More information

Mapping Properties of the Nonlinear Fourier Transform in Dimension Two

Mapping Properties of the Nonlinear Fourier Transform in Dimension Two Communications in Partial Differential Equations, 3: 59 60, 007 Copyright Taylor & Francis Group, LLC ISSN 0360-530 print/53-433 online DOI: 0.080/036053005005304 Mapping Properties of the Nonlinear Fourier

More information

Scattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions

Scattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions Chapter 3 Scattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions 3.1 Scattered Data Interpolation with Polynomial Precision Sometimes the assumption on the

More information

. Consider the linear system dx= =! = " a b # x y! : (a) For what values of a and b do solutions oscillate (i.e., do both x(t) and y(t) pass through z

. Consider the linear system dx= =! =  a b # x y! : (a) For what values of a and b do solutions oscillate (i.e., do both x(t) and y(t) pass through z Preliminary Exam { 1999 Morning Part Instructions: No calculators or crib sheets are allowed. Do as many problems as you can. Justify your answers as much as you can but very briey. 1. For positive real

More information

AALBORG UNIVERSITY. A new direct method for reconstructing isotropic conductivities in the plane. Department of Mathematical Sciences.

AALBORG UNIVERSITY. A new direct method for reconstructing isotropic conductivities in the plane. Department of Mathematical Sciences. AALBORG UNIVERSITY A new direct method for reconstructing isotropic conductivities in the plane by Kim Knudsen January 23 R-23-1 Department of Mathematical Sciences Aalborg University Fredrik Bajers Vej

More information

2 Garrett: `A Good Spectral Theorem' 1. von Neumann algebras, density theorem The commutant of a subring S of a ring R is S 0 = fr 2 R : rs = sr; 8s 2

2 Garrett: `A Good Spectral Theorem' 1. von Neumann algebras, density theorem The commutant of a subring S of a ring R is S 0 = fr 2 R : rs = sr; 8s 2 1 A Good Spectral Theorem c1996, Paul Garrett, garrett@math.umn.edu version February 12, 1996 1 Measurable Hilbert bundles Measurable Banach bundles Direct integrals of Hilbert spaces Trivializing Hilbert

More information

2 Section 2 However, in order to apply the above idea, we will need to allow non standard intervals ('; ) in the proof. More precisely, ' and may gene

2 Section 2 However, in order to apply the above idea, we will need to allow non standard intervals ('; ) in the proof. More precisely, ' and may gene Introduction 1 A dierential intermediate value theorem by Joris van der Hoeven D pt. de Math matiques (B t. 425) Universit Paris-Sud 91405 Orsay Cedex France June 2000 Abstract Let T be the eld of grid-based

More information

MATH 220: INNER PRODUCT SPACES, SYMMETRIC OPERATORS, ORTHOGONALITY

MATH 220: INNER PRODUCT SPACES, SYMMETRIC OPERATORS, ORTHOGONALITY MATH 22: INNER PRODUCT SPACES, SYMMETRIC OPERATORS, ORTHOGONALITY When discussing separation of variables, we noted that at the last step we need to express the inhomogeneous initial or boundary data as

More information

Computational inversion based on complex geometrical optics solutions

Computational inversion based on complex geometrical optics solutions Computational inversion based on complex geometrical optics solutions Samuli Siltanen Department of Mathematics and Statistics University of Helsinki, Finland samuli.siltanen@helsinki.fi http://www.siltanen-research.net

More information

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )

More information

114 EUROPHYSICS LETTERS i) We put the question of the expansion over the set in connection with the Schrodinger operator under consideration (an accur

114 EUROPHYSICS LETTERS i) We put the question of the expansion over the set in connection with the Schrodinger operator under consideration (an accur EUROPHYSICS LETTERS 15 April 1998 Europhys. Lett., 42 (2), pp. 113-117 (1998) Schrodinger operator in an overfull set A. N. Gorban and I. V. Karlin( ) Computing Center RAS - Krasnoyars 660036, Russia (received

More information

Problem Set 9 Due: In class Tuesday, Nov. 27 Late papers will be accepted until 12:00 on Thursday (at the beginning of class).

Problem Set 9 Due: In class Tuesday, Nov. 27 Late papers will be accepted until 12:00 on Thursday (at the beginning of class). Math 3, Fall Jerry L. Kazdan Problem Set 9 Due In class Tuesday, Nov. 7 Late papers will be accepted until on Thursday (at the beginning of class).. Suppose that is an eigenvalue of an n n matrix A and

More information

A Finite Element Method for an Ill-Posed Problem. Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D Halle, Abstract

A Finite Element Method for an Ill-Posed Problem. Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D Halle, Abstract A Finite Element Method for an Ill-Posed Problem W. Lucht Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D-699 Halle, Germany Abstract For an ill-posed problem which has its origin

More information

Partial Differential Equations

Partial Differential Equations Part II Partial Differential Equations Year 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2015 Paper 4, Section II 29E Partial Differential Equations 72 (a) Show that the Cauchy problem for u(x,

More information

Abstract Minimal degree interpolation spaces with respect to a nite set of

Abstract Minimal degree interpolation spaces with respect to a nite set of Numerische Mathematik Manuscript-Nr. (will be inserted by hand later) Polynomial interpolation of minimal degree Thomas Sauer Mathematical Institute, University Erlangen{Nuremberg, Bismarckstr. 1 1, 90537

More information

October 7, :8 WSPC/WS-IJWMIP paper. Polynomial functions are renable

October 7, :8 WSPC/WS-IJWMIP paper. Polynomial functions are renable International Journal of Wavelets, Multiresolution and Information Processing c World Scientic Publishing Company Polynomial functions are renable Henning Thielemann Institut für Informatik Martin-Luther-Universität

More information

Spurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics

Spurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics UNIVERSITY OF CAMBRIDGE Numerical Analysis Reports Spurious Chaotic Solutions of Dierential Equations Sigitas Keras DAMTP 994/NA6 September 994 Department of Applied Mathematics and Theoretical Physics

More information

only nite eigenvalues. This is an extension of earlier results from [2]. Then we concentrate on the Riccati equation appearing in H 2 and linear quadr

only nite eigenvalues. This is an extension of earlier results from [2]. Then we concentrate on the Riccati equation appearing in H 2 and linear quadr The discrete algebraic Riccati equation and linear matrix inequality nton. Stoorvogel y Department of Mathematics and Computing Science Eindhoven Univ. of Technology P.O. ox 53, 56 M Eindhoven The Netherlands

More information

Survey of Inverse Problems For Hyperbolic PDEs

Survey 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 information

Lecture 8 - Algebraic Methods for Matching 1

Lecture 8 - Algebraic Methods for Matching 1 CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 1, 2018 Lecture 8 - Algebraic Methods for Matching 1 In the last lecture we showed that

More information

LECTURE 1: SOURCES OF ERRORS MATHEMATICAL TOOLS A PRIORI ERROR ESTIMATES. Sergey Korotov,

LECTURE 1: SOURCES OF ERRORS MATHEMATICAL TOOLS A PRIORI ERROR ESTIMATES. Sergey Korotov, LECTURE 1: SOURCES OF ERRORS MATHEMATICAL TOOLS A PRIORI ERROR ESTIMATES Sergey Korotov, Institute of Mathematics Helsinki University of Technology, Finland Academy of Finland 1 Main Problem in Mathematical

More information

2 A Model, Harmonic Map, Problem

2 A Model, Harmonic Map, Problem ELLIPTIC SYSTEMS JOHN E. HUTCHINSON Department of Mathematics School of Mathematical Sciences, A.N.U. 1 Introduction Elliptic equations model the behaviour of scalar quantities u, such as temperature or

More information

JUHA KINNUNEN. Harmonic Analysis

JUHA KINNUNEN. Harmonic Analysis JUHA KINNUNEN Harmonic Analysis Department of Mathematics and Systems Analysis, Aalto University 27 Contents Calderón-Zygmund decomposition. Dyadic subcubes of a cube.........................2 Dyadic cubes

More information

NONLINEAR FOURIER ANALYSIS FOR DISCONTINUOUS CONDUCTIVITIES: COMPUTATIONAL RESULTS

NONLINEAR FOURIER ANALYSIS FOR DISCONTINUOUS CONDUCTIVITIES: COMPUTATIONAL RESULTS NONLINEAR FOURIER ANALYSIS FOR DISCONTINUOUS CONDUCTIVITIES: COMPUTATIONAL RESULTS K. ASTALA, L. PÄIVÄRINTA, J. M. REYES AND S. SILTANEN Contents. Introduction. The nonlinear Fourier transform 6 3. Inverse

More information

1. Introduction Let the least value of an objective function F (x), x2r n, be required, where F (x) can be calculated for any vector of variables x2r

1. Introduction Let the least value of an objective function F (x), x2r n, be required, where F (x) can be calculated for any vector of variables x2r DAMTP 2002/NA08 Least Frobenius norm updating of quadratic models that satisfy interpolation conditions 1 M.J.D. Powell Abstract: Quadratic models of objective functions are highly useful in many optimization

More information

SPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS

SPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS SPRING 006 PRELIMINARY EXAMINATION SOLUTIONS 1A. Let G be the subgroup of the free abelian group Z 4 consisting of all integer vectors (x, y, z, w) such that x + 3y + 5z + 7w = 0. (a) Determine a linearly

More information

Course Description for Real Analysis, Math 156

Course Description for Real Analysis, Math 156 Course Description for Real Analysis, Math 156 In this class, we will study elliptic PDE, Fourier analysis, and dispersive PDE. Here is a quick summary of the topics will study study. They re described

More information

Contents. 4 Arithmetic and Unique Factorization in Integral Domains. 4.1 Euclidean Domains and Principal Ideal Domains

Contents. 4 Arithmetic and Unique Factorization in Integral Domains. 4.1 Euclidean Domains and Principal Ideal Domains Ring Theory (part 4): Arithmetic and Unique Factorization in Integral Domains (by Evan Dummit, 018, v. 1.00) Contents 4 Arithmetic and Unique Factorization in Integral Domains 1 4.1 Euclidean Domains and

More information

Reconstruction of the refractive index by near- eld phaseless imaging

Reconstruction of the refractive index by near- eld phaseless imaging Reconstruction of the refractive index by near- eld phaseless imaging Victor Palamodov November 0, 207 Abstract. An explicit method is described for reconstruction of the complex refractive index by the

More information

Ole Christensen 3. October 20, Abstract. We point out some connections between the existing theories for

Ole Christensen 3. October 20, Abstract. We point out some connections between the existing theories for Frames and pseudo-inverses. Ole Christensen 3 October 20, 1994 Abstract We point out some connections between the existing theories for frames and pseudo-inverses. In particular, using the pseudo-inverse

More information

Factorization of integer-valued polynomials with square-free denominator

Factorization of integer-valued polynomials with square-free denominator accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday

More information

An inverse scattering problem in random media

An inverse scattering problem in random media An inverse scattering problem in random media Pedro Caro Joint work with: Tapio Helin & Matti Lassas Computational and Analytic Problems in Spectral Theory June 8, 2016 Outline Introduction and motivation

More information

Introduction to Real Analysis Alternative Chapter 1

Introduction to Real Analysis Alternative Chapter 1 Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces

More information

A MULTIGRID ALGORITHM FOR. Richard E. Ewing and Jian Shen. Institute for Scientic Computation. Texas A&M University. College Station, Texas SUMMARY

A MULTIGRID ALGORITHM FOR. Richard E. Ewing and Jian Shen. Institute for Scientic Computation. Texas A&M University. College Station, Texas SUMMARY A MULTIGRID ALGORITHM FOR THE CELL-CENTERED FINITE DIFFERENCE SCHEME Richard E. Ewing and Jian Shen Institute for Scientic Computation Texas A&M University College Station, Texas SUMMARY In this article,

More information

PARTIAL DIFFERENTIAL EQUATIONS. Lecturer: D.M.A. Stuart MT 2007

PARTIAL DIFFERENTIAL EQUATIONS. Lecturer: D.M.A. Stuart MT 2007 PARTIAL DIFFERENTIAL EQUATIONS Lecturer: D.M.A. Stuart MT 2007 In addition to the sets of lecture notes written by previous lecturers ([1, 2]) the books [4, 7] are very good for the PDE topics in the course.

More information

Winter Lecture 10. Convexity and Concavity

Winter Lecture 10. Convexity and Concavity Andrew McLennan February 9, 1999 Economics 5113 Introduction to Mathematical Economics Winter 1999 Lecture 10 Convexity and Concavity I. Introduction A. We now consider convexity, concavity, and the general

More information

PART IV Spectral Methods

PART IV Spectral Methods PART IV Spectral Methods Additional References: R. Peyret, Spectral methods for incompressible viscous flow, Springer (2002), B. Mercier, An introduction to the numerical analysis of spectral methods,

More information

Our goal is to solve a general constant coecient linear second order. this way but that will not always happen). Once we have y 1, it will always

Our goal is to solve a general constant coecient linear second order. this way but that will not always happen). Once we have y 1, it will always October 5 Relevant reading: Section 2.1, 2.2, 2.3 and 2.4 Our goal is to solve a general constant coecient linear second order ODE a d2 y dt + bdy + cy = g (t) 2 dt where a, b, c are constants and a 0.

More information

Discretization-invariant Bayesian inversion and Besov space priors. Samuli Siltanen RICAM Tampere University of Technology

Discretization-invariant Bayesian inversion and Besov space priors. Samuli Siltanen RICAM Tampere University of Technology Discretization-invariant Bayesian inversion and Besov space priors Samuli Siltanen RICAM 28.10.2008 Tampere University of Technology http://math.tkk.fi/inverse-coe/ This is a joint work with Matti Lassas

More information

16. Local theory of regular singular points and applications

16. Local theory of regular singular points and applications 16. Local theory of regular singular points and applications 265 16. Local theory of regular singular points and applications In this section we consider linear systems defined by the germs of meromorphic

More information

1 Lyapunov theory of stability

1 Lyapunov theory of stability M.Kawski, APM 581 Diff Equns Intro to Lyapunov theory. November 15, 29 1 1 Lyapunov theory of stability Introduction. Lyapunov s second (or direct) method provides tools for studying (asymptotic) stability

More information

Numerical computation of complex geometrical optics solutions to the conductivity equation

Numerical computation of complex geometrical optics solutions to the conductivity equation Numerical computation of complex geometrical optics solutions to the conductivity equation Kari Astala a, Jennifer L Mueller b, Lassi Päivärinta a, Samuli Siltanen a a Department of Mathematics and Statistics,

More information

Lecture 4: Numerical solution of ordinary differential equations

Lecture 4: Numerical solution of ordinary differential equations Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor

More information

Increasing stability in an inverse problem for the acoustic equation

Increasing stability in an inverse problem for the acoustic equation Increasing stability in an inverse problem for the acoustic equation Sei Nagayasu Gunther Uhlmann Jenn-Nan Wang Abstract In this work we study the inverse boundary value problem of determining the refractive

More information

Topic 4 Notes Jeremy Orloff

Topic 4 Notes Jeremy Orloff Topic 4 Notes Jeremy Orloff 4 auchy s integral formula 4. Introduction auchy s theorem is a big theorem which we will use almost daily from here on out. Right away it will reveal a number of interesting

More information

Some Background Material

Some Background Material Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important

More information

2 Tikhonov Regularization and ERM

2 Tikhonov Regularization and ERM Introduction Here we discusses how a class of regularization methods originally designed to solve ill-posed inverse problems give rise to regularized learning algorithms. These algorithms are kernel methods

More information

STABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin

STABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin On the stability of invariant subspaces of commuting matrices Tomaz Kosir and Bor Plestenjak September 18, 001 Abstract We study the stability of (joint) invariant subspaces of a nite set of commuting

More information

Reconstructing conductivities with boundary corrected D-bar method

Reconstructing conductivities with boundary corrected D-bar method J. Inverse Ill-Posed Probl., Ahead of Print DOI 10.1515/jip-2013-0042 de Gruyter 2014 Reconstructing conductivities with boundary corrected D-bar method Samuli Siltanen and Janne P. Tamminen Abstract.

More information

From Fractional Brownian Motion to Multifractional Brownian Motion

From Fractional Brownian Motion to Multifractional Brownian Motion From Fractional Brownian Motion to Multifractional Brownian Motion Antoine Ayache USTL (Lille) Antoine.Ayache@math.univ-lille1.fr Cassino December 2010 A.Ayache (USTL) From FBM to MBM Cassino December

More information

LECTURE NOTES IN CRYPTOGRAPHY

LECTURE NOTES IN CRYPTOGRAPHY 1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic

More information

An inverse source problem in optical molecular imaging

An inverse source problem in optical molecular imaging An inverse source problem in optical molecular imaging Plamen Stefanov 1 Gunther Uhlmann 2 1 2 University of Washington Formulation Direct Problem Singular Operators Inverse Problem Proof Conclusion Figure:

More information

4.1 Eigenvalues, Eigenvectors, and The Characteristic Polynomial

4.1 Eigenvalues, Eigenvectors, and The Characteristic Polynomial Linear Algebra (part 4): Eigenvalues, Diagonalization, and the Jordan Form (by Evan Dummit, 27, v ) Contents 4 Eigenvalues, Diagonalization, and the Jordan Canonical Form 4 Eigenvalues, Eigenvectors, and

More information

Contents. 2.1 Vectors in R n. Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v. 2.50) 2 Vector Spaces

Contents. 2.1 Vectors in R n. Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v. 2.50) 2 Vector Spaces Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v 250) Contents 2 Vector Spaces 1 21 Vectors in R n 1 22 The Formal Denition of a Vector Space 4 23 Subspaces 6 24 Linear Combinations and

More information

4 Uniform convergence

4 Uniform convergence 4 Uniform convergence In the last few sections we have seen several functions which have been defined via series or integrals. We now want to develop tools that will allow us to show that these functions

More information

Rearrangements and polar factorisation of countably degenerate functions G.R. Burton, School of Mathematical Sciences, University of Bath, Claverton D

Rearrangements and polar factorisation of countably degenerate functions G.R. Burton, School of Mathematical Sciences, University of Bath, Claverton D Rearrangements and polar factorisation of countably degenerate functions G.R. Burton, School of Mathematical Sciences, University of Bath, Claverton Down, Bath BA2 7AY, U.K. R.J. Douglas, Isaac Newton

More information

MATH 205C: STATIONARY PHASE LEMMA

MATH 205C: STATIONARY PHASE LEMMA MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)

More information

A Direct Method for reconstructing inclusions from Electrostatic Data

A Direct Method for reconstructing inclusions from Electrostatic Data A Direct Method for reconstructing inclusions from Electrostatic Data Isaac Harris Texas A&M University, Department of Mathematics College Station, Texas 77843-3368 iharris@math.tamu.edu Joint work with:

More information

Linear Algebra, 4th day, Thursday 7/1/04 REU Info:

Linear Algebra, 4th day, Thursday 7/1/04 REU Info: Linear Algebra, 4th day, Thursday 7/1/04 REU 004. Info http//people.cs.uchicago.edu/laci/reu04. Instructor Laszlo Babai Scribe Nick Gurski 1 Linear maps We shall study the notion of maps between vector

More information

SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS

SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS TSOGTGEREL GANTUMUR Abstract. After establishing discrete spectra for a large class of elliptic operators, we present some fundamental spectral properties

More information

Scattering for the NLS equation

Scattering for the NLS equation Scattering for the NLS equation joint work with Thierry Cazenave (UPMC) Ivan Naumkin Université Nice Sophia Antipolis February 2, 2017 Introduction. Consider the nonlinear Schrödinger equation with the

More information

290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f

290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f Numer. Math. 67: 289{301 (1994) Numerische Mathematik c Springer-Verlag 1994 Electronic Edition Least supported bases and local linear independence J.M. Carnicer, J.M. Pe~na? Departamento de Matematica

More information

Reconstructing inclusions from Electrostatic Data

Reconstructing inclusions from Electrostatic Data Reconstructing inclusions from Electrostatic Data Isaac Harris Texas A&M University, Department of Mathematics College Station, Texas 77843-3368 iharris@math.tamu.edu Joint work with: W. Rundell Purdue

More information

f(s) e -i n π s/l d s

f(s) e -i n π s/l d s Pointwise convergence of complex Fourier series Let f(x) be a periodic function with period l defined on the interval [,l]. The complex Fourier coefficients of f( x) are This leads to a Fourier series

More information

Vector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)

Vector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition) Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational

More information

LECTURE 5 APPLICATIONS OF BDIE METHOD: ACOUSTIC SCATTERING BY INHOMOGENEOUS ANISOTROPIC OBSTACLES DAVID NATROSHVILI

LECTURE 5 APPLICATIONS OF BDIE METHOD: ACOUSTIC SCATTERING BY INHOMOGENEOUS ANISOTROPIC OBSTACLES DAVID NATROSHVILI LECTURE 5 APPLICATIONS OF BDIE METHOD: ACOUSTIC SCATTERING BY INHOMOGENEOUS ANISOTROPIC OBSTACLES DAVID NATROSHVILI Georgian Technical University Tbilisi, GEORGIA 0-0 1. Formulation of the corresponding

More information

Mathematical Methods for Physics and Engineering

Mathematical Methods for Physics and Engineering Mathematical Methods for Physics and Engineering Lecture notes for PDEs Sergei V. Shabanov Department of Mathematics, University of Florida, Gainesville, FL 32611 USA CHAPTER 1 The integration theory

More information

Topics in Fourier analysis - Lecture 2.

Topics in Fourier analysis - Lecture 2. Topics in Fourier analysis - Lecture 2. Akos Magyar 1 Infinite Fourier series. In this section we develop the basic theory of Fourier series of periodic functions of one variable, but only to the extent

More information

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra. DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1

More information

Dimensionality in the Stability of the Brunn-Minkowski Inequality: A blessing or a curse?

Dimensionality in the Stability of the Brunn-Minkowski Inequality: A blessing or a curse? Dimensionality in the Stability of the Brunn-Minkowski Inequality: A blessing or a curse? Ronen Eldan, Tel Aviv University (Joint with Bo`az Klartag) Berkeley, September 23rd 2011 The Brunn-Minkowski Inequality

More information

Balance properties of multi-dimensional words

Balance properties of multi-dimensional words Theoretical Computer Science 273 (2002) 197 224 www.elsevier.com/locate/tcs Balance properties of multi-dimensional words Valerie Berthe a;, Robert Tijdeman b a Institut de Mathematiques de Luminy, CNRS-UPR

More information

arxiv: v2 [math.ap] 17 Jun 2014

arxiv: v2 [math.ap] 17 Jun 2014 NONLINEAR FOURIER ANALYSIS FOR DISCONTINUOUS CONDUCTIVITIES: COMPUTATIONAL RESULTS K. ASTALA, L. PÄIVÄRINTA, J. M. REYES AND S. SILTANEN arxiv:30.705v [math.ap] 7 Jun 04 Contents. Introduction. The nonlinear

More information

Convergence for periodic Fourier series

Convergence for periodic Fourier series Chapter 8 Convergence for periodic Fourier series We are now in a position to address the Fourier series hypothesis that functions can realized as the infinite sum of trigonometric functions discussed

More information

1 Introduction It will be convenient to use the inx operators a b and a b to stand for maximum (least upper bound) and minimum (greatest lower bound)

1 Introduction It will be convenient to use the inx operators a b and a b to stand for maximum (least upper bound) and minimum (greatest lower bound) Cycle times and xed points of min-max functions Jeremy Gunawardena, Department of Computer Science, Stanford University, Stanford, CA 94305, USA. jeremy@cs.stanford.edu October 11, 1993 to appear in the

More information

SHARP BOUNDARY TRACE INEQUALITIES. 1. Introduction

SHARP BOUNDARY TRACE INEQUALITIES. 1. Introduction SHARP BOUNDARY TRACE INEQUALITIES GILES AUCHMUTY Abstract. This paper describes sharp inequalities for the trace of Sobolev functions on the boundary of a bounded region R N. The inequalities bound (semi-)norms

More information

ON TRIVIAL GRADIENT YOUNG MEASURES BAISHENG YAN Abstract. We give a condition on a closed set K of real nm matrices which ensures that any W 1 p -grad

ON TRIVIAL GRADIENT YOUNG MEASURES BAISHENG YAN Abstract. We give a condition on a closed set K of real nm matrices which ensures that any W 1 p -grad ON TRIVIAL GRAIENT YOUNG MEASURES BAISHENG YAN Abstract. We give a condition on a closed set K of real nm matrices which ensures that any W 1 p -gradient Young measure supported on K must be trivial the

More information

Inverse Obstacle Scattering

Inverse Obstacle Scattering , Göttingen AIP 2011, Pre-Conference Workshop Texas A&M University, May 2011 Scattering theory Scattering theory is concerned with the effects that obstacles and inhomogenities have on the propagation

More information

Stochastic dominance with imprecise information

Stochastic dominance with imprecise information Stochastic dominance with imprecise information Ignacio Montes, Enrique Miranda, Susana Montes University of Oviedo, Dep. of Statistics and Operations Research. Abstract Stochastic dominance, which is

More information

Chapter One Hilbert s 7th Problem: It s statement and origins

Chapter One Hilbert s 7th Problem: It s statement and origins Chapter One Hilbert s 7th Problem: It s statement and origins At the second International Congress of athematicians in Paris, 900, the mathematician David Hilbert was invited to deliver a keynote address,

More information

THE LUBRICATION APPROXIMATION FOR THIN VISCOUS FILMS: REGULARITY AND LONG TIME BEHAVIOR OF WEAK SOLUTIONS A.L. BERTOZZI AND M. PUGH.

THE LUBRICATION APPROXIMATION FOR THIN VISCOUS FILMS: REGULARITY AND LONG TIME BEHAVIOR OF WEAK SOLUTIONS A.L. BERTOZZI AND M. PUGH. THE LUBRICATION APPROXIMATION FOR THIN VISCOUS FILMS: REGULARITY AND LONG TIME BEHAVIOR OF WEAK SOLUTIONS A.L. BERTOI AND M. PUGH April 1994 Abstract. We consider the fourth order degenerate diusion equation

More information

Constrained Leja points and the numerical solution of the constrained energy problem

Constrained Leja points and the numerical solution of the constrained energy problem Journal of Computational and Applied Mathematics 131 (2001) 427 444 www.elsevier.nl/locate/cam Constrained Leja points and the numerical solution of the constrained energy problem Dan I. Coroian, Peter

More information

ON COMPACTNESS OF THE DIFFERENCE OF COMPOSITION OPERATORS. C φ 2 e = lim sup w 1

ON COMPACTNESS OF THE DIFFERENCE OF COMPOSITION OPERATORS. C φ 2 e = lim sup w 1 ON COMPACTNESS OF THE DIFFERENCE OF COMPOSITION OPERATORS PEKKA NIEMINEN AND EERO SAKSMAN Abstract. We give a negative answer to a conjecture of J. E. Shapiro concerning compactness of the dierence of

More information

Chapter One. The Calderón-Zygmund Theory I: Ellipticity

Chapter One. The Calderón-Zygmund Theory I: Ellipticity Chapter One The Calderón-Zygmund Theory I: Ellipticity Our story begins with a classical situation: convolution with homogeneous, Calderón- Zygmund ( kernels on R n. Let S n 1 R n denote the unit sphere

More information