User:DVD206/On Some Inverse Problems
On 2D Inverse Problems
Dedicated to Nicole DeLaittre
Summary edit
- The inverse problems, which this book is about are the mathematical problems of recovering the coefficients of functional and differential systems of equations from data about their solutions. These problems are opposite in some sense to the forward problems of evaluating functions. The inverse problems are well suited for computer simulations and many classical and current mathematical problems can be restated with ease as inverse problems on graphs or manifolds. Also the context of the inverse problems provides a unified point of view on the work of many great mathematicians.
These are some of the man motivations for writing this book.
The study of inverse problems takes its roots from medical imaging, such as CT scans, X-rays and MRIs and oil & gas production industry. It was motivated by needs of non-destructive and non-intrusive methods for study of hidden objects such as human organs or Earth's natural resources.
The tools of study and solutions of the inverse problems considered in this book allow one to "see inside" the objects using data about the electro-magnetic fields and sound waves observed at the boundary or outside the object.
Even though we reference many mathematical areas in this book, it is practically self-contained, and is intended for the use by a wide audience of people interested in the subject.
Basic definitions and background edit
Graphs and manifolds edit
Harmonic functions edit
On random processes edit
The inverse problems edit
Applications to classical problems edit
- ==== Solving polynomial equation ====
Rectangular directed layered grid
- ==== Pascal triangle ====
Rectangular grids and gluing graphs
- ==== Monodromy operator ====
Ordinary differential equations (ODEs)
On the inverse problem of Calderon edit
"Can One Hear the Shape of a Drum?" edit
On inhomogeneous string of Krein edit
Special matrices and determinants edit
Embedded graphs and their transformations edit
The rules for replacing conductors in series or parallel connection by a single electrically equivalent conductor follow from the equivalence of the Y-Δ or star-mesh transforms.
-
Caption1
Y-Δ and star-mesh transforms edit
Medial graphs edit
Dual graphs and harmonic conjugates edit
Determining genus of a graph edit
Hamilton paths in graphs edit
The new spectral theorem edit
The layered case edit
Fourier coordinates edit
Stieltjes continued fractions edit
A finite continued fraction is an expression of the form
Blaschke products edit
Let a_i be a set of points in the complex unit disc. The corresponding Blaschke product is defined as
If the set of points is finite, the function defines the n-to-1 map of the unit disc onto itself,
where n is the number of points.
If the set of points is infinite, the product converges and defines an automorphism of the complex unit disc, given the Blaschke condition
The following fact will be useful in our calculations:
Pick-Nevanlinna interpolation edit
Cauchy matrices edit
- The Cayley transform provides the link between the Pick-Nevanlinna interpolation problem at the unit disc and the half-space.
Solution of the layered inverse problem edit
Rotation invariant layered networks
A. Elementary symmetric functions and permutations B. Continued fractions and interlacing properties of zeros of polynomials C. Wave-particle duality and identities involving integrals of paths in a graph and its Laplacian eigenvalues D. Square root and finite-differences
Given the Dirichlet-to-Neumann map of a layered network, find the eigenvalues and the interpolate, calculate the Blaschke product and continued fraction. That gives the conductivities of the layeres.
User:Daviddaved/The square root of the minus Laplacian edit
- We will now consider an important special case of the inverse problem
The case of the unit disc edit
Zolotorev problem edit
One more example edit
Total positivity edit
Compound matrices edit
Variation diminishing property edit
Spectral properties edit
Electrical networks edit
Dirichlet-to-Neumann operator edit
Effective conductivities edit
Connections between discrete and continuous models edit
Kernel of Dirichlet-to-Neumann map edit
Riemann mapping theorem edit
Hilbert transform edit
Acknowledgements edit
The author would like to than Wikipedia for ... Many thanks to the students of the REU summer school on inverse problems at the UW.
Bibliography edit
- Astala, K. and P¨aiv¨arinta, L. "Calder´on’s inverse conductivity problem in the plane", http://annals.math.princeton.edu/wp-content/uploads/annals-v163-n1-p05.pdf
- Biesel, O. D., Ingerman D. V., Morrow J. A. and Shore W. T. "Layered Networks, the Discrete Laplacian, and a Continued Fraction Identity", http://www.math.washington.edu/~reu/papers/2008/william/layered.pdf
- Curtis E. B., Ingerman D. V. and Morrow J. A. "Circular Planar Graphs and Resistor Networks", http://www.math.washington.edu/~morrow/papers/cim.pdf
- Edelman, A. and Strang, G. "Pascal matrices", http://web.mit.edu/18.06/www/pascal-work.pdf
- Fomin, S. "Loop-erased walks and total positivity", http://arxiv.org/pdf/math.CO/0004083.pdf
- Gantmacher F. R. and Krein M. G. "Oscillation Matrices and Kernels and Small Vibrations of Mechanical Systems", Revised Edition, http://www.ams.org/bookstore?fn=20&arg1=diffequ&ikey=CHEL-345-H
- Ingerman, D. V. "The Square of the Dirichlet-to-Neumann map equals minus Laplacian", http://arxiv.org/ftp/arxiv/papers/0806/0806.0653.pdf
- Marshall, D.E. "An elementary proof of the Pick-Nevanlinna interpolation theorem", http://projecteuclid.org/DPubS?verb=Display&version=1.0&service=UI&handle=euclid.mmj/1029001307&page=record