SlideShare a Scribd company logo
1 of 17
Download to read offline
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Enclosure method for the p-Laplacian
Tommi Brander
Joint with Manas Kar and Mikko Salo
University of Jyv¨askyl¨a
9.12.2014
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Outline
1 Calder´on’s problem for the p-Laplace equation
2 Detecting inclusions
3 Main idea and outline
4 Details of the proof
5 Questions or comments?
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Calder´on’s problem for the p-Laplace equation
Suppose Ω is a bounded open set, and 0 < 1/C < σ < C in Ω.
Consider the weighted p-Laplace equation with 1 < p < ∞
∆σ
p (u) = div σ(x)| u|p−2 u = 0 in Ω,
u = f on ∂Ω.
Calder´on’s problem asks if we can determine the conductivity σ
from the knowledge of the DN map f → Λσ(f ) = σ| u|p−2 u · ν.
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Calder´on’s problem for the p-Laplace equation
In the (isotropic) p = 2 case much is known: One can recover
Lipschitz conductivities when d ≥ 3 [Haberman-Tataru 2013,
Caro-Rogers 2014] and L∞ conductivites when d = 2
[Astala-P¨aiv¨arinta 2006].
The p = 2 case has been investigated less: One can recover
continuous conductivity on the boundary of C1 domain
[Salo-Zhong 2012] and, with stronger regularity assumptions,
σ on the boundary [Brander 2014].
d-Laplacian is useful in conformal geometry. 0- and
1-Laplacian are used in UMEIT and CDI, respectively.
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Detecting inclusions
Suppose we have an inclusion D ⊆ Ω; that is, σ 1 or 1 in D
and σ = 1 elsewhere. What can we say about D based on
boundary measurements?
Theorem (B.-Kar-Salo 2014)
Suppose D has Lipschitz boundary, 0 < c < σ < C < 1 or
1 < c < σ < C < ∞ in D, and σ = 1 in Ω  D. The we can
recover the convex hull of D from the Dirichlet to Neumann map.
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Detecting inclusions
In the p = 2 case there are several well-studied methods.
[Isakov 1988] suggested using singular solutions to detect
obstacles in known background medium. The suggestion has
been implemented in sampling and probing methods, such as
linear sampling, factorisation, probe and singular source
methods.
[Ikehata 1999] introduced the enclosure method which avoids
some problems of the methods based on singular solutions.
We use Ikehata’s enclosure method.
The enclosure method has been applied to many linear
equations, including Hemlholtz and Maxwell equations.
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Main idea and outline
Theorem (B.-Kar-Salo 2014)
If σ0, σ1 ∈ L∞
+ (Ω) and 1 < p < ∞, and if f ∈ W 1,p(Ω), then
(p − 1)
Ω
σ0
σ
1/(p−1)
1
σ
1
p−1
1 − σ
1
p−1
0 | u0|p
dx (1)
≤ ((Λσ1 − Λσ0 )f , f ) ≤
Ω
(σ1 − σ0) | u0|p
dx, (2)
where u0 ∈ W 1,p(Ω) solves div(σ0 | u0|p−2
u0) = 0 in Ω with
u0|∂Ω = f .
We will later define the indicator function to equal ((Λσ − Λ1)f , f )
for special solutions f .
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Main idea and outline
Define the p-harmonic function
f = u0(x, ρ, t, τ) = exp (τ (x · ρ − t)) a(τx · ρ⊥
),
where a is periodic and rapidly oscillating, ρ is direction with
ρ · ρ⊥ = 0, t is time and τ is large parameter.
When x · ρ < t, the function and its oscillations are small.
When x · ρ > t, the function and its oscillations are large.
For large τ almost all of the energy of the system will be on the
side x · ρ > t.
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Main idea and outline
Define the indicator function
I(ρ, t, τ) = τn−p
((Λσ − Λ1)f , f ).
By selecting the direction ρ and the time t we focus energy on the
half-space x · ρ > t.
We can detect when inclusion intersects the half-space: by the
monotonicity inequality the indicator function becomes large
as τ grows.
We can also detect when the inclusion is completely outside
the half-space, since the energy will be very small (by
monotonicity inequality) as τ grows.
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Main idea and outline
The identity
I(ρ, t, τ) = exp(2τ(hD(ρ) − t))I(ρ, hD(ρ), τ)
implies that we only need to investigate the time
t = hD(ρ) = sup
x∈D
x · ρ.
The wave of energy and the inclusion barely touch at this time.
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Main idea and outline
Theorem (B.-Kar-Salo 2014)
There exist c, C > 0 such that
c < |I(ρ, hD(ρ), τ)| < Cτn
(3)
for τ 1.
With the previous identity this implies that the indicator function
grows exponentially fast when t < hD(ρ) and vanishes
exponentially when t > hD(ρ).
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Main idea and outline
The upper bound is easy to prove and only requires τ > 0. The
proof uses the definition of Wolff solutions, monotonicity
inequality, and the fact that σ > 1 in the inclusion D.
The lower bound is much more tricky, and also uses the Lipschitz
regularity of the inclusion.
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Details of the proof
From now on, we consider the direction ρ to be fixed. We are
trying to show that the inequalities
c < |I(ρ, hD(ρ), τ)| < Cτn
(4)
hold for large τ. We will omit ρ as an argument to make the
expressions simpler.
We first prove the upper bound.
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Details of the proof
By monotonicity inequality we have
|I(hD, τ)| ≤ τn−p
Ω
(σ − 1) | u0|p
dx. (5)
A property of the Wolff solutions u0 is that
| u0(x)|p
≈ τp
exp(pτ(x · ρ − hD)) ≤ Cτp
, (6)
since hD = supx∈D x · ρ. By assumption σ > 1 + ε on a set D of
positive measure.
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Details of the proof
We now start the proof of the lower bound. First, monotonicity
inequality implies
|I(τ, hD)| ≥ τ(n−p)
Ω
(p − 1)
1
σ
1
p−1
(σ
1
p−1 − 1)| u0|p
dx (7)
≥ Cτ(n−p)
D
| u0|p
dx.
The estimate used for upper bound is not helpful, as it gives
exponentially decreasing lower bound.
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Details of the proof
We cover the compact set ∂D ∩ {x ∈ Ω; x · ρ = hD} by a finite
collection of balls B(αj , δ) with αj in the set, and define
Dδ = D ∩ (∪j B(αj , δ)).
Then there is c > 0 with
DDδ
e−pτ(hD (ρ)−x·ρ)
dx = O(e−pcτ
) (8)
as τ → ∞.
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
Calder´on’s problem for the p-Laplace equation
Detecting inclusions
Main idea and outline
Details of the proof
Questions or comments?
Questions or comments?
The article this presentation is based on can be found in the arXiv:
http://arxiv.org/abs/1410.4048
Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian

More Related Content

What's hot

Lossy Kernelization
Lossy KernelizationLossy Kernelization
Lossy Kernelizationmsramanujan
 
NLO Higgs Effective Field Theory and κ Framework
NLO Higgs Effective Field Theory and κ FrameworkNLO Higgs Effective Field Theory and κ Framework
NLO Higgs Effective Field Theory and κ FrameworkRaquel Gomez Ambrosio
 
lecture 29
lecture 29lecture 29
lecture 29sajinsc
 
Discrete Math Presentation(Rules of Inference)
Discrete Math Presentation(Rules of Inference)Discrete Math Presentation(Rules of Inference)
Discrete Math Presentation(Rules of Inference)Ikhtiar Khan Sohan
 
Node Unique Label Cover
Node Unique Label CoverNode Unique Label Cover
Node Unique Label Covermsramanujan
 
lecture 27
lecture 27lecture 27
lecture 27sajinsc
 
CMSC 56 | Lecture 15: Closures of Relations
CMSC 56 | Lecture 15: Closures of RelationsCMSC 56 | Lecture 15: Closures of Relations
CMSC 56 | Lecture 15: Closures of Relationsallyn joy calcaben
 
Prerequisite for metric space
Prerequisite for metric spacePrerequisite for metric space
Prerequisite for metric spaceROHAN GAIKWAD
 
08 Machine Learning Maximum Aposteriori
08 Machine Learning Maximum Aposteriori08 Machine Learning Maximum Aposteriori
08 Machine Learning Maximum AposterioriAndres Mendez-Vazquez
 
MM framework for RL
MM framework for RLMM framework for RL
MM framework for RLSung Yub Kim
 
Lecture 12 orhogonality - 6.1 6.2 6.3
Lecture 12   orhogonality - 6.1 6.2 6.3Lecture 12   orhogonality - 6.1 6.2 6.3
Lecture 12 orhogonality - 6.1 6.2 6.3njit-ronbrown
 
Secure Domination in graphs
Secure Domination in graphsSecure Domination in graphs
Secure Domination in graphsMahesh Gadhwal
 
CMSC 56 | Lecture 16: Equivalence of Relations & Partial Ordering
CMSC 56 | Lecture 16: Equivalence of Relations & Partial OrderingCMSC 56 | Lecture 16: Equivalence of Relations & Partial Ordering
CMSC 56 | Lecture 16: Equivalence of Relations & Partial Orderingallyn joy calcaben
 
Discrete-Chapter 05 Inference and Proofs
Discrete-Chapter 05 Inference and ProofsDiscrete-Chapter 05 Inference and Proofs
Discrete-Chapter 05 Inference and ProofsWongyos Keardsri
 
Discrete-Chapter 04 Logic Part II
Discrete-Chapter 04 Logic Part IIDiscrete-Chapter 04 Logic Part II
Discrete-Chapter 04 Logic Part IIWongyos Keardsri
 
Constraints on conformal field theories in d=3
Constraints on conformal field theories in d=3Constraints on conformal field theories in d=3
Constraints on conformal field theories in d=3Subham Dutta Chowdhury
 

What's hot (20)

Lossy Kernelization
Lossy KernelizationLossy Kernelization
Lossy Kernelization
 
NLO Higgs Effective Field Theory and κ Framework
NLO Higgs Effective Field Theory and κ FrameworkNLO Higgs Effective Field Theory and κ Framework
NLO Higgs Effective Field Theory and κ Framework
 
Biconnectivity
BiconnectivityBiconnectivity
Biconnectivity
 
lecture 29
lecture 29lecture 29
lecture 29
 
Tsp is NP-Complete
Tsp is NP-CompleteTsp is NP-Complete
Tsp is NP-Complete
 
Discrete Math Presentation(Rules of Inference)
Discrete Math Presentation(Rules of Inference)Discrete Math Presentation(Rules of Inference)
Discrete Math Presentation(Rules of Inference)
 
Node Unique Label Cover
Node Unique Label CoverNode Unique Label Cover
Node Unique Label Cover
 
lecture 27
lecture 27lecture 27
lecture 27
 
Analysis of algorithms
Analysis of algorithmsAnalysis of algorithms
Analysis of algorithms
 
CMSC 56 | Lecture 15: Closures of Relations
CMSC 56 | Lecture 15: Closures of RelationsCMSC 56 | Lecture 15: Closures of Relations
CMSC 56 | Lecture 15: Closures of Relations
 
Prerequisite for metric space
Prerequisite for metric spacePrerequisite for metric space
Prerequisite for metric space
 
08 Machine Learning Maximum Aposteriori
08 Machine Learning Maximum Aposteriori08 Machine Learning Maximum Aposteriori
08 Machine Learning Maximum Aposteriori
 
MM framework for RL
MM framework for RLMM framework for RL
MM framework for RL
 
Lecture 12 orhogonality - 6.1 6.2 6.3
Lecture 12   orhogonality - 6.1 6.2 6.3Lecture 12   orhogonality - 6.1 6.2 6.3
Lecture 12 orhogonality - 6.1 6.2 6.3
 
Secure Domination in graphs
Secure Domination in graphsSecure Domination in graphs
Secure Domination in graphs
 
CMSC 56 | Lecture 16: Equivalence of Relations & Partial Ordering
CMSC 56 | Lecture 16: Equivalence of Relations & Partial OrderingCMSC 56 | Lecture 16: Equivalence of Relations & Partial Ordering
CMSC 56 | Lecture 16: Equivalence of Relations & Partial Ordering
 
Discrete-Chapter 05 Inference and Proofs
Discrete-Chapter 05 Inference and ProofsDiscrete-Chapter 05 Inference and Proofs
Discrete-Chapter 05 Inference and Proofs
 
Discrete-Chapter 04 Logic Part II
Discrete-Chapter 04 Logic Part IIDiscrete-Chapter 04 Logic Part II
Discrete-Chapter 04 Logic Part II
 
Constraints on conformal field theories in d=3
Constraints on conformal field theories in d=3Constraints on conformal field theories in d=3
Constraints on conformal field theories in d=3
 
Discrete Math Lecture 02: First Order Logic
Discrete Math Lecture 02: First Order LogicDiscrete Math Lecture 02: First Order Logic
Discrete Math Lecture 02: First Order Logic
 

Viewers also liked

3 cummins gensets naf-tech tests 09 11 20
3 cummins gensets naf-tech tests 09 11 203 cummins gensets naf-tech tests 09 11 20
3 cummins gensets naf-tech tests 09 11 20John M Riggs
 
Michael E. King Resume.dox
Michael E. King Resume.doxMichael E. King Resume.dox
Michael E. King Resume.doxMike King
 
Recomendación Richard Brown
Recomendación Richard BrownRecomendación Richard Brown
Recomendación Richard BrownLidia Mar Est
 
Rapaport rough "bubblebust" 151124
Rapaport rough "bubblebust"  151124 Rapaport rough "bubblebust"  151124
Rapaport rough "bubblebust" 151124 John M Riggs
 
General Education Diploma 2
General Education Diploma 2General Education Diploma 2
General Education Diploma 2osama albahri
 
Geospatial Analysis: Innovation in GIS for Better Decision Making
Geospatial Analysis: Innovation in GIS for Better Decision MakingGeospatial Analysis: Innovation in GIS for Better Decision Making
Geospatial Analysis: Innovation in GIS for Better Decision MakingMEASURE Evaluation
 
Measuring Impact Qualitatively
Measuring Impact QualitativelyMeasuring Impact Qualitatively
Measuring Impact QualitativelyMEASURE Evaluation
 
Randomization and Its Discontents
Randomization and Its DiscontentsRandomization and Its Discontents
Randomization and Its DiscontentsMEASURE Evaluation
 

Viewers also liked (14)

3 cummins gensets naf-tech tests 09 11 20
3 cummins gensets naf-tech tests 09 11 203 cummins gensets naf-tech tests 09 11 20
3 cummins gensets naf-tech tests 09 11 20
 
Biofortification as part of multi-dimensional nutrition programmes in Uganda,...
Biofortification as part of multi-dimensional nutrition programmes in Uganda,...Biofortification as part of multi-dimensional nutrition programmes in Uganda,...
Biofortification as part of multi-dimensional nutrition programmes in Uganda,...
 
3
33
3
 
Titulo
TituloTitulo
Titulo
 
Michael E. King Resume.dox
Michael E. King Resume.doxMichael E. King Resume.dox
Michael E. King Resume.dox
 
Recomendación Richard Brown
Recomendación Richard BrownRecomendación Richard Brown
Recomendación Richard Brown
 
After
AfterAfter
After
 
Enrique ochoa
Enrique ochoaEnrique ochoa
Enrique ochoa
 
Rapaport rough "bubblebust" 151124
Rapaport rough "bubblebust"  151124 Rapaport rough "bubblebust"  151124
Rapaport rough "bubblebust" 151124
 
General Education Diploma 2
General Education Diploma 2General Education Diploma 2
General Education Diploma 2
 
Cuento de-marce-pdf
Cuento de-marce-pdfCuento de-marce-pdf
Cuento de-marce-pdf
 
Geospatial Analysis: Innovation in GIS for Better Decision Making
Geospatial Analysis: Innovation in GIS for Better Decision MakingGeospatial Analysis: Innovation in GIS for Better Decision Making
Geospatial Analysis: Innovation in GIS for Better Decision Making
 
Measuring Impact Qualitatively
Measuring Impact QualitativelyMeasuring Impact Qualitatively
Measuring Impact Qualitatively
 
Randomization and Its Discontents
Randomization and Its DiscontentsRandomization and Its Discontents
Randomization and Its Discontents
 

Similar to Detecting Inclusions in p-Laplace Equation

Feasible Combinatorial Matrix Theory - LICS2013 presentation
Feasible Combinatorial Matrix Theory - LICS2013 presentationFeasible Combinatorial Matrix Theory - LICS2013 presentation
Feasible Combinatorial Matrix Theory - LICS2013 presentationMichael Soltys
 
article_imen_ridha_2016_version_finale
article_imen_ridha_2016_version_finalearticle_imen_ridha_2016_version_finale
article_imen_ridha_2016_version_finaleMdimagh Ridha
 
DeepLearn2022 1. Goals & AlgorithmDesign.pdf
DeepLearn2022 1. Goals & AlgorithmDesign.pdfDeepLearn2022 1. Goals & AlgorithmDesign.pdf
DeepLearn2022 1. Goals & AlgorithmDesign.pdfSean Meyn
 
Pinning and facetting in multiphase LBMs
Pinning and facetting in multiphase LBMsPinning and facetting in multiphase LBMs
Pinning and facetting in multiphase LBMsTim Reis
 
Latent Dirichlet Allocation
Latent Dirichlet AllocationLatent Dirichlet Allocation
Latent Dirichlet AllocationMarco Righini
 
Ordinary Differential Equation
Ordinary Differential EquationOrdinary Differential Equation
Ordinary Differential Equationnur fara
 
Anti-differentiating Approximation Algorithms: PageRank and MinCut
Anti-differentiating Approximation Algorithms: PageRank and MinCutAnti-differentiating Approximation Algorithms: PageRank and MinCut
Anti-differentiating Approximation Algorithms: PageRank and MinCutDavid Gleich
 
04 greedyalgorithmsii 2x2
04 greedyalgorithmsii 2x204 greedyalgorithmsii 2x2
04 greedyalgorithmsii 2x2MuradAmn
 
Data sparse approximation of the Karhunen-Loeve expansion
Data sparse approximation of the Karhunen-Loeve expansionData sparse approximation of the Karhunen-Loeve expansion
Data sparse approximation of the Karhunen-Loeve expansionAlexander Litvinenko
 
Data sparse approximation of Karhunen-Loeve Expansion
Data sparse approximation of Karhunen-Loeve ExpansionData sparse approximation of Karhunen-Loeve Expansion
Data sparse approximation of Karhunen-Loeve ExpansionAlexander Litvinenko
 
Freezing of energy of a soliton in an external potential
Freezing of energy of a soliton in an external potentialFreezing of energy of a soliton in an external potential
Freezing of energy of a soliton in an external potentialAlberto Maspero
 
Variational Bayes: A Gentle Introduction
Variational Bayes: A Gentle IntroductionVariational Bayes: A Gentle Introduction
Variational Bayes: A Gentle IntroductionFlavio Morelli
 
Developing fast low-rank tensor methods for solving PDEs with uncertain coef...
Developing fast  low-rank tensor methods for solving PDEs with uncertain coef...Developing fast  low-rank tensor methods for solving PDEs with uncertain coef...
Developing fast low-rank tensor methods for solving PDEs with uncertain coef...Alexander Litvinenko
 
He laplace method for special nonlinear partial differential equations
He laplace method for special nonlinear partial differential equationsHe laplace method for special nonlinear partial differential equations
He laplace method for special nonlinear partial differential equationsAlexander Decker
 
A Fibonacci-like universe expansion on time-scale
A Fibonacci-like universe expansion on time-scaleA Fibonacci-like universe expansion on time-scale
A Fibonacci-like universe expansion on time-scaleOctavianPostavaru
 

Similar to Detecting Inclusions in p-Laplace Equation (20)

QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
 
Feasible Combinatorial Matrix Theory - LICS2013 presentation
Feasible Combinatorial Matrix Theory - LICS2013 presentationFeasible Combinatorial Matrix Theory - LICS2013 presentation
Feasible Combinatorial Matrix Theory - LICS2013 presentation
 
article_imen_ridha_2016_version_finale
article_imen_ridha_2016_version_finalearticle_imen_ridha_2016_version_finale
article_imen_ridha_2016_version_finale
 
Reductions
ReductionsReductions
Reductions
 
DeepLearn2022 1. Goals & AlgorithmDesign.pdf
DeepLearn2022 1. Goals & AlgorithmDesign.pdfDeepLearn2022 1. Goals & AlgorithmDesign.pdf
DeepLearn2022 1. Goals & AlgorithmDesign.pdf
 
Pinning and facetting in multiphase LBMs
Pinning and facetting in multiphase LBMsPinning and facetting in multiphase LBMs
Pinning and facetting in multiphase LBMs
 
Latent Dirichlet Allocation
Latent Dirichlet AllocationLatent Dirichlet Allocation
Latent Dirichlet Allocation
 
Ordinary Differential Equation
Ordinary Differential EquationOrdinary Differential Equation
Ordinary Differential Equation
 
Anti-differentiating Approximation Algorithms: PageRank and MinCut
Anti-differentiating Approximation Algorithms: PageRank and MinCutAnti-differentiating Approximation Algorithms: PageRank and MinCut
Anti-differentiating Approximation Algorithms: PageRank and MinCut
 
04 greedyalgorithmsii 2x2
04 greedyalgorithmsii 2x204 greedyalgorithmsii 2x2
04 greedyalgorithmsii 2x2
 
Data sparse approximation of the Karhunen-Loeve expansion
Data sparse approximation of the Karhunen-Loeve expansionData sparse approximation of the Karhunen-Loeve expansion
Data sparse approximation of the Karhunen-Loeve expansion
 
Slides
SlidesSlides
Slides
 
Data sparse approximation of Karhunen-Loeve Expansion
Data sparse approximation of Karhunen-Loeve ExpansionData sparse approximation of Karhunen-Loeve Expansion
Data sparse approximation of Karhunen-Loeve Expansion
 
Least Squares method
Least Squares methodLeast Squares method
Least Squares method
 
Freezing of energy of a soliton in an external potential
Freezing of energy of a soliton in an external potentialFreezing of energy of a soliton in an external potential
Freezing of energy of a soliton in an external potential
 
Variational Bayes: A Gentle Introduction
Variational Bayes: A Gentle IntroductionVariational Bayes: A Gentle Introduction
Variational Bayes: A Gentle Introduction
 
Developing fast low-rank tensor methods for solving PDEs with uncertain coef...
Developing fast  low-rank tensor methods for solving PDEs with uncertain coef...Developing fast  low-rank tensor methods for solving PDEs with uncertain coef...
Developing fast low-rank tensor methods for solving PDEs with uncertain coef...
 
He laplace method for special nonlinear partial differential equations
He laplace method for special nonlinear partial differential equationsHe laplace method for special nonlinear partial differential equations
He laplace method for special nonlinear partial differential equations
 
Econometrics 2017-graduate-3
Econometrics 2017-graduate-3Econometrics 2017-graduate-3
Econometrics 2017-graduate-3
 
A Fibonacci-like universe expansion on time-scale
A Fibonacci-like universe expansion on time-scaleA Fibonacci-like universe expansion on time-scale
A Fibonacci-like universe expansion on time-scale
 

Detecting Inclusions in p-Laplace Equation

  • 1. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Enclosure method for the p-Laplacian Tommi Brander Joint with Manas Kar and Mikko Salo University of Jyv¨askyl¨a 9.12.2014 Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 2. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Outline 1 Calder´on’s problem for the p-Laplace equation 2 Detecting inclusions 3 Main idea and outline 4 Details of the proof 5 Questions or comments? Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 3. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Calder´on’s problem for the p-Laplace equation Suppose Ω is a bounded open set, and 0 < 1/C < σ < C in Ω. Consider the weighted p-Laplace equation with 1 < p < ∞ ∆σ p (u) = div σ(x)| u|p−2 u = 0 in Ω, u = f on ∂Ω. Calder´on’s problem asks if we can determine the conductivity σ from the knowledge of the DN map f → Λσ(f ) = σ| u|p−2 u · ν. Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 4. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Calder´on’s problem for the p-Laplace equation In the (isotropic) p = 2 case much is known: One can recover Lipschitz conductivities when d ≥ 3 [Haberman-Tataru 2013, Caro-Rogers 2014] and L∞ conductivites when d = 2 [Astala-P¨aiv¨arinta 2006]. The p = 2 case has been investigated less: One can recover continuous conductivity on the boundary of C1 domain [Salo-Zhong 2012] and, with stronger regularity assumptions, σ on the boundary [Brander 2014]. d-Laplacian is useful in conformal geometry. 0- and 1-Laplacian are used in UMEIT and CDI, respectively. Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 5. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Detecting inclusions Suppose we have an inclusion D ⊆ Ω; that is, σ 1 or 1 in D and σ = 1 elsewhere. What can we say about D based on boundary measurements? Theorem (B.-Kar-Salo 2014) Suppose D has Lipschitz boundary, 0 < c < σ < C < 1 or 1 < c < σ < C < ∞ in D, and σ = 1 in Ω D. The we can recover the convex hull of D from the Dirichlet to Neumann map. Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 6. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Detecting inclusions In the p = 2 case there are several well-studied methods. [Isakov 1988] suggested using singular solutions to detect obstacles in known background medium. The suggestion has been implemented in sampling and probing methods, such as linear sampling, factorisation, probe and singular source methods. [Ikehata 1999] introduced the enclosure method which avoids some problems of the methods based on singular solutions. We use Ikehata’s enclosure method. The enclosure method has been applied to many linear equations, including Hemlholtz and Maxwell equations. Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 7. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Main idea and outline Theorem (B.-Kar-Salo 2014) If σ0, σ1 ∈ L∞ + (Ω) and 1 < p < ∞, and if f ∈ W 1,p(Ω), then (p − 1) Ω σ0 σ 1/(p−1) 1 σ 1 p−1 1 − σ 1 p−1 0 | u0|p dx (1) ≤ ((Λσ1 − Λσ0 )f , f ) ≤ Ω (σ1 − σ0) | u0|p dx, (2) where u0 ∈ W 1,p(Ω) solves div(σ0 | u0|p−2 u0) = 0 in Ω with u0|∂Ω = f . We will later define the indicator function to equal ((Λσ − Λ1)f , f ) for special solutions f . Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 8. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Main idea and outline Define the p-harmonic function f = u0(x, ρ, t, τ) = exp (τ (x · ρ − t)) a(τx · ρ⊥ ), where a is periodic and rapidly oscillating, ρ is direction with ρ · ρ⊥ = 0, t is time and τ is large parameter. When x · ρ < t, the function and its oscillations are small. When x · ρ > t, the function and its oscillations are large. For large τ almost all of the energy of the system will be on the side x · ρ > t. Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 9. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Main idea and outline Define the indicator function I(ρ, t, τ) = τn−p ((Λσ − Λ1)f , f ). By selecting the direction ρ and the time t we focus energy on the half-space x · ρ > t. We can detect when inclusion intersects the half-space: by the monotonicity inequality the indicator function becomes large as τ grows. We can also detect when the inclusion is completely outside the half-space, since the energy will be very small (by monotonicity inequality) as τ grows. Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 10. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Main idea and outline The identity I(ρ, t, τ) = exp(2τ(hD(ρ) − t))I(ρ, hD(ρ), τ) implies that we only need to investigate the time t = hD(ρ) = sup x∈D x · ρ. The wave of energy and the inclusion barely touch at this time. Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 11. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Main idea and outline Theorem (B.-Kar-Salo 2014) There exist c, C > 0 such that c < |I(ρ, hD(ρ), τ)| < Cτn (3) for τ 1. With the previous identity this implies that the indicator function grows exponentially fast when t < hD(ρ) and vanishes exponentially when t > hD(ρ). Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 12. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Main idea and outline The upper bound is easy to prove and only requires τ > 0. The proof uses the definition of Wolff solutions, monotonicity inequality, and the fact that σ > 1 in the inclusion D. The lower bound is much more tricky, and also uses the Lipschitz regularity of the inclusion. Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 13. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Details of the proof From now on, we consider the direction ρ to be fixed. We are trying to show that the inequalities c < |I(ρ, hD(ρ), τ)| < Cτn (4) hold for large τ. We will omit ρ as an argument to make the expressions simpler. We first prove the upper bound. Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 14. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Details of the proof By monotonicity inequality we have |I(hD, τ)| ≤ τn−p Ω (σ − 1) | u0|p dx. (5) A property of the Wolff solutions u0 is that | u0(x)|p ≈ τp exp(pτ(x · ρ − hD)) ≤ Cτp , (6) since hD = supx∈D x · ρ. By assumption σ > 1 + ε on a set D of positive measure. Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 15. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Details of the proof We now start the proof of the lower bound. First, monotonicity inequality implies |I(τ, hD)| ≥ τ(n−p) Ω (p − 1) 1 σ 1 p−1 (σ 1 p−1 − 1)| u0|p dx (7) ≥ Cτ(n−p) D | u0|p dx. The estimate used for upper bound is not helpful, as it gives exponentially decreasing lower bound. Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 16. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Details of the proof We cover the compact set ∂D ∩ {x ∈ Ω; x · ρ = hD} by a finite collection of balls B(αj , δ) with αj in the set, and define Dδ = D ∩ (∪j B(αj , δ)). Then there is c > 0 with DDδ e−pτ(hD (ρ)−x·ρ) dx = O(e−pcτ ) (8) as τ → ∞. Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian
  • 17. Calder´on’s problem for the p-Laplace equation Detecting inclusions Main idea and outline Details of the proof Questions or comments? Questions or comments? The article this presentation is based on can be found in the arXiv: http://arxiv.org/abs/1410.4048 Tommi Brander Joint with Manas Kar and Mikko Salo Enclosure method for the p-Laplacian