<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE raweb PUBLIC "-//INRIA//DTD " "raweb2.dtd">
<raweb xmlns:xlink="http://www.w3.org/1999/xlink" xml:lang="en" year="2012">
  <identification id="apics" isproject="true">
    <shortname>APICS</shortname>
    <projectName>Analysis and Problems of Inverse type in Control and Signal processing</projectName>
    <theme-de-recherche>Modeling, Optimization, and Control of Dynamic Systems</theme-de-recherche>
    <domaine-de-recherche>Applied Mathematics, Computation and Simulation</domaine-de-recherche>
    <urlTeam>http://www-sop.inria.fr/apics/</urlTeam>
    <datecreation type="Project-Team">January 01, 2005 </datecreation>
    <UR name="Sophia"/>
    <keywords>
      <term>System Analysis And Control</term>
      <term>Nonlinear Control</term>
      <term>Harmonic Analysis</term>
      <term>Signal Processing</term>
    </keywords>
    <moreinfo/>
  </identification>
  <team id="uid1">
    <person key="apics-2006-idm538940448832">
      <firstname>Laurent</firstname>
      <lastname>Baratchart</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Team Leader, Senior Researcher Inria</moreinfo>
      <hdr>oui</hdr>
    </person>
    <person key="arenaire-2006-idm111960264528">
      <firstname>Sylvain</firstname>
      <lastname>Chevillard</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Researcher Inria</moreinfo>
    </person>
    <person key="apics-2006-idm538940435888">
      <firstname>Juliette</firstname>
      <lastname>Leblond</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Senior Researcher Inria</moreinfo>
      <hdr>oui</hdr>
    </person>
    <person key="apics-2006-idm538940432864">
      <firstname>Martine</firstname>
      <lastname>Olivi</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Researcher Inria</moreinfo>
      <hdr>oui</hdr>
    </person>
    <person key="apics-2006-idm538940427408">
      <firstname>Fabien</firstname>
      <lastname>Seyfert</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Researcher Inria</moreinfo>
    </person>
    <person key="caiman-2006-idm450347363200">
      <firstname>Stéphanie</firstname>
      <lastname>Sorres</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>Assistant</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>TR Inria, part-time in the team</moreinfo>
    </person>
    <person key="apics-2008-idm471168816912">
      <firstname>Slah</firstname>
      <lastname>Chaabi</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>PhD</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Univ. Aix-Marseille I</moreinfo>
    </person>
    <person key="apics-2008-idm471168819984">
      <firstname>Ana-Maria</firstname>
      <lastname>Nicu</lastname>
      <affiliation>UnivFr</affiliation>
      <categoryPro>PhD</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Univ. Nice-Sophia Antipolis, until February</moreinfo>
    </person>
    <person key="apics-2012-idm433830175168">
      <firstname>Dmitry</firstname>
      <lastname>Ponomarev</lastname>
      <affiliation>UnivFr</affiliation>
      <categoryPro>PhD</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Univ. Nice-Sophia Antipolis, since October</moreinfo>
    </person>
    <person key="apics-2012-idm433830172112">
      <firstname>Sanda</firstname>
      <lastname>Lefteriu</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>PostDoc</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Funded by Inria, since October</moreinfo>
    </person>
    <person key="apics-2011-idm548469842112">
      <firstname>Elodie</firstname>
      <lastname>Pozzi</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>PostDoc</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Funded by Inria</moreinfo>
    </person>
  </team>
  <presentation id="uid2">
    <bodyTitle>Overall Objectives</bodyTitle>
    <subsection id="uid3" level="1">
      <bodyTitle>Research Themes</bodyTitle>
      <p>The team develops constructive, function-theoretic approaches to
inverse problems arising in
modelling and design, in particular for electro-magnetic systems as well as
in the analysis of certain classes of signals.</p>
      <p>Data typically consist of measurements or desired behaviours.
The general thread is to approximate them by families of solutions
to the equations governing the underlying system.
This leads us to consider various interpolation and approximation problems in
classes of rational and meromorphic functions,
harmonic gradients, or
solutions to more general elliptic partial differential equations (PDE).
A recurring difficulty is to control the singularities of the
approximants.</p>
      <p>The mathematical tools pertain to complex and harmonic
analysis, approximation theory, potential theory,
system theory, differential topology, optimization and computer algebra.
Targeted applications include:</p>
      <simplelist>
        <li id="uid4">
          <p noindent="true">identification and synthesis of
analog microwave devices (filters, amplifiers),</p>
        </li>
        <li id="uid5">
          <p noindent="true">non-destructive control from field measurements in medical engineering
(source recovery in magneto/electro-encephalography),
paleomagnetism (determining the magnetization of rock samples),
and nuclear engineering (plasma shaping in tokamaks).</p>
        </li>
      </simplelist>
      <p>In each case, the endeavour is to develop algorithms resulting in dedicated
software.
</p>
    </subsection>
    <subsection id="uid6" level="1">
      <bodyTitle>International and industrial partners</bodyTitle>
      <simplelist>
        <li id="uid7">
          <p noindent="true">Collaboration under contract with Thales Alenia Space
(Toulouse, Cannes, and Paris), CNES (Toulouse),
XLim (Limoges), University of Bilbao (Universidad del País Vasco / Euskal Herriko Unibertsitatea, Spain).</p>
        </li>
        <li id="uid8">
          <p noindent="true">Regular contacts with research groups at
UST (Villeneuve d'Asq),
Universities of Bordeaux-I (Talence),
Orléans (MAPMO),
Pau (EPI commune Inria Magique-3D),
Provence (Marseille, CMI),
Nice (Lab. JAD),
with CEA-IRFM (Cadarache),
CWI (the Netherlands),
MIT (Boston, USA)
Michigan State University (East-Lansing, USA),
Vanderbilt University (Nashville USA),
Texas A&amp;M University (College Station USA),
State University of New-York (Albany, USA),
University of Oregon (Eugene, USA),
Politecnico di Milano (Milan, Italy),
University of Trieste (Italy),
RMC (Kingston, Canada),
University of Leeds (UK),
of Maastricht (The Netherlands),
of Cork (Ireland),
Vrije Universiteit Brussel (Belgium),
TU-Wien (Austria),
TFH-Berlin (Germany),
ENIT (Tunis),
KTH (Stockholm),
University of Cyprus (Nicosia, Cyprus),
University of Macau (Macau, China).</p>
        </li>
        <li id="uid9">
          <p noindent="true">The project is involved in the GDR-project AFHP
(CNRS),
in a EMS21-RTG NSF program (with MIT, Boston, and Vanderbilt University,
Nashville,
USA), in a LMS Grant with Leeds University (UK) and in a CSF program
(with University of Cyprus).</p>
        </li>
      </simplelist>
    </subsection>
  </presentation>
  <fondements id="uid10">
    <bodyTitle>Scientific Foundations</bodyTitle>
    <subsection id="uid11" level="1">
      <bodyTitle>Introduction</bodyTitle>
      <p>Within the extensive field of inverse problems, much of the research by APICS
deals with reconstructing solutions of classical elliptic PDEs from their
boundary behaviour. Perhaps the most basic example of such a problem is
harmonic
identification of a stable linear dynamical system: the transfer-function <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>f</mi></math></formula>
is holomorphic in the right half-pane, which means it satisfies there the
Cauchy-Riemann equation <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mover accent="true"><mi>∂</mi><mo>¯</mo></mover><mi>f</mi><mo>=</mo><mn>0</mn></mrow></math></formula>, and in principle <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>f</mi></math></formula> can be
recovered from its values on the imaginary axis, <i>e.g.</i> by Cauchy formula.</p>
      <p>Practice is not nearly as simple, for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>f</mi></math></formula> is only measured pointwise in the
pass-band of the system which makes the problem ill-posed
<ref xlink:href="#apics-2012-bid0" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Moreover, the transfer function is usually sought in
specific form,
displaying the necessary physical parameters for control and design.
For instance if <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>f</mi></math></formula> is rational of degree <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula>, it satisfies
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mover accent="true"><mi>∂</mi><mo>¯</mo></mover><mi>f</mi><mo>=</mo><msubsup><mo>∑</mo><mn>1</mn><mi>n</mi></msubsup><msub><mi>a</mi><mi>j</mi></msub><msub><mi>δ</mi><msub><mi>z</mi><mi>j</mi></msub></msub></mrow></math></formula>
where the <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>z</mi><mi>j</mi></msub></math></formula> are its poles, and finding the domain of holomorphy
(<i>i.e.</i> locating the <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>z</mi><mi>j</mi></msub></math></formula>) amounts to solve a (degenerate)
free-boundary inverse problem, this time on the left
half-plane.
To address these questions, the team has developed a two-step approach
as follows.</p>
      <simplelist>
        <label>Step 1:</label>
        <li id="uid12">
          <p noindent="true">To determine a complete
model, that is, one which is defined
for every frequency, in a sufficiently flexible function
class (<i>e.g.</i> Hardy spaces). This ill-posed issue requires
regularization, for instance constraints on the behaviour at
non-measured frequencies.</p>
        </li>
        <label>Step 2:</label>
        <li id="uid13">
          <p noindent="true">To compute a reduced order model.
This typically consists of rational approximation
of the complete model obtained in step 1, or phase-shift thereof
to account for delays. Derivation of the complete model is
important to achieve stability
of the reduced one.</p>
        </li>
      </simplelist>
      <p>Step 1 makes connection with extremal
problems and analytic operator theory, see section <ref xlink:href="#uid22" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Step 2 involves optimization, and some Schur analysis
to parametrize transfer matrices of given Mc-Millan degree
when dealing with systems having several inputs and output,
see section <ref xlink:href="#uid25" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
It also makes contact with the topology of rational functions, to count
critical points and to derive bounds, see section
<ref xlink:href="#uid23" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Moreover, this step raises
issues in approximation theory regarding the rate of convergence and whether
the singularities of the
approximant (<i>i.e.</i> its poles) converge to the singularities of the
approximated function; this is where logarithmic potential theory
becomes effective, see section <ref xlink:href="#uid26" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <p>Iterating the previous steps coupled with a sensitivity analysis
yields a tuning procedure which was first demonstrated in
<ref xlink:href="#apics-2012-bid1" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> on resonant microwave filters.</p>
      <p>Similar steps can be taken to approach design problems in
frequency domain, replacing measured behaviour by
desired behaviour. However, describing achievable responses from
the design parameters at hand is generally cumbersome,
and most constructive techniques rely on rather specific criteria
adapted to the physics of the
problem.
This is especailly true of circuits and filters, whose design classically
appeals to standard polynomial extremal problems and realization
procedures from system theory <ref xlink:href="#apics-2012-bid2" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid3" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
APICS is active in this field, where we introduced the use of
Zolotarev-like problems for microwave multiband filter design. We currently
favor interpolation techniques because of their
transparency with respect to parameter use,
see section <ref xlink:href="#uid17" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <p>In another connection, the example of harmonic identification
quickly suggests a generalization
of itself. Indeed, on identifying <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>ℂ</mi></math></formula> with <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mrow><mi>ℝ</mi></mrow><mn>2</mn></msup></math></formula>, holomorphic functions
become conjugate-gradients of harmonic functions so that
harmonic identification is, after all, a special case of a classical issue:
to recover a harmonic function on a domain from partial
knowledge of the Dirichlet-Neumann data; portion of the boundary where
data are not available may be unknown, in which case we meet a free boundary
problem. This framework for 2-D non-destructive control was first
advocated in
<ref xlink:href="#apics-2012-bid4" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and subsequently received considerable attention.
This framework makes it clear how to state similar problems
in higher dimensions and for more
general operators than the Laplacian, provided solutions are essentially
determined by the trace of their gradient on part of the boundary
which is the case for elliptic equations <footnote id="uid14" id-text="1">There is a subtle difference here between dimension 2 and higher. Indeed,
a function
holomorphic on a plane domain is defined by its non-tangential limit on a
boundary subset of positive linear measure, but there are non-constant
harmonic functions in the 3-D ball, <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>C</mi><mn>1</mn></msup></math></formula> up to the boundary sphere,
yet having vanishing gradient on a subset of positive measure of the
sphere</footnote>
<ref xlink:href="#apics-2012-bid5" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. All these questions are particular instances of the
so-called inverse potential problem, where a measure <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>μ</mi></math></formula>
has to be recovered
from knowledge of the gradient of its potential
(<i>i.e.</i>, the field) on part of a hypersurface (a curve in 2-D)
encompassing the support of
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>μ</mi></math></formula>. For Laplace's operator, potentials are logarithmic in 2-D and
Newtonian in higher dimensions. For elliptic operators with non constant
coefficients, the potential depends on
the form of fundamental solutions and is less manageable because
it is no longer of convolution type. In any case, by construction, the
operator applied to the potential yields back the measure.</p>
      <p>Inverse potential problems are severely indeterminate because infinitely many
measures within an open set produce the same field outside this set
<ref xlink:href="#apics-2012-bid6" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. In step 1 above
we implicitly removed this indeterminacy by requiring that the measure
be supported on the boundary (because we seek a function holomorphic
throughout the right half space), and in step 2
by requiring, say, in case of rational approximation
that the measure be discrete in the left half-plane. The same discreteness
assumption prevails in 3-D inverse source problems.
To recap, the gist of our approach is to approximate boundary data by
(boundary traces of) fields arising from potentials of measures
with specific support. Note this is different from standard approaches
to inverse problems, where descent algorithms are applied to
integration schemes of the direct problem; in such methods, it is the
equation which gets approximated (in fact: discretized).</p>
      <p>Along these lines, the team initiated the use of steps 1 and 2 above,
along with singularity
analysis, to approach issues of nondestructive control in 2 and 3-D
<ref xlink:href="#apics-2012-bid7" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> <ref xlink:href="#apics-2012-bid8" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid9" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. We are currently engaged
in two
kinds of generalization, further described in section <ref xlink:href="#uid16" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
The first one deals with non-constant
conductivities, where Cauchy-Riemann equations for holomorphic functions
are replaced by conjugate Beltrami equations for pseudo-holomorphic functions;
there we seek applications to plasma confinement.
The other one lies with inverse source problems for Laplace's equation
in 3-D, where holomorphic
functions are replaced by harmonic gradients, developing applications to
EEG/MEG and inverse magnetization problems in paleomagnetism,
see section <ref xlink:href="#uid30" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/></p>
      <p>The main approximation-theoretic tools developed by APICS to get to grips with
issues mentioned so far are outlined in section <ref xlink:href="#uid21" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
In section <ref xlink:href="#uid15" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> to come, we make more precise which problems are
considered and for which applications.</p>
    </subsection>
    <subsection id="uid15" level="1">
      <bodyTitle>Range of inverse problems</bodyTitle>
      <subsection id="uid16" level="2">
        <bodyTitle>Elliptic partial differential equations (PDE)</bodyTitle>
        <participants>
          <person key="apics-2006-idm538940448832">
            <firstname>Laurent</firstname>
            <lastname>Baratchart</lastname>
          </person>
          <person key="apics-2008-idm471168816912">
            <firstname>Slah</firstname>
            <lastname>Chaabi</lastname>
          </person>
          <person key="apics-2006-idm538940435888">
            <firstname>Juliette</firstname>
            <lastname>Leblond</lastname>
          </person>
          <person key="apics-2008-idm471168819984">
            <firstname>Ana-Maria</firstname>
            <lastname>Nicu</lastname>
          </person>
          <person key="apics-2012-idm433830175168">
            <firstname>Dmitry</firstname>
            <lastname>Ponomarev</lastname>
          </person>
          <person key="apics-2011-idm548469842112">
            <firstname>Elodie</firstname>
            <lastname>Pozzi</lastname>
          </person>
        </participants>
        <p>This work is done in collaboration with Alexander Borichev (Univ. Provence).</p>
        <p>Reconstructing Dirichlet-Neumann boundary conditions
for a function harmonic in a plane domain
when these are known on a strict subset <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>E</mi></math></formula> of the boundary, is equivalent to
recover a holomorphic function in the domain from its boundary values on <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>E</mi></math></formula>.
This is the problem raised on the half-plane in step 1 of section
<ref xlink:href="#uid11" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. It makes good sense in holomorphic
Hardy spaces where functions are determined by their values on
boundary subsets of positive linear measure, which
is the framework for problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math></formula> in section <ref xlink:href="#uid22" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Such problems
naturally arise in nondestructive testing of 2-D (or cylindical) materials
from partial electrical measurements on the boundary.
Indeed, the ratio between tangential and normal
currents (so-called Robin coefficient) tells about corrosion of the material.
Solving problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math></formula> where <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>ψ</mi></math></formula> is chosen to be the response of
some uncorroded piece with identical shape
allows one to approach such questions, and
this was an initial application of holomorphic extremal problems
to non-destructive control <ref xlink:href="#apics-2012-bid10" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid11" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        <p>A recent application by the team deals with non-constant conductivity
over a doubly connected domain, <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>E</mi></math></formula> being the outer boundary.
Measuring Dirichlet-Neumann data on <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>E</mi></math></formula>, we wanted to check whether the
solution is constant on the inner boundary. We first had to define
and study Hardy spaces of the conjugate Beltrami equation, of which the
conductivity equation is the compatibility condition (just like Laplace's
equation is the compatibility condition of the Cauchy-Riemann system).
This was done in references <ref xlink:href="#apics-2012-bid12" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
and <ref xlink:href="#apics-2012-bid13" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Then, solving an obvious modification of problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math></formula>
allows one to numerically check what we want.
Further, the value of this
extremal problem defines a criterion on
inner boundaries, and subsequently a descent algorithm was set up
to improve the initial boundary into one where the solution is closer
to being constant, thereby trying to solve a free boundary problem..</p>
        <p>When the domain is regarded as separating the edge of a tokamak's vessel
from the plasma (rotational symmetry makes this a 2-D problem),
the procedure just described suits plasma control from magnetic confinement.
It was successfully applied in collaboration with CEA
(the French nuclear agency) and the University of Nice (JAD Lab.)
to data from <i>Tore Supra</i> <ref xlink:href="#apics-2012-bid14" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, see section
<ref xlink:href="#uid64" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. This procedure is fast because no numerical integration of
the underlying PDE is needed, as an explicit basis of solutions to the
conjugate Beltrami equation was found in this case.</p>
        <p>Three-dimensional versions of step 1 in section
<ref xlink:href="#uid11" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> are also considered, namely to recover a harmonic function
(up to a constant) in a ball or a half-space from partial knowledge of its
gradient on the boundary. Such questions arise naturally in connection with
neurosciences and medical imaging (electroencephalography, EEG) or in
paleomagnetism (analysis of rocks magnetization)
<ref xlink:href="#apics-2012-bid9" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> <ref xlink:href="#apics-2012-bid15" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, see section <ref xlink:href="#uid57" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
They are not yet as developed as the 2-D case where the power of complex
analysis is at work, but considerable progress was made over the last years
through methods of harmonic analysis and operator theory.</p>
        <p>The team is also concerned with non-destructive control
problems of localizing defaults such as cracks,
sources or occlusions in a planar or 3-dimensional domain,
from boundary data (which may correspond to thermal, electrical, or
magnetic measurements).
These defaults can be expressed as a lack of analyticity
of the solution of the associated Dirichlet-Neumann problem
and we approach them using techniques of best rational or
meromorphic approximation on the boundary of the object
<ref xlink:href="#apics-2012-bid16" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> <ref xlink:href="#apics-2012-bid17" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
see sections <ref xlink:href="#uid23" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and <ref xlink:href="#uid30" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. In fact, the way
singularities of the approximant relate to the singularities
of the approximated function is an all-pervasive
theme in approximation theory, and for appropriate classes of functions
the location
of the poles of a best rational approximant
can be used as an estimator of the singularities of the approximated function
(see section <ref xlink:href="#uid57" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). This circle of ideas is much in the spirit of
step 2 in section
<ref xlink:href="#uid11" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        <p>A genuine 3-dimensional theory of approximation by discrete potentials, though, is still in its infancy.</p>
      </subsection>
      <subsection id="uid17" level="2">
        <bodyTitle>Systems, transfer and scattering</bodyTitle>
        <participants>
          <person key="apics-2006-idm538940448832">
            <firstname>Laurent</firstname>
            <lastname>Baratchart</lastname>
          </person>
          <person key="arenaire-2006-idm111960264528">
            <firstname>Sylvain</firstname>
            <lastname>Chevillard</lastname>
          </person>
          <person key="apics-2012-idm433830172112">
            <firstname>Sanda</firstname>
            <lastname>Lefteriu</lastname>
          </person>
          <person key="apics-2006-idm538940432864">
            <firstname>Martine</firstname>
            <lastname>Olivi</lastname>
          </person>
          <person key="apics-2006-idm538940427408">
            <firstname>Fabien</firstname>
            <lastname>Seyfert</lastname>
          </person>
        </participants>
        <p>Through initial contacts with CNES, the French space agency,
the team came to work on identification-for-tuning
of microwave electromagnetic filters used in space telecommunications
(see section <ref xlink:href="#uid31" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). The problem was
to recover, from band-limited frequency measurements, the physical
parameters of the device under examination.
The latter consists of interconnected dual-mode resonant cavities with
negligible loss, hence its scattering matrix is modelled by a
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>2</mn><mo>×</mo><mn>2</mn></mrow></math></formula> unitary-valued matrix function on the frequency line,
say the imaginary axis to fix ideas. In the bandwidth around the
resonant frequency, a modal approximation of the Helmholtz equation in the
cavities shows that this matrix is approximately rational, of Mc-Millan degree
twice the number of cavities.</p>
        <p>This is where system theory enters the scene, through the
so-called <i>realization</i> process mapping
a rational transfer function in the frequency domain
to a state-space representation of the underlying system as
a system of linear differential equations in the time domain.
Specifically, realizing the scattering matrix
allows one to construct
a virtual electrical network, equivalent to the filter,
the parameters of which mediate in between the frequency response
and the
geometric characteristics of the cavities (<i>i.e.</i> the tuning parameters).</p>
        <p>Hardy spaces, and in particular the Hilbert space <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mn>2</mn></msup></math></formula>, provide a framework to transform this classical ill-posed issue into a series of well-posed analytic and meromorphic approximation problems.
The procedure sketched in section <ref xlink:href="#uid11" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> now goes as follows:</p>
        <orderedlist>
          <li id="uid18">
            <p noindent="true">infer from the pointwise boundary data in the bandwidth
a stable transfer function (<i>i.e.</i> one which is holomorphic
in the right half-plane), that may be infinite dimensional
(numerically: of high degree). This is done by solving in the Hardy space
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mn>2</mn></msup></math></formula> of the right half-plane a problem analogous to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math></formula> in section
<ref xlink:href="#uid22" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, taking into account prior knowledge on the
decay of the response outside the bandwidth, see <ref xlink:href="#apics-2012-bid18" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
for details.</p>
          </li>
          <li id="uid19">
            <p noindent="true">From this stable model, a rational stable approximation of
appropriate degree is computed. For this a descent method is used
on the relatively compact manifold of inner matrices of given size and degree,
using a novel parametrization of stable transfer functions
<ref xlink:href="#apics-2012-bid18" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
          </li>
          <li id="uid20">
            <p noindent="true">From this rational model, realizations meeting certain constraints
imposed by the technology in use are computed
(see section <ref xlink:href="#uid65" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). These constraints typically come
from the nature and topology of the equivalent electrical network used
to model the filter. This network is composed of
resonators, coupled to each other by some specific coupling topology.
Performing this realization step for given coupling topology can be recast,
under appropriate compatibility conditions <ref xlink:href="#apics-2012-bid19" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
as the problem of solving a zero-dimensional multivariate polynomial system.
To tackle this problem in practice, we use Groebner basis techniques as
well as continuation methods as implemented in the Dedale-HF software
(<ref xlink:href="#uid50" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
          </li>
        </orderedlist>
        <p>Let us also mention that extensions of classical coupling matrix theory to
frequency-dependent (reactive) couplings have lately been carried-out
<ref xlink:href="#apics-2012-bid20" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for wide-band design applications,
but further study is needed to make them effective.</p>
        <p>Subsequently APICS started investigating issues pertaining to filter
design rather than identification.
Given the topology of the filter,
a basic problem is to find the optimal response
with respect to amplitude specifications in frequency domain
bearing on rejection, transmission and group delay of scattering parameters.
Generalizing the approach based on Tchebychev polynomials for single band
filters, we recast the problem of multi-band response synthesis
in terms of a generalization of classical Zolotarev min-max problem
<ref xlink:href="#apics-2012-bid21" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> to rational functions <ref xlink:href="#apics-2012-bid22" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Thanks to quasi-convexity, the latter
can be solved efficiently using iterative methods relying on linear
programming. These are implemented in the software easy-FF (see section <ref xlink:href="#uid52" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
        <p>Later, investigations by the team extended to design and
identification of more complex microwave devices,
like multiplexers and routers, which connect several
filters through wave guides.
Schur analysis plays an important role in such studies, which is no surprise
since scattering matrices of passive systems are of Schur type
(<i>i.e.</i> contractive in the stability region).
The theory originates with the work of I. Schur <ref xlink:href="#apics-2012-bid23" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
who devised a recursive test to
check for contractivity of a holomorphic function in the disk.
Generalizations thereof turned out to be very efficient to parametrize
solutions to contractive interpolation problems subject to
a well-known compatibility condition (positive definiteness of the so-called
Pick matrix) <ref xlink:href="#apics-2012-bid24" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Schur analysis became quite popular
in electrical engineering, as the Schur recursion precisely describes how
to chain two-port circuits.</p>
        <p>Dwelling on this, members of the team contributed to
differential parametrizations (atlases of charts) of lossless
matrix functions to the theory <ref xlink:href="#apics-2012-bid25" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/><ref xlink:href="#apics-2012-bid26" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid27" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
They are of fundamental use in our rational approximation
software RARL2 (see section <ref xlink:href="#uid40" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).
Schur analysis is also instrumental to approach de-embedding issues
considered in section <ref xlink:href="#uid66" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, and provides further
background to current studies by the team of
synthesis and adaptation problems for multiplexers.
At the heart of the latter lies a variant of contractive interpolation
with degree constraint introduced in <ref xlink:href="#apics-2012-bid28" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        <p>We also mention the role played by multipoint Schur analysis in the team's
investigation of spectral representation for certain non-stationary
discrete stochastic processes <ref xlink:href="#apics-2012-bid29" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid30" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        <p>Recently, in collaboration with UPV (Bilbao),
our attention was driven by CNES,
to questions of stability relative to high-frequency amplifiers,
see section <ref xlink:href="#uid81" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Contrary to previously mentioned devices, these are <i>active</i> components.
The amplifier can be linearized at a functioning point
and admittances of the corresponding electrical network
can be computed at various frequencies, using the so-called harmonic
balance method.
The goal is to check for stability of this linearised model.
The latter is composed of lumped electrical elements namely
inductors, capacitors, negative <i>and</i> positive reactors,
transmission lines, and commanded current sources.
Research so far focused on determining the algebraic structure
of admittance functions, and setting up a function-theoretic framework to
analyse them. In particular, much effort was put on realistic assumptions
under which a stable/unstable decomposition can be claimed in
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>H</mi><mn>2</mn></msup><mo>⊕</mo><mover><msup><mi>H</mi><mn>2</mn></msup><mo>¯</mo></mover></mrow></math></formula> (see section <ref xlink:href="#uid70" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).
Under them, the unstable part of the elements under examination
is rational and we expect to bring valuable estimates of stability
to the designer using the general scheme in section <ref xlink:href="#uid11" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      </subsection>
    </subsection>
    <subsection id="uid21" level="1">
      <bodyTitle>Approximation of boundary data</bodyTitle>
      <participants>
        <person key="apics-2006-idm538940448832">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="arenaire-2006-idm111960264528">
          <firstname>Sylvain</firstname>
          <lastname>Chevillard</lastname>
        </person>
        <person key="apics-2006-idm538940435888">
          <firstname>Juliette</firstname>
          <lastname>Leblond</lastname>
        </person>
        <person key="apics-2006-idm538940432864">
          <firstname>Martine</firstname>
          <lastname>Olivi</lastname>
        </person>
        <person key="apics-2012-idm433830175168">
          <firstname>Dmitry</firstname>
          <lastname>Ponomarev</lastname>
        </person>
        <person key="apics-2011-idm548469842112">
          <firstname>Elodie</firstname>
          <lastname>Pozzi</lastname>
        </person>
        <person key="apics-2006-idm538940427408">
          <firstname>Fabien</firstname>
          <lastname>Seyfert</lastname>
        </person>
      </participants>
      <p>The following people are collaborating with us on these topics: Bernard Hanzon (Univ. Cork, Ireland), Jean-Paul Marmorat (Centre de mathématiques appliquées (CMA), École des Mines de Paris), Jonathan Partington (Univ. Leeds, UK), Ralf Peeters (Univ. Maastricht, NL), Edward Saff (Vanderbilt University, Nashville, USA), Herbert Stahl (TFH Berlin), Maxim Yattselev (Univ. Oregon at Eugene, USA).</p>
      <subsection id="uid22" level="2">
        <bodyTitle>Best constrained analytic approximation</bodyTitle>
        <p>In dimension 2, the prototypical problem to be solved in step 1 of section
<ref xlink:href="#uid11" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> may be described as:
given a domain <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>D</mi><mo>⊂</mo><msup><mrow><mi>ℝ</mi></mrow><mn>2</mn></msup></mrow></math></formula>, we want to recover
a holomorphic function from its values on a
subset of the boundary of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula>.
Using conformal mapping, it is convenient for the discussion
to normalize <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula>.
So, in the simply connected case, we fix
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula> to be the unit disk with boundary the unit circle <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>T</mi></math></formula>.
We denote by <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mi>p</mi></msup></math></formula> the Hardy space of exponent <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>p</mi></math></formula> which is
the closure of polynomials in the <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mi>p</mi></msup></math></formula>-norm on the circle if
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>1</mn><mo>≤</mo><mi>p</mi><mo>&lt;</mo><mi>∞</mi></mrow></math></formula> and the space of bounded holomorphic functions in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula> if
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>p</mi><mo>=</mo><mi>∞</mi></mrow></math></formula>. Functions in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mi>p</mi></msup></math></formula> have well-defined boundary values in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>T</mi><mo>)</mo></mrow></mrow></math></formula>,
which makes it possible to speak of (traces of) analytic functions on
the boundary.</p>
        <p>To find an analytic function in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula>
approximately matching measured values <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>f</mi></math></formula>
on a sub-arc <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>K</mi></math></formula> of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>T</mi></math></formula>, we formulate a
constrained best approximation problem as follows.</p>
        <p rend="quoted">(<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>P</mi></math></formula>)  Let <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>1</mn><mo>≤</mo><mi>p</mi><mo>≤</mo><mi>∞</mi></mrow></math></formula>, <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>K</mi></math></formula> a sub-arc of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>T</mi></math></formula>,
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>f</mi><mo>∈</mo><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>K</mi><mo>)</mo></mrow></mrow></math></formula>, <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>ψ</mi><mo>∈</mo><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>T</mi><mo>∖</mo><mi>K</mi><mo>)</mo></mrow></mrow></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>M</mi><mo>&gt;</mo><mn>0</mn></mrow></math></formula>;
find a function <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>g</mi><mo>∈</mo><msup><mi>H</mi><mi>p</mi></msup></mrow></math></formula> such that
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mrow><mo>∥</mo><mi>g</mi><mo>-</mo><mi>ψ</mi><mo>∥</mo></mrow><mrow><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>T</mi><mo>∖</mo><mi>K</mi><mo>)</mo></mrow></mrow></msub><mo>≤</mo><mi>M</mi></mrow></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>g</mi><mo>-</mo><mi>f</mi></mrow></math></formula>
is of minimal norm in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>K</mi><mo>)</mo></mrow></mrow></math></formula> under this constraint.</p>
        <p>Here <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>ψ</mi></math></formula> is a reference behaviour capturing <i>a priori</i>
assumptions on
the behaviour of the model off <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>K</mi></math></formula>, while <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>M</mi></math></formula> is some admissible deviation
from them. The value of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>p</mi></math></formula> reflects the type of
stability which is sought and how much one wants to smoothen the data.
The choice of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mi>p</mi></msup></math></formula> classes is well-adapted to handling pointwise measurements.</p>
        <p>To fix terminology we refer to (<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>P</mi></math></formula>) as
a <i>bounded extremal problem</i>.
As shown in <ref xlink:href="#apics-2012-bid31" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid32" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
<ref xlink:href="#apics-2012-bid33" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>1</mn><mo>&lt;</mo><mi>p</mi><mo>≤</mo><mi>∞</mi></mrow></math></formula>,
the solution to this convex
infinite-dimensional optimization problem can be obtained
upon iterating with respect to a Lagrange parameter
the solution to spectral equations for
some appropriate Hankel and Toeplitz operators.
These equations in turn involve the solution to the standard extremal problem
below best approximation
problem (<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>P</mi><mn>0</mn></msub></math></formula>) below <ref xlink:href="#apics-2012-bid34" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>:</p>
        <p rend="quoted">(<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>P</mi><mn>0</mn></msub></math></formula>)  Let <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>1</mn><mo>≤</mo><mi>p</mi><mo>≤</mo><mi>∞</mi></mrow></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>ϕ</mi><mo>∈</mo><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>T</mi><mo>)</mo></mrow></mrow></math></formula>;
find a function <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>g</mi><mo>∈</mo><msup><mi>H</mi><mi>p</mi></msup></mrow></math></formula> such that
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>g</mi><mo>-</mo><mi>ϕ</mi></mrow></math></formula> is of minimal norm in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>T</mi><mo>)</mo></mrow></mrow></math></formula>.</p>
        <p>The case <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>p</mi><mo>=</mo><mn>1</mn></mrow></math></formula> of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math></formula> is essentially open.</p>
        <p>Various modifications of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math></formula> have been studied in order to meet specific
needs.
For instance when dealing with loss-less transfer functions
(see section <ref xlink:href="#uid31" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>), one may want to express
the constraint on <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>T</mi><mo>∖</mo><mi>K</mi></mrow></math></formula> in a pointwise manner: <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>|</mo><mi>g</mi><mo>-</mo><mi>ψ</mi><mo>|</mo><mo>≤</mo><mi>M</mi></mrow></math></formula> a.e. on <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>T</mi><mo>∖</mo><mi>K</mi></mrow></math></formula>, see <ref xlink:href="#apics-2012-bid35" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. In this form, it comes close
to (but still is different from) <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mi>∞</mi></msup></math></formula> frequency optimization
methods for control <ref xlink:href="#apics-2012-bid36" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid37" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        <p>The analog of problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math></formula> on an annulus,
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>K</mi></math></formula> being now the outer boundary, can be seen as a means to regularize
a classical inverse problem occurring in nondestructive control,
namely recovering a harmonic function on
the inner boundary from Dirichlet-Neumann data on the
outer boundary (see sections <ref xlink:href="#uid16" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#uid30" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#uid58" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#uid64" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). For <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>p</mi><mo>=</mo><mn>2</mn></mrow></math></formula> the solution is analysed in
<ref xlink:href="#apics-2012-bid38" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. It may serve as a tool to approach
Bernoulli type problems where we are given data on the outer boundary
and we <i>seek the inner
boundary</i>, knowing it is a level curve of the flux.
Then, the Lagrange parameter indicates
which deformation should be applied on the inner contour in order to improve
data fitting.</p>
        <p>This is discussed in sections <ref xlink:href="#uid16" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and <ref xlink:href="#uid64" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
for more general equations than the Laplacian, namely
isotropic conductivity equations of the form
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi> div </mi><mo>(</mo><mi>σ</mi><mi>∇</mi><mi>u</mi><mo>)</mo><mo>=</mo><mn>0</mn></mrow></math></formula> where
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>σ</mi></math></formula> is non constant. In this case Hardy spaces in problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math></formula> become
those of a so-called conjugate or real Beltrami equation <ref xlink:href="#apics-2012-bid39" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
which are studied for
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>1</mn><mo>&lt;</mo><mi>p</mi><mo>&lt;</mo><mi>∞</mi></mrow></math></formula> in
<ref xlink:href="#apics-2012-bid12" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid13" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Expansions
of solutions needed to constructively handle such issues have been
carried out in  <ref xlink:href="#apics-2012-bid14" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        <p>Though originally considered in dimension 2,
problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math></formula> carries over naturally to higher dimensions where analytic
functions get replaced by gradients of harmonic functions.
Namely, given some open set <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>Ω</mi><mo>⊂</mo><msup><mrow><mi>ℝ</mi></mrow><mi>n</mi></msup></mrow></math></formula> and
a <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mrow><mi>ℝ</mi></mrow><mi>n</mi></msup></math></formula>-valued vector <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>V</mi></math></formula> field on
an open subset <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>O</mi></math></formula> of the boundary of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Ω</mi></math></formula>, we seek a harmonic function in
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Ω</mi></math></formula> whose gradient is close to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>V</mi></math></formula> on <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>O</mi></math></formula>.</p>
        <p>When <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Ω</mi></math></formula> is a ball or a half-space, a convenient substitute of
holomorphic Hardy spaces is provided by Stein-Weiss Hardy spaces of
harmonic gradients <ref xlink:href="#apics-2012-bid40" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Conformal maps are no longer available
in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mrow><mi>ℝ</mi></mrow><mi>n</mi></msup></math></formula> for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>n</mi><mo>&gt;</mo><mn>2</mn></mrow></math></formula> and other geometries have not
been much studied so far. On the ball, the analog
of problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math></formula> is</p>
        <p rend="quoted">(<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>P</mi><mn>1</mn></mrow></math></formula>)  Let <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>1</mn><mo>≤</mo><mi>p</mi><mo>≤</mo><mi>∞</mi></mrow></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>B</mi><mo>⊂</mo><msup><mrow><mi>ℝ</mi></mrow><mi>n</mi></msup></mrow></math></formula> the unit ball.
Fix <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>O</mi></math></formula> an open subset of the unit sphere
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>S</mi><mo>⊂</mo><msup><mrow><mi>ℝ</mi></mrow><mi>n</mi></msup></mrow></math></formula>. Let further
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>V</mi><mo>∈</mo><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>O</mi><mo>)</mo></mrow></mrow></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>W</mi><mo>∈</mo><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>S</mi><mo>∖</mo><mi>O</mi><mo>)</mo></mrow></mrow></math></formula>
be <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mrow><mi>ℝ</mi></mrow><mi>n</mi></msup></math></formula>-valued vector fields, and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>M</mi><mo>&gt;</mo><mn>0</mn></mrow></math></formula>;
find a harmonic gradient <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>G</mi><mo>∈</mo><msup><mi>H</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>B</mi><mo>)</mo></mrow></mrow></math></formula> such that
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mrow><mo>∥</mo><mi>G</mi><mo>-</mo><mi>W</mi><mo>∥</mo></mrow><mrow><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>S</mi><mo>∖</mo><mi>O</mi><mo>)</mo></mrow></mrow></msub><mo>≤</mo><mi>M</mi></mrow></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>G</mi><mo>-</mo><mi>V</mi></mrow></math></formula>
is of minimal norm in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>O</mi><mo>)</mo></mrow></mrow></math></formula> under this constraint.</p>
        <p>When <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>p</mi><mo>=</mo><mn>2</mn></mrow></math></formula>,
spherical harmonics offer a reasonable substitute
to Fourier expansions and problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>P</mi><mn>1</mn><mo>)</mo></mrow></math></formula> was solved in <ref xlink:href="#apics-2012-bid9" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
together with its natural analog on a shell.
The solution generalizes the Toeplitz
operator approach to bounded extremal problems <ref xlink:href="#apics-2012-bid31" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
and constructive
aspects of the procedure (harmonic 3-D projection, Kelvin and Riesz
transformation, spherical harmonics) were derived.
An important ingredient is a refinement of the Hodge
decomposition allowing us to
express a <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mrow><mi>ℝ</mi></mrow><mi>n</mi></msup></math></formula>-valued vector field in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>S</mi><mo>)</mo></mrow></mrow></math></formula>, <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>1</mn><mo>&lt;</mo><mi>p</mi><mo>&lt;</mo><mi>∞</mi></mrow></math></formula>,
as the sum of a
vector field in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>H</mi><mo>(</mo><mi>B</mi><mo>)</mo></mrow></math></formula>, a vector field in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>H</mi><mi>p</mi></msup><mrow><mo>(</mo></mrow><msup><mrow><mi>ℝ</mi></mrow><mi>n</mi></msup><mo>∖</mo><mover><mi>B</mi><mo>¯</mo></mover></mrow></math></formula>,
and a tangential divergence free vector field. If <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>p</mi><mo>=</mo><mn>1</mn></mrow></math></formula> or <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>p</mi><mo>=</mo><mi>∞</mi></mrow></math></formula>,
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mi>p</mi></msup></math></formula> must be replaced respectively by the real Hardy space <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mn>1</mn></msup></math></formula> and the
bounded mean oscillation space <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>B</mi><mi>M</mi><mi>O</mi></mrow></math></formula>, and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mi>∞</mi></msup></math></formula> should be modified
accordingly.
This decomposition was fully discussed in <ref xlink:href="#apics-2012-bid15" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
(for the case of the half-space) where it plays a fundamental role.</p>
        <p>Problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>P</mi><mn>1</mn><mo>)</mo></mrow></math></formula> is still under investigation in the case <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>p</mi><mo>=</mo><mi>∞</mi></mrow></math></formula>,
where even the case where <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>O</mi><mo>=</mo><mi>S</mi></mrow></math></formula> is pending because
a substitute of the Adamjan-Arov-Krein theory <ref xlink:href="#apics-2012-bid41" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
is still to be built in dimension greater than 2.</p>
        <p>Such problems arise in connection with
source recovery in electro/mgneto encephalography and paleomagnetism, as
discussed in sections <ref xlink:href="#uid16" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and <ref xlink:href="#uid30" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      </subsection>
      <subsection id="uid23" level="2">
        <bodyTitle>Best meromorphic and rational approximation</bodyTitle>
        <p>The techniques explained in this section are used to solve
step 2 in section <ref xlink:href="#uid15" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> <i>via</i> conformal mapping
and subsequently instrumental to
approach inverse boundary value problems
for Poisson equation <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>Δ</mi><mi>u</mi><mo>=</mo><mi>μ</mi></mrow></math></formula>,
where <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>μ</mi></math></formula> is some (unknown) distribution.</p>
        <subsection id="uid24" level="3">
          <bodyTitle>Scalar meromorphic and rational approximation</bodyTitle>
          <p>Let as before <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula> designate the unit disk, and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>T</mi></math></formula> the unit circle.
We further put <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>R</mi><mi>N</mi></msub></math></formula> for the set of rational functions
with at most <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>N</mi></math></formula> poles in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula>, which allows us to
define the meromorphic functions
in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>T</mi><mo>)</mo></mrow></mrow></math></formula> as the traces of functions in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>H</mi><mi>p</mi></msup><mo>+</mo><msub><mi>R</mi><mi>N</mi></msub></mrow></math></formula>.</p>
          <p>A natural generalization of problem (<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>P</mi><mn>0</mn></msub></math></formula>) is:</p>
          <p rend="quoted">(<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>P</mi><mi>N</mi></msub></math></formula>)  Let <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>1</mn><mo>≤</mo><mi>p</mi><mo>≤</mo><mi>∞</mi></mrow></math></formula>, <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>N</mi><mo>≥</mo><mn>0</mn></mrow></math></formula> an integer, and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>f</mi><mo>∈</mo><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>T</mi><mo>)</mo></mrow></mrow></math></formula>;
find a function <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>g</mi><mi>N</mi></msub><mo>∈</mo><msup><mi>H</mi><mi>p</mi></msup><mo>+</mo><msub><mi>R</mi><mi>N</mi></msub></mrow></math></formula> such that
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>g</mi><mi>N</mi></msub><mo>-</mo><mi>f</mi></mrow></math></formula> is of minimal norm in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>T</mi><mo>)</mo></mrow></mrow></math></formula>.</p>
          <p>Only for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>p</mi><mo>=</mo><mi>∞</mi></mrow></math></formula> and continuous <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>f</mi></math></formula> it is known how to solve
(<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>P</mi><mi>N</mi></msub></math></formula>) in closed form. The unique solution is given by AAK theory (named after Adamjan, Arov and Krein),
that connects the spectral decomposition of Hankel operators with best approximation in Hankel norm  <ref xlink:href="#apics-2012-bid41" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
This theory allows one to express <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>g</mi><mi>N</mi></msub></math></formula> in terms of the singular vectors of
the Hankel operator with symbol <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>f</mi></math></formula>. The continuity of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>g</mi><mi>N</mi></msub></math></formula> as a function
of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>f</mi></math></formula> only holds for stronger norms than uniform.</p>
          <p>The case <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>p</mi><mo>=</mo><mn>2</mn></mrow></math></formula> is of special importance.
In particular when <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>f</mi><mo>∈</mo><msup><mrow><mover accent="true"><mi>H</mi><mo>¯</mo></mover></mrow><mn>2</mn></msup></mrow></math></formula>, the Hardy space of exponent 2 of the
<i>complement</i> of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula> in the complex plane (by definition,
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>h</mi><mo>(</mo><mi>z</mi><mo>)</mo></mrow></math></formula> belongs to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mrow><mover accent="true"><mi>H</mi><mo>¯</mo></mover></mrow><mi>p</mi></msup></math></formula> if, and only if <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>h</mi><mo>(</mo><mn>1</mn><mo>/</mo><mi>z</mi><mo>)</mo></mrow></math></formula> belongs to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mi>p</mi></msup></math></formula>),
then
(<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>P</mi><mi>N</mi></msub></math></formula>) reduces to rational approximation. Moreover,
it turns out that the associated solution <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>g</mi><mi>N</mi></msub><mo>∈</mo><msub><mi>R</mi><mi>N</mi></msub></mrow></math></formula> has no pole outside <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula>,
hence it is a <i>stable</i> rational
approximant to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>f</mi></math></formula>. However, in contrast with the situation
when <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>p</mi><mo>=</mo><mi>∞</mi></mrow></math></formula>, this approximant may <i>not</i> be unique.</p>
          <p>The former Miaou project (predecessor of Apics) has designed an
adapted steepest-descent algorithm
for the case <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>p</mi><mo>=</mo><mn>2</mn></mrow></math></formula> whose convergence to a <i>local minimum</i> is
guaranteed; until now it seems to be the only procedure meeting this
property. Roughly speaking, it is a gradient algorithm that proceeds
recursively with respect to the order <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>N</mi></math></formula> of the approximant,
in a compact region of the parameter space <ref xlink:href="#apics-2012-bid42" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Although it has proved
effective in all applications carried out so far
(see sections <ref xlink:href="#uid30" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#uid31" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>),
it is not known whether the absolute minimum can
always be obtained by
choosing
initial conditions corresponding to <i>critical points</i> of lower degree
(as is done by the RARL2 software, section <ref xlink:href="#uid40" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
          <p>In order to establish global convergence results, APICS has undertook a
long-term study of the number and nature of critical points, in which
tools from differential topology and
operator theory team up with classical approximation theory.
The main discovery is that
the nature of the critical points
(<i>e.g.</i>, local minima, saddles...)
depends on the decrease of the interpolation
error to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>f</mi></math></formula> as <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>N</mi></math></formula> increases <ref xlink:href="#apics-2012-bid43" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Based on this, sufficient conditions
have been developed for a local minimum to be unique.
These conditions are hard to use in practice because they require
strong estimates of the approximation error. These
are often difficult to obtain for a given function, and are usually only
valid for large <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>N</mi></math></formula>.
Examples where uniqueness or asymptotic uniqueness has been proved this way
include transfer functions of relaxation
systems (<i>i.e.</i>
Markov functions) <ref xlink:href="#apics-2012-bid44" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and more
generally Cauchy integrals over hyperbolic geodesic
arcs <ref xlink:href="#apics-2012-bid45" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and certain entire functions  <ref xlink:href="#apics-2012-bid46" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
          <p>An analog to AAK theory
has been carried out for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>2</mn><mo>≤</mo><mi>p</mi><mo>&lt;</mo><mi>∞</mi></mrow></math></formula> <ref xlink:href="#apics-2012-bid33" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Although not
computationally as powerful, it can be used to derive lower bounds
and helps analysing the behaviour of poles.
When <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>1</mn><mo>≤</mo><mi>p</mi><mo>&lt;</mo><mn>2</mn></mrow></math></formula>, problem (<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>P</mi><mi>N</mi></msub></math></formula>) is still fairly open.</p>
          <p>A common
feature to all these problems
is that critical point equations
express non-Hermitian orthogonality relations for the denominator
of the approximant. This makes connection with interpolation theory
<ref xlink:href="#apics-2012-bid47" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/><ref xlink:href="#apics-2012-bid48" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and
is used in an essential manner to assess the
behaviour of the poles of the approximants to functions with branchpoint-type
singularities,
which is of particular interest for inverse source problems
(<i>cf.</i> sections <ref xlink:href="#uid53" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and <ref xlink:href="#uid57" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
          <p>In higher dimensions, the analog of problem (<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>P</mi><mi>N</mi></msub></math></formula>) is the approximation of
a vector field with gradients of
potentials generated by <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>N</mi></math></formula> point masses instead of meromorphic functions.
The issue is by no means understood at present,
and is a major endeavour of future research
problems.</p>
          <p>Certain constrained rational approximation problems, of special interest
in identification
and design of passive systems, arise when putting additional
requirements on the approximant, for instance that it should be smaller than 1
in modulus.
Such questions have become over years an increasingly significant
part of the team's
activity (see section <ref xlink:href="#uid31" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).
For instance, convergence properties of multipoint Schur approximants,
which are rational interpolants preserving
contractivity of a function, were analysed in
<ref xlink:href="#apics-2012-bid29" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Such approximants are useful in prediction theory of
stochastic processes, but since they interpolate inside the domain of
holomorphy
they are of limited use in frequency design.</p>
          <p>In another connection,
the generalization to several arcs
of classical Zolotarev problems <ref xlink:href="#apics-2012-bid49" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
is an achievement by the team which is useful for multiband synthesis
<ref xlink:href="#apics-2012-bid22" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Still, though the modulus of the response
is the first concern in filter design, variation of the phase
must nevertheless remain under control to avoid unacceptable distortion of
the signal. This specific but important issue has less structure and was
approached using constrained optimization; a dedicated code has been
developed under contract with the CNES (see section <ref xlink:href="#uid52" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
        </subsection>
        <subsection id="uid25" level="3">
          <bodyTitle>Matrix-valued rational approximation</bodyTitle>
          <p>Matrix-valued approximation is necessary for handling systems with several
inputs and outputs, and it generates substantial additional difficulties
with respect to scalar approximation,
theoretically as well as algorithmically. In the matrix case,
the McMillan degree (<i>i.e.</i> the degree of a minimal realization in
the System-Theoretic sense) generalizes the degree.</p>
          <p>The problem we want to consider reads:
<i>Let <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>ℱ</mi><mo>∈</mo><msup><mrow><mo>(</mo><msup><mi>H</mi><mn>2</mn></msup><mo>)</mo></mrow><mrow><mi>m</mi><mo>×</mo><mi>l</mi></mrow></msup></mrow></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula> an
integer; find a rational matrix of size <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>m</mi><mo>×</mo><mi>l</mi></mrow></math></formula> without
poles in the unit disk and of McMillan degree at most <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula> which is nearest possible
to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>ℱ</mi></math></formula> in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mrow><mo>(</mo><msup><mi>H</mi><mn>2</mn></msup><mo>)</mo></mrow><mrow><mi>m</mi><mo>×</mo><mi>l</mi></mrow></msup></math></formula>.</i>
Here the <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mn>2</mn></msup></math></formula> norm of a matrix is the square root of the sum of the
squares of the norms of its entries.</p>
          <p>The scalar approximation algorithm <ref xlink:href="#apics-2012-bid42" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, mentioned in section
<ref xlink:href="#uid24" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
generalizes to
the matrix-valued situation <ref xlink:href="#apics-2012-bid50" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. The
first difficulty here consists in the parametrization
of transfer matrices of given
McMillan degree <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula>, and the inner matrices (<i>i.e.</i> matrix-valued functions
that are analytic in the unit disk and unitary on the circle) of degree <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula>. The latter
enter the picture in an essential manner as they play the role of the denominator
in a fractional representation of transfer matrices (using the so-called
Douglas-Shapiro-Shields factorization).
The set of inner matrices of given degree has the structure of a smooth manifold that allows one to use differential tools
as in the scalar case. In practice, one has to produce an atlas of charts (parametrization valid in a neighborhood of a
point), and we must handle changes of charts in the course of the algorithm. Such parametrization can be obtained from
interpolation theory and Schur type algorithms, the parameters being interpolation vectors or matrices
( <ref xlink:href="#apics-2012-bid25" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid27" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid26" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). Some of
them are particularly interesting to compute
realizations and achieve filter synthesis
(<ref xlink:href="#apics-2012-bid27" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> <ref xlink:href="#apics-2012-bid26" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).
Rational approximation software codes have been developed
in the team (see sections <ref xlink:href="#uid40" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
          <p>Difficulties relative to multiple local minima naturally arise in
the matrix-valued case as well, and deriving criteria that
guarantee uniqueness is even
more difficult than in the scalar case. The case of rational functions
of sought degree or small perturbations thereof
(the consistency problem) was solved in
  <ref xlink:href="#apics-2012-bid51" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. The case of matrix-valued Markov functions, the first example beyond rational functions, was treated in <ref xlink:href="#apics-2012-bid52" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
          <p>Let us stress that the algorithms mentioned above are first to
handle rational approximation in the matrix case in a way that converges to
local minima, while meeting stability constraints on the approximant.</p>
        </subsection>
      </subsection>
      <subsection id="uid26" level="2">
        <bodyTitle>Behavior of poles of meromorphic approximants</bodyTitle>
        <participants>
          <person key="apics-2006-idm538940448832">
            <firstname>Laurent</firstname>
            <lastname>Baratchart</lastname>
          </person>
        </participants>
        <p>The following people collaborate with us on this subject: Herbert Stahl (TFH Berlin), Maxim Yattselev (Univ. Oregon at Eugene, USA).</p>
        <p>We refer here to the behaviour of poles of best
meromorphic approximants, in the <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mi>p</mi></msup></math></formula>-sense on a closed curve,
to functions <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>f</mi></math></formula> defined as Cauchy integrals of complex
measures whose support lies inside the curve. If one
normalizes the contour to be the unit circle <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>T</mi></math></formula>,
we are back to the framework of
section <ref xlink:href="#uid24" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and to problem (<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>P</mi><mi>N</mi></msub></math></formula>);
invariance of the problem under conformal
mapping was established in <ref xlink:href="#apics-2012-bid8" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Research so far has focused
on functions whose singular set inside the contour is zero or one-dimensional.</p>
        <p>Generally speaking, the
behaviour of poles is particularly important in meromorphic approximation
to obtain error rates as the degree goes large and to tackle
constructive issues like
uniqueness. As explained in section <ref xlink:href="#uid16" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
we consider this issue in connection with
approximation of the solution to a
Dirichlet-Neumann problem, so as to extract information on the
singularities. The general theme is thus <i>how do the singularities
of the approximant reflect those of the approximated function?</i>
This approach to inverse problem for the 2-D Laplacian turns out
to be attractive when singularities
are zero- or one-dimensional (see section <ref xlink:href="#uid30" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). It can be used
as a computationally cheap
initialization of more precise but heavier
numerical optimizations.</p>
        <p>As regards crack detection or source recovery, the approach in
question boils
down to
analysing the behaviour of best meromorphic
approximants of a function with branch points.
For piecewise analytic cracks, or in the case of sources, We were able to
prove (<ref xlink:href="#apics-2012-bid8" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid53" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid54" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>) that the poles of the
approximants accumulate on some extremal contour of minimum weighted energy
linkings the singular points of the crack, or the sources
<ref xlink:href="#apics-2012-bid7" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Moreover, the asymptotic density
of the poles turns out to be the Green equilibrium distribution
of this contour in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula>, hence puts heavy charge around the
singular points (in particular at the endpoints) which are therefore
well localized if one is able to approximate in
sufficiently high degree (this is where the method could fail).</p>
        <p>The case of two-dimensional singularities is still an outstanding open problem.</p>
        <p>It is interesting that inverse source problems inside
a sphere or an ellipsoid in 3-D can
be attacked with the above 2-D techniques, as applied to planar
sections (see section <ref xlink:href="#uid57" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
      </subsection>
      <subsection id="uid27" level="2">
        <bodyTitle>Miscellaneous</bodyTitle>
        <participants>
          <person key="arenaire-2006-idm111960264528">
            <firstname>Sylvain</firstname>
            <lastname>Chevillard</lastname>
          </person>
        </participants>
        <p>Sylvain Chevillard, joined team in November 2010. His coming
resulted in APICS hosting a research activity in certified computing,
centered around the software <i>Sollya</i> of which S. Chevillard is a
co-author, see section <ref xlink:href="#uid55" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. On the one hand, Sollya is an
Inria software which still requires some tuning to a growing community of
users. On the other hand, approximation-theoretic methods
at work in Sollya are potentially useful for certified solutions to
constrained analytic problems described in section <ref xlink:href="#uid22" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
However, developing Solya is not a long-term objective of APICS.</p>
      </subsection>
    </subsection>
  </fondements>
  <domaine id="uid28">
    <bodyTitle>Application Domains</bodyTitle>
    <subsection id="uid29" level="1">
      <bodyTitle>Introduction</bodyTitle>
      <p>These domains are related to the problems described in sections <ref xlink:href="#uid16" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and <ref xlink:href="#uid17" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. They are handled
using the techniques described in section <ref xlink:href="#uid21" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
    </subsection>
    <subsection id="uid30" level="1">
      <bodyTitle>Inverse problems
for elliptic PDE</bodyTitle>
      <participants>
        <person key="apics-2006-idm538940448832">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="apics-2006-idm538940435888">
          <firstname>Juliette</firstname>
          <lastname>Leblond</lastname>
        </person>
        <person key="apics-2008-idm471168819984">
          <firstname>Ana-Maria</firstname>
          <lastname>Nicu</lastname>
        </person>
        <person key="apics-2012-idm433830175168">
          <firstname>Dmitry</firstname>
          <lastname>Ponomarev</lastname>
        </person>
      </participants>
      <p>This work is done in collaboration with Maureen Clerc and Théo Papadopoulo from the Athena project-team.</p>
      <p>Solving overdetermined Cauchy problems for the Laplace equation on a
spherical layer (in 3-D) in order to extrapolate
incomplete data (see section <ref xlink:href="#uid16" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>) is
a necessary
ingredient of the team's approach to inverse source problems, in particular
for applications to EEG since the latter involves propagating the
initial conditions through several layers of different conductivities,
from the boundary
down to the center of the domain where the
singularities (<i>i.e.</i> the sources) lie.
Actually, once propagated
to the innermost sphere, it turns out that that traces of the
boundary data on 2-D cross sections (disks) coincide
with analytic functions in the slicing plane,
that has branched singularities inside the disk <ref xlink:href="#apics-2012-bid16" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. These
singularities are
related to the actual location of the sources (namely, they reach in turn a
maximum in modulus when the plane contains one of the sources). Hence, we are
back to the 2-D framework of section <ref xlink:href="#uid26" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
where approximately recovering these singularities
can be performed using best rational approximation.</p>
      <p>Numerical experiments gave
very good results on simulated data and we are now proceeding with
real experimental magneto-encephalographic data, see
also sections <ref xlink:href="#uid53" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and <ref xlink:href="#uid57" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
The PhD thesis of A.-M. Nicu <ref xlink:href="#apics-2012-bid55" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> was concerned with these
applications, see <ref xlink:href="#apics-2012-bid17" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
in collaboration with the Athena team at Inria Sophia Antipolis, and
neuroscience teams in partner-hospitals (hosp. Timone, Marseille).</p>
      <p>Similar inverse potential problems appear naturally in
magnetic reconstruction. A particular
application, which is the object of a joint NSF project with
Vanderbilt University and MIT, is to geophysics. There, the remanent
magnetization of a rock is to be analysed
to draw information on magnetic reversals and to
reconstruct the rock history. Recently developed
scanning magnetic microscopes measure the magnetic field down to
very small scales in a “thin plate” geological
sample at the Laboratory of planetary sciences at MIT,
and the magnetization has to be recovered from the field measured on a plane
located at small distance above the slab.</p>
      <p>Mathematically
speaking, EEG and magnetization inverse problems both amount to recover the (3-D valued) quantity <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>m</mi></math></formula> (primary current density in case of the brain
or magnetization in case of a thin slab of rock)
from measurements of the vector
potential:</p>
      <p>
        <formula type="display">
          <math xmlns="http://www.w3.org/1998/Math/MathML" mode="display" overflow="scroll">
            <mrow>
              <msub>
                <mo>∫</mo>
                <mi>Ω</mi>
              </msub>
              <mfrac>
                <mrow>
                  <mtext>div</mtext>
                  <mspace width="0.166667em"/>
                  <mi>m</mi>
                  <mrow>
                    <mo>(</mo>
                    <msup>
                      <mi>x</mi>
                      <mo>'</mo>
                    </msup>
                    <mo>)</mo>
                  </mrow>
                  <mspace width="0.166667em"/>
                  <mi>d</mi>
                  <msup>
                    <mi>x</mi>
                    <mo>'</mo>
                  </msup>
                </mrow>
                <mrow>
                  <mrow>
                    <mo>|</mo>
                    <mi>x</mi>
                    <mo>-</mo>
                  </mrow>
                  <msup>
                    <mi>x</mi>
                    <mo>'</mo>
                  </msup>
                  <mrow>
                    <mo>|</mo>
                  </mrow>
                </mrow>
              </mfrac>
              <mspace width="0.166667em"/>
              <mo>,</mo>
            </mrow>
          </math>
        </formula>
      </p>
      <p noindent="true">outside the volume <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Ω</mi></math></formula> of the object, from Maxwell's equations.</p>
      <p>The team is also getting engaged in
problems with variable conductivity governed by a 2-D conjugate-Beltrami
equation, see
<ref xlink:href="#apics-2012-bid12" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid14" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid13" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
The application we have in mind is to plasma confinement for
thermonuclear fusion in a Tokamak, more precisely with the extrapolation of
magnetic data on the boundary of the chamber from the outer boundary of the
plasma, which is a level curve for the poloidal flux solving the original
div-grad equation. Solving this inverse problem of Bernoulli type
is of importance to determine the
appropriate boundary conditions to be applied to the chamber in order to
shape the plasma <ref xlink:href="#apics-2012-bid56" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
These issues are the topics of the PhD theses of S. Chaabi and D. Ponomarev <ref xlink:href="#apics-2012-bid57" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, and of
a joint collaboration with the Laboratoire J.-A. Dieudonné at the Univ. of Nice-SA (and the Inria team Castor), and
the CMI-LATP at the Univ. of Aix-Marseille I (see section <ref xlink:href="#uid64" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).
</p>
    </subsection>
    <subsection id="uid31" level="1">
      <bodyTitle>Identification and design of microwave devices</bodyTitle>
      <participants>
        <person key="apics-2006-idm538940448832">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="arenaire-2006-idm111960264528">
          <firstname>Sylvain</firstname>
          <lastname>Chevillard</lastname>
        </person>
        <person key="apics-2006-idm538940432864">
          <firstname>Martine</firstname>
          <lastname>Olivi</lastname>
        </person>
        <person key="apics-2006-idm538940427408">
          <firstname>Fabien</firstname>
          <lastname>Seyfert</lastname>
        </person>
      </participants>
      <p>This work is done in collaboration with Stéphane Bila (XLim, Limoges) and Jean-Paul Marmorat (Centre de mathématiques appliquées (CMA), École des Mines de Paris).</p>
      <p>One of the best training grounds for the research of the team in function
theory is the identification and design of physical systems for which the
linearity assumption works well in the considered range of frequency,
and whose
specifications are made in the frequency domain. This is the case of
electromagnetic resonant systems which are of
common use in
telecommunications.</p>
      <p>In space telecommunications (satellite transmissions),
constraints specific to on-board technology lead to the use of filters
with resonant cavities in the microwave range.
These filters serve multiplexing purposes (before or after
amplification), and consist of a sequence of cylindrical hollow
bodies, magnetically coupled by irises (orthogonal double slits). The
electromagnetic wave that traverses the cavities satisfies the Maxwell
equations, forcing the tangent electrical field along the body of
the cavity to be zero. A deeper study (of the Helmholtz
equation) states that essentially only a discrete set of wave vectors is
selected. In the
considered range of frequency, the electrical field in each cavity can be seen
as being
decomposed along two orthogonal modes, perpendicular to the axis of the cavity
(other modes are far off in the frequency domain, and their influence can be neglected).</p>
      <object id="uid32">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/bibande11p4z.png" type="float" width="427.0pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>Picture of a 6-cavities dual mode filter. Each cavity (except the last one) has 3 screws to couple the modes within the
cavity, so that 16 quantities must be optimized. Quantities such as the diameter and length of the cavities, or
the width of the 11 slits are fixed during the design phase.</caption>
      </object>
      <p>Each cavity (see Figure <ref xlink:href="#uid32" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>) has three screws, horizontal, vertical and
midway (horizontal and vertical are two arbitrary directions, the third
direction makes an angle of 45 or 135 degrees, the easy case is when all
cavities show the same orientation, and when the directions of the irises are
the same, as well as the input and output slits). Since the screws are
conductors, they act more or less as capacitors; besides, the
electrical field on the surface has to be zero, which modifies the boundary conditions
of one of the two modes (for the other mode, the electrical field is zero
hence it is not influenced by the screw), the third screw acts as a coupling
between the two modes. The effect of the iris is to the contrary of a
screw: no condition is imposed where there is a hole, which results in a
coupling between two horizontal (or two vertical) modes of adjacent cavities
(in fact the iris is the union of two rectangles, the important parameter
being their width). The design of a filter consists in finding the size
of each cavity, and the width of each iris. Subsequently, the filter can be
constructed and tuned by adjusting the screws. Finally, the screws are glued.
In what follows, we shall consider a typical example, a filter designed by the
CNES in Toulouse, with four cavities near 11 Ghz.</p>
      <p>Near the resonance frequency, a good approximation of the Maxwell equations is
given by the solution of a second order differential equation. One obtains
thus an electrical model for our filter as a sequence of electrically-coupled
resonant circuits, and each circuit will be modelled by two resonators, one
per mode, whose resonance frequency represents the frequency of a mode, and
whose resistance represent the electric losses (current on the surface).</p>
      <p>In this way, the filter can be seen as a quadripole, with two ports, when
plugged on a resistor at one end and fed with some potential at the other end.
We are
then interested in the power which is transmitted and reflected. This leads to
defining a
scattering matrix <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>S</mi></math></formula>, that can be considered as the transfer function of a
stable causal linear dynamical system, with two inputs and two outputs. Its
diagonal terms <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>S</mi><mrow><mn>1</mn><mo>,</mo><mn>1</mn></mrow></msub></math></formula>, <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>S</mi><mrow><mn>2</mn><mo>,</mo><mn>2</mn></mrow></msub></math></formula> correspond to reflections at each port,
while
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>S</mi><mrow><mn>1</mn><mo>,</mo><mn>2</mn></mrow></msub></math></formula>, <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>S</mi><mrow><mn>2</mn><mo>,</mo><mn>1</mn></mrow></msub></math></formula> correspond to transmission. These functions can be
measured at certain frequencies (on the imaginary axis).
The filter is rational of order 4 times the number of cavities
(that is 16 in the
example), and the key step consists in expressing the components of the
equivalent electrical circuit as a function of the <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>S</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub></math></formula> (since there are no
formulas expressing the lengths of the screws in terms of parameters of this
electrical model). This representation is also useful
to analyze the numerical simulations of the Maxwell equations, and
to check the design, particularly the
absence of higher resonant modes.</p>
      <p>In fact, resonance is not studied via the electrical model,
but via a low-pass
equivalent circuit obtained upon linearising near the central frequency, which is no
longer
conjugate symmetric (<i>i.e.</i> the underlying system may not have real
coefficients) but whose degree is divided by 2 (8 in the example).</p>
      <p>In short, the identification strategy is as follows:</p>
      <simplelist>
        <li id="uid33">
          <p noindent="true">measuring the scattering matrix of the filter near the
optimal frequency over twice the pass band
(which is 80Mhz in the example).</p>
        </li>
        <li id="uid34">
          <p noindent="true">Solving bounded extremal problems for the transmission
and the reflection (the modulus of he response
being respectively
close to 0 and 1 outside the interval measurement, cf. section <ref xlink:href="#uid22" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).
This provides us with a scattering matrix of order roughly 1/4 of the number of
data points.</p>
        </li>
        <li id="uid35">
          <p noindent="true">Approximating this scattering matrix by a rational transfer-function
of fixed degree
(8 in this example)
via the Endymion or RARL2 software (cf. section <ref xlink:href="#uid25" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
        </li>
        <li id="uid36">
          <p noindent="true">A realization of the transfer function is thus obtained, and
some additional symmetry constraints are imposed.</p>
        </li>
        <li id="uid37">
          <p noindent="true">Finally one builds a realization of the approximant
and looks for a
change of variables that eliminates non-physical couplings.
This is obtained by
using algebraic-solvers and continuation
algorithms on the group of orthogonal complex matrices (symmetry
forces this type of transformation).</p>
        </li>
      </simplelist>
      <object id="uid38">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/nappratS22.png" type="float" width="199.16928pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>Nyquist Diagram. Rational approximation (degree 8) and data - <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>S</mi><mn>22</mn></msub></math></formula>.</caption>
      </object>
      <p>The final approximation is of high quality. This can be interpreted as
a validation of the linearity hypothesis for the system:
the relative <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mn>2</mn></msup></math></formula> error is less than <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mn>10</mn><mrow><mo>-</mo><mn>3</mn></mrow></msup></math></formula>.
This is illustrated by a reflection diagram
(Figure <ref xlink:href="#uid38" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). Non-physical couplings are less than <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mn>10</mn><mrow><mo>-</mo><mn>2</mn></mrow></msup></math></formula>.</p>
      <p>The above considerations are valid for a large class of filters. These
developments have also been used for the design of non-symmetric filters,
useful for the synthesis of repeating devices.</p>
      <p>The team also investigates problems relative to the design of optimal responses for microwave devices. The resolution of a quasi-convex Zolotarev problems was for example proposed, in order to derive guaranteed optimal multi-band filter's responses subject to modulus constraints <ref xlink:href="#apics-2012-bid22" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. This generalizes the classical single band design techniques based on Tchebychev polynomials and elliptic functions. These techniques rely on the fact that the modulus of the scattering parameters of a filters, say <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mrow><mo>|</mo></mrow><msub><mi>S</mi><mrow><mn>1</mn><mo>,</mo><mn>2</mn></mrow></msub><mrow><mo>|</mo></mrow></mrow></math></formula>, admits a simple expression in terms of the filtering function <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mrow><mi>D</mi><mo>=</mo><mo>|</mo></mrow><msub><mi>S</mi><mrow><mn>1</mn><mo>,</mo><mn>1</mn></mrow></msub><mrow><mo>|</mo><mo>/</mo><mo>|</mo></mrow><msub><mi>S</mi><mrow><mn>1</mn><mo>,</mo><mn>2</mn></mrow></msub><mrow><mo>|</mo></mrow></mrow></math></formula> namely,</p>
      <p>
        <formula type="display">
          <math xmlns="http://www.w3.org/1998/Math/MathML" mode="display" overflow="scroll">
            <mrow>
              <mrow>
                <mo>|</mo>
              </mrow>
              <msub>
                <mi>S</mi>
                <mrow>
                  <mn>1</mn>
                  <mo>,</mo>
                  <mn>2</mn>
                </mrow>
              </msub>
              <msup>
                <mrow>
                  <mo>|</mo>
                </mrow>
                <mn>2</mn>
              </msup>
              <mo>=</mo>
              <mfrac>
                <mn>1</mn>
                <mrow>
                  <mn>1</mn>
                  <mo>+</mo>
                  <msup>
                    <mi>D</mi>
                    <mn>2</mn>
                  </msup>
                </mrow>
              </mfrac>
              <mo>.</mo>
            </mrow>
          </math>
        </formula>
      </p>
      <p noindent="true">The filtering function appears to be the ratio of two polynomials <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>p</mi><mn>1</mn></msub><mo>/</mo><msub><mi>p</mi><mn>2</mn></msub></mrow></math></formula>, the numerator of the reflection and transmission scattering factors, that can be chosen freely. The denominator <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>q</mi></math></formula> is obtained as the unique stable and unitary polynomial solving the classical Feldtkeller spectral equation:</p>
      <p>
        <formula type="display">
          <math xmlns="http://www.w3.org/1998/Math/MathML" mode="display" overflow="scroll">
            <mrow>
              <mi>q</mi>
              <msup>
                <mi>q</mi>
                <mo>*</mo>
              </msup>
              <mo>=</mo>
              <msub>
                <mi>p</mi>
                <mn>1</mn>
              </msub>
              <msubsup>
                <mi>p</mi>
                <mn>1</mn>
                <mo>*</mo>
              </msubsup>
              <mo>+</mo>
              <msub>
                <mi>p</mi>
                <mn>2</mn>
              </msub>
              <msubsup>
                <mi>p</mi>
                <mn>2</mn>
                <mo>*</mo>
              </msubsup>
              <mo>.</mo>
            </mrow>
          </math>
        </formula>
      </p>
      <p>The relative simplicity of the derivation of filter's responses under modulus constraints is due to this ability to "forget" about latter spectral equation, and express all design constraints on the filtering functions <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula>. This no longer the case when considering the synthesis <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>N</mi></math></formula>-port devices for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>N</mi><mo>&gt;</mo><mn>3</mn></mrow></math></formula>, like multiplexers, routers power dividers or when considering the synthesis of filters under matching conditions. The efficient derivation of multiplexers responses is one of the team's active recent research area, where technique based on constrained Nevanlinna-Pick interpolation problems are under study (see section <ref xlink:href="#uid67" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
    </subsection>
  </domaine>
  <logiciels id="uid39">
    <bodyTitle>Software</bodyTitle>
    <subsection id="uid40" level="1">
      <bodyTitle>
        <ref xlink:href="http://www-sop.inria.fr/apics/RARL2/rarl2-eng.html" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">RARL2</ref>
      </bodyTitle>
      <participants>
        <person key="apics-2006-idm538940432864">
          <firstname>Martine</firstname>
          <lastname>Olivi</lastname>
          <moreinfo>corresponding participant</moreinfo>
        </person>
      </participants>
      <p>Status: Currently under development. A stable version is maintained.</p>
      <p>This software is developed in collaboration with Jean-Paul Marmorat (Centre de mathématiques appliquées (CMA), École des Mines de Paris).</p>
      <p>RARL2 (Réalisation interne et Approximation Rationnelle L2) is a software for
rational approximation (see section <ref xlink:href="#uid25" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>)
<ref xlink:href="http://www-sop.inria.fr/apics/RARL2/rarl2-eng.html" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>www-sop.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>apics/<allowbreak/>RARL2/<allowbreak/>rarl2-eng.<allowbreak/>html</ref>.</p>
      <p>The software RARL2 computes, from a given matrix-valued function in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mrow><msup><mover accent="true"><mi>H</mi><mo>¯</mo></mover><mn>2</mn></msup></mrow><mrow><mi>m</mi><mo>×</mo><mi>l</mi></mrow></msup></math></formula>, a local best rational approximant in the <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mn>2</mn></msup></math></formula> norm, which is <i>stable and of prescribed McMillan degree</i>
(see section <ref xlink:href="#uid25" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). It was initially developed in the context of linear (discrete-time) system theory and makes an heavy use of the classical concepts in this field. The matrix-valued function to be approximated can be viewed as the transfer function of a multivariable discrete-time stable system. RARL2 takes as input either:</p>
      <simplelist>
        <li id="uid41">
          <p noindent="true">its internal realization,</p>
        </li>
        <li id="uid42">
          <p noindent="true">its first <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>N</mi></math></formula> Fourier coefficients,</p>
        </li>
        <li id="uid43">
          <p noindent="true">discretized (uniformly distributed) values on the circle. In this case, a least-square criterion is used instead of
the <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mn>2</mn></msup></math></formula> norm.</p>
        </li>
      </simplelist>
      <p>It thus performs model reduction in case 1) and 2) and frequency data identification in case 3). In the case of band-limited frequency data, it could be necessary to infer the behavior of the system outside the bandwidth before performing rational approximation (see <ref xlink:href="#uid17" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).
An appropriate Moebius transformation allows to use the software for continuous-time systems as well.</p>
      <p>The method is a steepest-descent algorithm. A parametrization of MIMO systems is used, which ensures that the stability constraint on the approximant is met. The implementation, in matlab, is based on state-space representations.</p>
      <p>The number of local minima can be rather high so that the choice of an initial point for the
optimization can play a crucial role. Two methods can be used:
1) An initialization with a best Hankel approximant.
2) An iterative research strategy on the degree of the local minima, similar in
principle to that of Rarl2, increases the chance of obtaining the
absolute minimum by generating, in a
structured manner, several initial conditions.</p>
      <p>RARL2 performs the rational approximation step in our applications
to filter identification (see section <ref xlink:href="#uid31" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>) as well as sources or cracks recovery (see section <ref xlink:href="#uid30" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). It was released to the universities of Delft, Maastricht, Cork and Brussels.
The parametrization embodied in RARL2 was also used for a multi-objective control synthesis problem provided by ESTEC-ESA, The Netherlands. An extension of the software to the case of triple poles approximants is now available.
It provides satisfactory results in the source recovery problem and it is used by FindSources3D (see section <ref xlink:href="#uid53" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
    </subsection>
    <subsection id="uid44" level="1">
      <bodyTitle>RGC</bodyTitle>
      <participants>
        <person key="apics-2006-idm538940427408">
          <firstname>Fabien</firstname>
          <lastname>Seyfert</lastname>
          <moreinfo>corresponding participant</moreinfo>
        </person>
      </participants>
      <p>Status: A stable version is maintained.</p>
      <p>This software is developed in collaboration with Jean-Paul Marmorat (Centre de mathématiques appliquées (CMA), École des Mines de Paris).</p>
      <p>The identification of filters modelled by an electrical
circuit that was developed by the team (see section <ref xlink:href="#uid31" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>)
led us to compute the electrical parameters of the underlying
filter. This means finding a particular realization <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>A</mi><mo>,</mo><mi>B</mi><mo>,</mo><mi>C</mi><mo>,</mo><mi>D</mi><mo>)</mo></mrow></math></formula> of the model
given by the rational approximation step. This 4-tuple must satisfy constraints
that come from the geometry of the equivalent electrical network and
translate into some of the coefficients in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>A</mi><mo>,</mo><mi>B</mi><mo>,</mo><mi>C</mi><mo>,</mo><mi>D</mi><mo>)</mo></mrow></math></formula> being zero.
Among the different geometries of coupling, there is one called
“the arrow form” <ref xlink:href="#apics-2012-bid58" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> which is of particular interest
since it is unique for a given transfer function and is easily
computed.
The computation of this realization is the first step of RGC. Subsequently, if
the target realization is not in arrow form, one can nevertheless show that it can be
deduced from the arrow-form by a complex- orthogonal change of basis. In this case,
RGC starts a local optimization procedure that reduces the distance between
the arrow form and the target, using successive orthogonal transformations.
This optimization problem on the group of orthogonal matrices is non-convex
and has many local and global minima. In fact, there is not even
uniqueness of the filter realization for a given geometry. Moreover,
it is often relevant to know all solutions of the problem, because the
designer is not even sure, in many cases, which one is being handled.
The assumptions on the reciprocal influence
of the resonant modes may not be equally well satisfied for all such
solutions, hence some of them should be preferred for the design.
Today, apart from the particular case where the arrow
form is the desired form (this happens frequently up to degree 6) the RGC
software provides no guarantee to obtain a single
realization that satisfies the prescribed constraints. The software Dedale-HF
(see section <ref xlink:href="#uid50" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>), which is the successor of RGC,
solves with guarantees this constraint realization problem.
</p>
    </subsection>
    <subsection id="uid45" level="1">
      <bodyTitle>
        <ref xlink:href="http://www-sop.inria.fr/apics/personnel/Fabien.Seyfert/Presto_web_page/presto_pres.html" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">PRESTO-HF</ref>
      </bodyTitle>
      <participants>
        <person key="apics-2006-idm538940427408">
          <firstname>Fabien</firstname>
          <lastname>Seyfert</lastname>
          <moreinfo>corresponding participant</moreinfo>
        </person>
      </participants>
      <p>Status: Currently under development. A stable version is maintained.</p>
      <p>PRESTO-HF: a toolbox dedicated to lowpass parameter identification for
microwave filters
<ref xlink:href="http://www-sop.inria.fr/apics/personnel/Fabien.Seyfert/Presto_web_page/presto_pres.html" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://www-sop.inria.fr/apics/personnel/Fabien.Seyfert/Presto_web_page/presto_pres.html</ref>.
In order to allow the industrial transfer of our methods, a Matlab-based
toolbox has been developed, dedicated to the problem of identification
of low-pass microwave filter parameters. It allows one to run the
following algorithmic steps, either individually or in a single
shot:</p>
      <simplelist>
        <li id="uid46">
          <p noindent="true">determination of delay components caused by the access
devices (automatic reference plane adjustment),</p>
        </li>
        <li id="uid47">
          <p noindent="true">automatic determination of an analytic completion, bounded in modulus
for each channel,</p>
        </li>
        <li id="uid48">
          <p noindent="true">rational approximation of fixed McMillan degree,</p>
        </li>
        <li id="uid49">
          <p noindent="true">determination of a constrained realization.</p>
        </li>
      </simplelist>
      <p>For the matrix-valued rational approximation step, Presto-HF relies on
RARL2 (see section <ref xlink:href="#uid40" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>), a rational approximation engine developed within the team.
Constrained realizations are computed by the RGC software.
As a toolbox, Presto-HF has a modular structure, which allows one
for example to
include some building blocks in an already existing software.</p>
      <p>The delay compensation algorithm is based on the following strong assumption:
far off the passband, one can reasonably expect a good approximation of the
rational components of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>S</mi><mn>11</mn></msub></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>S</mi><mn>22</mn></msub></math></formula> by the first few terms of their
Taylor expansion at infinity, a small degree polynomial in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>1</mn><mo>/</mo><mi>s</mi></mrow></math></formula>. Using this
idea, a sequence of quadratic convex optimization problems are solved, in order
to obtain appropriate compensations. In order to check the previous
assumption, one has to measure the filter on a larger band, typically three
times the pass band.</p>
      <p>This toolbox is currently used by Thales Alenia Space in Toulouse, Thales airborn systems and a license
agreement has been recently negotiated with TAS-Espagna. XLim (University
of Limoges) is
a heavy user of Presto-HF among the academic filtering community and some free
license agreements are currently being considered with the microwave
department of the University of Erlangen (Germany) and the Royal Military
College (Kingston, Canada).
</p>
    </subsection>
    <subsection id="uid50" level="1">
      <bodyTitle>
        <ref xlink:href="http://www-sop.inria.fr/apics/Dedale" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">Dedale-HF</ref>
      </bodyTitle>
      <participants>
        <person key="apics-2006-idm538940427408">
          <firstname>Fabien</firstname>
          <lastname>Seyfert</lastname>
          <moreinfo>corresponding participant</moreinfo>
        </person>
      </participants>
      <p>Status: Currently under development. A stable version is maintained.</p>
      <p>Dedale-HF is a software dedicated to solve exhaustively the coupling matrix
synthesis problem in reasonable time for the users
of the filtering community. For a given coupling topology, the coupling matrix
synthesis problem (C.M. problem for short) consists in finding all possible
electromagnetic coupling values between resonators that yield a realization of
given filter characteristics (see section <ref xlink:href="#uid65" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).
Solving the latter problem is
crucial during the design step of a filter in order to derive its physical
dimensions as well as during the tuning process where coupling values need to
be extracted from frequency measurements (see Figure <ref xlink:href="#uid51" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
      <object id="uid51">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/Vue_ensemble.png" type="float" width="312.9803pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>Overall scheme of the design and tuning process of a microwave filter.</caption>
      </object>
      <p>Dedale-HF consists in two parts: a database of coupling topologies as well as
a dedicated predictor-corrector code. Roughly speaking each reference file of
the database contains, for a given coupling topology, the complete solution
to the C.M. problem associated to particular filtering characteristics. The
latter is then used as a starting point for a predictor-corrector integration
method that computes the solution to the C.M. problem of the user,
<i>i.e.</i> the one corresponding to user-specified filter characteristics. The
reference files are computed off-line using Groebner basis techniques or
numerical techniques based on the exploration of a monodromy group. The use of
such a continuation technique combined with an efficient implementation of the
integrator produces a drastic reduction, by a factor of 20, of the computational time.</p>
      <p>Access to the database and integrator code is done via the web on
<ref xlink:href="http://www-sop.inria.fr/apics/Dedale" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://www-sop.inria.fr/apics/Dedale/WebPages</ref>.
The software is free of charge for academic research purposes: a
registration is however needed in order to access full
functionality. Up to now 90 users have registered world wide (mainly:
Europe, U.S.A, Canada and China) and 4000 reference files have been
downloaded.</p>
      <p>A license of this software has been sold end 2011, to TAS-Espagna to tune filter, with topologies with multiple solutions. The usage of Dedale-HF is here considered together with Presto-HF.</p>
    </subsection>
    <subsection id="uid52" level="1">
      <bodyTitle>
        <ref xlink:href="http://www-sop.inria.fr/apics/easyff/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">easyFF</ref>
      </bodyTitle>
      <participants>
        <person key="apics-2006-idm538940427408">
          <firstname>Fabien</firstname>
          <lastname>Seyfert</lastname>
        </person>
      </participants>
      <p>Status: A stable version is maintained.</p>
      <p>This software has been developed by Vincent Lunot (Taiwan Univ.) during his Ph.d. He still continues to maintain it.</p>
      <p>EasyFF is a software dedicated to the computation of complex, and in particular multi-band, filtering functions. The software takes as input, specifications on the modulus of the scattering matrix (transmission and rejection), the filter's order and the number of transmission zeros. The output is an "optimal" filtering characteristic in the sense that it is the solution of an associated min-max Zolotarev problem. Computations are based on a Remez-type algorithm (if transmission zeros are fixed) or on linear programming techniques if transmission zeros are part of the optimization <ref xlink:href="#apics-2012-bid22" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
    </subsection>
    <subsection id="uid53" level="1">
      <bodyTitle>
        <ref xlink:href="http://www-sop.inria.fr/apics/FindSources3D/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">FindSources3D</ref>
      </bodyTitle>
      <participants>
        <person key="apics-2006-idm538940435888">
          <firstname>Juliette</firstname>
          <lastname>Leblond</lastname>
          <moreinfo>corresponding participant</moreinfo>
        </person>
      </participants>
      <p>Status: Currently under development. A stable version is maintained.</p>
      <p>This software is developed in collaboration with Maureen Clerc and Théo Papadopoulo from the Athena EPI, and with Jean-Paul Marmorat (Centre de mathématiques appliquées (CMA), École des Mines de Paris).</p>
      <p>FindSources3D is a software dedicated to source
recovery for the inverse EEG problem, in 3-layer spherical settings, from pointwise
data (see
<ref xlink:href="http://www-sop.inria.fr/apics/FindSources3D/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>www-sop.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>apics/<allowbreak/>FindSources3D/</ref>). Through the
algorithm described in <ref xlink:href="#apics-2012-bid17" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and section <ref xlink:href="#uid30" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, it makes use of the software RARL2
(section <ref xlink:href="#uid40" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>) for the rational approximation step in plane
sections. The data transmission preliminary step (“cortical mapping”) is
solved using boundary element methods through the software OpenMEEG (its
CorticalMapping features) developed by the Athena Team
(see <ref xlink:href="http://www-sop.inria.fr/athena/software/OpenMEEG/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>www-sop.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>athena/<allowbreak/>software/<allowbreak/>OpenMEEG/</ref>).
A first release of FindSources3D is now available,
which will be demonstrated and distributed within the medical teams we are in contact with (see
Figure <ref xlink:href="#uid54" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, CeCILL license, APP version 1.0: IDDN.FR.001.45009.S.A.2009.000.10000).</p>
      <object id="uid54">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/clustering2.png" type="float" width="227.62204pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>Potential values at electrodes on a sphere (scalp), recovered 2 sources (FindSources3D).</caption>
      </object>
    </subsection>
    <subsection id="uid55" level="1">
      <bodyTitle>
        <ref xlink:href="http://sollya.gforge.inria.fr/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">Sollya</ref>
      </bodyTitle>
      <participants>
        <person key="arenaire-2006-idm111960264528">
          <firstname>Sylvain</firstname>
          <lastname>Chevillard</lastname>
          <moreinfo>corresponding participant</moreinfo>
        </person>
      </participants>
      <p>Status: Currently under development. A stable version is maintained.</p>
      <p>This software is developed in collaboration with Christoph Lauter (LIP6) and Mioara Joldeş (Uppsala University, Sweden).</p>
      <p>Sollya is an interactive tool where the developers of mathematical floating-point libraries (libm) can experiment before actually developing code. The environment is safe with respect to floating-point errors, <i>i.e.</i> the user precisely knows when rounding errors or approximation errors happen, and rigorous bounds are always provided for these errors.</p>
      <p>Amongst other features, it offers a fast Remez algorithm for computing polynomial approximations of real functions and also an algorithm for finding good polynomial approximants with floating-point coefficients to any real function. It also provides algorithms for the certification of numerical codes, such as Taylor Models, interval arithmetic or certified supremum norms.</p>
      <p>It is available as a free software under the CeCILL-C license at <ref xlink:href="http://sollya.gforge.inria.fr/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>sollya.<allowbreak/>gforge.<allowbreak/>inria.<allowbreak/>fr/</ref>.
</p>
    </subsection>
  </logiciels>
  <resultats id="uid56">
    <bodyTitle>New Results</bodyTitle>
    <subsection id="uid57" level="1">
      <bodyTitle>Source recovery problems</bodyTitle>
      <participants>
        <person key="apics-2006-idm538940448832">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="arenaire-2006-idm111960264528">
          <firstname>Sylvain</firstname>
          <lastname>Chevillard</lastname>
        </person>
        <person key="apics-2006-idm538940435888">
          <firstname>Juliette</firstname>
          <lastname>Leblond</lastname>
        </person>
        <person key="apics-2008-idm471168819984">
          <firstname>Ana-Maria</firstname>
          <lastname>Nicu</lastname>
        </person>
      </participants>
      <p>The works presented here are done in collaboration with Maureen Clerc and Théo Papadopoulo from the Athena EPI, with Doug Hardin and Edward Saff from Vanderbilt University (Nashville, USA), and with Abderrazek Karoui (Univ. Bizerte, Tunisie) and Jean-Paul Marmorat (Centre de mathématiques appliquées (CMA), École des Mines de Paris).</p>
      <p>This section in dedicated to inverse problems for 3-D Poisson-Laplace equations.
Though the geometrical settings differ in the 2 sections below, the characterization of silent sources (that give rise to a vanishing potential at measurement points)
is a common problem to both which has been recently achieved, see <ref xlink:href="#apics-2012-bid15" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,<ref xlink:href="#apics-2012-bid59" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
<ref xlink:href="#apics-2012-bid60" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.These are sums of (distributional) derivatives of
Sobolev functions vanishing on the boundary.</p>
      <subsection id="uid58" level="2">
        <bodyTitle>Application to EEG</bodyTitle>
        <p>In 3-D, functional or clinical active regions
in the cortex are often represented by pointwise sources that have to be
localized from measurements on the scalp of a potential
satisfying a Laplace equation (EEG,
electroencephalography).
In the work <ref xlink:href="#apics-2012-bid16" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> it was shown how
to proceed via best rational approximation on a sequence of 2-D
disks cut along the inner sphere, for the case where there are at most 2
sources. A milestone in a long-haul research on the behaviour of poles of
best rational approximants of fixed degree to functions with branch points
has been reached this year <ref xlink:href="#apics-2012-bid54" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, which shows that the technique carries
over to finitely many sources (see section <ref xlink:href="#uid30" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).
In this connection, a dedicated software “FindSources3D” (see section <ref xlink:href="#uid53" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>)
has been developed, in collaboration with the team Athena <ref xlink:href="#apics-2012-bid17" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid61" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        <p>Further, it appears that in the rational approximation step of these schemes, <i>multiple</i> poles possess a nice behaviour with respect to the branched singularities. This is due to the very basic physical assumptions on the model (for EEG data, one should consider <i>triple</i> poles). Though numerically observed in <ref xlink:href="#apics-2012-bid17" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, there is no mathematical
justification so far why these multiple poles have such strong accumulation
properties, which remains an intriguing observation.</p>
        <p>Issues of robust interpolation on the sphere from incomplete pointwise data
are also under study in order to improve numerical accuracy of our reconstruction schemes.
Spherical harmonics, Slepian bases and related special functions are of special interest (thesis of A.-M. Nicu <ref xlink:href="#apics-2012-bid55" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid62" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>), while other techniques should be considered as well.</p>
        <p>Also, magnetic data from MEG (magneto-encephalography) will soon
become available, which should enhance the accuracy of source recovery
algorithms.</p>
        <p>It turns out that discretization issues in geophysics can also be
approached by these approximation techniques. Namely, in geodesy or
for GPS computations, one may need to get a best discrete
approximation of the gravitational potential on the Earth's surface,
from partial data collected there. This is the topic of a beginning collaboration with a physicist
colleague (IGN, LAREG, geodesy). Related geometrical issues (finding
out the geoid, level surface of the gravitational potential) are worthy of consideration as well.</p>
      </subsection>
      <subsection id="uid59" level="2">
        <bodyTitle>Magnetization issues</bodyTitle>
        <p>Magnetic sources localization from observations of the field away from the
support of the magnetization is an issue under investigation in a joint effort
with
the Math. department of Vanderbilt University and the Earth Sciences
department at MIT. The goal is to recover the magnetic properties of rock
samples (<i>e.g.</i> meteorites or stalactites) from fine field measurements
close to the sample that
can nowadays be obtained using SQUIDs (supraconducting coil devices).</p>
        <p>The magnetization operator
is the Riesz potential of the divergence of the magnetization.
The problem of recovering a thin plate magnetization distribution
from measurements of the field in a plane above the sample
lead us to an analysis of the kernel of this operator, which we
characterized in various function and distribution spaces
(arbitrary compactly supported distributions or derivatives of
bounded functions). For this purpose, we
introduced a generalization of the Hodge decomposition in terms of Riesz
transforms and showed that a thin plate magnetization is
“silent” (i.e. in the kernel) if
the normal component is zero and the tangential component is divergence
free.
In particular, we show that a unidirectional non-trivial magnetization with
compact support cannot be silent. The same is true for bidirectional magnetizations if at least one of the directions is nontangential.
We also proved that any
magnetization is equivalent to a unidirectional. We did introduce notions of being silent from above and silent from below, which are in general distinct.
These results have been reported in a paper to appear <ref xlink:href="#apics-2012-bid15" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        <p>We currently work on Fourier based inversion techniques
for unidirectional
magnetizations, and Figures <ref xlink:href="#uid60" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
<ref xlink:href="#uid61" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#uid62" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and
<ref xlink:href="#uid63" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
show an example of reconstruction.
A joint paper with our collaborators from VU and MIT
is being written on this topic.</p>
        <object id="uid60">
          <table>
            <tr>
              <td>
                <ressource xlink:href="IMG/inriaVisuel.png" type="float" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
              </td>
            </tr>
          </table>
          <caption>Inria's logo were printed on a piece of paper. The ink of the letters “In” were magnetized along a direction <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>D</mi><mn>1</mn></msub></math></formula>. The ink of the letters “ria” were magnetized along another direction <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>D</mi><mn>2</mn></msub></math></formula> (almost orthogonal to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>D</mi><mn>1</mn></msub></math></formula>).</caption>
        </object>
        <object id="uid61">
          <table>
            <tr>
              <td>
                <ressource xlink:href="IMG/inriaMesureBZ.png" type="float" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
              </td>
            </tr>
          </table>
          <caption>The Z-component of the magnetic field generated by the sample is measured by a SQUID microscope. The measure is performed 200µm above the sample.</caption>
        </object>
        <object id="uid62">
          <table>
            <tr>
              <td>
                <ressource xlink:href="IMG/inriaRecover1.png" type="float" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
              </td>
            </tr>
          </table>
          <caption>The field measured in Figure <ref xlink:href="#uid61" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> is inversed, assuming that the sample is unidimensionally magnetized along the direction <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>D</mi><mn>1</mn></msub></math></formula>. The letters “In” are fairly well recovered while the rest of the letters is blurred (because the hypothesis about the direction of magnetization is false for “ria”).</caption>
        </object>
        <object id="uid63">
          <table>
            <tr>
              <td>
                <ressource xlink:href="IMG/inriaRecover2.png" type="float" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
              </td>
            </tr>
          </table>
          <caption>The field measured in Figure <ref xlink:href="#uid61" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> is inversed, assuming that the sample is unidimensionally magnetized along the direction <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>D</mi><mn>2</mn></msub></math></formula>. The letters “ria” are fairly well recovered while the rest of the letters is blured (because the hypothesis about the direction of magnetization is false for “In”).</caption>
        </object>
        <p>For more general magnetizations,
the severe ill-posedness of reconstruction challenges
discrete Fourier methods, one of the main problems being the
truncation of the observations outside the range of the SQUID measurements.
We look forward to develop extrapolation techniques in the spirit of step 1
in section <ref xlink:href="#uid11" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
</p>
      </subsection>
    </subsection>
    <subsection id="uid64" level="1">
      <bodyTitle>Boundary value problems, generalized Hardy classes</bodyTitle>
      <participants>
        <person key="apics-2006-idm538940448832">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="apics-2008-idm471168816912">
          <firstname>Slah</firstname>
          <lastname>Chaabi</lastname>
        </person>
        <person key="apics-2006-idm538940435888">
          <firstname>Juliette</firstname>
          <lastname>Leblond</lastname>
        </person>
        <person key="apics-2012-idm433830175168">
          <firstname>Dmitry</firstname>
          <lastname>Ponomarev</lastname>
        </person>
      </participants>
      <p>This work has been performed in collaboration with Yannick Fischer from the Magique3D EPI (Inria Bordeaux, Pau).</p>
      <p>In collaboration with the
CMI-LATP (University Aix-Marseille I), the team considers 2-D diffusion processes with variable conductivity.
In particular its complexified version, the so-called <i>conjugate</i> or
<i>real Beltrami
equation</i>,
was investigated.
In the case of a smooth domain, and for Lipschitz
conductivity, we analyzed the Dirichlet problem
for solutions in Sobolev and then in Hardy classes <ref xlink:href="#apics-2012-bid12" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <p>Their traces merely lie in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mi>p</mi></msup></math></formula> (<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>1</mn><mo>&lt;</mo><mi>p</mi><mo>&lt;</mo><mi>∞</mi></mrow></math></formula>)
of the boundary, a space which is suitable for identification from
pointwise measurements.
Again these traces turn out to be dense on strict subsets of the boundary.
This allows us to state
Cauchy problems as bounded extremal issues in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mi>p</mi></msup></math></formula>
classes of generalized analytic
functions, in a reminiscent manner of what was done for analytic functions
as discussed in section <ref xlink:href="#uid22" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <p>We generalized the construction to finitely connected Dini-smooth
domains and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>W</mi><mrow><mn>1</mn><mo>,</mo><mi>q</mi></mrow></msup></math></formula>-smooth conductivities, with <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>q</mi><mo>&gt;</mo><mn>2</mn></mrow></math></formula> <ref xlink:href="#apics-2012-bid13" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. The case of an annular
geometry is the relevant one for the application to plasma shaping mentioned
below <ref xlink:href="#apics-2012-bid14" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid13" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
The application that initially motivated this work came from free boundary
problems in plasma confinement (in tokamaks) for thermonuclear fusion.
This work was initiated in collaboration with
the Laboratoire J. Dieudonné (University of Nice).</p>
      <p>In the transversal section of a tokamak
(which is a disk if the vessel is idealized into a torus),
the so-called poloidal flux is subject to some conductivity equation
outside the plasma volume
for some simple explicit smooth conductivity function, while the boundary of
the plasma (in the Tore Supra tokamak) is
a level line of this flux <ref xlink:href="#apics-2012-bid56" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Related magnetic measurements are
available on the chamber, which furnish incomplete boundary data from
which one wants to recover the inner (plasma) boundary. This free boundary
problem (of Bernoulli type) can be handled through the solutions of a
family of bounded extremal problems in
generalized Hardy classes of solutions to real Beltrami equations, in
the annular framework <ref xlink:href="#apics-2012-bid13" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <p>In the particular case at hand, the conductivity is <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>1</mn><mo>/</mo><mi>x</mi></mrow></math></formula> and the domain
is an annulus embedded in the right half-plane.
We obtained a basis of
solutions (exponentials times Legendre functions) upon separating variables in toroidal coordinates.
This provides a computational setting to solve the extremal
problems mentioned before, and was the topic of the PhD thesis of Y. Fischer <ref xlink:href="#apics-2012-bid14" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2012-bid57" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
In the most recent tokamaks, like Jet or ITER, an
interesting feature of the level curves of the poloidal flux
is the occurrence of a cusp (a saddle
point of the poloidal flux, called an X point), and it is desirable to shape the plasma
according to a level line passing through this X point for physical
reasons related to the efficiency of the energy transfer. We established
well-posedness of the Dirichlet problem in weighted <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mi>p</mi></msup></math></formula> classes for
harmonic measure on piecewise smooth domains without cusps, thereby laying
ground for such a study. This issue is next in line, now that the present
approach has been validated numerically on Tore Supra data, and the topic of the PhD thesis of D. Ponomarev.</p>
      <p>The PhD work of S. Chaabi is devoted to further aspects of Dirichlet
problems for the
conjugate Beltrami equation. On the one hand, a
method based on Foka's
approach to boundary value problems, which uses Lax pairs and
solves for a Riemann-Hilbert problem, has been devised to
compute in semi explicit form solutions to Dirichlet and Neumann problems for
the conductivity equation satisfied by the poloidal flux.
Also, for more general conductivities, namely bounded below and
lying in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>W</mi><mrow><mn>1</mn><mo>,</mo><mi>s</mi></mrow></msup></math></formula> with <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>s</mi><mo>≥</mo><mn>2</mn></mrow></math></formula>,
parameterization of solutions to Dirichlet problems on the disk
by Hardy function was achieved through
Bers-Nirenberg factorization. Note the conductivity may be unbounded when
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>s</mi><mo>=</mo><mn>2</mn></mrow></math></formula>, which is completely new.
Two papers are being prepared reporting on these topics.</p>
      <p>Finally, note that the conductivity equation can be expressed like a static Schrödinger equation, for smooth enough conductivity coefficients. This provides a link with the following results recently set up by D. Ponomarev, who recently join the team for his PhD.
A description of laser beam propagation in photopolymers can be crudely approximated by a stationary two-dimensional model of wave propagation in a medium with negligible change of refractive index. In such setting, Helmholtz equation is approximated by a linear Schrödinger equation with one of spatial coordinates being an evolutionary variable. Explicit comparison of the solutions in the whole half-space allows to establish global justification of the Schrodinger model for sufficiently smooth pulses <ref xlink:href="#apics-2012-bid63" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
This phenomenon can also be described by a nonstationary model that relies on the spatial nonlinear Schrödinger (NLS) equation with the time-dependent refractive index. A toy problem is considered in <ref xlink:href="#apics-2012-bid64" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, when the rate of change of refractive index is proportional to the squared amplitude of the electric field and the
spatial domain is a plane. The NLS approximation is derived from a 2-D quasi-linear wave equation,
for small time intervals and smooth initial data. Numerical simulations illustrate the approximation result in the 1-D case.
</p>
    </subsection>
    <subsection id="uid65" level="1">
      <bodyTitle>Circuit realisations of filter responses: determination of canonical forms and exhaustive computations of constrained realisations</bodyTitle>
      <participants>
        <person key="apics-2006-idm538940427408">
          <firstname>Fabien</firstname>
          <lastname>Seyfert</lastname>
        </person>
      </participants>
      <p>This work has been done in collaboration with Smain Amari (Royal Military College, Kingston, Canada), Jean Charles Faugère (SALSA EPI, Inria Rocquencourt), Giuseppe Macchiarella (Politecnico di Milano, Milan, Italy), Uwe Rosenberg (Design and Project Engineering, Osterholz-Scharmbeck, Germany) and Matteo Oldoni (Politecnico di Milano, Milan, Italy).</p>
      <p>We continued our work on the circuit realizations of filters'
responses with mixed type (inductive or capacitive) coupling elements
and constrained topologies <ref xlink:href="#apics-2012-bid20" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. For inline circuits,
methods
based on sequential extractions of electrical elements are best suited
due to their computational simplicity. On the other hand, for circuits with no
inline topology ,such methods are inefficient while algebraic methods
(based on a Groebner basis)
can be used, but at high computational cost.
In order to tackle large order circuits, our approach is to decompose
them into connected inline sections, which can be directly realized by
extraction techniques, and into
complex sections, where algebraic methods are needed for realization.
In order to do this, we
started studying the synthesis of filter responses by means of circuits
with reactive non-resonating nodes (dangling resonators)
<ref xlink:href="#apics-2012-bid65" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Links of this topic with Potapov's factorization of J-inner functions are currently being investigated.</p>
      <p>In this connection, sensitivity analysis of the electrical response of a filter with respect to the electrical parameters of the underlying circuit has been published in collaboration with the University of Cartagena and ESA <ref xlink:href="#apics-2012-bid66" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. We essentially proved that the total electrical sensitivity of a filters' response does not depend on the coupling topology of the underlying circuit: the latter however controls the distribution
of this sensitivity within each resonator.</p>
    </subsection>
    <subsection id="uid66" level="1">
      <bodyTitle>Synthesis of compact multiplexers and de-embedding of multiplexers</bodyTitle>
      <participants>
        <person key="apics-2006-idm538940432864">
          <firstname>Martine</firstname>
          <lastname>Olivi</lastname>
        </person>
        <person key="apics-2012-idm433830172112">
          <firstname>Sanda</firstname>
          <lastname>Lefteriu</lastname>
        </person>
        <person key="apics-2006-idm538940427408">
          <firstname>Fabien</firstname>
          <lastname>Seyfert</lastname>
        </person>
      </participants>
      <p>This work has been done in collaboration with
Stéphane Bila (Xlim, Limoges, France),
Hussein Ezzedin (Xlim, Limoges, France),
Damien Pacaud (Thales Alenia Space, Toulouse, France),
Giuseppe Macchiarella (Politecnico di Milano, Milan, Italy, and
Matteo Oldoni (Politecnico di Milano, Milan, Italy).</p>
      <subsection id="uid67" level="2">
        <bodyTitle>Synthesis of compact multiplexers</bodyTitle>
        <p>We focused our research on multiplexer with a star topology. These are
comprised of a central <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>N</mi></math></formula>-port junction, and of filters plugged on all but
common ports (see Figure <ref xlink:href="#uid69" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). A possible approach to synthesis of the multiplexer's response is to postulate that each filter channel has to match the multiplexer at <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>n</mi><mi>k</mi></msub></math></formula> frequencies (<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>n</mi><mi>k</mi></msub></math></formula> being the order of the filter) while rejecting the energy at <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>m</mi><mi>k</mi></msub></math></formula> other frequencies (<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>m</mi><mi>k</mi></msub></math></formula> being the order the transmission polynomial of the filter). The desired synthesis can then be cast into computing of a collection of filter's responses matching
the energy as prescribed and rejecting it at specified frequencies
when plugged simultaneously on the junction. Whether such a collection exists
is one of the main open issues facing
co-integration of systems in electronics. Investigating the latter
led us to consider the simpler problem of matching a filter,
on a frequency-varying load, while rejecting energy at fixed specified
frequencies. If the order of the filter is <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula> this amounts to fix
a given transmission polynomial <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>r</mi></math></formula> and to solve for a unitary polynomial
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>p</mi></math></formula> meeting interpolation conditions of the form:</p>
        <p>
          <formula textype="equation*" type="display">
            <math xmlns="http://www.w3.org/1998/Math/MathML" mode="display" overflow="scroll">
              <mtable displaystyle="true">
                <mtr>
                  <mtd columnalign="right">
                    <mrow>
                      <mi>j</mi>
                      <mo>=</mo>
                      <mn>1</mn>
                      <mo>.</mo>
                      <mo>.</mo>
                      <mi>n</mi>
                      <mo>,</mo>
                      <mspace width="0.166667em"/>
                      <mspace width="0.166667em"/>
                      <mspace width="0.166667em"/>
                      <mspace width="1.em"/>
                      <mfrac>
                        <mi>p</mi>
                        <mi>q</mi>
                      </mfrac>
                      <mrow>
                        <mo>(</mo>
                        <msub>
                          <mi>w</mi>
                          <mi>j</mi>
                        </msub>
                        <mo>)</mo>
                      </mrow>
                      <mo>=</mo>
                      <msub>
                        <mi>γ</mi>
                        <mi>j</mi>
                      </msub>
                    </mrow>
                  </mtd>
                </mtr>
              </mtable>
            </math>
          </formula>
        </p>
        <p>where <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>q</mi></math></formula> is the unique monic Hurwitz polynomial satisfying the Feldtkeller equation</p>
        <p>
          <formula type="display">
            <math xmlns="http://www.w3.org/1998/Math/MathML" mode="display" overflow="scroll">
              <mrow>
                <mi>q</mi>
                <msup>
                  <mi>q</mi>
                  <mo>*</mo>
                </msup>
                <mo>=</mo>
                <mi>p</mi>
                <msup>
                  <mi>p</mi>
                  <mo>*</mo>
                </msup>
                <mo>+</mo>
                <mi>r</mi>
                <msup>
                  <mi>r</mi>
                  <mo>*</mo>
                </msup>
                <mo>.</mo>
              </mrow>
            </math>
          </formula>
        </p>
        <p noindent="true">This problem can be seen as an extended Nevanlinna-Pick interpolation problem, which was considered in <ref xlink:href="#apics-2012-bid28" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> when the interpolation
frequencies lie in the <i>open</i> left half-plane.
We conjecture that existence and uniqueness of the solution still holds
in our case, where interpolation takes place on the boundary,
provided <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>r</mi></math></formula> has no roots on the imaginary axis. Numerical experiments based on continuation techniques tend to corroborate our belief: efforts now
focus on a mathematical proof. The derived numerical tools have already been used to successfully to design multiplexer's responses in collaboration with CNES and Xlim, thereby initiating a collaboration with Xlim on co-integration of filters and antennas.</p>
      </subsection>
      <subsection id="uid68" level="2">
        <bodyTitle>De-embedding of multiplexers</bodyTitle>
        <p>Let <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>S</mi></math></formula> be the measured scattering matrix of a
multiplexer composed of a <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>N</mi></math></formula>-port junction with response <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>T</mi></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>N</mi><mo>-</mo><mn>1</mn></mrow></math></formula>
filters with responses <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>F</mi><mn>1</mn></msub><mo>,</mo><mo>⋯</mo><msub><mi>F</mi><mrow><mi>N</mi><mo>-</mo><mn>1</mn></mrow></msub></mrow></math></formula> as plotted on Figure
<ref xlink:href="#uid69" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. The de-embedding question we raise is the following: given
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>S</mi></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>T</mi></math></formula>, is it possible to retrieve the <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>F</mi><mi>k</mi></msub></math></formula>'s ? The answer to this
question depends of course of the admissible class of filters.
For the simplest case where no assumption is made (except reciprocity), we showed that
the problem has a unique solution for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>N</mi><mo>&gt;</mo><mn>3</mn></mrow></math></formula> and for generic <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>T</mi></math></formula>,
while for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>N</mi><mo>=</mo><mn>2</mn></mrow></math></formula> the solution space at each frequency point
has real dimension 2. This redundancy can be explained by the existence of "ghost" or "silent" components that can hide behind the junction:
when being chained to the junction these components do not affect
its response. We also experienced that the generic behaviour for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>N</mi><mo>&gt;</mo><mn>3</mn></mrow></math></formula> is
rather theoretical, as usual junctions are often made of chained T-junctions:
in this non generic case (which is rather generic in practice !) some
"silent" component still exists for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>N</mi><mo>&gt;</mo><mn>3</mn></mrow></math></formula>. Additional hypotheses,
such as rationality with prescribed degree for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>F</mi><mi>k</mi></msub></math></formula>, are currently
being studied
and already yielded results for the case <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>N</mi><mo>=</mo><mn>3</mn></mrow></math></formula> <ref xlink:href="#apics-2012-bid67" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        <p>This work is pursued in collaboration with Thales Alenia Space, Politecnico di Milano, Xlim and CNES in particular within the contract CNES-Inria on compact <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>N</mi></math></formula>-port synthesis (see section <ref xlink:href="#uid80" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
        <object id="uid69">
          <table>
            <tr>
              <td>
                <ressource xlink:href="IMG/Multiplexer.png" type="float" width="284.52756pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
              </td>
            </tr>
          </table>
          <caption>Multiplexer made of a junction <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>T</mi></math></formula> and filtering devices <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>F</mi><mn>1</mn></msub><mo>,</mo><msub><mi>F</mi><mn>2</mn></msub><mo>⋯</mo><msub><mi>F</mi><mi>N</mi></msub></mrow></math></formula></caption>
        </object>
      </subsection>
    </subsection>
    <subsection id="uid70" level="1">
      <bodyTitle>Detection of the instability of amplifiers</bodyTitle>
      <participants>
        <person key="apics-2006-idm538940448832">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="arenaire-2006-idm111960264528">
          <firstname>Sylvain</firstname>
          <lastname>Chevillard</lastname>
        </person>
        <person key="apics-2006-idm538940432864">
          <firstname>Martine</firstname>
          <lastname>Olivi</lastname>
        </person>
        <person key="apics-2006-idm538940427408">
          <firstname>Fabien</firstname>
          <lastname>Seyfert</lastname>
        </person>
      </participants>
      <p>This work is conducted in collaboration with Jean-Baptiste Pomet from the
McTao team.
It is a continuation of a collaboration with CNES and the University of Bilbao.The goal is to help developing amplifiers, in particular to detect
instability at an early stage of the design.</p>
      <p>Currently, Electrical Engineers from the University of Bilbao, under contract with CNES (the French Space Agency), use heuristics to diagnose instability before the circuit is physically implemented. We intend to set up a rigorously founded algorithm, based on properties of transfer functions of such amplifiers which belong to particular classes of analytic functions.</p>
      <p>In non-degenerate cases, non-linear electrical components can be replaced
by their first order approximation when studying stability
to small perturbations. Using this approximation, diodes appear as perfect negative resistors and transistors as perfect current sources controlled by the voltages at certain points of the circuit.</p>
      <p>In 2011, we had proved that the class of transfer functions which
can be realized with such ideal components and
standard passive components (resistors, selfs, capacitors and transmission
lines) is rather large since it contains all rational functions in the
variable and in the exponentials thereof.</p>
      <p>In 2012, we focused on the kind of instabilities that these ideal systems can exhibit. We showed that a circuit can be unstable, although it has no pole in the right half-plane. This remains true even if a high resistor is put in parallel of the circuit, which is rather unusual. This pathological example is unrealistic, though, because it assumes that non-linear elements continue to provide gain even at very high frequencies. In practice, small capacitive and inductive effects (negligible at moderate frequencies) make these components passive for very high frequencies. Under this simple assumption, we proved that the class of transfer functions of realistic circuits is much smaller than
in previous situation. In fact, a realistic circuit is unstable if and only if it has poles in the right half-plane.
Moreover, there can only be finitely many of them.
An article is currently being written on the subject.
</p>
    </subsection>
    <subsection id="uid71" level="1">
      <bodyTitle>Best constrained analytic approximation</bodyTitle>
      <participants>
        <person key="apics-2006-idm538940448832">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="arenaire-2006-idm111960264528">
          <firstname>Sylvain</firstname>
          <lastname>Chevillard</lastname>
        </person>
        <person key="apics-2006-idm538940435888">
          <firstname>Juliette</firstname>
          <lastname>Leblond</lastname>
        </person>
        <person key="apics-2012-idm433830175168">
          <firstname>Dmitry</firstname>
          <lastname>Ponomarev</lastname>
        </person>
        <person key="apics-2011-idm548469842112">
          <firstname>Elodie</firstname>
          <lastname>Pozzi</lastname>
        </person>
      </participants>
      <p>This work is performed in collaboration
with Jonathan Partington (Univ. Leeds, UK).</p>
      <p>Continuing effort is being paid by the team to
carry over the solution to bounded extremal problems of section <ref xlink:href="#uid22" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
to various settings.
We mentioned already in section <ref xlink:href="#uid64" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
the extension to 2-D diffusion equations with variable
conductivity for the determination of free boundaries in
plasma control and the development of
a generalized Hardy class theory.
We also investigate the ordinary Laplacian in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mrow><mi>ℝ</mi></mrow><mn>3</mn></msup></math></formula>, where
targeted applications are to
data transmission step for source detection in
electro/magneto-encephalography (EEG/MEG, see section <ref xlink:href="#uid57" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
      <p>Still, questions about the behaviour of solutions to the
standard bounded extremal problems <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math></formula> of section <ref xlink:href="#uid22" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
deserve attention.
We realized this year that Slepian functions are eigenfunctions of
truncated Toeplitz operators in 2-D. This can be used to quantify
robustness properties of our resolution schemes in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mn>2</mn></msup></math></formula> and to establish
error estimates, see <ref xlink:href="#apics-2012-bid68" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Moreover we considered additional interpolation constraints <ref xlink:href="#apics-2012-bid69" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, as a simplified but already interesting issue, before getting at
extremal problems for generalized analytic functions in annular non-smooth
domains. The latter arise in the context of plasma shaping in tokamaks like
ITER,
and will be the subject of the PhD thesis of D. Ponomarev.</p>
      <p>In another connection, weighted composition operators on Lebesgue,
Sobolev, and Hardy spaces appear in changes of variables
while expressing conformal equivalence of plane domains.
A universality property related to the existence of invariant subspaces for
these important classes of operators
has been established in <ref xlink:href="#apics-2012-bid70" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Additional density properties also
allow one to handle some of their dynamical aspects (like cyclicity).
</p>
    </subsection>
    <subsection id="uid72" level="1">
      <bodyTitle>Rational Approximation for fitting Non-Negative EPT densities</bodyTitle>
      <participants>
        <person key="apics-2006-idm538940432864">
          <firstname>Martine</firstname>
          <lastname>Olivi</lastname>
        </person>
        <person key="apics-2006-idm538940427408">
          <firstname>Fabien</firstname>
          <lastname>Seyfert</lastname>
        </person>
      </participants>
      <p>This work has been done in collaboration with Bernard Hanzon and Conor Sexton from Univ. Cork.</p>
      <p>The problem is to fit a probability density function on a large set of financial data. The model class is the set of non-negative EPT (Exponential-Polynomials-Trigonometric) functions which provides a useful framework for probabilistic calculation as illustrated in the link
<ref xlink:href="http://www.2-ept.com/2-ept-literature.html" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>www.<allowbreak/>2-ept.<allowbreak/>com/<allowbreak/>2-ept-literature.<allowbreak/>html</ref>.
Moreover, an EPT function can alternatively be interpreted as the impulse response of a continuous time stable system whose Laplace transform is a rational transfer function. This interpretation allows us to approach this problem using approximation tools developed by the team. The very context brings
up a classical, as yet essentially unsolved difficulty in rational
approximation, namely
preservation of positivity. This is known to be a hard issue.
Our work, initiated in 2011, resulted this year in an improved
approach for checking non-negativity of an EPT function.
These results have been presented at the 16th IFAC Conference on
System Identification <ref xlink:href="#apics-2012-bid71" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
The proposed method was demonstrated on the positive daily Dow Jones Industrial Average (DJIA) log returns over 80 years.</p>
    </subsection>
    <subsection id="uid73" level="1">
      <bodyTitle>Rational and meromorphic approximation</bodyTitle>
      <participants>
        <person key="apics-2006-idm538940448832">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
      </participants>
      <p>This work has been done in collaboration with Herbert Stahl (TFH Berlin) and Maxim Yattselev (Univ. Oregon at Eugene, USA).</p>
      <p>We completed and published this year the proof of an important result in
approximation theory, namely the counting measure of
poles of best <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mn>2</mn></msup></math></formula> approximants
(more generally: of critical points) of degree <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula> to a function analytically
continuable, except over finitely many branchpoints lying outside the unit
disk, converges to the Green
equilibrium distribution of the compact set of minimal Green capacity
outside of which the function is single valued <ref xlink:href="#apics-2012-bid54" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. The proof requires
showing existence and uniqueness of a compact set of minimal
weighted logarithmic capacity in a field, outside of which the function is
single-valued. Structure of this contour,
along with error estimates, also come out of the proof. The result is in fact valid for functions that are Cauchy integrals of
Dini-smooth functions on such a contour.
We rely in addition on asymptotic interpolation estimates from <ref xlink:href="#apics-2012-bid72" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <p>This result warrants source recovery techniques used in section
<ref xlink:href="#uid58" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <p>We also studied partial realizations, or equivalently Padé approximants
to transfer functions with branchpoints. Identification techniques
based on partial realizations of a stable infinite-dimensional
transfer function are known to often provide unstable models,
but the question as to whether this is due to noise or to intrinsic
instability was not clear.
In the case of 4 branchpoints, expressing the computation of
Padé approximants in terms of
the solution to a Riemann-Hilbert problem on the Riemann surface of the
function, we proved that the pole behaviour generically shows deterministic
chaos <ref xlink:href="#apics-2012-bid73" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
</p>
    </subsection>
    <subsection id="uid74" level="1">
      <bodyTitle>Tools for numerically guaranteed computations</bodyTitle>
      <participants>
        <person key="arenaire-2006-idm111960264528">
          <firstname>Sylvain</firstname>
          <lastname>Chevillard</lastname>
        </person>
      </participants>
      <p>The overall and long-term goal is to enhance the quality of numerical computations. The progress made during year 2012 is the following:</p>
      <simplelist>
        <li id="uid75">
          <p noindent="true">Publication of a work about the implementation of functions erf and erfc in multiple precision and with correct rounding <ref xlink:href="#apics-2012-bid74" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. It corresponds to a work initially begun in the Arénaire team and finished in the Caramel team. The goal of this work is to show on a representative example the different steps of the rigorous implementation of a function in multiple precision arithmetic (choice of a series approximating the function, choice of the truncation rank and working precision used for the computation, roundoff analysis, etc.). The steps are described in such a way that they can easily be reproduced by someone who would like to implement another function. Moreover, it is showed that the process is very regular, which suggests that it (or at least large parts of it) could be automated.</p>
        </li>
        <li id="uid76">
          <p noindent="true">In the same field of multiple precision arithmetic, and with Marc Mezzarobba (Aric team), we proposed an algorithm for the efficient evaluation of the Airy <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mtext>Ai</mtext><mo>(</mo><mi>x</mi><mo>)</mo></mrow></math></formula> function when <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>x</mi></math></formula> is moderately large  <ref xlink:href="#apics-2012-bid75" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Again, this work deals with a representative example, with the idea of trying to automate the process as a future work. The Taylor series of the Airy Ai function (as many others such as, e.g., Bessel functions or erf) is ill-conditioned when <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>x</mi></math></formula> is not small. To overcome this difficulty, we extend a method by Gawronski, Müller and Reinhard, known to solve the issue in the case of the error function erf. We rewrite <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mtext>Ai</mtext><mo>(</mo><mi>x</mi><mo>)</mo></mrow></math></formula> as <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>G</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>/</mo><mi>F</mi><mo>(</mo><mi>x</mi><mo>)</mo></mrow></math></formula> where <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>F</mi></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>G</mi></math></formula> are two functions with well-conditioned series. However, the coefficients of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>G</mi></math></formula> turn out to obey a three-terms ill-conditioned recurrence. We evaluate this recurrence using Miller's backward algorithm with a rigorous error analysis.</p>
        </li>
        <li id="uid77">
          <p noindent="true">Finally, a more general endeavor is to develop a tool that helps developers of libms in their task. This is performed by the software Sollya <footnote id="uid78" id-text="2"><ref xlink:href="http://sollya.gforge.inria.fr/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>sollya.<allowbreak/>gforge.<allowbreak/>inria.<allowbreak/>fr/</ref></footnote>, developed in collaboration with C. Lauter (Université Pierre et Marie Curie) and M. Joldeş (Uppsala University). During year 2012, a large effort has been made in view of the release of version 4.0 (to come in 2013). This effort (of about 400 commits in the svn repository of the project) is mainly intended to provide a library version of Sollya, as well as a robust test suite for the tool. As a matter of course, it allowed us to detect and fix a dozen of bugs.</p>
        </li>
      </simplelist>
    </subsection>
  </resultats>
  <contrats id="uid79">
    <bodyTitle>Bilateral Contracts and Grants with Industry</bodyTitle>
    <subsection id="uid80" level="1">
      <bodyTitle>Contract CNES-Inria-Xlim</bodyTitle>
      <p>Contract (reference Inria: 7066, CNES: 127 197/00)
involving CNES, XLim and Inria, focuses on the development
of synthesis procedures for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>N</mi></math></formula>-ports microwave devices. The objective
is here to derive analytical procedures for the design of multiplexers and
routers as opposed to the classical "black box optimization" which is usually
employed in this field (for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>N</mi><mo>≥</mo><mn>3</mn></mrow></math></formula>).</p>
    </subsection>
    <subsection id="uid81" level="1">
      <bodyTitle>Contract CNES-Inria-UPV/EHU</bodyTitle>
      <p>Contract (reference CNES: RS10/TG-0001-019)
involving CNES, University of Bilbao (UPV/EHU) and Inria
whose objective
is to set up a methodology for testing the stability of amplifying devices.
The work at Inria concerns the design of frequency optimization techniques
to identify the linearized response and analyze the linear periodic components.
</p>
    </subsection>
  </contrats>
  <partenariat id="uid82">
    <bodyTitle>Partnerships and Cooperations</bodyTitle>
    <subsection id="uid83" level="1">
      <bodyTitle>European Initiatives</bodyTitle>
      <subsection id="uid84" level="2">
        <bodyTitle>Collaborations with Major European Organizations</bodyTitle>
        <sanspuceslist>
          <li id="uid85">
            <p noindent="true">APICS is part of the European Research Network on System Identification (ERNSI) since 1992.</p>
          </li>
          <li id="uid86">
            <p noindent="true">Subject: System identification concerns the construction, estimation and validation of mathematical models of dynamical physical or engineering phenomena from experimental data.</p>
          </li>
        </sanspuceslist>
      </subsection>
    </subsection>
    <subsection id="uid87" level="1">
      <bodyTitle>International Initiatives</bodyTitle>
      <subsection id="uid88" level="2">
        <bodyTitle>Inria International Partners</bodyTitle>
        <p><b>LMS grant</b>, support of collaborative research with Leeds Univ., U.K., School of Mathematics (no. 41130, 2012).</p>
        <p><b>PHC Utique CMCU</b>, cooperation France-Tunisia (no. 10G 1503, led by Univ. Orléans, MAPMO).</p>
        <p><b>NSF CMG</b> collaborative research grant DMS/0934630,
“Imaging magnetization distributions in geological samples”, with Vanderbilt University and the MIT (USA).</p>
        <p><b>Cyprus NF grant </b>
“Orthogonal polynomials in the complex plane: distribution of zeros, strong asymptotics and shape reconstruction.”</p>
      </subsection>
    </subsection>
    <subsection id="uid89" level="1">
      <bodyTitle>International Research Visitors</bodyTitle>
      <subsection id="uid90" level="2">
        <bodyTitle>Visits of International Scientists</bodyTitle>
        <simplelist>
          <li id="uid91">
            <p noindent="true">Smain Amari (RMC Ontario).</p>
          </li>
          <li id="uid92">
            <p noindent="true">Bernard Hanzon (Univ. Cork, External Collaborator).</p>
          </li>
          <li id="uid93">
            <p noindent="true">Tahar Moumni (Univ. Bizerte, Tunisia).</p>
          </li>
          <li id="uid94">
            <p noindent="true">Jonathan R. Partington (Univ. Leeds, U.K., External Collaborator).</p>
          </li>
          <li id="uid95">
            <p noindent="true">Vladimir Peller (Michigan state Univ. at East Lansing)</p>
          </li>
          <li id="uid96">
            <p noindent="true">Yves Rolain (Vrije Universiteit Brussels).</p>
          </li>
          <li id="uid97">
            <p noindent="true">Nikos Stylianopoulos (Univ. of Cyprus).</p>
          </li>
        </simplelist>
      </subsection>
      <subsection id="uid98" level="2">
        <bodyTitle>Internships</bodyTitle>
        <sanspuceslist>
          <li id="uid99">
            <p noindent="true">Shubham KUMAR (from May 2012 until Sep 2012)</p>
            <sanspuceslist>
              <li id="uid100">
                <p noindent="true">Subject: Mathematical methods for multiplexers study</p>
              </li>
              <li id="uid101">
                <p noindent="true">Institution: IIT Delhi (India)</p>
              </li>
            </sanspuceslist>
          </li>
          <li id="uid102">
            <p noindent="true">Dmitry Ponomarev (from Jun 2012 until Aug 2012)</p>
            <sanspuceslist>
              <li id="uid103">
                <p noindent="true">Subject: Constrained optimization with prescribed values on the disk</p>
              </li>
              <li id="uid104">
                <p noindent="true">Pre-doctoral trainee</p>
              </li>
            </sanspuceslist>
          </li>
          <li id="uid105">
            <p noindent="true">Rahul PRAKASH (from May 2012 until Sep 2012)</p>
            <sanspuceslist>
              <li id="uid106">
                <p noindent="true">Subject: Mathematical methods for multiplexers study</p>
              </li>
              <li id="uid107">
                <p noindent="true">Institution: IIT Delhi (India)</p>
              </li>
            </sanspuceslist>
          </li>
          <li id="uid108">
            <p noindent="true">Xuan Zhang (from May 2012 until Sep 2012)</p>
            <sanspuceslist>
              <li id="uid109">
                <p noindent="true">Subject: Groebner basis methods for multiplexers study</p>
              </li>
              <li id="uid110">
                <p noindent="true">Institution: Polytech'Nice</p>
              </li>
            </sanspuceslist>
          </li>
          <li id="uid111">
            <p noindent="true">Jie Zhou (from May 2012 until Aug 2012)</p>
            <sanspuceslist>
              <li id="uid112">
                <p noindent="true">Subject: A Hardy-Hodge Decomposition on the 2D Sphere</p>
              </li>
              <li id="uid113">
                <p noindent="true">Institution: Ecole des Mines de Nancy</p>
              </li>
            </sanspuceslist>
          </li>
        </sanspuceslist>
      </subsection>
    </subsection>
    <subsection id="uid114" level="1">
      <bodyTitle>External collaborators of the team</bodyTitle>
      <p>The following people are external collaborators of the team:</p>
      <simplelist>
        <li id="uid115">
          <p noindent="true">Smain Amari [RMC (Royal Military College), Kingston, Canada, since October].</p>
        </li>
        <li id="uid116">
          <p noindent="true">Ben Hanzon [Univ. Cork, Ireland, since October].</p>
        </li>
        <li id="uid117">
          <p noindent="true">Mohamed Jaoua [French Univ. of Egypt].</p>
        </li>
        <li id="uid118">
          <p noindent="true">Jean-Paul Marmorat [Centre de mathématiques appliquées (CMA), École des Mines de Paris].</p>
        </li>
        <li id="uid119">
          <p noindent="true">Jonathan Partington [Univ. Leeds, UK].</p>
        </li>
        <li id="uid120">
          <p noindent="true">Edward Saff [Vanderbilt University, Nashville, USA].</p>
        </li>
      </simplelist>
    </subsection>
  </partenariat>
  <diffusion id="uid121">
    <bodyTitle>Dissemination</bodyTitle>
    <subsection id="uid122" level="1">
      <bodyTitle>Scientific Animation</bodyTitle>
      <p>L. Baratchart, S. Chevillard and J. Leblond gave communications at the Workshop on Inverse Magnetization Problems, Nashville, USA (Apr.).</p>
      <p>L. Baratchart and J. Leblond gave communications at PICOF, Conference Problèmes Inverses, Contrôle et Optimisation de Formes, Palaiseau, France (Apr.).</p>
      <p>L. Baratchart gave invited talks at the
Workshop on Potential Theory and Applications, Szeged,
Hungary (June), and at SIGMA 2012, CIRM-Luminy (Nov). He gave a talk at the Conférence en l'honneur de Gauthier Sallet,
Saint Louis du Sénégal (Dec.).
He was a colloquim speaker at the State University of New York, Albany, USA
(October) and at the University of Oregon, USA (Oct.).</p>
      <p>S. Chevillard gave a talk at the ERNSI 2012 conference in Maastricht (Netherlands). He reviewed an article for the Journal of Symbolic Computation.</p>
      <p>J. Leblond was invited to give a talk at the following conferences: Conference Control &amp; Inverse Problems for PDE (CIPPDE), Santiago, Chili (Jan.), Workshop Control of Fluid-Structure Systems &amp; Inverse Problems, Toulouse, France (Jun.), International Conference on Constructive Complex Approximation, Lille, France (Jun.), Joint Congress of the French &amp; Vietnamese Math. Soc. (VMS-SMF), Hué, Vietnam (Aug.), Congress on Numerical MEthods &amp; MOdelisation (MEMO), Tunis, Tunisie (Dec.). She also gave communications at the seminars of the School of Mathematics, Univ. Leeds, U.K. (Feb.), of the Institut de Mathématiques de Bordeaux (IMB, Univ. Bordeaux, Mar.), of the Department of Math. &amp; Geosciences, Univ. Trieste, Italy (Oct.), and at the 2nd Nice Physical Day (“Journées de la Physique de Nice”), Nice (Dec.).</p>
      <p>M. Olivi was co-organizer (with B. Hanzon and R. Peeters) of an invited session “model reduction/approximation” at the 16th IFAC Symposium on System Identification, Brussels, July 2012.</p>
      <p>D. Ponomarev presented a poster <ref xlink:href="#apics-2012-bid57" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> at the 2nd PhD Event in Fusion Science and Engineering, Pont-a-Mousson (Oct.).</p>
      <p>E. Pozzi gave several communications at seminars at Univ. of Besançon, Grenoble (Jan.), Bordeaux, Orléans (Mar.), Marseille, Lille (Apr.)</p>
      <p>F. Seyfert was invited to give a talk at the European Microwave Week 2012, Workshop on Advances of N-port networks for Space Application, Amsterdam, Netherlands.
</p>
    </subsection>
    <subsection id="uid123" level="1">
      <bodyTitle>Teaching - Supervision - Juries</bodyTitle>
      <subsection id="uid124" level="2">
        <bodyTitle>Teaching</bodyTitle>
        <sanspuceslist>
          <li id="uid125">
            <p noindent="true">Licence: E. Pozzi, Numerical algorithmics, 26h ETD (from Sep.), L3, Computer Sciences, Polytech'Nice, Univ. Nice Sopia Antipolis, France.</p>
          </li>
        </sanspuceslist>
      </subsection>
      <subsection id="uid126" level="2">
        <bodyTitle>Supervision</bodyTitle>
        <sanspuceslist>
          <li id="uid127">
            <p noindent="true">PhD: A.-M. Nicu, Approximation et représentation des fonctions sur la sphère.
Applications aux problèmes inverses de la géodésie et l'imagerie médicale <ref xlink:href="#apics-2012-bid55" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Univ. Nice Sophia Antipolis, ED STIC, Feb. 2012 (advisor: J. Leblond).</p>
          </li>
          <li id="uid128">
            <p noindent="true">PhD in progress: S. Chaabi, Boundary value problems for
pseudo-holomorphic functions, since Nov. 2008 (advisors: L. Baratchart and A. Borichev).</p>
          </li>
          <li id="uid129">
            <p noindent="true">PhD in progress: D. Ponomarev, Inverse problems for planar conductivity and Schrödinger PDEs, since Nov. 2012 (advisors: J. Leblond, L. Baratchart).</p>
          </li>
        </sanspuceslist>
      </subsection>
      <subsection id="uid130" level="2">
        <bodyTitle>Juries</bodyTitle>
        <simplelist>
          <li id="uid131">
            <p noindent="true">J. Leblond (advisor) and M. Olivi (examinator) were members of the PhD jury of A.-M. Nicu (Univ. Nice Sophia Antipolis, Feb.) <ref xlink:href="#apics-2012-bid55" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
          </li>
          <li id="uid132">
            <p noindent="true">J. Leblond was a member (reviewer) of the PhD jury of N. Chaulet (Ecole Polytechnique, Nov.).</p>
          </li>
          <li id="uid133">
            <p noindent="true">L. Baratchart was the head of the PhD jury of
Matteo Santacesaria
(Ecole Polytechnique, Dec.).</p>
          </li>
        </simplelist>
      </subsection>
    </subsection>
    <subsection id="uid134" level="1">
      <bodyTitle>Popularization</bodyTitle>
      <simplelist>
        <li id="uid135">
          <p noindent="true">M. Olivi is co-president with I. Castellani of the Committee MASTIC (Commission d'Animation, de Médiation et d'Animation Scientifique) <ref xlink:href="https://project.inria.fr/mastic/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>project.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>mastic/</ref>. She is responsible for Scientific Mediation.</p>
        </li>
        <li id="uid136">
          <p noindent="true">J. Leblond and E. Pozzi are members of this committee.</p>
        </li>
        <li id="uid137">
          <p noindent="true">E. Pozzi participated to the “Filles et mathématiques” day, Avignon, Nov.</p>
        </li>
      </simplelist>
    </subsection>
    <subsection id="uid138" level="1">
      <bodyTitle>Community services</bodyTitle>
      <p>L. Baratchart is a member of the Editorial Boards of
<i>Constructive Methods
and Function Theory</i> and <i>Complex Analysis and Operator Theory</i>.
He is Inria's representative at the « conseil scientifique » of the Univ. Provence (Aix-Marseille).</p>
      <p>S. Chevillard is representative at the « comité de centre » and at the « comité des projets » (Research Center Inria-Sophia).</p>
      <p>J. Leblond is an elected member of the “Conseil Scientifique” of Inria. Together with C. Calvet from Human Resources, she is in charge of the mission “Conseil et soutien aux chercheurs” within the Research Centre, and she participated to the working group BEAT (“Bien Être Au Travail”).</p>
      <p>M. Olivi is a member of the CSD (Comité de Suivi Doctoral) of the Research Center. She is responsible for scientific mediation.</p>
      <p>F. Seyfert is a member of CUMIR at InRIA Sophia-Antipolis-Méditerrannée.
</p>
    </subsection>
  </diffusion>
  <biblio id="bibliography" html="bibliography" numero="10" titre="Bibliography">
    <biblStruct id="apics-2012-bid20" type="article" rend="refer" n="refercite:ASB2010">
      <analytic>
        <title level="a">Theory of Coupled Resonator Microwave Bandpass Filters of Arbitrary Bandwidth</title>
        <author>
          <persName key="apics-2008-idm471168853792">
            <foreName>Smain</foreName>
            <surname>Amari</surname>
            <initial>S.</initial>
          </persName>
          <persName key="apics-2006-idm538940427408">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName>
            <foreName>M.</foreName>
            <surname>Bekheit</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <title level="j">Microwave Theory and Techniques, IEEE Transactions on</title>
        <imprint>
          <biblScope type="volume">58</biblScope>
          <biblScope type="number">8</biblScope>
          <dateStruct>
            <month>August</month>
            <year>2010</year>
          </dateStruct>
          <biblScope type="pages">2188 -2203</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid9" type="article" rend="refer" n="refercite:ATFEH">
      <identifiant type="doi" value="10.1007/s00041-009-9110-0"/>
      <analytic>
        <title level="a">Bounded extremal and Cauchy-Laplace problems on the sphere and shell</title>
        <author>
          <persName>
            <foreName>Bilal</foreName>
            <surname>Atfeh</surname>
            <initial>B.</initial>
          </persName>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2006-idm538940402240">
            <foreName>Jonathan R.</foreName>
            <surname>Partington</surname>
            <initial>J. R.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <title level="j">J. Fourier Anal. Appl.</title>
        <imprint>
          <biblScope type="volume">16</biblScope>
          <biblScope type="number">2</biblScope>
          <dateStruct>
            <year>2010</year>
          </dateStruct>
          <biblScope type="pages">177–203</biblScope>
          <ref xlink:href="http://dx.doi.org/10.1007/s00041-009-9110-0" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>dx.<allowbreak/>doi.<allowbreak/>org/<allowbreak/>10.<allowbreak/>1007/<allowbreak/>s00041-009-9110-0</ref>
        </imprint>
      </monogr>
      <note type="bnote">Published online Nov. 2009</note>
    </biblStruct>
    <biblStruct id="apics-2012-bid29" type="article" rend="refer" n="refercite:BKLO1">
      <analytic>
        <title level="a">Multipoint Schur algorithm and orthogonal rational functions: convergence properties, I</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Stanislas</foreName>
            <surname>Kupin</surname>
            <initial>S.</initial>
          </persName>
          <persName key="apics-2006-idm538940418896">
            <foreName>Vincent</foreName>
            <surname>Lunot</surname>
            <initial>V.</initial>
          </persName>
          <persName key="apics-2006-idm538940432864">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <title level="j">Journal d'Analyse</title>
        <imprint>
          <biblScope type="volume">112</biblScope>
          <dateStruct>
            <year>2011</year>
          </dateStruct>
          <biblScope type="pages">207-255</biblScope>
          <ref xlink:href="http://arxiv.org/abs/0812.2050v3" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>arxiv.<allowbreak/>org/<allowbreak/>abs/<allowbreak/>0812.<allowbreak/>2050v3</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid16" type="article" rend="refer" n="refercite:2-3Dprep">
      <analytic>
        <title level="a">Sources identification in 3D balls using meromorphic approximation in 2D disks</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2006-idm538940405024">
            <foreName>Jean-Paul</foreName>
            <surname>Marmorat</surname>
            <initial>J.-P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Electronic Transactions on Numerical Analysis (ETNA)</title>
        <imprint>
          <biblScope type="volume">25</biblScope>
          <dateStruct>
            <year>2006</year>
          </dateStruct>
          <biblScope type="pages">41–53</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid12" type="article" rend="refer" n="refercite:baratchart:2010:hal-00401712:2">
      <identifiant type="doi" value="10.1016/j.jfa.2010.04.004"/>
      <analytic>
        <title level="a">Hardy spaces of the conjugate Beltrami equation</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2006-idm538940430224">
            <foreName>Stéphane</foreName>
            <surname>Rigat</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>Emmanuel</foreName>
            <surname>Russ</surname>
            <initial>E.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <title level="j">Journal of Functional Analysis</title>
        <imprint>
          <biblScope type="volume">259</biblScope>
          <biblScope type="number">2</biblScope>
          <dateStruct>
            <year>2010</year>
          </dateStruct>
          <biblScope type="pages">384-427</biblScope>
          <ref xlink:href="http://dx.doi.org/10.1016/j.jfa.2010.04.004" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>dx.<allowbreak/>doi.<allowbreak/>org/<allowbreak/>10.<allowbreak/>1016/<allowbreak/>j.<allowbreak/>jfa.<allowbreak/>2010.<allowbreak/>04.<allowbreak/>004</ref>
          <ref xlink:href="http://hal.inria.fr/hal-00401712" type="hal" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00401712</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid8" type="article" rend="refer" n="refercite:BMSW">
      <analytic>
        <title level="a">2D inverse problems for the Laplacian: a meromorphic approximation approach</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Frédéric</foreName>
            <surname>Mandréa</surname>
            <initial>F.</initial>
          </persName>
          <persName key="apics-2006-idm538940396912">
            <foreName>Edward B.</foreName>
            <surname>Saff</surname>
            <initial>E. B.</initial>
          </persName>
          <persName>
            <foreName>Franck</foreName>
            <surname>Wielonsky</surname>
            <initial>F.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Journal de Math. Pures et Appliquées</title>
        <imprint>
          <biblScope type="volume">86</biblScope>
          <dateStruct>
            <year>2008</year>
          </dateStruct>
          <biblScope type="pages">1-41</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid48" type="article" rend="refer" n="refercite:BYFoCM">
      <analytic>
        <title level="a">Convergent interpolation to Cauchy integrals over analytic arcs</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940363632">
            <foreName>Maxim</foreName>
            <surname>Yattselev</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <title level="j">Found. Comp. Math.</title>
        <imprint>
          <biblScope type="volume">9</biblScope>
          <biblScope type="number">6</biblScope>
          <dateStruct>
            <year>2009</year>
          </dateStruct>
          <biblScope type="pages">675–715</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid19" type="article" rend="refer" n="refercite:cameron:hal-00663777">
      <identifiant type="doi" value="10.1002/mmce.20190"/>
      <identifiant type="hal" value="hal-00663777"/>
      <analytic>
        <title level="a">Exhaustive approach to the coupling matrix synthesis problem and application to the design of high degree asymmetric filters</title>
        <author>
          <persName>
            <foreName>R.J.</foreName>
            <surname>Cameron</surname>
            <initial>R.</initial>
          </persName>
          <persName key="salsa-2006-idm430056309904">
            <foreName>Jean-Charles</foreName>
            <surname>Faugère</surname>
            <initial>J.-C.</initial>
          </persName>
          <persName key="salsa-2006-idm430056317024">
            <foreName>Fabrice</foreName>
            <surname>Rouillier</surname>
            <initial>F.</initial>
          </persName>
          <persName key="apics-2006-idm538940427408">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <title level="j">International Journal of RF and Microwave Computer-Aided Engineering</title>
        <imprint>
          <biblScope type="volume">17</biblScope>
          <biblScope type="number">1</biblScope>
          <dateStruct>
            <year>2007</year>
          </dateStruct>
          <biblScope type="pages">4–12</biblScope>
          <ref xlink:href="http://hal.inria.fr/hal-00663777" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00663777</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid78" type="article" rend="refer" n="refercite:fischer:2011:hal-00537648:2">
      <identifiant type="doi" value="10.3934/cpaa.2012.11.2327"/>
      <identifiant type="hal" value="hal-00537648"/>
      <analytic>
        <title level="a">Some inverse problems around the tokamak Tore Supra</title>
        <author>
          <persName key="apics-2008-idm471168810864">
            <foreName>Yannick</foreName>
            <surname>Fischer</surname>
            <initial>Y.</initial>
          </persName>
          <persName>
            <foreName>Benjamin</foreName>
            <surname>Marteau</surname>
            <initial>B.</initial>
          </persName>
          <persName key="corida-2006-idm101499630640">
            <foreName>Yannick</foreName>
            <surname>Privat</surname>
            <initial>Y.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <title level="j">Communications on Pure and Applied Analysis</title>
        <imprint>
          <biblScope type="volume">11</biblScope>
          <biblScope type="number">6</biblScope>
          <dateStruct>
            <year>2012</year>
          </dateStruct>
          <biblScope type="pages">2327-2349</biblScope>
          <ref xlink:href="http://hal.inria.fr/hal-00537648" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00537648</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid27" type="article" rend="refer" n="refercite:O-LAA">
      <identifiant type="doi" value="10.1016/j.laa.2006.09.029"/>
      <analytic>
        <title level="a">Balanced realizations of discrete-time stable all-pass systems and the tangential Schur algorithm</title>
        <author>
          <persName>
            <foreName>Bernard</foreName>
            <surname>Hanzon</surname>
            <initial>B.</initial>
          </persName>
          <persName key="apics-2006-idm538940432864">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Ralf</foreName>
            <surname>Peeters</surname>
            <initial>R.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <title level="j">Linear Algebra and its Applications</title>
        <imprint>
          <biblScope type="volume">418</biblScope>
          <dateStruct>
            <year>2006</year>
          </dateStruct>
          <biblScope type="pages">793-820</biblScope>
          <ref xlink:href="http://dx.doi.org/10.1016/j.laa.2006.09.029" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>dx.<allowbreak/>doi.<allowbreak/>org/<allowbreak/>10.<allowbreak/>1016/<allowbreak/>j.<allowbreak/>laa.<allowbreak/>2006.<allowbreak/>09.<allowbreak/>029</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid22" type="article" rend="refer" n="refercite:BLS2007">
      <identifiant type="doi" value="10.1109/TMTT.2007.912234"/>
      <analytic>
        <title level="a">Certified Computation of Optimal Multiband Filtering Functions</title>
        <author>
          <persName key="apics-2006-idm538940418896">
            <foreName>Vincent</foreName>
            <surname>Lunot</surname>
            <initial>V.</initial>
          </persName>
          <persName key="apics-2006-idm538940427408">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName>
            <foreName>Stéphane</foreName>
            <surname>Bila</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>A.</foreName>
            <surname>Nasser</surname>
            <initial>A.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <title level="j">IEEE Transactions on Microwave Theory and Techniques</title>
        <imprint>
          <biblScope type="volume">56</biblScope>
          <biblScope type="number">1</biblScope>
          <dateStruct>
            <year>2008</year>
          </dateStruct>
          <biblScope type="pages">105-112</biblScope>
          <ref xlink:href="http://dx.doi.org/10.1109/TMTT.2007.912234" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>dx.<allowbreak/>doi.<allowbreak/>org/<allowbreak/>10.<allowbreak/>1109/<allowbreak/>TMTT.<allowbreak/>2007.<allowbreak/>912234</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid26" type="article" rend="refer" n="refercite:O-Automatica">
      <identifiant type="doi" value="10.1016/j.automatica.2007.01.020"/>
      <analytic>
        <title level="a">Nudelman Interpolation, Parametrization of Lossless Functions and balanced realizations</title>
        <author>
          <persName key="apics-2006-idm538940405024">
            <foreName>Jean-Paul</foreName>
            <surname>Marmorat</surname>
            <initial>J.-P.</initial>
          </persName>
          <persName key="apics-2006-idm538940432864">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <title level="j">Automatica</title>
        <imprint>
          <biblScope type="volume">43</biblScope>
          <dateStruct>
            <year>2007</year>
          </dateStruct>
          <biblScope type="pages">1329–1338</biblScope>
          <ref xlink:href="http://dx.doi.org/10.1016/j.automatica.2007.01.020" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>dx.<allowbreak/>doi.<allowbreak/>org/<allowbreak/>10.<allowbreak/>1016/<allowbreak/>j.<allowbreak/>automatica.<allowbreak/>2007.<allowbreak/>01.<allowbreak/>020</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="5346" id="apics-2012-bid55" type="phdthesis" rend="year" n="cite:theseAna">
      <identifiant type="hal" value="tel-00671453"/>
      <monogr>
        <title level="m">Approximation et représentation des fonctions sur la sphère. Applications à la géodésie et à l'imagerie médicale.</title>
        <author>
          <persName key="apics-2008-idm471168819984">
            <foreName>Ana-Maria</foreName>
            <surname>Nicu</surname>
            <initial>A.-M.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName type="school">Université de Nice Sophia-Antipolis, ED STIC</orgName>
          </publisher>
          <dateStruct>
            <month>February</month>
            <year>2012</year>
          </dateStruct>
          <ref xlink:href="http://hal.inria.fr/tel-00671453" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>tel-00671453</ref>
        </imprint>
      </monogr>
      <note type="typdoc">Ph. D. Thesis</note>
    </biblStruct>
    <biblStruct dedoublkey="1889" id="apics-2012-bid54" type="article" rend="year" n="cite:BSY">
      <identifiant type="doi" value="10.1016/j.aim.2011.09.005"/>
      <identifiant type="hal" value="hal-00665834"/>
      <analytic>
        <title level="a">Weighted Extremal Domains and Best Rational Approximation</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Herbert</foreName>
            <surname>Stahl</surname>
            <initial>H.</initial>
          </persName>
          <persName key="apics-2006-idm538940363632">
            <foreName>Maxim</foreName>
            <surname>Yattselev</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes" id="rid00099">
        <idno type="issn">0001-8708</idno>
        <title level="j">Advances in Mathematics</title>
        <imprint>
          <biblScope type="volume">229</biblScope>
          <dateStruct>
            <year>2012</year>
          </dateStruct>
          <biblScope type="pages">357-407</biblScope>
          <ref xlink:href="http://hal.inria.fr/hal-00665834" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00665834</ref>
        </imprint>
      </monogr>
      <note type="bnote">44 pages, 5 figures</note>
    </biblStruct>
    <biblStruct dedoublkey="1739" id="apics-2012-bid74" type="article" rend="year" n="cite:chevillard:ensl-00356709">
      <identifiant type="hal" value="ensl-00356709"/>
      <analytic>
        <title level="a">The functions erf and erfc computed with arbitrary precision and explicit error bounds</title>
        <author>
          <persName key="arenaire-2006-idm111960264528">
            <foreName>Sylvain</foreName>
            <surname>Chevillard</surname>
            <initial>S.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes" id="rid00905">
        <idno type="issn">0890-5401</idno>
        <title level="j">Information and Computation</title>
        <imprint>
          <biblScope type="volume">216</biblScope>
          <dateStruct>
            <year>2012</year>
          </dateStruct>
          <biblScope type="pages">72 – 95</biblScope>
          <ref xlink:href="http://hal.inria.fr/ensl-00356709" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>ensl-00356709</ref>
        </imprint>
      </monogr>
      <note type="bnote">(the version available on the HAL server is slightly different from the published version because it contains full proofs)</note>
    </biblStruct>
    <biblStruct dedoublkey="1601" id="apics-2012-bid17" type="article" rend="year" n="cite:clerc:hal-00699541">
      <identifiant type="doi" value="10.1088/0266-5611/28/5/055018"/>
      <identifiant type="hal" value="hal-00699541"/>
      <analytic>
        <title level="a">Source localization using rational approximation on plane sections</title>
        <author>
          <persName key="odyssee-2006-idm405611893984">
            <foreName>Maureen</foreName>
            <surname>Clerc</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2006-idm538940405024">
            <foreName>Jean-Paul</foreName>
            <surname>Marmorat</surname>
            <initial>J.-P.</initial>
          </persName>
          <persName key="odyssee-2006-idm405611888688">
            <foreName>Théodore</foreName>
            <surname>Papadopoulo</surname>
            <initial>T.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes" id="rid01099">
        <idno type="issn">0266-5611</idno>
        <title level="j">Inverse Problems</title>
        <imprint>
          <biblScope type="volume">28</biblScope>
          <biblScope type="number">5</biblScope>
          <dateStruct>
            <month>May</month>
            <year>2012</year>
          </dateStruct>
          <biblScope type="pages">24</biblScope>
          <ref xlink:href="http://hal.inria.fr/hal-00699541" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00699541</ref>
        </imprint>
      </monogr>
      <note type="bnote">This article corresponds to Inria Research Report N° RR-7704 available at <ref xlink:href="http://hal.inria.fr/inria-00613644" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>inria-00613644</ref></note>
    </biblStruct>
    <biblStruct dedoublkey="1598" id="apics-2012-bid77" type="article" rend="year" n="cite:fischer:2011:hal-00537648:2">
      <identifiant type="doi" value="10.3934/cpaa.2012.11.2327"/>
      <identifiant type="hal" value="hal-00537648"/>
      <analytic>
        <title level="a">Some inverse problems around the tokamak Tore Supra</title>
        <author>
          <persName key="apics-2008-idm471168810864">
            <foreName>Yannick</foreName>
            <surname>Fischer</surname>
            <initial>Y.</initial>
          </persName>
          <persName>
            <foreName>Benjamin</foreName>
            <surname>Marteau</surname>
            <initial>B.</initial>
          </persName>
          <persName key="corida-2006-idm101499630640">
            <foreName>Yannick</foreName>
            <surname>Privat</surname>
            <initial>Y.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes" id="rid00401">
        <idno type="issn">1534-0392</idno>
        <title level="j">Communications on Pure and Applied Analysis</title>
        <imprint>
          <biblScope type="volume">11</biblScope>
          <biblScope type="number">6</biblScope>
          <dateStruct>
            <year>2012</year>
          </dateStruct>
          <biblScope type="pages">2327-2349</biblScope>
          <ref xlink:href="http://hal.inria.fr/hal-00537648" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00537648</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="0895" id="apics-2012-bid18" type="article" rend="year" n="cite:olivi:hal-00753824">
      <identifiant type="doi" value="10.1016/j.automatica.2012.10.005"/>
      <identifiant type="hal" value="hal-00753824"/>
      <analytic>
        <title level="a">Identification of microwave filters by analytic and rational H2 approximation</title>
        <author>
          <persName key="apics-2006-idm538940432864">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2006-idm538940427408">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName key="apics-2006-idm538940405024">
            <foreName>Jean-Paul</foreName>
            <surname>Marmorat</surname>
            <initial>J.-P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes" id="rid00229">
        <idno type="issn">0005-1098</idno>
        <title level="j">Automatica</title>
        <imprint>
          <dateStruct>
            <year>2012</year>
          </dateStruct>
          <ref xlink:href="http://hal.inria.fr/hal-00753824" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00753824</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="1835" id="apics-2012-bid70" type="article" rend="year" n="cite:EP-2012">
      <analytic>
        <title level="a">Universality of weighted composition operators on <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>L</mi><mn>2</mn></msup><mrow><mo>(</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow><mo>)</mo></mrow></mrow></math></formula> and Sobolev spaces</title>
        <author>
          <persName key="apics-2011-idm548469842112">
            <foreName>Elodie</foreName>
            <surname>Pozzi</surname>
            <initial>E.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes" id="rid01903">
        <idno type="issn">0081-6906</idno>
        <title level="j">Acta Scientiarum Mathematicarum (Szeged)</title>
        <imprint>
          <biblScope type="volume">78</biblScope>
          <dateStruct>
            <year>2012</year>
          </dateStruct>
          <biblScope type="pages">609-642</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="0754" id="apics-2012-bid66" type="article" rend="year" n="cite:seyfert:hal-00763652">
      <identifiant type="hal" value="hal-00763652"/>
      <analytic>
        <title level="a">Formal Expression of Sensitivity and Energy Relationship in the Context of the Coupling Matrix</title>
        <author>
          <persName key="apics-2006-idm538940427408">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName>
            <foreName>Monica</foreName>
            <surname>Martinez-Mendoza</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Christoph</foreName>
            <surname>Ernst</surname>
            <initial>C.</initial>
          </persName>
          <persName>
            <foreName>Alejandro</foreName>
            <surname>Alvarez-Melcon</surname>
            <initial>A.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes" id="rid00824">
        <idno type="issn">0018-9480</idno>
        <title level="j">IEEE Transactions on Microwave Theory and Techniques</title>
        <imprint>
          <biblScope type="volume">60</biblScope>
          <biblScope type="number">11</biblScope>
          <dateStruct>
            <month>November</month>
            <year>2012</year>
          </dateStruct>
          <biblScope type="pages">3369 - 3375</biblScope>
          <ref xlink:href="http://hal.inria.fr/hal-00763652" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00763652</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="0537" id="apics-2012-bid67" type="article" rend="year" n="cite:seyfert:hal-00763665">
      <identifiant type="doi" value="10.1002/mmce.20664"/>
      <identifiant type="hal" value="hal-00763665"/>
      <analytic>
        <title level="a">De-embedding response of filters from diplexer measurements</title>
        <author>
          <persName key="apics-2006-idm538940427408">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName key="apics-2010-idm445087650016">
            <foreName>Matteo</foreName>
            <surname>Oldoni</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Giuseppe</foreName>
            <surname>Macchiarella</surname>
            <initial>G.</initial>
          </persName>
          <persName>
            <foreName>Damien</foreName>
            <surname>Pacaud</surname>
            <initial>D.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes" id="rid01044">
        <idno type="issn">1096-4290</idno>
        <title level="j">International Journal of RF and Microwave Computer-Aided Engineering</title>
        <imprint>
          <dateStruct>
            <month>August</month>
            <year>2012</year>
          </dateStruct>
          <ref xlink:href="http://hal.inria.fr/hal-00763665" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00763665</ref>
        </imprint>
      </monogr>
      <note type="bnote">D. (2012)</note>
    </biblStruct>
    <biblStruct dedoublkey="3131" id="apics-2012-bid76" type="inproceedings" rend="year" n="cite:ezzeddine:hal-00735858">
      <identifiant type="hal" value="hal-00735858"/>
      <analytic>
        <title level="a">Design of a compact dual-band diplexer with dual mode cavities</title>
        <author>
          <persName>
            <foreName>Hussein</foreName>
            <surname>Ezzeddine</surname>
            <initial>H.</initial>
          </persName>
          <persName>
            <foreName>Stéphane</foreName>
            <surname>Bila</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>Serge</foreName>
            <surname>Verdeyme</surname>
            <initial>S.</initial>
          </persName>
          <persName key="apics-2006-idm538940427408">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName>
            <foreName>Damien</foreName>
            <surname>Pacaud</surname>
            <initial>D.</initial>
          </persName>
          <persName>
            <foreName>Laetitia</foreName>
            <surname>Estagerie</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Jérôme</foreName>
            <surname>Puech</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>Pierre</foreName>
            <surname>Mazet</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-international-audience="yes" x-proceedings="no">
        <title level="m">European Microwave Week (EuMW)</title>
        <loc>Amsterdam, Netherlands</loc>
        <imprint>
          <dateStruct>
            <month>October</month>
            <year>2012</year>
          </dateStruct>
          <ref xlink:href="http://hal.inria.fr/hal-00735858" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00735858</ref>
        </imprint>
        <meeting id="cid69356">
          <title>European Microwave Conference</title>
          <num>42</num>
          <abbr type="sigle">EUMW</abbr>
        </meeting>
      </monogr>
      <note type="bnote">EuMC 24-2</note>
    </biblStruct>
    <biblStruct dedoublkey="4746" id="apics-2012-bid65" type="inproceedings" rend="year" n="cite:oldoni:hal-00763722">
      <identifiant type="hal" value="hal-00763722"/>
      <analytic>
        <title level="a">Synthesis of Microwave Filters with "Reactive"nodes</title>
        <author>
          <persName key="apics-2010-idm445087650016">
            <foreName>Matteo</foreName>
            <surname>Oldoni</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Giuseppe</foreName>
            <surname>Macchiarella</surname>
            <initial>G.</initial>
          </persName>
          <persName key="apics-2006-idm538940427408">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName key="apics-2008-idm471168853792">
            <foreName>Smain</foreName>
            <surname>Amari</surname>
            <initial>S.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-international-audience="yes" x-proceedings="yes">
        <title level="m">European Microwave Week 2012</title>
        <loc>Amsterdam, Pays-Bas</loc>
        <imprint>
          <dateStruct>
            <month>October</month>
            <year>2012</year>
          </dateStruct>
          <ref xlink:href="http://hal.inria.fr/hal-00763722" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00763722</ref>
        </imprint>
        <meeting id="cid69356">
          <title>European Microwave Conference</title>
          <num>42</num>
          <abbr type="sigle">EUMW</abbr>
        </meeting>
      </monogr>
      <note type="bnote">EuMC24-5</note>
    </biblStruct>
    <biblStruct dedoublkey="4402" id="apics-2012-bid71" type="inproceedings" rend="year" n="cite:sexton:hal-00763205">
      <identifiant type="hal" value="hal-00763205"/>
      <analytic>
        <title level="a">Rational Approximation of Transfer Functions for Non-Negative EPT Densities</title>
        <author>
          <persName>
            <foreName>Conor</foreName>
            <surname>Sexton</surname>
            <initial>C.</initial>
          </persName>
          <persName key="apics-2006-idm538940432864">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Bernard</foreName>
            <surname>Hanzon</surname>
            <initial>B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-international-audience="yes" x-proceedings="yes">
        <title level="m">16th IFAC Symposium on System Identification</title>
        <loc>Bruxelles, Belgique</loc>
        <imprint>
          <dateStruct>
            <month>July</month>
            <year>2012</year>
          </dateStruct>
          <ref xlink:href="http://hal.inria.fr/hal-00763205" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00763205</ref>
        </imprint>
        <meeting id="cid99111">
          <title>IFAC Symposium on System Identification</title>
          <num>16</num>
          <abbr type="sigle">SYSID</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="5707" id="apics-2012-bid68" subtype="nonparu" type="techreport" rend="year" n="cite:EP2012">
      <identifiant type="hal" value="hal-00746554"/>
      <monogr>
        <title level="m">Best approximation in Hardy spaces and by polynomials, with norm constraints</title>
        <author>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2006-idm538940402240">
            <foreName>Jonathan R.</foreName>
            <surname>Partington</surname>
            <initial>J. R.</initial>
          </persName>
          <persName key="apics-2011-idm548469842112">
            <foreName>Elodie</foreName>
            <surname>Pozzi</surname>
            <initial>E.</initial>
          </persName>
        </author>
        <imprint>
          <biblScope type="number">RR-8098</biblScope>
          <publisher>
            <orgName type="institution">Inria</orgName>
          </publisher>
          <dateStruct>
            <month>October</month>
            <year>2012</year>
          </dateStruct>
          <ref xlink:href="http://hal.inria.fr/hal-00746554" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00746554</ref>
        </imprint>
      </monogr>
      <note type="bnote">Submitted for publication</note>
      <note type="typdoc">Rapport de recherche</note>
    </biblStruct>
    <biblStruct dedoublkey="5229" id="apics-2012-bid61" type="misc" rend="year" n="cite:posterP">
      <monogr x-international-audience="yes" x-proceedings="no">
        <title level="m">Identification de sources en électro-encéphalographie</title>
        <author>
          <persName key="odyssee-2006-idm405611893984">
            <foreName>Maureen</foreName>
            <surname>Clerc</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2006-idm538940405024">
            <foreName>Jean-Paul</foreName>
            <surname>Marmorat</surname>
            <initial>J.-P.</initial>
          </persName>
          <persName key="odyssee-2006-idm405611888688">
            <foreName>Théodore</foreName>
            <surname>Papadopoulo</surname>
            <initial>T.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <year>2012</year>
          </dateStruct>
          <ref xlink:href="http://www-sop.inria.fr/members/Juliette.Leblond/posters.html" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>www-sop.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>members/<allowbreak/>Juliette.<allowbreak/>Leblond/<allowbreak/>posters.<allowbreak/>html</ref>
        </imprint>
      </monogr>
      <note type="howpublished">Poster</note>
      <note type="bnote">Colloque Ingénierie et STIC pour la Santé, Paris, France</note>
    </biblStruct>
    <biblStruct dedoublkey="5212" id="apics-2012-bid57" type="misc" rend="year" n="cite:posterDP">
      <monogr x-international-audience="yes" x-proceedings="no">
        <title level="m">Equilibrium plasma shape recovery from magnetic measurements in tokamaks</title>
        <author>
          <persName key="apics-2008-idm471168810864">
            <foreName>Yannick</foreName>
            <surname>Fischer</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2012-idm433830175168">
            <foreName>Dmitry</foreName>
            <surname>Ponomarev</surname>
            <initial>D.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>Oct.</month>
            <year>2012</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="howpublished">Poster</note>
      <note type="bnote">2nd PhD Event in Fusion Science and Engineering, Pont-à-Mousson, France</note>
    </biblStruct>
    <biblStruct dedoublkey="6259" id="apics-2012-bid69" type="unpublished" rend="year" n="cite:DPreport">
      <monogr>
        <title level="m">Constrained optimization with prescribed values on the disk</title>
        <author>
          <persName key="apics-2012-idm433830175168">
            <foreName>Dmitry</foreName>
            <surname>Ponomarev</surname>
            <initial>D.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <year>2012</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="bnote">Internship Report</note>
    </biblStruct>
    <biblStruct dedoublkey="5121" id="apics-2012-bid59" type="mastersthesis" rend="year" n="cite:Rap-Jie">
      <monogr>
        <title level="m">A Hardy-Hodge Decomposition on the 2D Sphere</title>
        <author>
          <persName key="ariana-2009-idm368440934672">
            <foreName>Jie</foreName>
            <surname>Zhou</surname>
            <initial>J.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName type="school">Ecole des Mines de Nancy</orgName>
          </publisher>
          <dateStruct>
            <year>2012</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="typdoc">Masters thesis</note>
    </biblStruct>
    <biblStruct id="apics-2012-bid21" type="book" rend="foot" n="footcite:Achieser">
      <monogr>
        <title level="m">Elements of the Theory of Elliptic Functions</title>
        <author>
          <persName>
            <foreName>N. I.</foreName>
            <surname>Achieser</surname>
            <initial>N. I.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName>AMS</orgName>
          </publisher>
          <dateStruct>
            <year>1990</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid25" type="article" rend="foot" n="footcite:ABG">
      <analytic>
        <title level="a">On the Differential Structure of Matrix-Valued Rational Inner Functions</title>
        <author>
          <persName>
            <foreName>D.</foreName>
            <surname>Alpay</surname>
            <initial>D.</initial>
          </persName>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940410336">
            <foreName>Andrea</foreName>
            <surname>Gombani</surname>
            <initial>A.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Operator Theory : Advances and Applications</title>
        <imprint>
          <biblScope type="volume">73</biblScope>
          <dateStruct>
            <year>1994</year>
          </dateStruct>
          <biblScope type="pages">30-66</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid24" type="book" rend="foot" n="footcite:BGR">
      <monogr>
        <title level="m">Interpolation of rational matrix functions</title>
        <author>
          <persName>
            <foreName>J. A.</foreName>
            <surname>Ball</surname>
            <initial>J. A.</initial>
          </persName>
          <persName>
            <foreName>I.</foreName>
            <surname>Gohberg</surname>
            <initial>I.</initial>
          </persName>
          <persName>
            <foreName>L.</foreName>
            <surname>Rodman</surname>
            <initial>L.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName>Birkhäuser</orgName>
          </publisher>
          <dateStruct>
            <year>1990</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid52" type="inproceedings" rend="foot" n="footcite:LB1MTNS2006">
      <analytic>
        <title level="a">On the <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mn>2</mn></msup></math></formula> Rational Approximation of Markov Matrix-Valued Functions</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">Proc. 17th Symposium on Mathematical Theory of Networks and Systems (MTNS)</title>
        <loc>Kyoto, Japon</loc>
        <imprint>
          <dateStruct>
            <year>2006</year>
          </dateStruct>
          <biblScope type="pages">180-182</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid42" type="article" rend="foot" n="footcite:bco">
      <analytic>
        <title level="a">Identification and rational <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mn>2</mn></msup></math></formula> approximation: a gradient algorithm</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>M.</foreName>
            <surname>Cardelli</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2006-idm538940432864">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Automatica</title>
        <imprint>
          <biblScope type="volume">27</biblScope>
          <dateStruct>
            <year>1991</year>
          </dateStruct>
          <biblScope type="pages">413-418</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid13" type="unpublished" rend="foot" n="footcite:BFL2011">
      <monogr>
        <title level="m">Dirichlet/Neumann problems and Hardy classes for the planar conductivity equation</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2008-idm471168810864">
            <foreName>Yannick</foreName>
            <surname>Fischer</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
        </author>
        <imprint>
          <ref xlink:href="http://arxiv.org/abs/1111.6776" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>arxiv.<allowbreak/>org/<allowbreak/>abs/<allowbreak/>1111.<allowbreak/>6776</ref>
        </imprint>
      </monogr>
      <note type="bnote">To appear in Complex Variable &amp; Elliptic Equations</note>
    </biblStruct>
    <biblStruct id="apics-2012-bid30" type="inproceedings" rend="foot" n="footcite:BGKMTNS">
      <analytic>
        <title level="a">Orthogonal rational functions and nonstationary stochastic processes: a Szegő theory</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>L.</foreName>
            <surname>Golinskii</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Stanislas</foreName>
            <surname>Kupin</surname>
            <initial>S.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">Proc. 19th Symposium on Mathematical Theory of Networks and Systems</title>
        <loc>Budapest</loc>
        <imprint>
          <dateStruct>
            <year>2010</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid15" type="article" rend="foot" n="footcite:BHLSW">
      <identifiant type="doi" value="10.1088/0266-5611/29/1/015004"/>
      <analytic>
        <title level="a">Characterizing kernels of operators related to thin-plate magnetizations via generalizations of Hodge decompositions</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>D. P.</foreName>
            <surname>Hardin</surname>
            <initial>D. P.</initial>
          </persName>
          <persName>
            <foreName>E. A.</foreName>
            <surname>Lima</surname>
            <initial>E. A.</initial>
          </persName>
          <persName key="apics-2006-idm538940396912">
            <foreName>Edward B.</foreName>
            <surname>Saff</surname>
            <initial>E. B.</initial>
          </persName>
          <persName>
            <foreName>B. P.</foreName>
            <surname>Weiss</surname>
            <initial>B. P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Inverse Problems</title>
        <imprint>
          <biblScope type="volume">29</biblScope>
          <biblScope type="number">1</biblScope>
          <dateStruct>
            <year>2013</year>
          </dateStruct>
          <ref xlink:href="http://dx.doi.org/10.1088/0266-5611/29/1/015004" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>dx.<allowbreak/>doi.<allowbreak/>org/<allowbreak/>10.<allowbreak/>1088/<allowbreak/>0266-5611/<allowbreak/>29/<allowbreak/>1/<allowbreak/>015004</ref>
        </imprint>
      </monogr>
      <note type="bnote">Available online on the site of the journal. To appear in 2013</note>
    </biblStruct>
    <biblStruct id="apics-2012-bid53" type="article" rend="foot" n="footcite:BKTE">
      <analytic>
        <title level="a">Zero distributions via orthogonality</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Reinhold</foreName>
            <surname>Kuestner</surname>
            <initial>R.</initial>
          </persName>
          <persName>
            <foreName>Vilmos</foreName>
            <surname>Totik</surname>
            <initial>V.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Annales de l'Institut Fourier</title>
        <imprint>
          <biblScope type="volume">55</biblScope>
          <biblScope type="number">5</biblScope>
          <dateStruct>
            <year>2005</year>
          </dateStruct>
          <biblScope type="pages">1455-1499</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid60" type="unpublished" rend="foot" n="footcite:silentsources-prep">
      <monogr>
        <title level="m">Silent electrical sources in domains of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mrow><mi>ℝ</mi></mrow><mn>3</mn></msup></math></formula></title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
        </author>
        <imprint/>
      </monogr>
      <note type="bnote">In preparation</note>
    </biblStruct>
    <biblStruct id="apics-2012-bid31" type="article" rend="foot" n="footcite:partII">
      <analytic>
        <title level="a">Hardy approximation to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mi>p</mi></msup></math></formula> functions on subsets of the circle with <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>1</mn><mo>≤</mo><mi>p</mi><mo>&lt;</mo><mi>∞</mi></mrow></math></formula></title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Constructive Approximation</title>
        <imprint>
          <biblScope type="volume">14</biblScope>
          <dateStruct>
            <year>1998</year>
          </dateStruct>
          <biblScope type="pages">41-56</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid7" type="article" rend="foot" n="footcite:papiercarthage">
      <analytic>
        <title level="a">How can meromorphic approximation help to solve some 2D inverse problems for the Laplacian?</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>Frédéric</foreName>
            <surname>Mandréa</surname>
            <initial>F.</initial>
          </persName>
          <persName key="apics-2006-idm538940396912">
            <foreName>Edward B.</foreName>
            <surname>Saff</surname>
            <initial>E. B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Inverse Problems</title>
        <imprint>
          <biblScope type="volume">15</biblScope>
          <dateStruct>
            <year>1999</year>
          </dateStruct>
          <biblScope type="pages">79–90</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid32" type="article" rend="foot" n="footcite:BEPinfini">
      <analytic>
        <title level="a">Hardy approximation to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mi>∞</mi></msup></math></formula> functions on subsets of the circle</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2006-idm538940402240">
            <foreName>Jonathan R.</foreName>
            <surname>Partington</surname>
            <initial>J. R.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Constructive Approximation</title>
        <imprint>
          <biblScope type="volume">12</biblScope>
          <dateStruct>
            <year>1996</year>
          </dateStruct>
          <biblScope type="pages">423-435</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid35" type="techreport" rend="foot" n="footcite:BLS">
      <monogr>
        <title level="m">Extremal problems of mixed type in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mn>2</mn></msup></math></formula> of the circle</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2006-idm538940427408">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
        </author>
        <imprint>
          <biblScope type="number">RR-7087</biblScope>
          <publisher>
            <orgName type="institution">Inria</orgName>
          </publisher>
          <dateStruct>
            <year>2009</year>
          </dateStruct>
          <ref xlink:href="http://fr.arxiv.org/abs/0911.1441" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>fr.<allowbreak/>arxiv.<allowbreak/>org/<allowbreak/>abs/<allowbreak/>0911.<allowbreak/>1441</ref>
        </imprint>
      </monogr>
      <note type="typdoc">Rapport de recherche</note>
    </biblStruct>
    <biblStruct id="apics-2012-bid43" type="article" rend="foot" n="footcite:BO1">
      <analytic>
        <title level="a">Index of critical points in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>l</mi><mn>2</mn></msup></math></formula>-approximation</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940432864">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">System and Control Letters</title>
        <imprint>
          <biblScope type="volume">10</biblScope>
          <dateStruct>
            <year>1988</year>
          </dateStruct>
          <biblScope type="pages">167–174</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid51" type="article" rend="foot" n="footcite:BO2">
      <analytic>
        <title level="a">Critical points and error rank in best <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mn>2</mn></msup></math></formula> matrix rational approximation of fixed McMillan degree</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940432864">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Constructive Approximation</title>
        <imprint>
          <biblScope type="volume">14</biblScope>
          <dateStruct>
            <year>1998</year>
          </dateStruct>
          <biblScope type="pages">273-300</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid46" type="article" rend="foot" n="footcite:BSW">
      <analytic>
        <title level="a">A criterion for uniqueness of a critical point in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mn>2</mn></msup></math></formula> rational approximation</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940396912">
            <foreName>Edward B.</foreName>
            <surname>Saff</surname>
            <initial>E. B.</initial>
          </persName>
          <persName>
            <foreName>Franck</foreName>
            <surname>Wielonsky</surname>
            <initial>F.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Journal d'Analyse</title>
        <imprint>
          <biblScope type="volume">70</biblScope>
          <dateStruct>
            <year>1996</year>
          </dateStruct>
          <biblScope type="pages">225-266</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid33" type="article" rend="foot" n="footcite:AAKLp">
      <analytic>
        <title level="a">An <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mi>p</mi></msup></math></formula> analog to AAK theory for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>p</mi><mo>≥</mo><mn>2</mn></mrow></math></formula></title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940427408">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Journal of Functional Analysis</title>
        <imprint>
          <biblScope type="volume">191</biblScope>
          <biblScope type="number">1</biblScope>
          <dateStruct>
            <year>2002</year>
          </dateStruct>
          <biblScope type="pages">52–122</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid44" type="article" rend="foot" n="footcite:BStWu">
      <analytic>
        <title level="a">Asymptotic uniqueness of best rational approximants of given degree to Markov functions in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mrow><mi>L</mi></mrow><mn>2</mn></msup></math></formula> of the circle</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Herbert</foreName>
            <surname>Stahl</surname>
            <initial>H.</initial>
          </persName>
          <persName>
            <foreName>Franck</foreName>
            <surname>Wielonsky</surname>
            <initial>F.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Constr. Approx.</title>
        <imprint>
          <biblScope type="volume">17</biblScope>
          <biblScope type="number">1</biblScope>
          <dateStruct>
            <year>2001</year>
          </dateStruct>
          <biblScope type="pages">103–138</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid73" type="unpublished" rend="foot" n="footcite:BY2012">
      <monogr>
        <title level="m">Padé approximants to certain elliptic-type functions</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940363632">
            <foreName>Maxim</foreName>
            <surname>Yattselev</surname>
            <initial>M.</initial>
          </persName>
        </author>
        <imprint>
          <ref xlink:href="http://arxiv.org/abs/1205.4480" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>arxiv.<allowbreak/>org/<allowbreak/>abs/<allowbreak/>1205.<allowbreak/>4480</ref>
        </imprint>
      </monogr>
      <note type="bnote">Accepted for publication in "Journal d'Analyse"</note>
    </biblStruct>
    <biblStruct id="apics-2012-bid45" type="incollection" rend="foot" n="footcite:Bar-proc">
      <analytic>
        <title level="a">Asymptotic uniqueness of best rational approximants to complex Cauchy transforms in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mn>2</mn></msup></math></formula> of the circle</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940363632">
            <foreName>Maxim</foreName>
            <surname>Yattselev</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">Recent trends in orthogonal polynomials and approximation theory</title>
        <loc>Providence, RI</loc>
        <title level="s">Contemp. Math.</title>
        <imprint>
          <biblScope type="volume">507</biblScope>
          <publisher>
            <orgName>Amer. Math. Soc.<loc>Providence, RI</loc></orgName>
          </publisher>
          <dateStruct>
            <year>2010</year>
          </dateStruct>
          <biblScope type="pages">87–111</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid47" type="article" rend="foot" n="footcite:BYJacobi">
      <analytic>
        <title level="a">Convergent Interpolation to Cauchy Integrals over Analytic Arcs with Jacobi-Type Weights</title>
        <author>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940363632">
            <foreName>Maxim</foreName>
            <surname>Yattselev</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <title level="j">International Mathematics Research Notices</title>
        <imprint>
          <dateStruct>
            <year>2010</year>
          </dateStruct>
          <biblScope type="pages">65</biblScope>
          <ref xlink:href="http://hal.inria.fr/hal-00508314" type="hal" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00508314</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid11" type="article" rend="foot" n="footcite:MCM-Jul-2008">
      <identifiant type="doi" value="doi:10.1016/j.mcm.2008.07.016"/>
      <analytic>
        <title level="a">Sources recovery from boundary data: a model related to electroencephalography</title>
        <author>
          <persName key="poems-2006-idm290075485808">
            <foreName>Amel</foreName>
            <surname>Ben Abda</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>Fehmi</foreName>
            <surname>Ben Hassen</surname>
            <initial>F.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2006-idm538940416272">
            <foreName>Moncef</foreName>
            <surname>Mahjoub</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <title level="j">Mathematical and Computer Modelling</title>
        <imprint>
          <biblScope type="volume">49</biblScope>
          <dateStruct>
            <year>2009</year>
          </dateStruct>
          <biblScope type="pages">2213-2223</biblScope>
          <ref xlink:href="http://dx.doi.org/10.1016/j.mcm.2008.07.016" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>dx.<allowbreak/>doi.<allowbreak/>org/<allowbreak/>10.<allowbreak/>1016/<allowbreak/>j.<allowbreak/>mcm.<allowbreak/>2008.<allowbreak/>07.<allowbreak/>016</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid58" type="article" rend="foot" n="footcite:FSieee">
      <analytic>
        <title level="a">Direct Electromagnetic Optimization of Microwave Filters</title>
        <author>
          <persName>
            <foreName>Stéphane</foreName>
            <surname>Bila</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>D.</foreName>
            <surname>Baillargeat</surname>
            <initial>D.</initial>
          </persName>
          <persName>
            <foreName>M.</foreName>
            <surname>Aubourg</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Serge</foreName>
            <surname>Verdeyme</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>P.</foreName>
            <surname>Guillon</surname>
            <initial>P.</initial>
          </persName>
          <persName key="apics-2006-idm538940427408">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName key="apics-2006-idm538940438528">
            <foreName>José</foreName>
            <surname>Grimm</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>C.</foreName>
            <surname>Zanchi</surname>
            <initial>C.</initial>
          </persName>
          <persName>
            <foreName>Jacques</foreName>
            <surname>Sombrin</surname>
            <initial>J.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">IEEE Microwave Magazine</title>
        <imprint>
          <biblScope type="volume">1</biblScope>
          <dateStruct>
            <year>2001</year>
          </dateStruct>
          <biblScope type="pages">46-51</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid56" type="book" rend="foot" n="footcite:Blum">
      <monogr>
        <title level="m">Numerical simulation and optimal control in plasma physics, with applications to Tokamaks</title>
        <author>
          <persName key="moise-2006-idm184989456064">
            <foreName>Jacques</foreName>
            <surname>Blum</surname>
            <initial>J.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName>Wiley/Gauthier-Villars</orgName>
          </publisher>
          <dateStruct>
            <year>1989</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid3" type="article" rend="foot" n="footcite:Cameron2002">
      <identifiant type="doi" value="10.1109/TMTT.2002.805141"/>
      <analytic>
        <title level="a">Synthesis of advanced microwave filters without diagonal cross-couplings</title>
        <author>
          <persName>
            <foreName>R.J.</foreName>
            <surname>Cameron</surname>
            <initial>R.</initial>
          </persName>
          <persName>
            <foreName>A.R.</foreName>
            <surname>Harish</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>C.J.</foreName>
            <surname>Radcliffe</surname>
            <initial>C.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Microwave Theory and Techniques, IEEE Transactions on</title>
        <imprint>
          <biblScope type="volume">50</biblScope>
          <biblScope type="number">12</biblScope>
          <dateStruct>
            <month>dec</month>
            <year>2002</year>
          </dateStruct>
          <biblScope type="pages">2862 - 2872</biblScope>
          <ref xlink:href="http://dx.doi.org/10.1109/TMTT.2002.805141" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>dx.<allowbreak/>doi.<allowbreak/>org/<allowbreak/>10.<allowbreak/>1109/<allowbreak/>TMTT.<allowbreak/>2002.<allowbreak/>805141</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid10" type="article" rend="foot" n="footcite:Robinstabil">
      <analytic>
        <title level="a">Logarithmic stability estimates for a Robin coefficient in 2D Laplace inverse problems</title>
        <author>
          <persName>
            <foreName>Slim</foreName>
            <surname>Chaabane</surname>
            <initial>S.</initial>
          </persName>
          <persName key="apics-2006-idm538940421536">
            <foreName>I.</foreName>
            <surname>Fellah</surname>
            <initial>I.</initial>
          </persName>
          <persName key="apics-2006-idm538940407680">
            <foreName>Mohamed</foreName>
            <surname>Jaoua</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Inverse Problems</title>
        <imprint>
          <biblScope type="volume">20</biblScope>
          <biblScope type="number">1</biblScope>
          <dateStruct>
            <year>2004</year>
          </dateStruct>
          <biblScope type="pages">49–57</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid75" type="unpublished" rend="foot" n="footcite:CM2013">
      <monogr>
        <title level="m">Multiple precision evaluation of the Airy Ai function with reduced cancellation</title>
        <author>
          <persName key="arenaire-2006-idm111960264528">
            <foreName>Sylvain</foreName>
            <surname>Chevillard</surname>
            <initial>S.</initial>
          </persName>
          <persName key="algo-2007-idm502272805776">
            <foreName>Marc</foreName>
            <surname>Mezzarobba</surname>
            <initial>M.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <year>2013</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="bnote">accepted for publication in the Proceedings of ARITH 21</note>
    </biblStruct>
    <biblStruct id="apics-2012-bid14" type="phdthesis" rend="foot" n="footcite:theseYF">
      <identifiant type="hal" value="tel-00643239"/>
      <monogr>
        <title level="m">Approximation des des classes de fonctions analytiques généralisées et résolution de problèmes inverses pour les tokamaks</title>
        <author>
          <persName key="apics-2008-idm471168810864">
            <foreName>Yannick</foreName>
            <surname>Fischer</surname>
            <initial>Y.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName type="school">Univ. Nice Sophia Antipolis</orgName>
          </publisher>
          <dateStruct>
            <year>2011</year>
          </dateStruct>
          <ref xlink:href="http://tel.archives-ouvertes.fr/tel-00643239/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>tel.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>tel-00643239/</ref>
        </imprint>
      </monogr>
      <note type="typdoc">Ph. D. Thesis</note>
    </biblStruct>
    <biblStruct id="apics-2012-bid4" type="article" rend="foot" n="footcite:FrVo">
      <analytic>
        <title level="a">Determining cracks by boundary measurements</title>
        <author>
          <persName>
            <foreName>A.</foreName>
            <surname>Friedman</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>M</foreName>
            <surname>Vogelius</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Indiana Univ. Math. J.</title>
        <imprint>
          <biblScope type="volume">38</biblScope>
          <biblScope type="number">3</biblScope>
          <dateStruct>
            <year>1989</year>
          </dateStruct>
          <biblScope type="pages">527-556</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid50" type="article" rend="foot" n="footcite:fo">
      <analytic>
        <title level="a">Matrix rational <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mn>2</mn></msup></math></formula>-approximation: a gradient algorithm based on Schur analysis</title>
        <author>
          <persName>
            <foreName>P.</foreName>
            <surname>Fulcheri</surname>
            <initial>P.</initial>
          </persName>
          <persName key="apics-2006-idm538940432864">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <title level="j">SIAM J. on Control &amp; Optim.</title>
        <imprint>
          <biblScope type="volume">36</biblScope>
          <dateStruct>
            <year>1998</year>
          </dateStruct>
          <biblScope type="pages">2103-2127</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid34" type="book" rend="foot" n="footcite:Garnett">
      <monogr>
        <title level="m">Bounded analytic functions</title>
        <author>
          <persName>
            <foreName>J. B.</foreName>
            <surname>Garnett</surname>
            <initial>J. B.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName>Academic Press</orgName>
          </publisher>
          <dateStruct>
            <year>1981</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid28" type="article" rend="foot" n="footcite:Georgiou87">
      <analytic>
        <title level="a">A topological approach to Nevanlinna-Pick interpolation</title>
        <author>
          <persName>
            <foreName>T.</foreName>
            <surname>Georgiou</surname>
            <initial>T.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">SIAM J. Math. Anal.</title>
        <imprint>
          <dateStruct>
            <year>1987</year>
          </dateStruct>
          <biblScope type="pages">1248-1260</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid72" type="article" rend="foot" n="footcite:GR">
      <analytic>
        <title level="a">Equilibrium distributions and degree of rational approximation of analytic functions</title>
        <author>
          <persName>
            <foreName>A. A.</foreName>
            <surname>Gonchar</surname>
            <initial>A. A.</initial>
          </persName>
          <persName>
            <foreName>E. A.</foreName>
            <surname>Rakhmanov</surname>
            <initial>E. A.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Math. USSR Sbornik</title>
        <imprint>
          <biblScope type="volume">62</biblScope>
          <biblScope type="number">2</biblScope>
          <dateStruct>
            <year>1989</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid36" type="article" rend="foot" n="footcite:HeltMarsh">
      <analytic>
        <title level="a">Frequency domain analysis and analytic selections</title>
        <author>
          <persName>
            <foreName>J.W.</foreName>
            <surname>Helton</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>D.E.</foreName>
            <surname>Marshall</surname>
            <initial>D.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Indiana Univ. Math. J.</title>
        <imprint>
          <biblScope type="volume">39</biblScope>
          <biblScope type="number">1</biblScope>
          <dateStruct>
            <year>1990</year>
          </dateStruct>
          <biblScope type="pages">157–184</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid39" type="book" rend="foot" n="footcite:IwMa">
      <monogr>
        <title level="m">Geometric function theory and non-linear analysis</title>
        <author>
          <persName>
            <foreName>Tadeusz</foreName>
            <surname>Iwaniec</surname>
            <initial>T.</initial>
          </persName>
          <persName>
            <foreName>Gaven</foreName>
            <surname>Martin</surname>
            <initial>G.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName>Oxford Univ. Press</orgName>
          </publisher>
          <dateStruct>
            <year>2001</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid38" type="article" rend="foot" n="footcite:Moncef2prepj">
      <identifiant type="doi" value="10.1093/imamat/hxn041"/>
      <analytic>
        <title level="a">Robust numerical algorithms based on analytic approximation for the solution of inverse problems in annular domains</title>
        <author>
          <persName key="apics-2006-idm538940407680">
            <foreName>Mohamed</foreName>
            <surname>Jaoua</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2006-idm538940416272">
            <foreName>Moncef</foreName>
            <surname>Mahjoub</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2006-idm538940402240">
            <foreName>Jonathan R.</foreName>
            <surname>Partington</surname>
            <initial>J. R.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <title level="j">IMA J. of Applied Mathematics</title>
        <imprint>
          <biblScope type="volume">74</biblScope>
          <dateStruct>
            <year>2009</year>
          </dateStruct>
          <biblScope type="pages">481-506</biblScope>
          <ref xlink:href="http://dx.doi.org/10.1093/imamat/hxn041" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>dx.<allowbreak/>doi.<allowbreak/>org/<allowbreak/>10.<allowbreak/>1093/<allowbreak/>imamat/<allowbreak/>hxn041</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid62" type="unpublished" rend="foot" n="footcite:KLNprep">
      <monogr>
        <title level="m">Slepian functions on the sphere with applications to signal recovery and inverse source problems</title>
        <author>
          <persName>
            <foreName>A.</foreName>
            <surname>Karoui</surname>
            <initial>A.</initial>
          </persName>
          <persName key="apics-2006-idm538940435888">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2008-idm471168819984">
            <foreName>Ana-Maria</foreName>
            <surname>Nicu</surname>
            <initial>A.-M.</initial>
          </persName>
        </author>
        <imprint/>
      </monogr>
      <note type="bnote">In preparation</note>
    </biblStruct>
    <biblStruct id="apics-2012-bid6" type="book" rend="foot" n="footcite:Landk">
      <monogr>
        <title level="m">Foundations of modern potential theory</title>
        <author>
          <persName>
            <foreName>N.S.</foreName>
            <surname>Landkhof</surname>
            <initial>N.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName>Springer-Verlag</orgName>
          </publisher>
          <dateStruct>
            <year>1972</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid0" type="book" rend="foot" n="footcite:Lavrentiev67">
      <monogr>
        <title level="m">Some Improperly Posed Problems of Mathematical Physics</title>
        <author>
          <persName>
            <foreName>M.M.</foreName>
            <surname>Lavrentiev</surname>
            <initial>M.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName>Springer</orgName>
          </publisher>
          <dateStruct>
            <year>1967</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid2" type="article" rend="foot" n="footcite:Temes1968">
      <identifiant type="doi" value="10.1109/TCT.1968.1082870"/>
      <analytic>
        <title level="a">Filter Design Using Transformed Variables</title>
        <author>
          <persName>
            <foreName>H.</foreName>
            <surname>Orchard</surname>
            <initial>H.</initial>
          </persName>
          <persName>
            <foreName>G.</foreName>
            <surname>Temes</surname>
            <initial>G.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Circuit Theory, IEEE Transactions on</title>
        <imprint>
          <biblScope type="volume">15</biblScope>
          <biblScope type="number">4</biblScope>
          <dateStruct>
            <month>dec</month>
            <year>1968</year>
          </dateStruct>
          <biblScope type="pages">385 - 408</biblScope>
          <ref xlink:href="http://dx.doi.org/10.1109/TCT.1968.1082870" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>dx.<allowbreak/>doi.<allowbreak/>org/<allowbreak/>10.<allowbreak/>1109/<allowbreak/>TCT.<allowbreak/>1968.<allowbreak/>1082870</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid64" type="unpublished" rend="foot" n="footcite:DP2012a">
      <monogr>
        <title level="m">Justification of a nonlinear Schrodinger model for laser beams in photopolymers</title>
        <author>
          <persName>
            <foreName>D.</foreName>
            <surname>Pelinovsky</surname>
            <initial>D.</initial>
          </persName>
          <persName key="apics-2012-idm433830175168">
            <foreName>Dmitry</foreName>
            <surname>Ponomarev</surname>
            <initial>D.</initial>
          </persName>
        </author>
        <imprint/>
      </monogr>
      <note type="bnote">Submitted for publication</note>
    </biblStruct>
    <biblStruct id="apics-2012-bid41" type="book" rend="foot" n="footcite:PellerH">
      <monogr>
        <title level="m">Hankel Operators and their Applications</title>
        <author>
          <persName key="apics-2006-idm538940371728">
            <foreName>Vladimir V</foreName>
            <surname>Peller</surname>
            <initial>V. V.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName>Springer</orgName>
          </publisher>
          <dateStruct>
            <year>2003</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid63" type="unpublished" rend="foot" n="footcite:DP2012b">
      <monogr>
        <title level="m">Global justification analysis for linear parabolic approximation in a reduced photopolymer model</title>
        <author>
          <persName key="apics-2012-idm433830175168">
            <foreName>Dmitry</foreName>
            <surname>Ponomarev</surname>
            <initial>D.</initial>
          </persName>
        </author>
        <imprint/>
      </monogr>
      <note type="bnote">In preparation</note>
    </biblStruct>
    <biblStruct id="apics-2012-bid49" type="book" rend="foot" n="footcite:SaTo">
      <monogr>
        <title level="m">Logarithmic potentials with external fields</title>
        <title level="s">Grundlehren der mathematischen Wissenshaften</title>
        <author>
          <persName key="apics-2006-idm538940396912">
            <foreName>Edward B.</foreName>
            <surname>Saff</surname>
            <initial>E. B.</initial>
          </persName>
          <persName>
            <foreName>Vilmos</foreName>
            <surname>Totik</surname>
            <initial>V.</initial>
          </persName>
        </author>
        <imprint>
          <biblScope type="volume">316</biblScope>
          <publisher>
            <orgName>Springer</orgName>
          </publisher>
          <dateStruct>
            <year>1997</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid37" type="article" rend="foot" n="footcite:ASchn">
      <analytic>
        <title level="a">Constrained Hardy space approximation</title>
        <author>
          <persName>
            <foreName>A.</foreName>
            <surname>Schneck</surname>
            <initial>A.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">J. Approx. Theory</title>
        <imprint>
          <biblScope type="volume">8</biblScope>
          <dateStruct>
            <year>2010</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid23" type="article" rend="foot" n="footcite:Schur">
      <analytic>
        <title level="a">Über Potenzreihen die im innern des einheitskreises beschränkt sind</title>
        <author>
          <persName>
            <foreName>I.</foreName>
            <surname>Schur</surname>
            <initial>I.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">J. Reine Angew. Math.</title>
        <imprint>
          <biblScope type="volume">147</biblScope>
          <dateStruct>
            <year>1917</year>
          </dateStruct>
          <biblScope type="pages">205-232</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid1" type="inproceedings" rend="foot" n="footcite:seyfert:hal-00663504">
      <identifiant type="doi" value="10.1109/MWSYM.2003.1210875"/>
      <identifiant type="hal" value="hal-00663504"/>
      <analytic>
        <title level="a">Extraction of coupling parameters for microwave filters: determinati on of a stable rational model from scattering data</title>
        <author>
          <persName key="apics-2006-idm538940427408">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName key="apics-2006-idm538940448832">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2006-idm538940405024">
            <foreName>Jean-Paul</foreName>
            <surname>Marmorat</surname>
            <initial>J.-P.</initial>
          </persName>
          <persName>
            <foreName>Stéphane</foreName>
            <surname>Bila</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>Jacques</foreName>
            <surname>Sombrin</surname>
            <initial>J.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-international-audience="yes" x-proceedings="yes">
        <title level="m">Microwave Symposium Digest, 2003 IEEE MTT-S International</title>
        <loc>Philadelphie, États-Unis</loc>
        <imprint>
          <biblScope type="volume">1</biblScope>
          <publisher>
            <orgName>IEEE</orgName>
          </publisher>
          <dateStruct>
            <year>2003</year>
          </dateStruct>
          <biblScope type="pages">25-28</biblScope>
          <ref xlink:href="http://hal.inria.fr/hal-00663504" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00663504</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid40" type="book" rend="foot" n="footcite:Stein">
      <monogr>
        <title level="m">Harmonic Analysis</title>
        <author>
          <persName>
            <foreName>E. M.</foreName>
            <surname>Stein</surname>
            <initial>E. M.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName>Princeton University Press</orgName>
          </publisher>
          <dateStruct>
            <year>1993</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="apics-2012-bid5" type="inproceedings" rend="foot" n="footcite:Wolff">
      <analytic>
        <title level="a">Counterexamples with harmonic gradients in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mrow><mi>𝐑</mi></mrow><mn>3</mn></msup></math></formula></title>
        <author>
          <persName>
            <foreName>T.</foreName>
            <surname>Wolff</surname>
            <initial>T.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <editor role="editor">
          <persName>
            <foreName>Princeton Univ.</foreName>
            <surname>Press</surname>
            <initial>P. U.</initial>
          </persName>
        </editor>
        <title level="m">Essays on Fourier analysis in honor of Elias M. Stein</title>
        <title level="s">Math. Ser.</title>
        <imprint>
          <biblScope type="volume">42</biblScope>
          <dateStruct>
            <year>1995</year>
          </dateStruct>
          <biblScope type="pages">321–384</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
  </biblio>
</raweb>
