Publications

2017

• First time to exit of a continuous Itô process: general moment estimates and L1-convergence rate for discrete time approximations
  
  • Bouchard Bruno
  • Geiss Stefan
  • Gobet Emmanuel
  Bernoulli, Bernoulli Society for Mathematical Statistics and Probability, 2017, 23 (3), pp.1631-1662. We establish general moment estimates for the discrete and continuous exit times of a general Itô process in terms of the distance to the boundary. These estimates serve as intermediate steps to obtain strong convergence results for the approximation of a continuous exit time by a discrete counterpart, computed on a grid. In particular, we prove that the discrete exit time of the Euler scheme of a diffusion converges in the L1 norm with an order 1/2 with respect to the mesh size. (10.3150/15-BEJ791)
  DOI : 10.3150/15-BEJ791
• The Generalized Linear Sampling Method for limited aperture measurements
  
  • Audibert Lorenzo
  • Haddar Houssem
  SIAM Journal on Imaging Sciences, Society for Industrial and Applied Mathematics, 2017, 10 (2), pp.845–870. We extend the so-called qeneralized Linear Sampling Method (GLSM) to the case of limited aperture data at a fixed frequency.in this case thefactorization of the samplig operatort does not obey the symmetry required in the justification of the GLSM introduced in Audibert-Haddar [Inverse Problems, 2014]. We propose a new formulation by adding an extra penalty term that asymptotically correct the non symmetry of the GLSM original penalty term. The analysis of the new formulation is first presented in an abstact frmeworkF e then show how to pply our setting to the slr W prolem with fr eld mesurements or ner eld mesurements on limited pertureF e nlly IH vlidte the method through some numeril tests in two dimensions nd for fr eld mesurementsF II Key words. snverse sttering prolemsD viner mpling wethodD qenerlized viner mpling wethodD pE IP toriztion wethodD ulittive methods IQ (10.1137/16M110112X)
  DOI : 10.1137/16M110112X
• Galerkin approximations for the optimal control of nonlinear delay differential equations
  
  • Chekroun Mickaël D
  • Kröner Axel
  • Liu Honghu
  , 2017. Optimal control problems of nonlinear delay differential equations (DDEs) are considered for which we propose a general Galerkin approximation scheme built from Koornwinder polynomials. Error estimates for the resulting Galerkin-Koornwinder approximations to the optimal control and the value function, are derived for a broad class of cost function-als and nonlinear DDEs. The approach is illustrated on a delayed logistic equation set not far away from its Hopf bifurcation point in the parameter space. In this case, we show that low-dimensional controls for a standard quadratic cost functional can be efficiently computed from Galerkin-Koornwinder approximations to reduce at a nearly optimal cost the oscillation amplitude displayed by the DDE's solution. Optimal controls computed from the Pontryagin's maximum principle (PMP) and the Hamilton-Jacobi-Bellman equation (HJB) associated with the corresponding ODE systems, are shown to provide numerical solutions in good agreement. It is finally argued that the value function computed from the corresponding reduced HJB equation provides a good approximation of that obtained from the full HJB equation.
• Relative controllability of linear difference equations
  
  • Mazanti Guilherme
  SIAM Journal on Control and Optimization, Society for Industrial and Applied Mathematics, 2017, 55 (5), pp.3132–3153. In this paper, we study the relative controllability of linear difference equations with multiple delays in the state by using a suitable formula for the solutions of such systems in terms of their initial conditions, their control inputs, and some matrix-valued coefficients obtained recursively from the matrices defining the system. Thanks to such formula, we characterize relative controllability in time $T$ in terms of an algebraic property of the matrix-valued coefficients, which reduces to the usual Kalman controllability criterion in the case of a single delay. Relative controllability is studied for solutions in the set of all functions and in the function spaces $L^p$ and $\mathcal C^k$. We also compare the relative controllability of the system for different delays in terms of their rational dependence structure, proving that relative controllability for some delays implies relative controllability for all delays that are ``less rationally dependent'' than the original ones, in a sense that we make precise. Finally, we provide an upper bound on the minimal controllability time for a system depending only on its dimension and on its largest delay. (10.1137/16M1073157)
  DOI : 10.1137/16M1073157
• On the heat diffusion for generic Riemannian and sub-Riemannian structures
  
  • Barilari Davide
  • Boscain Ugo
  • Charlot Grégoire
  • Neel Robert W.
  International Mathematics Research Notices, Oxford University Press (OUP), 2017, 15, pp.4639-4672. In this paper we provide the small-time heat kernel asymptotics at the cut locus in three relevant cases: generic low-dimensional Riemannian manifolds, generic 3D contact sub-Riemannian manifolds (close to the starting point) and generic 4D quasi-contact sub-Riemannian manifolds (close to a generic starting point). As a byproduct, we show that, for generic low-dimensional Riemannian manifolds, the only singularities of the exponential map, as a Lagragian map, that can arise along a minimizing geodesic are $A_3$ and $A_5$ (in the classification of Arnol'd's school). We show that in the non-generic case, a cornucopia of asymptotics can occur, even for Riemannian surfaces. (10.1093/imrn/rnw141)
  DOI : 10.1093/imrn/rnw141
• Transport of power in random waveguides with turning points
  
  • Garnier Josselin
  • Borcea Liliana
  • Wood Derek
  Communications in Mathematical Sciences, International Press, 2017, 15 (8), pp.2327 - 2371. (10.4310/CMS.2017.v15.n8.a9)
  DOI : 10.4310/CMS.2017.v15.n8.a9
• Some discussions on the Read Paper "Beyond subjective and objective in statistics" by A. Gelman and C. Hennig
  
  • Robert Christian
  • Celeux Gilles
  • Jewson Jack
  • Josse Julie
  • Marin Jean-Michel
  • Robert Christian P.
  , 2017. This note is a collection of several discussions of the paper "Beyond subjective and objective in statistics", read by A. Gelman and C. Hennig to the Royal Statistical Society on April 12, 2017, and to appear in the Journal of the Royal Statistical Society, Series A.
• Pliability, or the whitney extension theorem for curves in carnot groups
  
  • Juillet Nicolas
  • Sigalotti Mario
  Analysis & PDE, Mathematical Sciences Publishers, 2017, 10 (7), pp.1637 - 1661. The Whitney extension theorem is a classical result in analysis giving a necessary and sufficient condition for a function defined on a closed set to be extendable to the whole space with a given class of regularity. It has been adapted to several settings, among which the one of Carnot groups. However, the target space has generally been assumed to be equal to R^d for some d ≥ 1. We focus here on the extendability problem for general ordered pairs (G_1,G_2) (with G_2 non-Abelian). We analyze in particular the case G_1 = R and characterize the groups G_2 for which the Whitney extension property holds, in terms of a newly introduced notion that we call pliability. Pliability happens to be related to rigidity as defined by Bryant an Hsu. We exploit this relation in order to provide examples of non-pliable Carnot groups, that is, Carnot groups so that the Whitney extension property does not hold. We use geometric control theory results on the accessibility of control affine systems in order to test the pliability of a Carnot group. In particular, we recover some recent results by Le Donne, Speight and Zimmermann about Lusin approximation in Carnot groups of step 2 and Whitney extension in Heisenberg groups. We extend such results to all pliable Carnot groups, and we show that the latter may be of arbitrarily large step. (10.2140/apde.2017.10.1637)
  DOI : 10.2140/apde.2017.10.1637
• On the cut locus of free, step two Carnot groups
  
  • Rizzi Luca
  • Serres Ulysse
  Proceedings of the American Mathematical Society, American Mathematical Society, 2017, 145, pp.5341-5357. In this note, we study the cut locus of the free, step two Carnot groups G k with k generators, equipped with their left-invariant Carnot-Carathéodory metric. In particular, we disprove the conjectures on the shape of the cut loci proposed in [Mya02, Mya06] and [MM16a], by exhibiting sets of cut points C k ⊂ G k which, for k ≥ 4, are strictly larger than conjectured ones. While the latter were, respectively, smooth semi-algebraic sets of codimension Θ(k 2) and semi-algebraic sets of codimension Θ(k), the sets C k are semi-algebraic and have codimension 2, yielding the best possible lower bound valid for all k on the size of the cut locus of G k. Furthermore, we study the relation of the cut locus with the so-called abnormal set. In the low dimensional cases, it is known that Abn0(G k) = Cut0(G k) \ Cut0(G k), k = 2, 3. For each k ≥ 4, instead, we show that the cut locus always intersects the abnormal set, and there are plenty of abnormal geodesics with finite cut time. Finally, and as a straightforward consequence of our results, we derive an explicit lower bound for the small time heat kernel asymptotics at the points of C k. The question whether C k coincides with the cut locus for k ≥4 remains open. (10.1090/proc/13658)
  DOI : 10.1090/proc/13658
• Instability of dielectrics and conductors in electrostatic fields
  
  • Allaire Grégoire
  • Rauch Jeffrey
  Archive for Rational Mechanics and Analysis, Springer Verlag, 2017, 124, pp.233-268. This article proves most of the assertion in §116 of Maxwell's treatise on electromagnetism. The results go under the name Earnshaw's Theorem and assert the absence of stable equilibrium configurations of conductors and dielectrics in an external electrostatic field.
• Self-administered vitamin D status predictor : older adults are able to use a self-questionnaire for evaluating their vitamin D status
  
  • Annweiler Cédric
  • Kabeshova Anastasiia
  • Callens Alix
  • Paty Marie-Liesse
  • Holick Michael F.
  • Duval Guillaume T.
  PLoS ONE, Public Library of Science, 2017, 12 (11). The 16-item Vitamin D Status Predictor (VDSP) questionnaire helps to identify, without resorting to a blood test, older adults with low vitamin D concentrations. Our objective was to determine whether a self-administered VDSP was concordant with the VDSP administered by a physician, and to examine the concordance of every single item of the VDSP. Methods A total of 349 older in- and outpatients (mean, 83.2±7.2years; 59% female) were consecutively recruited in the geriatric ward of the University Hospital of Angers, France. All participants completed a self-administered VDSP questionnaire (self-VDSP) in paper format composed of 17 items exploring age, gender, general condition, nutrition, vision, mood, cognition, gait and falls, and osteoporosis. All participants underwent subsequently a full clinical examination by a physician exploring the same areas (rater-VDSP). Results The agreement between the self-VDSP and the rater-VDSP was almost perfect for the probability of having low vitamin D concentrations, regardless of the definition used (i.e., ≤25, ≤50 or ≤75 nmol/L). The agreements between physicians’ and patients’ responses were significant for every single VDSP item. The agreement was fair to perfect for all items, except for cognitive disorders, undernutrition and polymorbidity (poor agreement). Conclusions Older adults are able to evaluate their own probabilities of severe vitamin D deficiency, deficiency and insufficiency. A self-questionnaire may promote the use of the VDSP tool in this population, and help clinicians in decisions to supplement their patients in a reasoned way. (10.1371/journal.pone.0186578)
  DOI : 10.1371/journal.pone.0186578
• EFSA-GMO-DE-2017-141 1
  
  • Angevin Frédérique
  • Bagnis Claude
  • Bar-Hen Avner
  • Barny Marie-Anne
  • Boireau Pascal
  • Brévault Thierry
  • Chauvel Bruno B.
  • Collonnier Cécile
  • Couvet Denis
  • Dassa Elie
  • de Verneuil Hubert
  • Demeneix Barbara
  • Franche Claudine
  • Guerche Philippe
  • Guillemain Joël
  • Hernandez Raquet Guillermina
  • Khalife Jamal
  • Klonjkowski Bernard
  • Lavielle Marc
  • Le Corre Valérie
  • Lefèvre François
  • Lemaire Olivier
  • Lereclus Didier D.
  • Maximilien Rémy
  • Meurs Eliane
  • Naffakh Nadia
  • Négre Didier
  • Noyer Jean-Louis
  • Ochatt Sergio
  • Pages Jean-Christophe
  • Raynaud Xavier
  • Regnault-Roger Catherine
  • Renard Michel M.
  • Renault Tristan
  • Saindrenan Patrick
  • Simonet Pascal
  • Troadec Marie-Bérengère
  • Vaissière Bernard
  • Vilotte Jean-Luc
  , 2017.
• Suboptimal feedback control of PDEs by solving HJB equations on adaptive sparse grids
  
  • Garcke Jochen
  • Kröner Axel
  Journal of Scientific Computing, Springer Verlag, 2017, 70 (1), pp.1-28. An approach to solve finite time horizon suboptimal feedback control problems for partial differential equations is proposed by solving dynamic programming equations on adaptive sparse grids. The approach is illustrated for the wave equation and an extension to equations of Schrödinger type is indicated. A semi-discrete optimal control problem is introduced and the feedback control is derived from the corresponding value function. The value function can be characterized as the solution of an evolutionary Hamilton-Jacobi Bellman (HJB) equation which is defined over a state space whose dimension is equal to the dimension of the underlying semi-discrete system. Besides a low dimensional semi-discretization it is important to solve the HJB equation efficiently to address the curse of dimensionality. We propose to apply a semi-Lagrangian scheme using spatially adaptive sparse grids. Sparse grids allow the discretization of the value functions in (higher) space dimensions since the curse of dimensionality of full grid methods arises to a much smaller extent. For additional efficiency an adaptive grid refinement procedure is explored. We present several numerical examples studying the effect the parameters characterizing the sparse grid have on the accuracy of the value function and the optimal trajectory.
• Moral hazard in dynamic risk management
  
  • Cvitanić Jakša
  • Possamaï Dylan
  • Touzi Nizar
  Management Science, INFORMS, 2017, 63 (10), pp.3328-3346. We consider a contracting problem in which a principal hires an agent to manage a risky project. When the agent chooses volatility components of the output process and the principal observes the output continuously, the principal can compute the quadratic variation of the output, but not the individual components. This leads to moral hazard with respect to the risk choices of the agent. We identify a family of admissible contracts for which the optimal agent's action is explicitly characterized, and, using the recent theory of singular changes of measures for Itô processes, we study how restrictive this family is. In particular, in the special case of the standard Homlstrom-Milgrom model with fixed volatility, the family includes all possible contracts. We solve the principal-agent problem in the case of CARA preferences, and show that the optimal contract is linear in these factors: the contractible sources of risk, including the output, the quadratic variation of the output and the cross-variations between the output and the contractible risk sources. Thus, like sample Sharpe ratios used in practice, path-dependent contracts naturally arise when there is moral hazard with respect to risk management. In a numerical example, we show that the loss of efficiency can be significant if the principal does not use the quadratic variation component of the optimal contract. (10.1287/mnsc.2016.2493)
  DOI : 10.1287/mnsc.2016.2493
• A characterization of switched linear control systems with finite L 2 -gain
  
  • Chitour Yacine
  • Mason Paolo
  • Sigalotti Mario
  IEEE Transactions on Automatic Control, Institute of Electrical and Electronics Engineers, 2017, 62, pp.1825-1837. Motivated by an open problem posed by J.P. Hespanha, we extend the notion of Barabanov norm and extremal trajectory to classes of switching signals that are not closed under concatenation. We use these tools to prove that the finiteness of the L2-gain is equivalent, for a large set of switched linear control systems, to the condition that the generalized spectral radius associated with any minimal realization of the original switched system is smaller than one. (10.1109/tac.2016.2593678)
  DOI : 10.1109/tac.2016.2593678
• Log-majorization of the moduli of the eigenvalues of a matrix polynomial by tropical roots
  
  • Akian Marianne
  • Gaubert Stéphane
  • Sharify Meisam
  Linear Algebra and its Applications, Elsevier, 2017, 528, pp.394--435. We show that the sequence of moduli of the eigenvalues of a matrix polynomial is log-majorized, up to universal constants, by a sequence of "tropical roots" depending only on the norms of the matrix coefficients. These tropical roots are the non-differentiability points of an auxiliary tropical polynomial, or equivalently, the opposites of the slopes of its Newton polygon. This extends to the case of matrix polynomials some bounds obtained by Hadamard, Ostrowski and Pólya for the roots of scalar polynomials. We also obtain new bounds in the scalar case, which are accurate for "fewnomials" or when the tropical roots are well separated. (10.1016/j.laa.2016.11.004)
  DOI : 10.1016/j.laa.2016.11.004
• Dependence of tropical eigenspaces
  
  • Niv Adi
  • Rowen Louis
  Communications in Algebra, Taylor & Francis, 2017, 45 (3), pp.924-942. We study the pathology that causes tropical eigenspaces of distinct su-pertropical eigenvalues of a non-singular matrix A, to be dependent. We show that in lower dimensions the eigenvectors of distinct eigenvalues are independent, as desired. The index set that differentiates between subsequent essential monomials of the characteristic polynomial, yields an eigenvalue λ, and corresponds to the columns of adj(A + λI) from which the eigenvectors are taken. We ascertain the cause for failure in higher dimensions, and prove that independence of the eigenvectors is recovered in case the " difference criterion " holds, defined in terms of disjoint differences between index sets of subsequent coefficients. We conclude by considering the eigenvectors of the matrix A ∇ := 1 det(A) adj(A) and the connection of the independence question to generalized eigenvectors. (10.1080/00927872.2016.1172603)
  DOI : 10.1080/00927872.2016.1172603
• Dimensional Reduction of a Multiscale Model Based on Long Time Asymptotics
  
  • Clément Frédérique
  • Coquel Frédéric
  • Postel Marie
  • Tran Kim Long
  Multiscale Modeling and Simulation: A SIAM Interdisciplinary Journal, Society for Industrial and Applied Mathematics, 2017, 15 (3), pp.1198 - 1241. We consider a class of kinetic models for which a moment equation has a natural interpretation. We show that, depending on their velocity field, some models lead to moment equations that enable one to compute monokinetic solutions economically. We detail the example of a multiscale structured cell population model, consisting of a system of 2D transport equations. The reduced model, a system of 1D transport equations, is obtained by computing the moments of the 2D model with respect to one variable. The 1D solution is defined from the solution of the 2D model starting from an initial condition that is a Dirac mass in the direction removed by reduction. Long time properties of the 1D model solution are obtained in connection with properties of the support of the 2D solution for general case initial conditions. Finite volume numerical approximations of the 1D reduced model can be used to compute the moments of the 2D solution with proper accuracy. The numerical robustness is studied in the scalar case, and a full scale vector case is presented. (10.1137/16M1062545)
  DOI : 10.1137/16M1062545
• Introducing a level-set based shape and topology optimization method for the wear of composite materials with geometric constraints
  
  • Feppon Florian
  • Michailidis G
  • Sidebottom M.A.
  • Allaire Grégoire
  • Krick B.A.
  • Vermaak N
  Structural and Multidisciplinary Optimization, Springer Verlag, 2017, 55 (2), pp.547-568. The wear of materials continues to be a limiting factor in the lifetime and performance of mechanical systems with sliding surfaces. As the demand for low wear materials grows so does the need for models and methods to systematically optimize tribological systems. Elastic foundation models offer a simplified framework to study the wear of multimaterial composites subject to abrasive sliding. Previously, the evolving wear profile has been shown to converge to a steady-state that is characterized by a time-independent elliptic equation. In this article, the steady-state formulation is generalized and integrated with shape optimization to improve the wear performance of bi-material composites. Both macroscopic structures and periodic material microstructures are considered. Several common tribological objectives for systems undergoing wear are identified and mathematically formalized with shape derivatives. These include (i) achieving a planar wear surface from multimaterial composites and (ii) minimizing the run-in volume of material lost before steady-state wear is achieved. A level-set based topology optimization algorithm that incorporates a novel constraint on the level-set function is presented. In particular, a new scheme is developed to update material interfaces ; the scheme (i) conveniently enforces volume constraints at each iteration, (ii) controls the complexity of design features using perimeter penalization, and (iii) nucleates holes or inclusions with the topological gradient. The broad applicability of the proposed formulation for problems beyond wear is discussed, especially for problems where convenient control of the complexity of geometric features is desired. (10.1007/s00158-016-1512-4)
  DOI : 10.1007/s00158-016-1512-4
• Multipoint scatterers with zero-energy bound states
  
  • Grinevich Piotr
  • Novikov Roman
  Theoretical and Mathematical Physics, Consultants bureau, 2017, 193 (2), pp.1675-1679. We study multipoint scatterers with zero-energy bound states in three dimensions. We present examples of such scatterers with multiple zero eigenvalue or with strong multipole localization of zero-energy bound states.
• Regularity for the optimal compliance problem with length penalization
  
  • Chambolle Antonin
  • Lamboley Jimmy
  • Lemenant Antoine
  • Stepanov Eugene
  SIAM Journal on Mathematical Analysis, Society for Industrial and Applied Mathematics, 2017. We prove some regularity results for a connected set S in the planar domain O, which minimizes the compliance of its complement O\S, plus its length. This problem, interpreted as to find the best location for attaching a membrane subject to a given external force f so as to minimize the compliance, can be seen as an elliptic PDE version of the average distance problem/irrigation problem (in a penalized version rather than a constrained one), which has been extensively studied in the literature. We prove that minimizers consist of a finite number of smooth curves meeting only by three at 120 degree angles, containing no loop, and possibly touching the boundary of the domain only tangentially. Several new technical tools together with the classical ones are developed for this purpose.
• Optimal scaling of the Random Walk Metropolis algorithm under Lp mean differentiability
  
  • Durmus Alain
  • Le Corff Sylvain
  • Moulines Éric
  • Roberts Gareth O. O.
  Journal of Applied Probability, Cambridge University press, 2017, 54 (4), pp.1233 -1260. This paper considers the optimal scaling problem for high-dimensional random walk Metropolis algorithms for densities which are differentiable in Lp mean but which may be irregular at some points (like the Laplace density for example) and/or are supported on an interval. Our main result is the weak convergence of the Markov chain (appropriately rescaled in time and space) to a Langevin diffusion process as the dimension d goes to infinity. Because the log-density might be non-differentiable, the limiting diffusion could be singular. The scaling limit is established under assumptions which are much weaker than the one used in the original derivation of [6]. This result has important practical implications for the use of random walk Metropolis algorithms in Bayesian frameworks based on sparsity inducing priors. (10.1017/jpr.2017.61)
  DOI : 10.1017/jpr.2017.61
• Application of the Sparse Cardinal Sine Decomposition to 3D Stokes Flows
  
  • Alouges F.
  • Aussal M.
  • Lefebvre-Lepot A.
  • Pigeonneau Franck
  • Sellier Antoine
  International Journal of Computational Methods and Experimental Measurements, WIT Press, 2017, 5 (3), pp.387 - 394. In boundary element method (BEM), one encounters linear system with a dense and non-symmetric square matrix which might be so large that inverting the linear system is too prohibitive in terms of cpu time and/or memory. Each usual powerful treatment (Fast Multipole Method, H-matrices) developed to deal with this issue is optimized to efficiently perform matrix vector products. This work presents a new technique to adequately and quickly handle such products: the Sparse Cardinal Sine Decomposition. This approach, recently pioneered for the Laplace and Helmholtz equations, rests on the decomposition of each encountered kernel as series of radial Cardinal Sine functions. Here, we achieve this decomposition for the Stokes problem and implement it in MyBEM, a new fast solver for multi-physical BEM. The reported computational examples permit us to compare the advocated method against a usual BEM in terms of both accuracy and convergence. (10.2495/CMEM-V5-N3-387-394)
  DOI : 10.2495/CMEM-V5-N3-387-394
• High dimensional matrix estimation with unknown variance of the noise
  
  • Klopp Olga
  • Gaiffas Stéphane
  Statistica Sinica, Taipei : Institute of Statistical Science, Academia Sinica, 2017. We propose a new pivotal method for estimating high-dimensional matrices. Assume that we observe a small set of entries or linear combinations of entries of an unknown matrix $A_0$ corrupted by noise. We propose a new method for estimating $A_0$ which does not rely on the knowledge or an estimation of the standard deviation of the noise $\sigma$. Our estimator achieves, up to a logarithmic factor, optimal rates of convergence under the Frobenius risk and, thus, has the same prediction performance as previously proposed estimators which rely on the knowledge of $\sigma$. Our method is based on the solution of a convex optimization problem which makes it computationally attractive.
• Certified Descent Algorithm for shape optimization driven by fully-computable a posteriori error estimators
  
  • Giacomini Matteo
  • Pantz Olivier
  • Trabelsi Karim
  ESAIM: Control, Optimisation and Calculus of Variations, EDP Sciences, 2017, 23 (3), pp.977-1001. In this paper we introduce a novel certified shape optimization strategy-named Certified Descent Algorithm (CDA)-to account for the numerical error introduced by the Finite Element approximation of the shape gradient. We present a goal-oriented procedure to derive a certified upper bound of the error in the shape gradient and we construct a fully-computable, constant-free a posteriori error estimator inspired by the complementary energy principle. The resulting CDA is able to identify a genuine descent direction at each iteration and features a reliable stopping criterion. After validating the error estimator, some numerical simulations of the resulting certified shape optimization strategy are presented for the well-known inverse identification problem of Electrical Impedance Tomography. (10.1051/cocv/2016021)
  DOI : 10.1051/cocv/2016021