On the Analytical and Numerical Properties of the Truncated Laplace Transform II.
|
|
- Robert Fleming
- 5 years ago
- Views:
Transcription
1 The Laplace Transform is frequently encountered in mathematics, physics, engineering and other fields. However, the spectral properties of the Laplace Transform tend to complicate its numerical treatment; therefore, the closely related Truncated Laplace Transforms are often used in applications. We have constructed efficient algorithms for the evaluation of the left singular functions and singular values of the Truncated Laplace Transform. Together with the previously introduced algorithms for the evaluation of the right singular functions, these algorithms provide the Singular Value Decomposition of the Truncated Laplace Transform. The resulting algorithms are applicable to all environments likely to be encountered in applications, including the evaluation of singular functions corresponding to extremely small singular values e.g.. On the Analytical and Numerical Properties of the Truncated Laplace Transform II. Roy R. Lederman, Vladimir Rokhlin, Technical Report YALEU/DCS/TR-57 May 9, 5 Thisauthor sresearchwassupportedinpartbytheonrgrants#n4---78,#n and #N and the NSF grant # This author s research was supported in part by the ONR grants #N and #N Applied Mathematics Program, Yale University, New Haven CT 65 Approved for public release: distribution is unlimited. Keywords: Truncated Laplace Transform, SVD.
2 Introduction The Laplace Transform L is a linear mapping L [, L [, ; for a function f L [,, it is defined by the formula Lfω = e tω ftdt. As is well-known, L has a continuous spectrum, and L is not continuous see, for example, [3]. These and related properties tend to complicate the numerical treatment of L. In addressing these problems, we find it useful to draw an analogy between the numerical treatment of the Laplace Transform, and the numerical treatment of the Fourier Transform F; for a function f L R, the latter is defined by the formula Ffω = e itω ftdt, where ω R. In various applications in mathematics and engineering, it is useful to define the Truncated Fourier Transform F c : L [,] L [,]; for a given c >, F c of a function f L [,] is defined by the formula F c fω = e ictω ftdt. 3 The operator F c has been analyzed extensively; one of most notable observations, made by Slepian and Pollak around 96, was that the integral operator F c commutes with a second order differential operator see [8]. This property of F c was used in analytical and numerical investigations of the eigendecomposition of this operator; for example in [8, 9,, 6, 7, 9, 5]. For < a < b <, the linear mapping L a,b : L [a,b] L [, defined by the formula L a,b fω = b a e tω ftdt, 4 will be referred to as the Truncated Laplace Transform of f; obviously, L a,b is a compact operator see, for example, [3]. The Singular Value Decomposition SVD of L a,b has been analyzed, inter alia, in [3] and [5]; Bertero and Grünbaum observed that each of the symmetric operators L a,b L a,b and L a,b L a,b commutes with adifferential operator see [5]. Despite [5, 6, 3,, 4, 3, 8, 7], much more is known about the numerical and analytical properties of F c than about the properties of L a,b. We have constructed algorithms for the efficient evaluation of the SVD of L a,b. In [] we introduced algorithms for the efficient evaluation of the right singular functions and singular values of L a,b. In this paper, we introduce an efficient algorithm for the numerical evaluation
3 of the left singular functions, and an additional algorithm for computing the singular value. Additional properties of the Truncated Laplace transform will be discussed in upcoming papers. This paper is organized as follows. Section summarizes the various standard mathematical facts and simple derivations that are used later in this paper, as well as various properties of the Truncated Laplace Transform. Section 3 contains the derivation of various properties of the truncated Laplace transform which are related to the left singular functions; the properties are used in the algorithms presented in the following section. Section 4 describes the algorithms for the evaluation of the left singular functions and singular values of the Truncated Laplace Transform. Section 5 contains numerical results obtained using the algorithms. Section 6 contains generalizations and conclusions. Preliminaries. The Laguerre Functions In this section we summarize some of the properties of the Laguerre Polynomials, Generalized Laguerrepolynomials, andlaguerrefunctions. TheLaguerrepolynomialL k xofdegreek is defined by the formula L k x = k k m k m m! xm. 5 m= The Generalized Laguerre Polynomial of order α > and degree k, denoted by L α k x, is defined by the formula k k +α k x = m k m m! xm. 6 L α m= The Laguerre Function of degree k, which we denote by Φ k, is defined via the formula Φ k x = e x/ L k x. 7 The following well known properties of the Laguerre Polynomials and the Generalized Laguerre Polynomials can be found, inter alia, in []. L α k x = L α k x Lα k x 8 d dx L kx = L k 9 xl k x = k +L k+ x+k +L k x kl k x
4 e xt L k xdx = t k t k As is well-known, the Laguerre Polynomials L x,l x,... form an orthonormal basis in the Hilbert space induced by the weighted inner product f,g = e x fxgxdx. It follows that the Laguerre functions Φ x,φ x,... form an orthonormal basis in the standard L [, sense. By and 7, e xt Φ k xdx =. The Legendre Polynomials t k t+ k. 3 In this subsection we summarize some of the properties of the Normalized Shifted Legendre Polynomials, derived from the standard Legendre Polynomials. We define the Normalized Shifted Legendre Polynomial of degree k =,,..., which we will be denoting by Pk, by the formula P k x = P kx k +; 4 where P k is the Legendre Polynomial of degree k; the standard definition of the Legendre Polynomials can be found, inter alia, in []. As is well-known, the Legendre Polynomials form an orthogonal basis in L [,], but they are not normalized; a simple calculation shows that the Normalized Shifted Legendre Polynomials P,P,... form an orthonormal basis in L [,]. By 4, the first Normalized Shifted Legendre Polynomial is a constant, P x =. 5.3 Singular Value Decomposition of integral operators The SVD of integral operators and its key properties are summarized in the following theorem, which can be found, for example, in []. Theorem.. Suppose that the function K : [c,d] [a,b] R is square integrable, and T : L [a,b] L [c,d] is defined by the formula Tfx = b a Kx, tftdt. 6 3
5 Then, there exist two orthonormal sequences of functions u,u,..., where u n : [a,b] R and v,v,..., where v n : [c,d] R, and a sequence α,α,... R, where α α..., such that b Tfx = α n u n tftdt v n x 7 n= for any f L [a,b]. The sequence α,α,... is uniquely determined by K. a The functions u,u,... are referred to as the right singular functions, the functions v,v,... are referred to as the left singular functions, and the values α,α,... are referred to as the singular values of the operator T. Together, the right singular functions, the left singular functions and the singular values are referred to as the SVD of the operator T. It immediately follows from Theorem. that Tu n = α n v n, 8 T v n = α n u n. 9 Observation.. The right singular functions u,u,.. of T are eigenfunctions of the operator T T and the left singular functions v,v,... are eigenfunctions of the operator T T ; the singular values α,α,... of T are the square roots of the eigenvalues of T T and T T. In other words, for every n =,,..., and T Tu n τ = T T v n ξ = d c b a b Kx,τ Kx,tu n tdt dx = αnu n τ a d Kξ, t Kx,tv n xdx dt = αnv n ξ c Remark.3. The function K can be expressed using the singular functions as follows see [], Kx,t = v n xα n u n t n= and it can be approximated by truncation of small singular values also see []: Kx,t p v n xα n u n t 3 n= 4
6 .4 The Truncated Laplace Transform Definition.4. For any pair of real numbers a,b, such that < a < b <, the Truncated Laplace Transform L a,b is the linear mapping L [a,b] L [,, defined by the formula L a,b fω = b Obviously, the adjoint of L a,b is L a,b gt = a e tω ftdt, 4 e tω gωdω. 5 The operators L a,b and L a,b are compact, the range of L a,b is dense in L [a,b] and the range of L a,b is dense in L [, see, for example, [3]..5 The SVD of the Truncated Laplace Transform By Theorem., there exist an orthonormal sequence of right singular functions u,u,... L [a,b], an orthonormal sequence of left singular functions v,v,... L [, and a sequence of real numbers α,α,... R such that and for all n =,,..., L a,b fω = b α n n= a u n tftdt v n ω, 6 L a,b u n = α n v n, 7 and L a,b v n = α n u n, 8 α n α n+. 9 Remark.5. The multiplicity of the singular values of L a,b is one see [5]; in other words, for all n =,,... α n > α n+. 3 Remark.6. According to Observation., the right singular functions u,u,... of L a,b are eigenfunctions of the integral operator L a,b L a,b : L [a,b] L [a,b] given by the formula L a,b L a,b ft = e ωt b 5 a b e ωs fsds dω = a t+s fsds,
7 and the corresponding eigenvalues of L a,b L a,b are α,α,..., where α n is the singular value of L a,b associated with the right singular function u n. In other words, L a,b L a,b u n t = b a 3 t+s u nsds = α nu n t. 3 Similarly, the left singular functions v n of L a,b are eigenfunctions of the integral operator L a,b L a,b : L [, L [, given by the formula = b a L a,b L a,b gω = e ωt e ρt gρdρ dt = e aω+ρ e bω+ρ gρdρ, ω +ρ 33 and the corresponding eigenvalues L a,b L a,b are α,α,... In other words, L a,b L a,b v n ω = e aω+ρ e bω+ρ v n ρdρ = α ω +ρ nv n ω The differential operators D t and ˆD ω associated with the singular functions of L a,b In this subsection we summarize several properties related to the differential operator D t, defined by the formula Dt f t = d t a b t ddt dt ft t a ft, 35 where f C [a,b]; and properties related to the differential operator ˆD ω, defined by the formula ˆDω f ω = = ω d d dω dω fω +a +b d ω d dω dω fω + a b ω +a fω, 36 where f C 4 [, L [,. For a derivation of these properties, see [5]. Theorem.7. The differential operator D t, defined in 35, commutes with the integral operator L a,b L a,b, specified in 3 in L [a,b]. In other words, D t L a,b L a,b = L a,b L a,b D t 37 6
8 Theorem.8. The differential operator ˆD ω, defined in 36, commutes with the integral operator L a,b L a,b, specified in 33 in L [,. In other words, L a,b L a,b ˆD ω = ˆD ω L a,b L a,b. 38 Theorem.9. The right singular functions u,u,... defined in 7 of L a,b defined in 4 are also the eigenfunctions of D t. Theorem.. The left singular functions v,v,... defined in 7 of L a,b defined in 4 are also the eigenfunctions of ˆD ω. We denote the eigenvalues of the differential operator D t by χ, χ,..., and the eigenvalues of the differential operator ˆD ω by χ,χ,... By Theorem.9, the singular function u n is the solution to the differential equation d dt t a b t d dt u nt t a u n t = χ n u n t, 39 and by Theorem., the left singular function v n is the solution to the differential equation ω d d dω dω v kω +a +b d ω d dω dω v kω + a b ω +a v k ω = = χ k v kω. Remark.. The singular values α n defined in 7 of the integral operator L a,b are known to decay exponentially as n grows; consequently, the direct numerical computation of the singular functions of L a,b beyond the first few singular functions is impossible. The differential operators D t and ˆD ω are advantageous in the numerical treatment of the singular functions u n and v n because their eigenvalues are well-separated. 4.7 Properties of the right singular functions u n In this section we presents some of the numerical properties of the right singular functions u n, a more detailed discussion of these properties is found in []. We find it convenient to define the function ψ n x on the interval [,] by the formula ψ n x = b a u n a+b ax. 4 We introduce the notation h n = h n,hn,... for the vector of coefficients of the expansion of the function ψ n in the basis of Normalized Shifted Legendre Polynomials defined in 4; where the element h n k is defined by the formula h n k = ψ n xpk xdx, 4 7
9 so that ψ n x = k= h n k P k x. 43 Theorem.. The vector of coefficients h n is the n+-th eigenvector of the five-diagonal matrix M, defined by the formula where M k,k = k k 4 k 3k k+, M k,k = k3 +β k, k+ M k,k = 4 6β kβ+3β+k 7+β+β +k 3 +k 4 7+6β+8β k k+3, M k+,k = k+3 +β k+ k+3, M k+,k = β = a b a. k+ k+ 4 k+k+3 k Analytical apparatus 3. Expansion of v n in the basis of Laguerre functions Suppose that g is a smooth function in L [,. Then, g can be expressed in the basis of Laguerre functions Φ k defined in 7; let η = η,η,... be the a vector where η k = gωφ k ωdω, 46 then clearly η is the vector of coefficients in the expansion, gω = η k Φ k ω. 47 k= We introduce the notation η n = η n,ηn,... for the vector of coefficients of the expansion of the left singular function v k defined in 7 in the basis of Laguerre functions; where the element ηk n is defined by the formula so that ηk n = v n ωφ k ωdω, 48 v n ω = ηk n Φ kω. 49 k= 8
10 3. A matrix representation of the differential operator ˆD ω in the basis of Φ k The purpose of this subsection is to express the differential operator ˆD ω defined in 36 in the basis of Laguerre Functions Φ k as the matrix ˆM described in Lemma 3.. Theorem 3. shows that the matrix ˆM is in fact a five-diagonal matrix; and Corollary 3.3 provides the relationship between the eigenvectors of ˆM and the left singular functions vn defined in 7. Lemma 3.. Let g be a smooth function with the expansion η = η,η,... specified in 47: gω = η k Φ k ω. 5 k= Suppose that ψ = ˆD ω g, with the expansion c = c,c,... such that ψω = c k Φ k ω. 5 Then, c = ˆMη, k= where the matrix elements ˆM jk of ˆM are defined via the formula ˆM jk = Φ j ωˆdω Φ k ωdω, 53 with j,k <. Proof. By the linearity of the differential operator ˆD ω defined in 36, ψω = ˆDω g ω = η k ˆDω Φ k ω. 54 Combining 5 and 54, c k Φ k ω = k= k= k= 5 η k ˆDω Φ k ω. 55 Now, by multiplying both sides of 55 by Φ j and integrating, we have c j = η k ˆDω Φ k ω Φ j ωdω. 56 By linearity, c j = k= η k k= Φ j ωˆdω Φ k ωdω. 57 9
11 Theorem 3.. For any k, ˆDω Φ k ω = 4a 4b k k Φ k ω 6 + k 6a b Φ k ω 4 + kk + 48a b 4a 4b 3 + 6a b +a 4b Φ k ω 8 + k + 6a b Φ k+ ω 4 4a 4b k +k + Φ k+ ω, 6 58 where Φ k is the Laguerre function defined in 7. In other words, ˆM is the symmetric five-diagonal matrix with non-zero entries defined by the formulae 4a ˆM 4b k k k,k =, 6 ˆM k,k = k 6a b, 4 ˆM k,k = kk + 48a b 4a 4b 3 + 6a b +a 4b, 8 ˆM k+,k = k + 6a b, 4 4a ˆM 4b k +k + k+,k = Proof. By the definition of ˆD ω in 36, ˆDω Φ k x = = d d dωωdω Φ kω+a +b d d dω ω dω Φ kx+ a b ω +a Φ k ω A somewhat tedious derivation from 6, using identities 8, 9 and, yields 58. 6
12 Corollary 3.3. Suppose that η n = η n,ηn,... is the vector of coefficients defined in 48, in the expansion of the left singular function v n defined in 7; then, η n is the n+-th eigenvector of ˆM : ˆMη n = χ nη n, 6 where ˆM is the five-diagonal matrix 59, χ n are the eigenvalues of the differential operator ˆD ω, and k =,,,... Proof. By 4, v n is an eigenfunction of ˆD ω, with the eigenvalue χ n: ˆDω v k ω = χ k v kω, 6 so that ˆD ω ηk n Φ k ω = k= ˆDω v k ω = χ k ηk n Φ kω. 63 k= Therefore, by Lemma 3. we obtain 3.3. Remark 3.4. If the operator ˆD ω is represented in the basis associated with Hermite polynomials, rather than in the basis of Laguerre functions, the resulting matrix ˆM in Lemma 3. and Theorem 3. is seven-diagonal and of certain analytical advantage. This approach is under investigation and will be reported at a later date. 3.. The special cases L /,γ/ and L /γ,/ An inspection of formula 59 immediately indicates that there are two special cases in which the second off-diagonal of the matrix ˆM defined in 59 vanishes, and ˆM becomes a tridiagonal band matrix. The first case occurs when a = /. The substitution of a = /,b = γ/ into 59 yields ˆM k,k = 4 γ k, ˆM k,k = 4 γ γ + k γ + k +, 64 ˆM k+,k = 4 γ k +, and zero in all other elements of ˆM. In other words, the differential operator associated with the Truncated Laplace Transform L /,γ/ via 38 is a tridiagonal band matrix in the basis of Laguerre Functions.
13 The second case occurs when b = /. The substitution of a = γ,b = / into 59 yields γ ˆM k k,k = 4γ, γ ˆM + k + γ + k +γ k,k = 4γ, γ ˆM k + k+,k = 4γ, 65 and zero in all other elements of ˆM. Again, the differential operator associated with the Truncated Laplace Transform L /γ,/ via 38 is a tridiagonal band matrix in the basis of Laguerre Functions. 3.. The special case: L γ, γ An additional special case occurs when ab = /, i.e. in the case of the Truncated Laplace Transform L γ, γ. Substituting a = γ,b = γ into 59 eliminates the first off-diagonal of ˆM and yields the matrix ˆM s : ˆM s k,k =γ k k, 6γ ˆM s γ k,k = 6γ kk + γ γ +3, 8γ k+,k =γ k +k +, 6γ ˆM s 66 with zero in all other elements of ˆMs. 3.3 The standard form of the Truncated Laplace Transform As shown in [3], the behavior of the Truncated Laplace Transform L a,b is determined by the ratio γ = b/a. 67 The following lemma summarizes the connections between the SVD of the Truncated Laplace Transform L a,b and the SVD of the Truncated Laplace Transform L ; we will refer to the latter as the standard form of the Truncated Laplace Transform. γ, γ Lemma 3.5. Suppose that < a < b <, and that u n, v n and α n are the n + -th right singular function, left singular function and singular value of L a,b, respectively. Suppose that
14 ũ n, ṽ n and α n are the n+-th right singular function, left singular function and singular value of the standard form L, respectively, with γ = b/a. and Then, γ, γ u n t = γ a ũnt/ γa, 68 v n ω = γ a ṽ n ωa γ, 69 α n = α n. 7 Proof. The identities are readily obtained by the change of variables t = t/a γ in 3, the change of variables ω = a γω in 34, and normalization of the singular functions. We denote the differential operator associated with L γ, γ differential operator is specified by the formula ˆDω f ω = = ω d d dω dω fω + γ + 4γ d dω via Theorem.8 by ˆDω ; this ω d dω fω + 6 ω + fω, γ 7 which is a special case of formula 36. The following lemma specifies the relation between the eigenvalues of ˆD ω associated with L γ, γ and the eigenvalues of ˆDω defined in 36 associated with L a,b. Lemma 3.6. Suppose that χ n is the n+-th eigenvalue of the differential operator ˆD ω associated with L a,b, and that χ n is the n+-th eigenvalue of the differential operator ˆDω associated with L, where γ = b/a. Then, γ, γ χ n = 4γa χ n = 4ab χ n. 7 Proof. The relation is obtained from 36 by the change of variables ω = a γω. 3.4 The operator C γ [ In this discussion, we find it useful to introduce the transform C γ : L ] γ, γ L [,]; we define C γ of a function f by the formula C γ fs = γ s/4 f γ s/ /. 73 3
15 Remark 3.7. A simple calculation shows that C γ fs C γ gsds = 4 logγ γ γ ftgtdt. 74 The following lemma provides an expression for the function C γ L γ, γ Φ k the Laguerre function defined in 7. Lemma 3.8. For any < γ <, C γ L Φ k γ, γ Furthermore, the function C γ L γ, γ Φ k C γ L Φ k s = C k γ γ, γ, with Φ k s = γ s/4 k k. γ s/ γ + s/ 75 is even or odd, depending on the value of k: L γ, γ Φ k s. 76 Proof. The identity 75 is obtained by substituting 3 into 73. The symmetry property 76 follows immediately from 75. Corollary 3.9. For < γ <, the functions C γ L γ, γ Φ k s decay exponentially as k grows, in the following sense C γ L Φ k s γ s/ k γ s/ = + k γ s/ γ, γ Furthermore, if s, then, C γ L Φ k s γ / + Proof. By 75, C γ γ, γ L γ, γ Φ k s = γs/4 γ s/ γ s/ + γ s/ + k. 78 k, 79 so that for all < γ < and s R, γ s/ γ s/ <. 8 + The inequality 77 follows immediately from 79 and 8. Equation 78 follows immediately from 77. 4
16 3.4. The function C γ u n We introduce the notation U n for the C γ of the n+ right singular function of L defined by the formula γ, γ ; U n is U n s = C γ u n s. 8 where u n is the n+-th right singular function of the operator L γ, γ and C γ is defined in 73. The following lemma summarizes some of the observations found in [5] and reformulates them using the notation used in this paper. Lemma 3.. The function U n defined in 8 is an eigenfunction of the differential operator D s, defined by the formula Ds f s =log γ d γ + γcoshslog γ d ds 3 γcoshslog γ+ 4 γ 7 4 fs. ds fs Since the differential operator Ds is symmetric around, the function U n is even or odd in the sense that 8 U n s = n U n s Decay of the coefficients Since the left singular function v n defined in 7 is a smooth solutions of a differential equation specified in 4, we expect the coefficients ηk n defined in 48 in the expansion of v n to decay rapidly. In this section we provide an estimate for the actual decay. Lemma 3.. Suppose that v n is the n+-th left singular function of the operator L γ, γ defined in 4; then η n k α n logγ + γ k. 84 where η n k is defined in 48 and α n is the n+-th singular value of L Proof. By 48 and 7, η n k = α n b a γ, γ e ωt u n tdt Φ k ωdω
17 Changing the order of integration and using 5, η n k = α n γ γ A simple calculation using 74 and 8 shows that η n k = α n By the Cauchy-Schwarz inequality, η n k α n u n t L γ, γ Φ k tdt. 86 U n s C γ L γ, γ Φ k sds. 87 U n s ds C γ L γ, γ Φ k sds. 88 Now, since the right singular function u n is normalized, and using 74 and 8, η n k α n Finally, using inequality 78, η n k α n logγ logγ + γ C γ L γ, γ Φ k sds. 89 k. 9 Remark 3.. Lemma 3. can be generalized to the following bound for the coefficients of the expansion of the left singular functions of the Truncated Laplace Transform L a,b in the nonstandard form; the proof is found in our report []. The coefficients ηk n in the expansion of the left singular function v n of L a,b are bounded in the sense that η n k α n logγ γ smax/ γ smax/ + k, 9 where s max = max loga logγ, logb logγ. 9 6
18 3.6 Integral of the function u n The following lemma describes the relation between the integral b a u ntdt, where u n is the right singular function defined in 7, and the expansion specified in 43. The expansion 43 is associated with the right singular function u n via 4 and 4 and it is studied in []. Lemma 3.3. Suppose that u n be the n+-th right singular function of L a,b, then b a u n tdt = b ah n. 93 where h n is the first coefficient in the expansion 4 of the function ψ n defined in 43 in the basis of Legendre Polynomials. Proof. By 4, h n = Substituting 5 into 94 yields h n = ψ n xp xdx, 94 ψ n xdx. 95 Now, substituting 4 into 94 with the change of variable t = a+b ax yield A relation between u n, v n, and the singular value α n The following lemma provides the relation between the coefficient h n function v n, and the singular value α n. see 4, the left singular Theorem 3.4. Suppose that u n, v n and α n are the n + -th right singular function, left singular function and singular value of L a,b and suppose that h n is the first coefficient in the expansion defined in 43. Then, α n = b a hn v n 96 Proof. Evaluating both side of 7 at yields α n v n = L a,b u n = α n v n = Substituting 93 into 97, b a u n tdt. 97 α n v n = b a h n. 98 7
19 4 Algorithms 4. Computing the left singular function v n In this section we introduce an algorithm for the numerical evaluation of v n ω, the n+-th left singular function defined in 7 of L a,b the operator defined in 4. By Theorem., the function v n ω is an eigenfunction of the differential operator ˆD ω defined in 36; by Corollary 3.3, the expansion η n = η n,ηn,... defined in 49 of v n in the basis of Laguerre functions is an eigenvector of the matrix ˆM defined in 59. Based on Lemma 3.5 and Lemma 3.6, it is sufficient to compute ṽ n ω, the n + -th left singular function of the Truncated Laplace Transform in the standard form L, where γ, γ γ = b/a; v n t is computed from ṽ n t using 69. In this special case of the Truncated Laplace Transform, the expansion η n = η n,ηn,... of ṽ n ω is an eigenvector of the matrix ˆM s specified in 66. Since the matrix ˆM s is five-diagonal, and is non-zero only in even rows of even columns, and on odd rows of odd columns, an eigenvector of ˆMs must vanish at either the even or odd positions. Therefore, for any even n = m where m, equation 49 is reformulated as ṽ m ω = where η even,m = η even,m for all integer k : k=,η even,m η even,m k Φ k ω, 99,... is simply the even numbered elements of the vector η m ; η m k = ηeven,m k. In other words, η even,m is the m+-th eigenvector of the tridiagonal matrix ˆM s,even, obtained by removing the odd numbered rows and columns of ˆMs ; the non-zero elements of ˆMs,even are specified by the formula ˆM s,even k,k ˆM s,even = γ k k, 8γ k,k = γ 6γ kk + γ γ +3, 8γ k+,k = γ k +k +. 8γ ˆM s,even Similarly, for any odd n = m+ where m, equation 49 is reformulated as ṽ m+ ω = k= η odd,m k Φ k+ ω, 8
20 where η odd,m = η odd,m for all integer k :,η odd,m,... is simply the odd numbered elements of the vector η m+ ; η m+ k+ = ηodd,m k. 3 In other words, η odd,m is the m+-th eigenvector of the tridiagonal matrix ˆM s,odd, obtained by removing the even numbered rows and columns of ˆMs ; the non-zero elements of ˆMs,odd are specified by the formula ˆM s,odd k,k =γ kk +, 8γ ˆM s,odd k,k = γ 6γ k +k + γ γ +3, 8γ k+,k =γ k +k +3. 8γ ˆM s,odd 4 Therefore, the algorithm for computing the left singular function v n of the Truncated Laplace Transform L a,b, where n = m is an even number: Step : Compute η even,n, the n+-th eigenvector of the matrix ˆM s,even, defined in. Step : Compute the function ṽ n from η even,n, using the expansion specified in 99. Step 3: Obtain v n from ṽ n using 4. Similarly, the algorithm for computing the left singular function v n of the Truncated Laplace Transform L a,b, where n = m+ is an odd number: Step : Compute η odd,n, the n+-th eigenvector of the matrix ˆM s,odd, defined in 4. Step : Compute the function ṽ n from η odd,n, using the expansion specified in. Step 3: Obtain v n from ṽ n using 4. Remark 4.. For computations to precision ǫ, the vector η n = η n,ηn,... is truncated at K, such that ηk n ǫ for all k > K. By lemma 3. the coefficients ηn k decay rapidly as k grows; since the vectors η even,n and η odd,n, which contain only the even and odd elements of ηk n, respectively, these vectors are truncated at approximately K/ elements. Theactualpositionofthelastsignificantcoefficientofη even,n andη odd,n, largerinmagnitude than ǫ, is given in Figure 6 and Table 4 in Section 5, for several combinations of γ and n. 4. Computing the singular value α n Theorem 3.4 provides formula 96 for computing the singular value α n using the function v n and the first coefficient of the vector h n the vector associated with the right singular function u n via 4 and 4. The function v n is computed using the algorithm in Section 4., and the vector h n is the n+-th eigenvector of the matrix M defined in 44, see []. 9
21 Remark 4.. The numerical difficulty in this algorithm is that the first element h n of the vector h n see 4 is of the order of α n, so that is decays exponentially as n grows. It has been shown in [4] that in some band matrices, such as M, the first element of the eigenvector h n can be computed to relative precision, not not just to absolute precision. Consequently, if h n is computed as in [4], formula 96 yields α n with high relative precision. 5 Numerical results In this section we present results of several numerical experiments. The algorithms for computing the left singular functions v n and singular values α n of L a,b the operator defined in 4 were implemented in FORTRAN 77, using double precision arithmetic, and compiled using GFORTRAN. In Figures, and 3 we present examples of left singular functions of the operator L a,b, where a = and b =., b = and b = respectively. In Figure 4 and Table we present the singular values α n of the operator L a,b, for several ratios γ = b/a; α n depends only on γ and n see Lemma 3.5. In table we present several singular values smaller than ; the Fujitsu compiler with quadruple precision was used in this experiment. In Figure 5 and Table 3 we present the eigenvalues of the matrix ˆM s defined in 66. In Figure 6 and Table 4 we present for several combinations of γ and n the position of the last significant coefficient η n in the expansion defined in 49, that is larger in magnitude than ǫ = 6. In numerical computations, the vectors η even,m defined in and η odd,m defined in 3 are truncated at about half this number see Remark 4.. In figure 7 we present the CPU time required for the computation of the expansion of the -st right singular function v of L,γ, for varying γ; The experiment was performed on a ThinkPad X3 laptop with Intel Core i7-35 CPU and 6GB RAM n= n= n= 5 n=.5 n= n= n= 5 n=. v n ω v n ω ω ω Figure : Left singular functions of L,.. Figure : Left singular functions of L,.
22 5 v n ω α n 4 γ=. γ= γ= γ= γ= γ= γ= ω Figure 3: Left singular functions of L, n Figure 4: Singular values α n of L a,b, with γ = b/a. 5 8 χ n * γ=. γ= 5 γ= γ= γ= γ= γ= 3 n # of coefficients 6 4 γ=. γ= γ= γ= γ= γ= γ= γ= n Figure 5: Magnitude of the eigenvalues of the matrix ˆM s defined in 66. Figure 6: The position of the last significant coefficient larger in magnitude than 6.
23 CPU time s γ Figure 7: CPU time required for computing the expansion of the -st left singular function of L,γ, as a function of γ. The experiment was performed on a ThinkPad X3 laptop with an Intel Core i7-35 CPU and 6GB RAM. Table : Singular values α n of L a,b n γ =.E+ γ =.E+4 γ =.E+7 γ =.E+.356E E +.673E E E.88E +.437E E E E.487E E E E 8.95E.664E E E E E.9476E E.83E.96456E 3.85E.77967E E E E 4.694E E E E E.45E E E E E E E E 37.49E E E E E.384E E E E E E E E E E E.585E E E 88
24 Table : Examples of singular values α n smaller than γ n α n.e E.E E.E E.E E.E E.E E Table 3: Eigenvalues of ˆMs defined in 66 n γ =.E+ γ =.E+4 γ =.E+7 γ =.E+.378E E E E E +.439E E E + 8.7E +.394E E E E E E E E E E E + 9.E E E E E E E E E E E E +.848E + 4.4E E E E E E E E E E E E E E E +.37E E E E E E +.37E E E E E E E + 3 3
25 Table 4: The position of the last significant coefficient larger in magnitude than 6. n γ =.E+ γ =.E+4 γ =.E+7 γ =.E
26 6 Conclusions and generalizations In this paper we introduced effective algorithms for the evaluation of the left singular functions and singular values of the Truncated Laplace Transform L a,b. Together with the algorithms introduced in [] for the computation of the right singular functions, these algorithms conclude the construction of the SVD of the operators L a,b. As is evident from Remark.3 and the more detailed discussion in [], the left singular functions of L a,b are an efficient basis for representing combinations of decaying exponentials whose decay constants are in the interval [a, b]. References [] M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions: with Formulas, Graphs and Mathematical Tables, National Bureau of Standards, New York, 966. [] M. Bertero, P. Boccacci,, and E. Pike, On the recovery and resolution of exponential relaxation rates from experimental data. II. the optimum choice of experimental sampling points for Laplace transform inversion, Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci., , pp [3] M. Bertero, P. Boccacci, and E. R. Pike, On the recovery and resolution of exponential relaxation rates from experimental data: A singular-value analysis of the Laplace transform inversion in the presence of noise, Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci., , pp [4] M. Bertero, P. Brianzi, and E. R. Pike, On the recovery and resolution of exponential relaxation rates from experimental data. III. the effect of sampling and truncation of data on the Laplace transform inversion, Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci., , pp [5] M. Bertero and F. A. Grunbaum, Commuting differential operators for the finite Laplace transform, Inverse Problems, 985, pp [6] M. Bertero, F. A. Grunbaum, and L. Rebolia, Spectral properties of a differential operator related to the inversion of the finite Laplace transform, Inverse Problems, 986, pp [7] M. Bertero and E. Pike, Exponential-sampling method for Laplace and other dilationally invariant transforms: II. examples in photon correlation spectroscopy and fraunhofer diffraction, Inverse Problems, 7 99, pp. 4. [8] M. Bertero and E. R. Pike, Exponential-sampling method for Laplace and other dilationally invariant transforms: I. singular-system analysis, Inverse Problems, 7 99, pp.. 5
27 [9] H. J. Landau and H. O. Pollak, Prolate spheroidal wave functions, Fourier analysis and uncertainty - II, Bell System Technical Journal, 4 96, pp [] H. J. Landau and H. O. Pollak, Prolate spheroidal wave functions, Fourier analysis and uncertainty-iii: The dimension of the space of essentially time- and band-limited signals, Bell System Tech. J., 4 96, pp [] R. R. Lederman and V. Rokhlin, On the analytical and numerical properties of the truncated laplace transform., tech. rep., Yale CS, 4. [] R. R. Lederman and V. Rokhlin, On the analytical and numerical properties of the truncated laplace transform - I, In publication, 4. [3] M. Bertero, P. Brianzi and E.R. Pike, On the recovery and resolution of exponential relaxational rates from experimental data: Laplace transform inversions in weighted spaces, Inverse Problems, 985, pp. 5. [4] A. Osipov, Evaluation of small elements of the eigenvectors of certain symmetric tridiagonal matrices with high relative accuracy, arxiv, [5] A. Osipov, V. Rokhlin, and H. Xiao, Prolate Spheroidal Wave Functions of Order Zero: Mathematical Tools for Bandlimited Approximation, Springer, New York, 3. [6] D. Slepian, Prolate spheroidal wave functions, Fourier analysis and uncertainty - IV: Extensions to many dimensions; generalized prolate spheroidal functions, Bell System Tech J., , pp [7], Prolate spheroidal wave functions, Fourier analysis, and uncertainty-v: The discrete case, Bell System Tech. J., , pp [8] D. Slepian and H. O. Pollak, Prolate spheroidal wave functions, Fourier analysis and uncertainty - I, Bell System Tech. J., 4 96, pp [9] H. Xiao, V. Rokhlin, and N. Yarvin, Prolate spheroidal wavefunctions, quadrature and interpolation, Inverse Problems, 7, pp [] N. Yarvin and V. Rokhlin, Generalized gaussian quadratures and singular value decompositions of integral operators, SIAM J. Sci. Comput., 998, pp
On the Analytical and Numerical Properties of the Truncated Laplace Transform.
The Laplace transform is frequently encountered in mathematics, physics, engineering and other areas. However, the spectral properties of the Laplace transform tend to complicate its numerical treatment;
More informationFast Algorithms for Spherical Harmonic Expansions
Fast Algorithms for Spherical Harmonic Expansions Vladimir Rokhlin and Mark Tygert Research Report YALEU/DCS/RR-1309 December 17, 004 Abstract An algorithm is introduced for the rapid evaluation at appropriately
More informationRecurrence Relations and Fast Algorithms
Recurrence Relations and Fast Algorithms Mark Tygert Research Report YALEU/DCS/RR-343 December 29, 2005 Abstract We construct fast algorithms for decomposing into and reconstructing from linear combinations
More informationA fast randomized algorithm for overdetermined linear least-squares regression
A fast randomized algorithm for overdetermined linear least-squares regression Vladimir Rokhlin and Mark Tygert Technical Report YALEU/DCS/TR-1403 April 28, 2008 Abstract We introduce a randomized algorithm
More informationSpectra of Multiplication Operators as a Numerical Tool. B. Vioreanu and V. Rokhlin Technical Report YALEU/DCS/TR-1443 March 3, 2011
We introduce a numerical procedure for the construction of interpolation and quadrature formulae on bounded convex regions in the plane. The construction is based on the behavior of spectra of certain
More informationc 2006 Society for Industrial and Applied Mathematics
SIAM J. SCI. COMPUT. Vol. 7, No. 6, pp. 1903 198 c 006 Society for Industrial and Applied Mathematics FAST ALGORITHMS FOR SPHERICAL HARMONIC EXPANSIONS VLADIMIR ROKHLIN AND MARK TYGERT Abstract. An algorithm
More informationA new class of highly accurate differentiation schemes based on the prolate spheroidal wave functions
We introduce a new class of numerical differentiation schemes constructed for the efficient solution of time-dependent PDEs that arise in wave phenomena. The schemes are constructed via the prolate spheroidal
More informationA Randomized Algorithm for the Approximation of Matrices
A Randomized Algorithm for the Approximation of Matrices Per-Gunnar Martinsson, Vladimir Rokhlin, and Mark Tygert Technical Report YALEU/DCS/TR-36 June 29, 2006 Abstract Given an m n matrix A and a positive
More informationDetailed analysis of prolate quadratures and interpolation formulas
As demonstrated by Slepian et. al. in a sequence of classical papers see [33], [34], [7], [35], [36]), prolate spheroidal wave functions PSWFs) provide a natural and efficient tool for computing with bandlimited
More informationNon-asymptotic Analysis of Bandlimited Functions. Andrei Osipov Research Report YALEU/DCS/TR-1449 Yale University January 12, 2012
Prolate spheroidal wave functions PSWFs play an important role in various areas, from physics e.g. wave phenomena, fluid dynamics to engineering e.g. signal processing, filter design. Even though the significance
More informationRandomized algorithms for the low-rank approximation of matrices
Randomized algorithms for the low-rank approximation of matrices Yale Dept. of Computer Science Technical Report 1388 Edo Liberty, Franco Woolfe, Per-Gunnar Martinsson, Vladimir Rokhlin, and Mark Tygert
More informationPhysics 505 Homework No. 1 Solutions S1-1
Physics 505 Homework No s S- Some Preliminaries Assume A and B are Hermitian operators (a) Show that (AB) B A dx φ ABψ dx (A φ) Bψ dx (B (A φ)) ψ dx (B A φ) ψ End (b) Show that AB [A, B]/2+{A, B}/2 where
More informationClass notes: Approximation
Class notes: Approximation Introduction Vector spaces, linear independence, subspace The goal of Numerical Analysis is to compute approximations We want to approximate eg numbers in R or C vectors in R
More informationFunctional Analysis Review
Outline 9.520: Statistical Learning Theory and Applications February 8, 2010 Outline 1 2 3 4 Vector Space Outline A vector space is a set V with binary operations +: V V V and : R V V such that for all
More informationPART 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 informationSlepian functions on the sphere, generalized Gaussian quadrature rule
INSTITUTE OF PHYSICS PUBLISHING Inverse Problems (4 877 89 INVERSE PROBLEMS PII: S66-56(4769-7 Slepian functions on the sphere, generalized Gaussian quadrature rule L Miranian Department of Mathematics,
More informationLecture 12: Detailed balance and Eigenfunction methods
Miranda Holmes-Cerfon Applied Stochastic Analysis, Spring 2015 Lecture 12: Detailed balance and Eigenfunction methods Readings Recommended: Pavliotis [2014] 4.5-4.7 (eigenfunction methods and reversibility),
More informationMATH 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 informationPolynomial Chaos and Karhunen-Loeve Expansion
Polynomial Chaos and Karhunen-Loeve Expansion 1) Random Variables Consider a system that is modeled by R = M(x, t, X) where X is a random variable. We are interested in determining the probability of the
More informationRKHS, Mercer s theorem, Unbounded domains, Frames and Wavelets Class 22, 2004 Tomaso Poggio and Sayan Mukherjee
RKHS, Mercer s theorem, Unbounded domains, Frames and Wavelets 9.520 Class 22, 2004 Tomaso Poggio and Sayan Mukherjee About this class Goal To introduce an alternate perspective of RKHS via integral operators
More informationSPECTRAL THEOREM FOR COMPACT SELF-ADJOINT OPERATORS
SPECTRAL THEOREM FOR COMPACT SELF-ADJOINT OPERATORS G. RAMESH Contents Introduction 1 1. Bounded Operators 1 1.3. Examples 3 2. Compact Operators 5 2.1. Properties 6 3. The Spectral Theorem 9 3.3. Self-adjoint
More informationDifferential equations
Differential equations Math 7 Spring Practice problems for April Exam Problem Use the method of elimination to find the x-component of the general solution of x y = 6x 9x + y = x 6y 9y Soln: The system
More informationOrthonormal series expansion and finite spherical Hankel transform of generalized functions
Malaya Journal of Matematik 2(1)(2013) 77 82 Orthonormal series expansion and finite spherical Hankel transform of generalized functions S.K. Panchal a, a Department of Mathematics, Dr. Babasaheb Ambedkar
More informationON INTERPOLATION AND INTEGRATION IN FINITE-DIMENSIONAL SPACES OF BOUNDED FUNCTIONS
COMM. APP. MATH. AND COMP. SCI. Vol., No., ON INTERPOLATION AND INTEGRATION IN FINITE-DIMENSIONAL SPACES OF BOUNDED FUNCTIONS PER-GUNNAR MARTINSSON, VLADIMIR ROKHLIN AND MARK TYGERT We observe that, under
More informationKernel Method: Data Analysis with Positive Definite Kernels
Kernel Method: Data Analysis with Positive Definite Kernels 2. Positive Definite Kernel and Reproducing Kernel Hilbert Space Kenji Fukumizu The Institute of Statistical Mathematics. Graduate University
More informationLinear Ordinary Differential Equations
MTH.B402; Sect. 1 20180703) 2 Linear Ordinary Differential Equations Preliminaries: Matrix Norms. Denote by M n R) the set of n n matrix with real components, which can be identified the vector space R
More informationScattered 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 informationBasic Calculus Review
Basic Calculus Review Lorenzo Rosasco ISML Mod. 2 - Machine Learning Vector Spaces Functionals and Operators (Matrices) Vector Space A vector space is a set V with binary operations +: V V V and : R V
More information1. Fourier Transform (Continuous time) A finite energy signal is a signal f(t) for which. f(t) 2 dt < Scalar product: f(t)g(t)dt
1. Fourier Transform (Continuous time) 1.1. Signals with finite energy A finite energy signal is a signal f(t) for which Scalar product: f(t) 2 dt < f(t), g(t) = 1 2π f(t)g(t)dt The Hilbert space of all
More informationA fast randomized algorithm for orthogonal projection
A fast randomized algorithm for orthogonal projection Vladimir Rokhlin and Mark Tygert arxiv:0912.1135v2 [cs.na] 10 Dec 2009 December 10, 2009 Abstract We describe an algorithm that, given any full-rank
More informationFinite-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 informationQuadrature formulas for the Laplace and Mellin transforms
arxiv:74.84v1 [math.na] 1 Apr 7 Quadrature formulas for the Laplace and Mellin transforms Rafael G. Campos and Francisco Mejía Facultad de Ciencias Físico-Matemáticas, Universidad Michoacana, 586, Morelia,
More informationarxiv: v1 [cs.lg] 26 Jul 2017
Updating Singular Value Decomposition for Rank One Matrix Perturbation Ratnik Gandhi, Amoli Rajgor School of Engineering & Applied Science, Ahmedabad University, Ahmedabad-380009, India arxiv:70708369v
More informationFunctional Analysis Review
Functional Analysis Review Lorenzo Rosasco slides courtesy of Andre Wibisono 9.520: Statistical Learning Theory and Applications September 9, 2013 1 2 3 4 Vector Space A vector space is a set V with binary
More informationApplied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in
More informationWAVELET MULTIPLIERS AND SIGNALS
J. Austral. Math. Soc. Sen B 40(1999), 437-446 WAVELET MULTIPLIERS AND SIGNALS Z. HE 1 and M. W. WONG 1 (Received 26 March 1996; revised 6 August 1996) Abstract The Schatten-von Neumann property of a pseudo-differential
More information22 APPENDIX 1: MATH FACTS
22 APPENDIX : MATH FACTS 22. Vectors 22.. Definition A vector has a dual definition: It is a segment of a a line with direction, or it consists of its projection on a reference system xyz, usually orthogonal
More informationYour first day at work MATH 806 (Fall 2015)
Your first day at work MATH 806 (Fall 2015) 1. Let X be a set (with no particular algebraic structure). A function d : X X R is called a metric on X (and then X is called a metric space) when d satisfies
More informationSpectral Geometry of Riemann Surfaces
Spectral Geometry of Riemann Surfaces These are rough notes on Spectral Geometry and their application to hyperbolic riemann surfaces. They are based on Buser s text Geometry and Spectra of Compact Riemann
More informationFinite Frames and Graph Theoretical Uncertainty Principles
Finite Frames and Graph Theoretical Uncertainty Principles (pkoprows@math.umd.edu) University of Maryland - College Park April 13, 2015 Outline 1 Motivation 2 Definitions 3 Results Outline 1 Motivation
More informationSufficient conditions for functions to form Riesz bases in L 2 and applications to nonlinear boundary-value problems
Electronic Journal of Differential Equations, Vol. 200(200), No. 74, pp. 0. ISSN: 072-669. URL: http://ejde.math.swt.edu or http://ejde.math.unt.edu ftp ejde.math.swt.edu (login: ftp) Sufficient conditions
More informationApplied Linear Algebra
Applied Linear Algebra Peter J. Olver School of Mathematics University of Minnesota Minneapolis, MN 55455 olver@math.umn.edu http://www.math.umn.edu/ olver Chehrzad Shakiban Department of Mathematics University
More informationQuantum Mechanics Solutions
Quantum Mechanics Solutions (a (i f A and B are Hermitian, since (AB = B A = BA, operator AB is Hermitian if and only if A and B commute So, we know that [A,B] = 0, which means that the Hilbert space H
More information1 Math 241A-B Homework Problem List for F2015 and W2016
1 Math 241A-B Homework Problem List for F2015 W2016 1.1 Homework 1. Due Wednesday, October 7, 2015 Notation 1.1 Let U be any set, g be a positive function on U, Y be a normed space. For any f : U Y let
More informationA fast randomized algorithm for the approximation of matrices preliminary report
DRAFT A fast randomized algorithm for the approximation of matrices preliminary report Yale Department of Computer Science Technical Report #1380 Franco Woolfe, Edo Liberty, Vladimir Rokhlin, and Mark
More informationS. Lototsky and B.L. Rozovskii Center for Applied Mathematical Sciences University of Southern California, Los Angeles, CA
RECURSIVE MULTIPLE WIENER INTEGRAL EXPANSION FOR NONLINEAR FILTERING OF DIFFUSION PROCESSES Published in: J. A. Goldstein, N. E. Gretsky, and J. J. Uhl (editors), Stochastic Processes and Functional Analysis,
More informationChapter 4 Euclid Space
Chapter 4 Euclid Space Inner Product Spaces Definition.. Let V be a real vector space over IR. A real inner product on V is a real valued function on V V, denoted by (, ), which satisfies () (x, y) = (y,
More informationChapter 6 Inner product spaces
Chapter 6 Inner product spaces 6.1 Inner products and norms Definition 1 Let V be a vector space over F. An inner product on V is a function, : V V F such that the following conditions hold. x+z,y = x,y
More informationn 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes
Root finding: 1 a The points {x n+1, }, {x n, f n }, {x n 1, f n 1 } should be co-linear Say they lie on the line x + y = This gives the relations x n+1 + = x n +f n = x n 1 +f n 1 = Eliminating α and
More informationMath 24 Spring 2012 Sample Homework Solutions Week 8
Math 4 Spring Sample Homework Solutions Week 8 Section 5. (.) Test A M (R) for diagonalizability, and if possible find an invertible matrix Q and a diagonal matrix D such that Q AQ = D. ( ) 4 (c) A =.
More informationMath 307 Learning Goals
Math 307 Learning Goals May 14, 2018 Chapter 1 Linear Equations 1.1 Solving Linear Equations Write a system of linear equations using matrix notation. Use Gaussian elimination to bring a system of linear
More informationLinear Algebra. Session 12
Linear Algebra. Session 12 Dr. Marco A Roque Sol 08/01/2017 Example 12.1 Find the constant function that is the least squares fit to the following data x 0 1 2 3 f(x) 1 0 1 2 Solution c = 1 c = 0 f (x)
More informationDefinition and basic properties of heat kernels I, An introduction
Definition and basic properties of heat kernels I, An introduction Zhiqin Lu, Department of Mathematics, UC Irvine, Irvine CA 92697 April 23, 2010 In this lecture, we will answer the following questions:
More informationAsymptotic Properties of an Approximate Maximum Likelihood Estimator for Stochastic PDEs
Asymptotic Properties of an Approximate Maximum Likelihood Estimator for Stochastic PDEs M. Huebner S. Lototsky B.L. Rozovskii In: Yu. M. Kabanov, B. L. Rozovskii, and A. N. Shiryaev editors, Statistics
More informationDS-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 informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationTHE MAGNUS METHOD FOR SOLVING OSCILLATORY LIE-TYPE ORDINARY DIFFERENTIAL EQUATIONS
THE MAGNUS METHOD FOR SOLVING OSCILLATORY LIE-TYPE ORDINARY DIFFERENTIAL EQUATIONS MARIANNA KHANAMIRYAN Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Wilberforce Road,
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
More informationMath 408 Advanced Linear Algebra
Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x
More information1 Singular Value Decomposition
1 Singular Value Decomposition Factorisation of rectangular matrix (generalisation of eigenvalue concept / spectral theorem): For every matrix A C m n there exists a factorisation A = UΣV U C m m, V C
More informationMath 108b: Notes on the Spectral Theorem
Math 108b: Notes on the Spectral Theorem From section 6.3, we know that every linear operator T on a finite dimensional inner product space V has an adjoint. (T is defined as the unique linear operator
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 1982 NOTES ON MATRIX METHODS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 198 NOTES ON MATRIX METHODS 1. Matrix Algebra Margenau and Murphy, The Mathematics of Physics and Chemistry, Chapter 10, give almost
More informationPhysics 137A Quantum Mechanics Fall 2012 Midterm II - Solutions
Physics 37A Quantum Mechanics Fall 0 Midterm II - Solutions These are the solutions to the exam given to Lecture Problem [5 points] Consider a particle with mass m charge q in a simple harmonic oscillator
More informationHankel Optimal Model Reduction 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 2004: MODEL REDUCTION Hankel Optimal Model Reduction 1 This lecture covers both the theory and
More informationFourier Series. 1. Review of Linear Algebra
Fourier Series In this section we give a short introduction to Fourier Analysis. If you are interested in Fourier analysis and would like to know more detail, I highly recommend the following book: Fourier
More informationNormalized power iterations for the computation of SVD
Normalized power iterations for the computation of SVD Per-Gunnar Martinsson Department of Applied Mathematics University of Colorado Boulder, Co. Per-gunnar.Martinsson@Colorado.edu Arthur Szlam Courant
More informationMGA Tutorial, September 08, 2004 Construction of Wavelets. Jan-Olov Strömberg
MGA Tutorial, September 08, 2004 Construction of Wavelets Jan-Olov Strömberg Department of Mathematics Royal Institute of Technology (KTH) Stockholm, Sweden Department of Numerical Analysis and Computer
More informationOn the asymptotics of Bessel functions in the Fresnel regime
We introduce a version of the asymptotic expansions for Bessel functions J ν (z), Y ν (z) that is valid whenever z > ν (which is deep in the Fresnel regime), as opposed to the standard expansions that
More informationARTICLE IN PRESS Journal of Computational and Applied Mathematics ( )
Journal of Computational and Applied Mathematics ( ) Contents lists available at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: www.elsevier.com/locate/cam The polynomial
More informationFourier Series. Spectral Analysis of Periodic Signals
Fourier Series. Spectral Analysis of Periodic Signals he response of continuous-time linear invariant systems to the complex exponential with unitary magnitude response of a continuous-time LI system at
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationThe following definition is fundamental.
1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic
More informationPseudo-Hermiticity and Generalized P T- and CP T-Symmetries
Pseudo-Hermiticity and Generalized P T- and CP T-Symmetries arxiv:math-ph/0209018v3 28 Nov 2002 Ali Mostafazadeh Department of Mathematics, Koç University, umelifeneri Yolu, 80910 Sariyer, Istanbul, Turkey
More informationarxiv: v1 [math.ca] 23 Oct 2018
A REMARK ON THE ARCSINE DISTRIBUTION AND THE HILBERT TRANSFORM arxiv:80.08v [math.ca] 3 Oct 08 RONALD R. COIFMAN AND STEFAN STEINERBERGER Abstract. We prove that if fx) ) /4 L,) and its Hilbert transform
More informationLinear Algebra Review (Course Notes for Math 308H - Spring 2016)
Linear Algebra Review (Course Notes for Math 308H - Spring 2016) Dr. Michael S. Pilant February 12, 2016 1 Background: We begin with one of the most fundamental notions in R 2, distance. Letting (x 1,
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationThis ODE arises in many physical systems that we shall investigate. + ( + 1)u = 0. (λ + s)x λ + s + ( + 1) a λ. (s + 1)(s + 2) a 0
Legendre equation This ODE arises in many physical systems that we shall investigate We choose We then have Substitution gives ( x 2 ) d 2 u du 2x 2 dx dx + ( + )u u x s a λ x λ a du dx λ a λ (λ + s)x
More informationPrediction of Bandlimited Fading Envelopes with Arbitrary Spectral Shape
1 Prediction of Bandlimited Fading Envelopes with Arbitrary Spectral Shape Raphael J. Lyman and Adam Sikora Abstract In mobile radio, fading-envelope prediction can improve the performance of adaptive
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationSuperconvergence Results for the Iterated Discrete Legendre Galerkin Method for Hammerstein Integral Equations
Journal of Computer Science & Computational athematics, Volume 5, Issue, December 05 DOI: 0.0967/jcscm.05.0.003 Superconvergence Results for the Iterated Discrete Legendre Galerkin ethod for Hammerstein
More informationWavelet Bi-frames with Uniform Symmetry for Curve Multiresolution Processing
Wavelet Bi-frames with Uniform Symmetry for Curve Multiresolution Processing Qingtang Jiang Abstract This paper is about the construction of univariate wavelet bi-frames with each framelet being symmetric.
More informationLecture 12: Detailed balance and Eigenfunction methods
Lecture 12: Detailed balance and Eigenfunction methods Readings Recommended: Pavliotis [2014] 4.5-4.7 (eigenfunction methods and reversibility), 4.2-4.4 (explicit examples of eigenfunction methods) Gardiner
More informationSolutions: Problem Set 3 Math 201B, Winter 2007
Solutions: Problem Set 3 Math 201B, Winter 2007 Problem 1. Prove that an infinite-dimensional Hilbert space is a separable metric space if and only if it has a countable orthonormal basis. Solution. If
More informationOn the solution of elliptic partial differential equations on regions with corners
In this report we investigate the solution of boundary value problems on polygonal domains for elliptic partial differential equations. We observe that when the problems are formulated as the boundary
More informationQuantum mechanics. Chapter The quantum mechanical formalism
Chapter 5 Quantum mechanics 5.1 The quantum mechanical formalism The realisation, by Heisenberg, that the position and momentum of a quantum mechanical particle cannot be measured simultaneously renders
More informationElements of Positive Definite Kernel and Reproducing Kernel Hilbert Space
Elements of Positive Definite Kernel and Reproducing Kernel Hilbert Space Statistical Inference with Reproducing Kernel Hilbert Space Kenji Fukumizu Institute of Statistical Mathematics, ROIS Department
More informationApplied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in
More informationResearch Statement. James Bremer Department of Mathematics, University of California, Davis
Research Statement James Bremer Department of Mathematics, University of California, Davis Email: bremer@math.ucdavis.edu Webpage: https.math.ucdavis.edu/ bremer I work in the field of numerical analysis,
More informationRecall that any inner product space V has an associated norm defined by
Hilbert Spaces Recall that any inner product space V has an associated norm defined by v = v v. Thus an inner product space can be viewed as a special kind of normed vector space. In particular every inner
More informationEvaluation of small elements of the eigenvectors of certain symmetric tridiagonal matrices with high relative accuracy
Evaluation of the eigenvectors of symmetric tridiagonal matrices is one of the most basic tasks innumerical linear algebra. Itisawidely known factthat, inthe caseofwell separated eigenvalues, the eigenvectors
More informationSlepian Functions Why, What, How?
Slepian Functions Why, What, How? Lecture 1: Basics of Fourier and Fourier-Legendre Transforms Lecture : Spatiospectral Concentration Problem Cartesian & Spherical Cases Lecture 3: Slepian Functions and
More informationHilbert Spaces. Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space.
Hilbert Spaces Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space. Vector Space. Vector space, ν, over the field of complex numbers,
More informationFinal Exam, Linear Algebra, Fall, 2003, W. Stephen Wilson
Final Exam, Linear Algebra, Fall, 2003, W. Stephen Wilson Name: TA Name and section: NO CALCULATORS, SHOW ALL WORK, NO OTHER PAPERS ON DESK. There is very little actual work to be done on this exam if
More informationMathematical Methods wk 2: Linear Operators
John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationStability of an abstract wave equation with delay and a Kelvin Voigt damping
Stability of an abstract wave equation with delay and a Kelvin Voigt damping University of Monastir/UPSAY/LMV-UVSQ Joint work with Serge Nicaise and Cristina Pignotti Outline 1 Problem The idea Stability
More informationLecture 8: Linear Algebra Background
CSE 521: Design and Analysis of Algorithms I Winter 2017 Lecture 8: Linear Algebra Background Lecturer: Shayan Oveis Gharan 2/1/2017 Scribe: Swati Padmanabhan Disclaimer: These notes have not been subjected
More informationSPECTRAL 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 informationReview problems for MA 54, Fall 2004.
Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on
More informationLecture Note 7: Iterative methods for solving linear systems. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 7: Iterative methods for solving linear systems Xiaoqun Zhang Shanghai Jiao Tong University Last updated: December 24, 2014 1.1 Review on linear algebra Norms of vectors and matrices vector
More informationSPECTRAL METHODS: ORTHOGONAL POLYNOMIALS
SPECTRAL METHODS: ORTHOGONAL POLYNOMIALS 31 October, 2007 1 INTRODUCTION 2 ORTHOGONAL POLYNOMIALS Properties of Orthogonal Polynomials 3 GAUSS INTEGRATION Gauss- Radau Integration Gauss -Lobatto Integration
More information