Methods Based on Cauchy Integrals

Author(s):  
B. Davies
Keyword(s):  
1947 ◽  
Vol 43 (3) ◽  
pp. 289-306 ◽  
Author(s):  
Sheila M. Edmonds

The Parseval formulae for Fourier cosine and sine transforms,are of course most widely known in connexion with the classical theorems of Plancherel on functions of the class L2 (whose transforms are defined by mean convergence), and with their generalizations. We cannot expect to obtain anything as elegant as the ‘L2’ results when we consider (1) for functions of other kinds. Nevertheless, since the most obvious way of defining Fourier transforms is by means of Lebesgue or Cauchy integrals, we naturally wish to know how far the formulae (1) hold good for transforms obtained in this way. The two most familiar classes of functions having such transforms are:(i) functions f(t) integrable in the Lebesgue sense in (0, ∞), whose transforms Fe(x) and Fs(x) are defined by the Lebesgue integrals respectively; and(ii) functions f(t) which decrease in (0, ∞), tend to zero as t → ∞, and are integrable over any finite interval (0, T); in this case the transforms are defined by the Cauchy integrals .


1989 ◽  
Vol 2 (3) ◽  
pp. 553 ◽  
Author(s):  
R. R. Coifman ◽  
Peter W. Jones ◽  
Stephen Semmes
Keyword(s):  

2004 ◽  
Vol 4 (2) ◽  
pp. 163-179 ◽  
Author(s):  
Ivan Gavrilyuk ◽  
Vladimir L. Makarov ◽  
Vitaliy Vasylyk

Abstract For two new effcient methods for solving initial value problems in a Hilbert or Banach spaces based on a Sinc quadrature for an improper Dunford-Cauchy integrals over a path enveloping the spectrum of the operator we give a new unified estimate in the case of a Hilbert space.


Author(s):  
Walter Gautschi

This is the first book on constructive methods for, and applications of orthogonal polynomials, and the first available collection of relevant Matlab codes. The book begins with a concise introduction to the theory of polynomials orthogonal on the real line (or a portion thereof), relative to a positive measure of integration. Topics which are particularly relevant to computation are emphasized. The second chapter develops computational methods for generating the coefficients in the basic three-term recurrence relation. The methods are of two kinds: moment-based methods and discretization methods. The former are provided with a detailed sensitivity analysis. Other topics addressed concern Cauchy integrals of orthogonal polynomials and their computation, a new discussion of modification algorithms, and the generation of Sobolev orthogonal polynomials. The final chapter deals with selected applications: the numerical evaluation of integrals, especially by Gauss-type quadrature methods, polynomial least squares approximation, moment-preserving spline approximation, and the summation of slowly convergent series. Detailed historic and bibliographic notes are appended to each chapter. The book will be of interest not only to mathematicians and numerical analysts, but also to a wide clientele of scientists and engineers who perceive a need for applying orthogonal polynomials.


Sign in / Sign up

Export Citation Format

Share Document