<?xml version="1.0" encoding="utf-8"?>
<raweb xmlns:xlink="http://www.w3.org/1999/xlink" xml:lang="en" year="2014">
  <identification id="apics" isproject="true">
    <shortname>APICS</shortname>
    <projectName>Analysis and Problems of Inverse type in Control and Signal processing</projectName>
    <theme-de-recherche>Optimization and control of dynamic systems</theme-de-recherche>
    <domaine-de-recherche>Applied Mathematics, Computation and Simulation</domaine-de-recherche>
    <urlTeam>http://team.inria.fr/apics/</urlTeam>
    <datecreation>2005 January 01</datecreation>
    <UR name="Sophia"/>
    <keywords>
      <term>System Analysis And Control</term>
      <term>Harmonic Analysis</term>
      <term>Signal Processing</term>
      <term>Identification</term>
      <term>Inverse Problem</term>
    </keywords>
    <moreinfo/>
  </identification>
  <team id="uid1">
    <person key="apics-2014-idp98680">
      <firstname>Laurent</firstname>
      <lastname>Baratchart</lastname>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Team leader, Inria, Senior Researcher</moreinfo>
      <hdr>oui</hdr>
    </person>
    <person key="apics-2014-idp100160">
      <firstname>Sylvain</firstname>
      <lastname>Chevillard</lastname>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Inria, Researcher</moreinfo>
    </person>
    <person key="apics-2014-idp101400">
      <firstname>Juliette</firstname>
      <lastname>Leblond</lastname>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Inria, Senior Researcher</moreinfo>
      <hdr>oui</hdr>
    </person>
    <person key="apics-2014-idp102840">
      <firstname>Martine</firstname>
      <lastname>Olivi</lastname>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Inria, Researcher</moreinfo>
      <hdr>oui</hdr>
    </person>
    <person key="apics-2014-idp104272">
      <firstname>Fabien</firstname>
      <lastname>Seyfert</lastname>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Inria, Researcher</moreinfo>
    </person>
    <person key="apics-2014-idp105512">
      <firstname>David</firstname>
      <lastname>Martinez Martinez</lastname>
      <categoryPro>Technique</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Inria, from Nov 2014</moreinfo>
    </person>
    <person key="apics-2014-idp106768">
      <firstname>Sanda</firstname>
      <lastname>Lefteriu</lastname>
      <categoryPro>PostDoc</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Inria, until Mar 2014, granted by CNES</moreinfo>
    </person>
    <person key="apics-2014-idp108032">
      <firstname>Olga</firstname>
      <lastname>Permiakova</lastname>
      <categoryPro>AutreCategorie</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Internship, Master Computational Biology - UNSA, Inria, from April until Aug 2014</moreinfo>
    </person>
    <person key="apics-2014-idp109344">
      <firstname>Matthias</firstname>
      <lastname>Caenepeel</lastname>
      <categoryPro>PhD</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Vrije Universiteit Brussel (VUB)</moreinfo>
    </person>
    <person key="athena-2014-idp85600">
      <firstname>Christos</firstname>
      <lastname>Papageorgakis</lastname>
      <categoryPro>PhD</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Inria, UNSA - ED STIC, since Oct. 2014, granted by BESA GmbH and BDO PACA; part time with the team Athena</moreinfo>
    </person>
    <person key="apics-2014-idp111904">
      <firstname>Dmitry</firstname>
      <lastname>Ponomarev</lastname>
      <categoryPro>PhD</categoryPro>
      <research-centre>Sophia</research-centre>
      <moreinfo>Inria, UNSA - ED STIC, granted by MESR and 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
modeling 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 behaviors.
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),
in connection with inverse potential problems.
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 endeavor is to develop algorithms resulting in dedicated
software.</p>
    </subsection>
  </presentation>
  <fondements id="uid6">
    <bodyTitle>Research Program</bodyTitle>
    <subsection id="uid7" 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 behavior. Perhaps the simplest example lies with
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> can be evaluated at a point <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>i</mi><mi>ω</mi></mrow></math></formula> of the
imaginary axis from the response to a periodic input at frequency <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>ω</mi></math></formula>.
Since <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-plane, 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
recovering <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>f</mi></math></formula> amounts to solve a Dirichlet problem which can
be done in principle using, <i>e.g.</i> the 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-2014-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>, then
<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 <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>δ</mi><msub><mi>z</mi><mi>j</mi></msub></msub></math></formula> is a Dirac unit mass at
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>z</mi><mi>j</mi></msub></math></formula>. Thus, to find the domain of holomorphy
(<i>i.e.</i> to locate 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 such questions, the team has developed a two-step approach
as follows.</p>
      <simplelist>
        <label/>
        <li id="uid8">
          <p noindent="true"><b>Step 1:</b> To determine a complete
model, that is, one which is defined
at every frequency, in a sufficiently versatile function
class (<i>e.g.</i> Hardy spaces). This ill-posed issue requires
regularization, for instance constraints on the behavior at
non-measured frequencies.</p>
        </li>
        <label/>
        <li id="uid9">
          <p noindent="true"><b>Step 2:</b>
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. We emphasize that deriving a complete model in step 1
is
crucial to achieve stability
of the reduced model in step 2.</p>
        </li>
      </simplelist>
      <p>Step 1 relates to extremal
problems and analytic operator theory, see Section <ref xlink:href="#uid18" 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 outputs,
see Section <ref xlink:href="#uid21" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
It also makes contact with the topology of rational functions, in particular
to count
critical points and to derive bounds, see Section <ref xlink:href="#uid19" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Step 2 raises
further issues in approximation theory regarding the rate of convergence and
the extent to which singularities of the
approximant (<i>i.e.</i> its poles) tend to singularities of the
approximated function; this is where logarithmic potential theory
becomes instrumental, see Section <ref xlink:href="#uid22" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <p>Applying a realization procedure to the result of step 2 yields
an identification procedure from incomplete frequency data
which was first demonstrated in
<ref xlink:href="#apics-2014-bid1" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> to tune resonant microwave filters.
Harmonic identification of nonlinear systems around a stable equilibrium
can also be envisaged by combining the previous steps with exact linearization techniques
from <ref xlink:href="#apics-2014-bid2" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <p>A similar path can be taken to approach design problems in
the frequency domain, replacing the measured behavior by
some desired behavior. However, describing achievable responses in terms
of the design parameters is often cumbersome,
and most constructive techniques rely on specific criteria
adapted to the physics of the
problem.
This is especially true of filters, the design of which
traditionally appeals to polynomial extremal problems
<ref xlink:href="#apics-2014-bid3" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid4" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Apics contributed to this area the use of
Zolotarev-like problems for multi-band synthesis, although
we presently favor interpolation techniques in which parameters arise
in a more transparent manner,
see Section <ref xlink:href="#uid13" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <p>The previous 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; when the portion of boundary where
data are not available is itself unknown,
we meet a free boundary problem.
This framework for 2-D non-destructive control was first
advocated in
<ref xlink:href="#apics-2014-bid5" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and subsequently received considerable attention.
It makes 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="uid10" 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. Such a “bad” subset, however, cannot have interior points on the
sphere.</footnote>
<ref xlink:href="#apics-2014-bid6" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid7" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Such 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 the 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. Nevertheless it is a useful concept
bringing perspective on how problems could be raised and solved, using tools from harmonic analysis.</p>
      <p>Inverse potential problems are severely indeterminate because infinitely many
measures within an open set produce the same field outside this set; this phenomenon is called
<i>balayage</i> <ref xlink:href="#apics-2014-bid8" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. In the two steps approach
previously described ,
we implicitly removed this indeterminacy by requiring in step 1
that the measure
be supported on the boundary (because we seek a function holomorphic
throughout the right half space), and
by requiring in step 2
that the measure be discrete in the left half-plane. The discreteness
assumption also prevails in 3-D inverse source problems, see
Section <ref xlink:href="#uid26" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Conditions
that ensure uniqueness of the solution to the inverse potential
problem are part of the so-called regularizing assumptions which are needed
in each case to derive efficient algorithms.</p>
      <p>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 that it 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, Apics advocates the use of steps 1 and 2 above,
along with some singularity
analysis, to approach issues of nondestructive control in 2-D and 3-D
<ref xlink:href="#apics-2014-bid9" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> <ref xlink:href="#apics-2014-bid10" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid11" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. The team
is currently engaged in two
kinds of generalizations, to be described further in Section <ref xlink:href="#uid12" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
The first deals with non-constant
conductivities in 2-D, where Cauchy-Riemann equations characterizing
holomorphic functions
are replaced by conjugate Beltrami equations characterizing
pseudo-holomorphic functions; next in line are 3-D situations that we begin to consider,
see Sections <ref xlink:href="#uid63" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and <ref xlink:href="#uid29" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
There, we seek applications to inverse free boundary problems
such as plasma confinement in the vessel of a tokamak, or inverse conductivity problems like
those arising in impedance tomography.
The second generalization lies with inverse source problems for the Laplace equation
in 3-D, where holomorphic
functions are replaced by harmonic gradients; applications are to
EEG/MEG and inverse magnetization problems in paleomagnetism,
see Section <ref xlink:href="#uid26" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <p>The approximation-theoretic tools developed by Apics to handle
issues mentioned so far are outlined in Section <ref xlink:href="#uid17" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
In Section <ref xlink:href="#uid11" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> to come, we describe in more
detail which problems are
considered and which applications are targeted.</p>
    </subsection>
    <subsection id="uid11" level="1">
      <bodyTitle>Range of inverse problems</bodyTitle>
      <subsection id="uid12" level="2">
        <bodyTitle>Elliptic partial differential equations (PDE)</bodyTitle>
        <participants>
          <person key="apics-2014-idp98680">
            <firstname>Laurent</firstname>
            <lastname>Baratchart</lastname>
          </person>
          <person key="apics-2014-idp100160">
            <firstname>Sylvain</firstname>
            <lastname>Chevillard</lastname>
          </person>
          <person key="apics-2014-idp101400">
            <firstname>Juliette</firstname>
            <lastname>Leblond</lastname>
          </person>
          <person key="athena-2014-idp85600">
            <firstname>Christos</firstname>
            <lastname>Papageorgakis</lastname>
          </person>
          <person key="apics-2014-idp111904">
            <firstname>Dmitry</firstname>
            <lastname>Ponomarev</lastname>
          </person>
        </participants>
        <p>By standard properties of conjugate differentials, reconstructing Dirichlet-Neumann boundary conditions
for a function harmonic in a plane domain,
when these boundary conditions are known already on a 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="#uid7" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
It makes good sense in holomorphic
Hardy spaces where functions are entirely 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> that we set up in Section <ref xlink:href="#uid18" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Such issues
naturally arise in nondestructive testing of 2-D (or 3-D cylindrical) materials
from partial electrical measurements on the boundary.
For instance, the ratio between the tangential and the normal
currents (the so-called Robin coefficient) tells one about corrosion of the material.
Thus, 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
yields non destructive testing of a potentially corroded piece of material, part of
which is inaccessible to measurements.
This was an initial application of holomorphic extremal problems
to non-destructive control <ref xlink:href="#apics-2014-bid12" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid13" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        <p>Another application by the team deals with non-constant conductivity
over a doubly connected domain, the set <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>E</mi></math></formula> being now 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>, one wants to recover level lines of
the solution to
a conductivity equation, which is a so-called free boundary inverse problem.
For this,
given a closed curve inside the domain, we first quantify
how constant the
solution on this curve. To this effect,
we state and solve an 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>, where the constraint bears on
the real part of the function on the curve
(it should be close to a constant there),
in a Hardy space of a conjugate Beltrami equation, of which the
considered conductivity equation
is the compatibility condition (just like the Laplace
equation is the compatibility condition of the Cauchy-Riemann system).
Subsequently, a descent algorithm on the curve leads one to improve the
initial guess. For example, when the domain is
regarded as separating the edge of a tokamak's vessel
from the plasma (rotational symmetry makes this a 2-D situation),
this method can be used to estimate the shape of a plasma
subject to magnetic confinement.
It was successfully applied, in collaboration with CEA
(French nuclear agency) and the University of Nice (JAD Lab.),
to data from <i>Tore Supra</i>
<ref xlink:href="#apics-2014-bid14" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. The procedure is fast because no numerical integration of
the underlying PDE is needed, as an explicit basis of solutions to the
conjugate Beltrami equation in terms of Bessel functions
was found in this case. Generalizing this approach in a more systematic
manner to free boundary problems of Bernoulli type,
using descent
algorithms based on shape-gradient for such approximation-theoretic
criteria, is an interesting prospect, still to be pursued.</p>
        <p>The piece of work we just mentioned requires defining and studying Hardy
spaces of the conjugate-Beltrami equation, which is an interesting topic
by itself. For Sobolev-smooth coefficients
of exponent greater than 2,
this was done in references <ref xlink:href="#apics-2014-bid15" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
and <ref xlink:href="#apics-2014-bid16" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. The case of the critical exponent 2
is treated in <ref xlink:href="#apics-2014-bid17" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, which apparently provides
the first example of well-posedness for the Dirichlet problem in the
non-strictly elliptic case: the conductivity may be unbounded or zero on
sets of zero capacity and, accordingly, solutions need not be
locally bounded.</p>
        <p>The 3-D version of step 1 in Section <ref xlink:href="#uid7" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> is another
subject investigated by Apics: 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. This prototypical inverse problem
(<i>i.e.</i> inverse to the Cauchy problem for the Laplace equation)
often recurs in electromagnetism. At present, Apics is involved with
solving instances of this inverse problem arising
in two fields, namely medical imaging
<i>e.g.</i> for electroencephalography (EEG)
or magneto-encephalography (MEG), and
paleomagnetism (recovery of rocks magnetization)
<ref xlink:href="#apics-2014-bid11" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid18" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, see Section <ref xlink:href="#uid58" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
In this connection, we collaborate with two groups of partners:
Athena Inria project-team,
CHU La Timone, and BESA company on the one hand,
Geosciences Lab. at MIT and Cerege CNRS Lab.on the other hand.
The question is considerably more difficult than its 2-D
counterpart, due mainly to the lack of multiplicative structure for harmonic
gradients. Still,
considerable progress has been made over the last years
using methods of harmonic analysis and operator theory.</p>
        <p>The team is further concerned with 3-D generalizations and applications to
non-destructive control of step 2 in Section <ref xlink:href="#uid7" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
A typical problem is here to localize inhomogeneities or defaults such as
cracks, sources or occlusions in a planar or 3-dimensional object,
knowing thermal, electrical, or
magnetic measurements on the boundary.
These defaults can be expressed as a lack of harmonicity
of the solution to the associated Dirichlet-Neumann problem,
thereby posing an inverse potential problem in order to recover them.
In 2-D, finding an optimal discretization of the
potential in Sobolev norm amounts to solve a best rational approximation
problem, and the question arises as to how the location of the
singularities of the approximant (<i>i.e.</i> its poles)
reflects the location of the singularities of the potential
(<i>i.e.</i> the defaults we seek). This is a fairly deep issue
in approximation theory, to which Apics contributed convergence results
for certain classes of fields
expressed as Cauchy integrals over extremal contours for
the logarithmic potential
<ref xlink:href="#apics-2014-bid19" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid20" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> <ref xlink:href="#apics-2014-bid21" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Initial schemes to locate cracks or sources
<i>via</i> rational approximation on
planar domains were obtained this way <ref xlink:href="#apics-2014-bid12" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid9" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid22" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. It is remarkable that finite inverse source problems
in 3-D balls, or more general algebraic surfaces,
can be approached using these 2-D techniques upon slicing the
domain into planar sections
<ref xlink:href="#apics-2014-bid23" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid24" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
This bottom line generates a steady research activity
within Apics, and again applications are sought to medical imaging and
geosciences, see Sections <ref xlink:href="#uid26" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
<ref xlink:href="#uid27" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and <ref xlink:href="#uid58" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        <p>Conjectures can be raised on the behavior of
optimal potential discretization in 3-D, but answering them is
an ambitious program still in its infancy.</p>
      </subsection>
      <subsection id="uid13" level="2">
        <bodyTitle>Systems, transfer and scattering</bodyTitle>
        <participants>
          <person key="apics-2014-idp98680">
            <firstname>Laurent</firstname>
            <lastname>Baratchart</lastname>
          </person>
          <person key="apics-2014-idp109344">
            <firstname>Matthias</firstname>
            <lastname>Caenepeel</lastname>
          </person>
          <person key="apics-2014-idp100160">
            <firstname>Sylvain</firstname>
            <lastname>Chevillard</lastname>
          </person>
          <person key="apics-2014-idp106768">
            <firstname>Sanda</firstname>
            <lastname>Lefteriu</lastname>
          </person>
          <person key="apics-2014-idp102840">
            <firstname>Martine</firstname>
            <lastname>Olivi</lastname>
          </person>
          <person key="apics-2014-idp104272">
            <firstname>Fabien</firstname>
            <lastname>Seyfert</lastname>
          </person>
        </participants>
        <p>Through contacts with CNES (French space agency),
members of the team became involved in identification and tuning
of microwave electromagnetic filters used in space telecommunications,
see Section <ref xlink:href="#uid30" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. The initial problem was
to recover, from band-limited frequency measurements, physical
parameters of the device under examination.
The latter consists of interconnected dual-mode resonant cavities with
negligible loss, hence its scattering matrix is modeled 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 comes into play, 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
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 provide a framework to transform this ill-posed
issue into a series of regularized
analytic and meromorphic approximation problems.
More precisely,
the procedure sketched in Section <ref xlink:href="#uid7" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> goes as follows:</p>
        <orderedlist>
          <li id="uid14">
            <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
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="#uid18" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
while taking into account prior knowledge on the
decay of the response outside the bandwidth,
see <ref xlink:href="#apics-2014-bid25" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
for details.</p>
          </li>
          <li id="uid15">
            <p noindent="true">A stable rational approximation of
appropriate degree to the model obtained in the previous step
is performed.
For this, a descent method
on the compact manifold of inner matrices of given size and degree is used,
based on an original parametrization of stable transfer functions
developed within the team
<ref xlink:href="#apics-2014-bid25" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
          </li>
          <li id="uid16">
            <p noindent="true">Realizations of this rational approximant are computed.
To be useful, they must satisfy
certain constraints
imposed by the geometry of the device. These constraints typically come
from the coupling topology of the equivalent electrical network used
to model the filter. This network is composed of
resonators, coupled according to some specific graph.
This realization step can be recast,
under appropriate compatibility conditions <ref xlink:href="#apics-2014-bid26" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
as solving a zero-dimensional multivariate polynomial system.
To tackle this problem in practice, we use Gröbner basis techniques and
continuation methods which team up in the Dedale-HF software
(see Section <ref xlink:href="#uid49" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
          </li>
        </orderedlist>
        <p>Let us mention that extensions of classical coupling matrix theory to
frequency-dependent (reactive) couplings have lately been carried-out
<ref xlink:href="#apics-2014-bid27" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for wide-band design applications,
although further study is needed to make them computationally effective.</p>
        <p>Subsequently Apics started to investigate issues pertaining to
design rather than identification.
Given the topology of the filter,
a basic problem in this connection is to find the optimal response
subject to specifications
that bear on rejection, transmission and group delay of the
scattering parameters.
Generalizing the classical approach based on Chebyshev polynomials
for single band
filters, we recast the problem of multi-band response synthesis
as a generalization of the classical Zolotarev min-max problem
for rational functions <ref xlink:href="#apics-2014-bid28" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> <ref xlink:href="#apics-2014-bid29" 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 were implemented in the software
easy-FF (see Section <ref xlink:href="#uid51" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). Currently, the team is engaged
in synthesis of more complex microwave devices
like multiplexers and routers, which connect several
filters through wave guides.
Schur analysis plays an important role here, because
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-2014-bid30" 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.
The so-called Schur parameters of a function
may be viewed as Taylor coefficients for the hyperbolic metric of the disk, and
the fact that Schur functions are contractions for that metric lies at the
root of Schur's test.
Generalizations thereof turn out to be efficient to parametrize
solutions to contractive interpolation problems <ref xlink:href="#apics-2014-bid31" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Dwelling on this, Apics contributed
differential parametrizations (atlases of charts) of lossless
matrix functions <ref xlink:href="#apics-2014-bid32" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/><ref xlink:href="#apics-2014-bid33" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid34" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> which
are fundamental to our rational approximation
software RARL2 (see Section <ref xlink:href="#uid39" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).
Schur analysis is also instrumental to approach de-embedding issues,
and provides one with considerable
insight into the so-called matching problem. The latter consists in
maximizing the power a multiport can pass to a given load, and for
reasons of efficiency it
is all-pervasive in microwave and electric network design, <i>e.g.</i> of
antennas, multiplexers, wifi cards and more. It can be viewed as a
rational approximation problem in the hyperbolic metric, and the team
presently gets to grips with this hot topic using multipoint
contractive interpolation in
the framework of the (defense funded) ANR COCORAM,
see Sections <ref xlink:href="#uid65" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and <ref xlink:href="#uid88" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        <p>In recent years,
our attention was driven by CNES and UPV (Bilbao)
to questions about stability of high-frequency amplifiers,
see Section <ref xlink:href="#uid81" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Contrary to previously discussed devices, these are <i>active</i> components.
The response of an amplifier can be linearized around a
set of primary current and voltages,
and then admittances of the corresponding electrical network
can be computed at various frequencies, using the so-called harmonic
balance method.
The initial goal is to check for stability of the linearized model,
so as to ascertain existence of a well-defined working state.
The network is composed of lumped electrical elements namely
inductors, capacitors, negative <i>and</i> positive reactors,
transmission lines, and controlled current sources.
Our research so far focuses on describing the algebraic structure
of admittance functions, so as to set up a function-theoretic framework
where the two-steps approach outlined in Section <ref xlink:href="#uid7" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
can be put to work. The main discovery so far is that
the unstable part of each partial transfer function is rational,
see Section <ref xlink:href="#uid71" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      </subsection>
    </subsection>
    <subsection id="uid17" level="1">
      <bodyTitle>Approximation</bodyTitle>
      <participants>
        <person key="apics-2014-idp98680">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="apics-2014-idp100160">
          <firstname>Sylvain</firstname>
          <lastname>Chevillard</lastname>
        </person>
        <person key="apics-2014-idp101400">
          <firstname>Juliette</firstname>
          <lastname>Leblond</lastname>
        </person>
        <person key="apics-2014-idp102840">
          <firstname>Martine</firstname>
          <lastname>Olivi</lastname>
        </person>
        <person key="apics-2014-idp111904">
          <firstname>Dmitry</firstname>
          <lastname>Ponomarev</lastname>
        </person>
        <person key="apics-2014-idp104272">
          <firstname>Fabien</firstname>
          <lastname>Seyfert</lastname>
        </person>
      </participants>
      <subsection id="uid18" level="2">
        <bodyTitle>Best analytic approximation</bodyTitle>
        <p>In dimension 2, the prototypical problem to be solved in step 1 of
Section <ref xlink:href="#uid7" 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>, to recover
a holomorphic function from its values on a
subset <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>K</mi></math></formula> of the boundary of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula>.
For the discussion it is convenient to normalize <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula>,
which can be done by conformal mapping.
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 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 <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>-norm 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 <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>g</mi></math></formula> in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula>
matching some measured values <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>f</mi></math></formula> approximately
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"><mrow><mo>(</mo><mi>P</mi><mo>)</mo></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>, <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 behavior capturing <i>a priori</i>
assumptions on
the behavior 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
thereof. 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 smooth out 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 suited to handle point-wise
measurements.</p>
        <p>To fix terminology, we refer 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> as
a <i>bounded extremal problem</i>.
As shown in <ref xlink:href="#apics-2014-bid35" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid36" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
<ref xlink:href="#apics-2014-bid37" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, the solution to this convex
infinite-dimensional optimization problem can be obtained
when <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> upon iterating with respect to a Lagrange parameter
the solution to spectral equations for
appropriate Hankel and Toeplitz operators.
These spectral equations involve the solution to the special case
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>K</mi><mo>=</mo><mi>T</mi></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>, which is a standard extremal problem
<ref xlink:href="#apics-2014-bid38" 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> is more or less 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> can be set up in order to meet specific
needs.
For instance when dealing with lossless transfer functions
(see Section <ref xlink:href="#uid30" 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 point-wise 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-2014-bid39" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. In this form, the problem
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
used in control <ref xlink:href="#apics-2014-bid40" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid41" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. One can also impose bounds
on the real or imaginary part of <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> 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>,
which is useful when
considering Dirichlet-Neuman problems, see <ref xlink:href="#apics-2014-bid42" 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 to recover a harmonic function on
the inner boundary from Dirichlet-Neumann data on the
outer boundary (see Sections <ref xlink:href="#uid12" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#uid26" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#uid59" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#uid63" location="intern" 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 solution..
In this case, the Lagrange parameter indicates
how to deform the inner contour in order to improve
data fitting.
Similar topics are discussed in Sections <ref xlink:href="#uid12" 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"/>
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 no longer constant.
Then, the 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>
are those of a so-called conjugate Beltrami 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><mi>ν</mi><mover><mrow><mi>∂</mi><mi>f</mi></mrow><mo>¯</mo></mover></mrow></math></formula> <ref xlink:href="#apics-2014-bid43" 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-2014-bid16" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
<ref xlink:href="#apics-2014-bid15" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid44" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and
<ref xlink:href="#apics-2014-bid17" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Expansions
of solutions needed to constructively handle such issues in the specific
case of linear fractional conductivities (these occur in plasma shaping)
have been expounded in  <ref xlink:href="#apics-2014-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
some <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 <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>V</mi></math></formula> 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 substitute for
holomorphic Hardy spaces is provided by the Stein-Weiss Hardy spaces of
harmonic gradients <ref xlink:href="#apics-2014-bid45" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Conformal maps are no longer available
when <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>, so that <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Ω</mi></math></formula> can no longer be normalized.
More general geometries than spheres and half-spaces have not
been much studied so far.</p>
        <p>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><mo>(</mo><msub><mi>P</mi><mn>1</mn></msub><mo>)</mo></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. Given <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>,
Problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>P</mi><mn>1</mn></msub><mo>)</mo></mrow></math></formula> was solved in <ref xlink:href="#apics-2014-bid11" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> as well as
its analog on a shell. The solution extends the one
given in <ref xlink:href="#apics-2014-bid35" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> for the 2-D case,
using a generalization of Toeplitz operators. Thecas of the shell was motivated
An important ingredient is a refinement of the Hodge
decomposition, that we call the <i>Hardy-Hodge</i> 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><msup><mi>H</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>B</mi><mo>)</mo></mrow></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><msup><mrow><mi>ℝ</mi></mrow><mi>n</mi></msup><mo>∖</mo><mover><mi>B</mi><mo>¯</mo></mover><mo>)</mo></mrow></mrow></math></formula>,
and a tangential divergence free vector field on <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>S</mi></math></formula>; the space of such fields
is denoted by <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>D</mi><mo>(</mo><mi>S</mi><mo>)</mo></mrow></math></formula>.
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 by the real Hardy space
or the space of functions with bounded mean oscillation.
More generally this decomposition, which is valid on any sufficiently
smooth surface (see
Section <ref xlink:href="#uid58" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>), seems to play a fundamental role
in inverse potential problems. In fact, it was first introduced
formally on the plane to describe
silent magnetizations supported in <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>
(<i>i.e.</i> those generating no field
in the upper half space) <ref xlink:href="#apics-2014-bid18" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        <p>Just like 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> appeals to the solution of
problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>P</mi><mn>0</mn></msub><mo>)</mo></mrow></math></formula>, our ability to solve problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>P</mi><mn>1</mn></msub><mo>)</mo></mrow></math></formula> will depend on
the possibility to tackle the special 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>:</p>
        <p rend="quoted"><formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>P</mi><mn>2</mn></msub><mo>)</mo></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>V</mi><mo>∈</mo><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>S</mi><mo>)</mo></mrow></mrow></math></formula>
be 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.
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"><msub><mrow><mo>∥</mo><mi>G</mi><mo>-</mo><mi>V</mi><mo>∥</mo></mrow><mrow><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>S</mi><mo>)</mo></mrow></mrow></msub></math></formula> is minimum.</p>
        <p>Problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>P</mi><mn>2</mn></msub><mo>)</mo></mrow></math></formula> is simple 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> by
virtue of the Hardy Hodge decomposition together with orthogonality of
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>H</mi><mn>2</mn></msup><mrow><mo>(</mo><mi>B</mi><mo>)</mo></mrow></mrow></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>H</mi><mn>2</mn></msup><mrow><mo>(</mo><msup><mrow><mi>ℝ</mi></mrow><mi>n</mi></msup><mo>∖</mo><mover><mi>B</mi><mo>¯</mo></mover><mo>)</mo></mrow></mrow></math></formula>, which is the reason why
we were able to solve <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>P</mi><mn>1</mn></msub><mo>)</mo></mrow></math></formula> in this case. Other values of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>p</mi></math></formula> cannot
be treated as easily and are currently investigated by Apics,
especially 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> which is of particular interest
and presents itself as a 3-D analog to the Nehari problem
<ref xlink:href="#apics-2014-bid46" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        <p>Companion to problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>P</mi><mn>2</mn></msub><mo>)</mo></mrow></math></formula> is problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>P</mi><mn>3</mn></msub><mo>)</mo></mrow></math></formula> below.</p>
        <p rend="quoted"><formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>P</mi><mn>3</mn></msub><mo>)</mo></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>V</mi><mo>∈</mo><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>S</mi><mo>)</mo></mrow></mrow></math></formula>
be 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.
Find <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> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>D</mi><mo>∈</mo><mi>D</mi><mo>(</mo><mi>S</mi><mo>)</mo></mrow></math></formula> such that
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mrow><mo>∥</mo><mi>G</mi><mo>+</mo><mi>D</mi><mo>-</mo><mi>V</mi><mo>∥</mo></mrow><mrow><msup><mi>L</mi><mi>p</mi></msup><mrow><mo>(</mo><mi>S</mi><mo>)</mo></mrow></mrow></msub></math></formula> is minimum.</p>
        <p>Note that <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>P</mi><mn>2</mn></msub><mo>)</mo></mrow></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>P</mi><mn>3</mn></msub><mo>)</mo></mrow></math></formula> are identical in 2-D, since no non-constant
tangential divergence-free vector field exists on <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>T</mi></math></formula>.
It is no longer so in higher dimension, where both <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>P</mi><mn>2</mn></msub><mo>)</mo></mrow></math></formula> and
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>P</mi><mn>3</mn></msub><mo>)</mo></mrow></math></formula> arise in connection with
source recovery in electro/magneto encephalography and paleomagnetism, see
Sections <ref xlink:href="#uid12" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and <ref xlink:href="#uid26" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      </subsection>
      <subsection id="uid19" level="2">
        <bodyTitle>Best meromorphic and rational approximation</bodyTitle>
        <p>The techniques set forth in this section are used to solve
step 2 in Section <ref xlink:href="#uid11" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and instrumental to
approach inverse boundary value problems
for the 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="uid20" level="3">
          <bodyTitle>Scalar meromorphic and rational approximation</bodyTitle>
          <p>We 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>. By definition,
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> are (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"><mrow><mo>(</mo><msub><mi>P</mi><mn>0</mn></msub><mo>)</mo></mrow></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 <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>f</mi></math></formula> continuous is it known how to solve
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>P</mi><mi>N</mi></msub><mo>)</mo></mrow></math></formula> in closed form. The unique solution is given by AAK
theory (named after Adamjan, Arov and Krein),
which connects the spectral decomposition of Hankel operators with best
approximation <ref xlink:href="#apics-2014-bid46" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
          <p>The case where <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 for it
reduces to rational approximation. Indeed,
if we write the Hardy decomposition <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>f</mi><mo>=</mo><msup><mi>f</mi><mo>+</mo></msup><mo>+</mo><msup><mi>f</mi><mo>-</mo></msup></mrow></math></formula> where <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>f</mi><mo>+</mo></msup><mo>∈</mo><msup><mi>H</mi><mn>2</mn></msup></mrow></math></formula> and
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>f</mi><mo>-</mo></msup><mo>∈</mo><msup><mi>H</mi><mn>2</mn></msup><mrow><mo>(</mo><mi>ℂ</mi><mo>∖</mo><mover><mi>D</mi><mo>¯</mo></mover><mo>)</mo></mrow></mrow></math></formula>,
then <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>f</mi><mo>+</mo></msup><mo>+</mo><msub><mi>r</mi><mi>N</mi></msub></mrow></math></formula> where <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>r</mi><mi>N</mi></msub></math></formula> is a best approximant to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>f</mi><mo>-</mo></msup></math></formula> from <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>R</mi><mi>N</mi></msub></math></formula>
in <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><mi>T</mi><mo>)</mo></mrow></mrow></math></formula>.
Moreover, <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>r</mi><mi>N</mi></msub></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"><msup><mi>f</mi><mo>-</mo></msup></math></formula>. However, in contrast to the case
where <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 best approximant may <i>not</i> be unique.</p>
          <p>The former Miaou project (predecessor of Apics) designed a dedicated
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. This gradient algorithm proceeds
recursively with respect to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>N</mi></math></formula> on a compactification
of the parameter space <ref xlink:href="#apics-2014-bid47" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Although it has proved to be
effective in all applications carried out so far
(see Sections <ref xlink:href="#uid26" 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"/>),
it is still unknown 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="#uid39" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
          <p>In order to establish global convergence results, Apics has undertaken a
deeper study of the number and nature of critical points
(local minima, saddle points...), in which
tools from differential topology and
operator theory team up with classical interpolation theory
<ref xlink:href="#apics-2014-bid48" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid49" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Based on this work,
uniqueness or asymptotic uniqueness of the approximant
was proved for certain classes of functions like
transfer functions of relaxation
systems (<i>i.e.</i>
Markov functions) <ref xlink:href="#apics-2014-bid50" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and more
generally Cauchy integrals over hyperbolic geodesic arcs  <ref xlink:href="#apics-2014-bid51" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
These are the only results of this kind. Research by Apics on this topic
remained dormant for a while by reasons of opportunity,
but revisiting the work <ref xlink:href="#apics-2014-bid52" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> in higher dimension is still
a worthy endeavor. Meanwhile,
an analog to AAK theory
was 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> in <ref xlink:href="#apics-2014-bid37" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Although not as effective
computationally, it was recently used
to derive lower bounds <ref xlink:href="#apics-2014-bid53" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
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"><mrow><mo>(</mo><msub><mi>P</mi><mi>N</mi></msub><mo>)</mo></mrow></math></formula> is still quite open.</p>
          <p>A common
feature to the above-mentioned problems
is that critical point equations
yield non-Hermitian orthogonality relations for the denominator
of the approximant. This stresses connections with interpolation,
which is a standard way to build approximants,
and in many respects best or near-best rational approximation
may be regarded as a clever manner to pick interpolation points.
This was exploited in <ref xlink:href="#apics-2014-bid54" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid55" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
and is used in an essential manner to assess the
behavior of poles of best approximants to functions with branched
singularities,
which is of particular interest for inverse source problems
(<i>cf.</i> Sections <ref xlink:href="#uid52" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and <ref xlink:href="#uid58" 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"><mrow><mo>(</mo><msub><mi>P</mi><mi>N</mi></msub><mo>)</mo></mrow></math></formula> is best
approximation of a vector field by gradients of
discrete potentials generated by <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>N</mi></math></formula> point masses.
This basic issue is by no means fully understood,
and it is an exciting research prospect.
It is connected with certain generalizations of
Toeplitz or Hankel operators, and with constructive approaches
to so-called weak factorizations for real Hardy functions
<ref xlink:href="#apics-2014-bid56" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
          <p>Besides,
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 (<i>i.e.</i> a Schur function). In particular, Schur interpolation
lately received renewed attention
from the team, in connection with matching problems.
There, interpolation data are subject to
a well-known compatibility condition (positive definiteness of the so-called
Pick matrix), and the main difficulty is to put interpolation
points on the boundary of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula> while controlling both the degree and the
extremal points of the interpolant.
Results obtained by Apics in this direction generalize
a variant of contractive interpolation
with degree constraint studied in <ref xlink:href="#apics-2014-bid57" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
see Section <ref xlink:href="#uid65" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
We mention that contractive interpolation with nodes approaching the boundary
has been a subsidiary research topic by the team in the past,
which plays an interesting role in the
spectral representation of certain non-stationary
stochastic processes  <ref xlink:href="#apics-2014-bid58" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid59" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. The subject is
intimately connected to orthogonal polynomials on the unit circle,
and this line of investigation has recently evolved
towards an asymptotic study of orthogonal polynomials on planar domains,
which is an active area in approximation theory with application to
quantum particle systems and Hele-Shaw flows.
Section <ref xlink:href="#uid77" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        </subsection>
        <subsection id="uid21" level="3">
          <bodyTitle>Matrix-valued rational approximation</bodyTitle>
          <p>Matrix-valued approximation is necessary to handle systems with several
inputs and outputs but it generates additional difficulties
as compared to scalar-valued approximation,
both theoretically and 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 usual notion of degree
for rational functions.</p>
          <p>The basic problem that we consider now goes as follows:
<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 derived in
<ref xlink:href="#apics-2014-bid47" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and mentioned in
Section <ref xlink:href="#uid20" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
generalizes to
the matrix-valued situation <ref xlink:href="#apics-2014-bid60" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. The
first difficulty here is to parametrize
inner matrices (<i>i.e.</i> matrix-valued functions
analytic in the unit disk and unitary on the unit circle) of
given McMillan degree degree <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula>.
Indeed, inner matrices play the role of denominators
in fractional representations of transfer matrices (using the so-called
Douglas-Shapiro-Shields factorization).
The set of inner matrices of given degree is
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
(local parametrizations) and to handle changes of charts in the course of the algorithm. Such parametrization can be obtained using
interpolation theory and Schur-type algorithms, the parameters of which
are vectors or matrices
( <ref xlink:href="#apics-2014-bid32" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid34" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid33" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). Some of
these parametrizations are also interesting to compute
realizations and achieve filter synthesis
(<ref xlink:href="#apics-2014-bid34" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> <ref xlink:href="#apics-2014-bid33" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). The
rational approximation software “RARL2” developed
by the team is described in Section <ref xlink:href="#uid39" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
          <p>Difficulties relative to multiple local minima of course 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 degree <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula> or small perturbations thereof
(the consistency problem) was solved in  <ref xlink:href="#apics-2014-bid61" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Matrix-valued Markov functions are the only known example beyond this one
<ref xlink:href="#apics-2014-bid62" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
          <p>Let us stress that RARL2 seems the only algorithm
handling rational approximation in the matrix case that demonstrably
converges to
a local minimum while meeting stability constraints on the approximant.</p>
        </subsection>
      </subsection>
      <subsection id="uid22" level="2">
        <bodyTitle>Behavior of poles of meromorphic approximants</bodyTitle>
        <participants>
          <person key="apics-2014-idp98680">
            <firstname>Laurent</firstname>
            <lastname>Baratchart</lastname>
          </person>
        </participants>
        <p>We refer here to the behavior 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.
Normalizing 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 Problem <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><msub><mi>P</mi><mi>N</mi></msub><mo>)</mo></mrow></math></formula> in
Section <ref xlink:href="#uid20" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>;
invariance of the latter under conformal
mapping was established in <ref xlink:href="#apics-2014-bid10" 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 in approximation theory, assessing the
behavior of poles of rational approximants is essential
to obtain error rates as the degree goes large, and to tackle
constructive issues like
uniqueness. However, as explained in Section <ref xlink:href="#uid12" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
Apics considers this issue foremost as a means
to extract information on
singularities of the solution to a
Dirichlet-Neumann problem.
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="#uid26" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). It can be used
as a computationally cheap
initial condition for more precise but much heavier
numerical optimizations which often do not even converge
unless properly initialized.
As regards crack detection or source recovery, this approach
boils down to
analyzing the behavior 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-2014-bid10" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid21" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid19" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>),
that the poles of the
approximants accumulate, when the degree goes large,
to some extremal cut of minimum weighted
logarithmic capacity connecting
the singular points of the crack, or the sources
<ref xlink:href="#apics-2014-bid9" 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
on this cut in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>D</mi></math></formula>, therefore it charges the
singular points if one is able to approximate in
sufficiently high degree (this is where the method could fail, because
high-order approximation requires rather precise data).</p>
        <p>The case of two-dimensional singularities is still an outstanding open problem.</p>
        <p>It is remarkable that inverse source problems inside
a sphere or an ellipsoid in 3-D can
be approached with such 2-D techniques, as applied to planar
sections (see Section <ref xlink:href="#uid58" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). The technique is implemented in the software
FindSources3D, see Section <ref xlink:href="#uid52" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      </subsection>
      <subsection id="uid23" level="2">
        <bodyTitle>Miscellaneous</bodyTitle>
        <participants>
          <person key="apics-2014-idp100160">
            <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 on the software <i>Sollya</i> of which S. Chevillard is a
co-author, see Section <ref xlink:href="#uid56" 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="#uid18" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
However, developing Sollya is not a long-term objective of Apics.</p>
      </subsection>
    </subsection>
  </fondements>
  <domaine id="uid24">
    <bodyTitle>Application Domains</bodyTitle>
    <subsection id="uid25" level="1">
      <bodyTitle>Introduction</bodyTitle>
      <p>Application domains are naturally linked to the problems described in Sections <ref xlink:href="#uid12" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and <ref xlink:href="#uid13" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. By and large, they split
into a systems-and-circuits part and
an inverse-source-and-boundary-problems part, united under a common
umbrella of function-theoretic techniques as
described in Section <ref xlink:href="#uid17" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
    </subsection>
    <subsection id="uid26" level="1">
      <bodyTitle>Inverse source problems in EEG</bodyTitle>
      <participants>
        <person key="apics-2014-idp98680">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="apics-2014-idp101400">
          <firstname>Juliette</firstname>
          <lastname>Leblond</lastname>
        </person>
      </participants>
      <p>This work is performed in collaboration with Maureen Clerc and Théo Papadopoulo from the Athena Project-Team, and Jean-Paul Marmorat (Centre de mathématiques appliquées - CMA, École des Mines de Paris).</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="#uid12" 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. Indeed, the latter involves propagating the
initial conditions through several layers of different conductivities,
from the boundary shell
down to the center of the domain where the
singularities (<i>i.e.</i> the sources) lie.
Once propagated
to the innermost sphere, it turns out that traces of the
boundary data on 2-D cross sections coincide
with analytic functions with branched singularities
in the slicing plane
<ref xlink:href="#apics-2014-bid23" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. The singularities are
related to the actual location of the sources, namely their moduli
reach in turn a
maximum when the plane contains one of the sources. Hence we are
back to the 2-D framework of Section <ref xlink:href="#uid22" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
and recovering these singularities
can be performed <i>via</i> best rational approximation.
The goal is to produce a fast and sufficiently accurate
initial guess on the number
and location of the sources in order to run heavier
descent algorithms on the direct problem, which are more precise but
computationally costly and often
fail to converge if not properly initialized.</p>
      <p>Numerical experiments give
very good results on simulated data and we are now engaged in the process
of handling
real experimental data (see
Sections <ref xlink:href="#uid52" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and <ref xlink:href="#uid58" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>),
in collaboration with the Athena team at Inria Sophia Antipolis,
neuroscience teams in partner-hospitals (la Timone, Marseille),
and the BESA company (Munich).
</p>
    </subsection>
    <subsection id="uid27" level="1">
      <bodyTitle>Inverse magnetization problems</bodyTitle>
      <participants>
        <person key="apics-2014-idp98680">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="apics-2014-idp100160">
          <firstname>Sylvain</firstname>
          <lastname>Chevillard</lastname>
        </person>
        <person key="apics-2014-idp101400">
          <firstname>Juliette</firstname>
          <lastname>Leblond</lastname>
        </person>
        <person key="apics-2014-idp111904">
          <firstname>Dmitry</firstname>
          <lastname>Ponomarev</lastname>
        </person>
      </participants>
      <p>Generally speaking, inverse potential problems,
similar to the one appearing in Section <ref xlink:href="#uid26" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
occur naturally in connection with systems governed by Maxwell's equation
in the quasi-static approximation regime.
In particular, they arise in magnetic reconstruction issues. A specific
application is to geophysics, which led us to form the
Inria Associate Team “IMPINGE” (Inverse Magnetization Problems
IN GEosciences) together with MIT and Vanderbilt University.
A recent collaboration with Cerege (CNRS, Aix-en-Provence),
in the framework of the ANR-project MagLune,
completes this picture, see Section <ref xlink:href="#uid89" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <p>To set up the context,
recall that the Earth's geomagnetic field is generated by convection of the
liquid metallic core (geodynamo) and that rocks become magnetized by the
ambient field as they are formed or after subsequent alteration.
Their remanent magnetization provides
records of past variations of the geodynamo, which is used to study
important processes in Earth sciences like
motion of tectonic plates and geomagnetic reversals.
Rocks from Mars, the Moon, and asteroids also
contain remanent magnetization which indicates the past presence of
core dynamos. Magnetization in meteorites may
even record fields produced by the young sun and the protoplanetary disk
which may have played a key role in solar system formation.</p>
      <p>For a long time, paleomagnetic techniques were only capable of
analyzing bulk samples and
compute their net magnetic moment.
The development of SQUID microscopes
has recently extended the spatial resolution to sub-millimeter scales,
raising new physical and algorithmic challenges.
This associate team aims at tackling them,
experimenting with the
SQUID microscope set up in the Paleomagnetism Laboratory of the department of
Earth, Atmospheric and Planetary Sciences at MIT.
Typically, pieces of rock are sanded down to a thin slab,
and the magnetization has to be recovered from the field measured on a
parallel plane at small distance above the slab.</p>
      <p>Mathematically
speaking, both inverse source problems for EEG from Section <ref xlink:href="#uid26" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and inverse magnetization problems described presently
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>
      <formula id-text="1" id="uid28" textype="equation" 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 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.
The difference is that the distribution <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>m</mi></math></formula> is located in a volume in
the case of EEG, and on a plane in the case of rock magnetization.
This results in quite different identifiability properties, see  <ref xlink:href="#apics-2014-bid18" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and Section <ref xlink:href="#uid60" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
</p>
    </subsection>
    <subsection id="uid29" level="1">
      <bodyTitle>Free boundary problems</bodyTitle>
      <participants>
        <person key="apics-2014-idp98680">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="apics-2014-idp101400">
          <firstname>Juliette</firstname>
          <lastname>Leblond</lastname>
        </person>
      </participants>
      <p>This work is conducted in part with Yannick Privat, CNRS, Lab. J.-L. Lions, Paris.</p>
      <p>The team has engaged in the study of
problems with variable conductivity
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>σ</mi></math></formula>, governed by a 2-D
equation of the form <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mtext>div</mtext><mo>(</mo><mi>σ</mi><mi>∇</mi><mi>u</mi><mo>)</mo><mo>=</mo><mn>0</mn></mrow></math></formula>.
Such equations are in one-to-one
correspondence with real parts of solutions to
conjugate-Beltrami equations <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><mi>ν</mi><mover><mrow><mi>∂</mi><mi>f</mi></mrow><mo>¯</mo></mover></mrow></math></formula>,
so that complex analysis is a tool to study them,
see <ref xlink:href="#apics-2014-bid15" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
<ref xlink:href="#apics-2014-bid16" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#apics-2014-bid17" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
This research was prompted by
issues in 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-2014-bid63" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Investigations started
in collaboration with CEA-IRFM (Cadarache) and
the Laboratoire J.-A. Dieudonné at the Univ. of Nice-SA. Within the team,
they now expand to cover Dirichlet-Neumann problems for
larger classes of conductivities, <i>cf.</i> in particular
<ref xlink:href="#apics-2014-bid17" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
(see Section <ref xlink:href="#uid63" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).
</p>
    </subsection>
    <subsection id="uid30" level="1">
      <bodyTitle>Identification and design of microwave devices</bodyTitle>
      <participants>
        <person key="apics-2014-idp98680">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="apics-2014-idp100160">
          <firstname>Sylvain</firstname>
          <lastname>Chevillard</lastname>
        </person>
        <person key="apics-2014-idp102840">
          <firstname>Martine</firstname>
          <lastname>Olivi</lastname>
        </person>
        <person key="apics-2014-idp104272">
          <firstname>Fabien</firstname>
          <lastname>Seyfert</lastname>
        </person>
      </participants>
      <p>This is joint work 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 function-theoretic
applications by the team
is the identification and design of physical systems whose
performance is assessed frequency-wise. 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 an essentially discrete set of wave vectors is
selected. In the
considered range of frequency, the electrical field in each cavity can be
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="uid31">
        <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="#uid31" 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 screws are
conductors, they behave 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 an iris is opposite to that of a
screw: no condition is imposed on 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 Maxwell's equations is
given by the solution of a second order differential equation. Thus,
one obtains
an electrical model of the filter as a sequence of electrically-coupled
resonant circuits, each circuit being modeled by two resonators, one
per mode, the resonance frequency of which represents
the frequency of a mode, and
whose resistance accounts for electric losses (current on the surface) of the cavities.</p>
      <p>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.
One is now
interested in the power which is transmitted and reflected. This leads
one to define a
scattering matrix <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>S</mi></math></formula>, which may 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 on Figure <ref xlink:href="#uid37" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>), and the key step consists in expressing the components of the
equivalent electrical circuit as functions 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 quality of design, in particular 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 linearizing near the central frequency, which is no
longer
conjugate symmetric (<i>i.e.</i> the underlying system may no longer
have real
coefficients) but whose degree is divided by 2 (8 in the example).</p>
      <p>In short, the strategy for identification is as follows:</p>
      <simplelist>
        <li id="uid32">
          <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="uid33">
          <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="#uid18" 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="uid34">
          <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="#uid21" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
        </li>
        <li id="uid35">
          <p noindent="true">A realization of the transfer function is thus obtained, and
some additional symmetry constraints are imposed.</p>
        </li>
        <li id="uid36">
          <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="uid37">
        <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="#uid37" 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,
which are 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 proposed, in order to derive guaranteed optimal multi-band filter responses subject to modulus constraints <ref xlink:href="#apics-2014-bid29" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. This generalizes the classical single band design techniques based on Chebyshev polynomials and elliptic functions. The approach relies on the fact that the modulus of the scattering parameter <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>
      <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 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 unitary polynomial solving the classical Feldtkeller spectral equation:</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>The relative simplicity of the derivation of a filter's response, under
modulus constraints, owes much to the possibility of
forgetting about Feldtkeller's equation and express all design constraints
in terms of the filtering function. 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
among the team's recent investigation, where techniques based on
constrained Nevanlinna-Pick interpolation problems are being considered
(see Section <ref xlink:href="#uid65" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
      <p>Through contacts with CNES (Toulouse) and UPV (Bilbao),
Apics got further involved three years ago
with the design of amplifiers which, unlike filters, are active devices.
A prominent issue here is stability. A twenty years back, it was not
possible to simulate unstable responses, and only after building a device
could one detect instability. The advent of so-called <i>harmonic balance</i>
techniques, which compute steady state responses of linear elements in
the frequency domain and look for a periodic state in the time domain of
a network connecting these linear elements <i>via</i>
static nonlinearities made it possible to compute the harmonic response
of a (possibly nonlinear and unstable) device <ref xlink:href="#apics-2014-bid64" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
This has had tremendous impact on
design, and there is a growing demand for software analyzers.</p>
      <p>There are two types of stability involved. The first is stability of a fixed
point around which the linearized transfer function
accounts for small signal amplification. The second is stability of a
limit cycle which is reached when the input signal is no longer small
and truly nonlinear amplification is attained
(<i>e.g.</i> because of saturation).
Work by the team so far is concerned with the first type of stability,
and emphasis is put on defining and extracting the “unstable part” of the
response, see Section <ref xlink:href="#uid71" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
    </subsection>
  </domaine>
  <logiciels id="uid38">
    <bodyTitle>New Software and Platforms</bodyTitle>
    <subsection id="uid39" level="1">
      <bodyTitle>
        <ref xlink:href="http://www-sop.inria.fr/apics/RARL2/rarl2.html" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">RARL2</ref>
      </bodyTitle>
      <participants>
        <person key="apics-2014-idp102840">
          <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="#uid21" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>)
<ref xlink:href="http://www-sop.inria.fr/apics/RARL2/rarl2.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.<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="#uid21" 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="uid40">
          <p noindent="true">its internal realization,</p>
        </li>
        <li id="uid41">
          <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="uid42">
          <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 Section <ref xlink:href="#uid13" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).
An appropriate Möbius 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 large so that the choice of an initial point for the
optimization may play a crucial role. In this connection,
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="#uid30" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>) as well as sources or cracks recovery (see Section <ref xlink:href="#uid26" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). It was released to the universities of Delft, Maastricht, Cork, Brussels and Macao.
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 is used by FindSources3D (see Section <ref xlink:href="#uid52" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
    </subsection>
    <subsection id="uid43" level="1">
      <bodyTitle>RGC</bodyTitle>
      <participants>
        <person key="apics-2014-idp104272">
          <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 modeled by an electrical
circuit that was developed by the team (see Section <ref xlink:href="#uid30" 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-2014-bid65" 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 is not guaranteed to provide a solution.
In contrast, the software Dedale-HF
(see Section <ref xlink:href="#uid49" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>), which is the successor of RGC,
is guaranteed to solve this constraint realization problem.
</p>
    </subsection>
    <subsection id="uid44" level="1">
      <bodyTitle>
        <ref xlink:href="http://www-sop.inria.fr/apics/Presto-HF" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">PRESTO-HF</ref>
      </bodyTitle>
      <participants>
        <person key="apics-2014-idp104272">
          <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/Presto-HF" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://www-sop.inria.fr/apics/Presto-HF</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="uid45">
          <p noindent="true">determination of delay components caused by the access
devices (automatic reference plane adjustment),</p>
        </li>
        <li id="uid46">
          <p noindent="true">automatic determination of an analytic completion, bounded in modulus
for each channel,</p>
        </li>
        <li id="uid47">
          <p noindent="true">rational approximation of fixed McMillan degree,</p>
        </li>
        <li id="uid48">
          <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="#uid39" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).
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 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). A time-limited license has been bought by
Flextronics for testing purposes.
</p>
    </subsection>
    <subsection id="uid49" 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-2014-idp104272">
          <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 filtering community. Given a 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.
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="#uid50" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
      <object id="uid50">
        <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.
corresponding to the user-specified filter characteristics. The
reference files are computed off-line using Gröbner basis techniques or
numerical techniques based on the exploration of a monodromy group. The use of
such continuation techniques, combined with an efficient implementation of the
integrator, drastically reduces 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 for this software has been sold end of 2011 to TAS-Espagna,
in order to tune filters with topologies having multiple solutions.
For this, Dedale-HF teams up with Presto-HF.</p>
    </subsection>
    <subsection id="uid51" 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-2014-idp104272">
          <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 PhD. He still continues to maintain it.</p>
      <p>EasyFF is a software dedicated to the computation of complex, 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-2014-bid29" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
    </subsection>
    <subsection id="uid52" 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-2014-idp101400">
          <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 Project-Team, and with Jean-Paul Marmorat (Centre de mathématiques appliquées - CMA, École des Mines de Paris).</p>
      <p>FindSources3D <footnote id="uid53" id-text="2">CeCILL license, APP version 2.0 (2012): IDDN.FR.001.45009.001.S.A.2009.000.10000</footnote> is a software dedicated to source
recovery for the inverse EEG problem, in 3-layer spherical settings, from point-wise
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-2014-bid24" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and Section <ref xlink:href="#uid26" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, it makes use of the software RARL2
(Section <ref xlink:href="#uid39" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>) for the rational approximation step in plane
sections.</p>
      <p>A new release of FindSources3D is now available,
which will be demonstrated and distributed, in particular to the medical team we
maintain contact with (hosp. la Timone, Marseille).
The preliminary step (“cortical mapping”) is
now solved using expansion in spherical harmonics,
along with a constrained approximation scheme.</p>
      <p>Another release is being prepared, due to strong interest by the German
company BESA GmbH <footnote id="uid54" id-text="3"><ref xlink:href="http://www.besa.de/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>www.<allowbreak/>besa.<allowbreak/>de/</ref></footnote>, which
develops EEG software for research and clinical applications. A deeper collaboration with this company started last year.
Figure <ref xlink:href="#uid55" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> shows good results on a two sources distribution recovered by FindSources3D from values of the potential at electrodes on a sphere (scalp) generated by BESA's simulator.
There, the localization error is satisfactory, see
<ref xlink:href="#apics-2014-bid66" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Altogether FindSources3D provides suitable initial guess to heavier
dedicated recovery tools,
including an estimate of the number of sources
see Section <ref xlink:href="#uid59" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <object id="uid55">
        <table>
          <tr>
            <td>
              <ressource xlink:href="IMG/BilateralTemporal_NoNoise.png" type="float" width="227.62204pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
            </td>
          </tr>
        </table>
        <caption>Recovered 2 sources by FindSources3D (courtesy of BESA).</caption>
      </object>
    </subsection>
    <subsection id="uid56" 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="apics-2014-idp100160">
          <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ş (LAAS).</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>Among 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.
As well, it 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="uid57">
    <bodyTitle>New Results</bodyTitle>
    <subsection id="uid58" level="1">
      <bodyTitle>Source recovery problems</bodyTitle>
      <participants>
        <person key="apics-2014-idp98680">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="apics-2014-idp100160">
          <firstname>Sylvain</firstname>
          <lastname>Chevillard</lastname>
        </person>
        <person key="apics-2014-idp101400">
          <firstname>Juliette</firstname>
          <lastname>Leblond</lastname>
        </person>
        <person key="athena-2014-idp85600">
          <firstname>Christos</firstname>
          <lastname>Papageorgakis</lastname>
        </person>
        <person key="apics-2014-idp108032">
          <firstname>Olga</firstname>
          <lastname>Permiakova</lastname>
        </person>
        <person key="apics-2014-idp111904">
          <firstname>Dmitry</firstname>
          <lastname>Ponomarev</lastname>
        </person>
      </participants>
      <p>The research in this section is partly joint work with Qian Tao (Univ. Macao).</p>
      <p>It was proved in <ref xlink:href="#apics-2014-bid18" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
that a vector field with <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> components on <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>
can be expressed uniquely as the sum of (the trace on <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> of) a
harmonic gradient in the upper half-space,
of (the trace on <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> of) a
harmonic gradient in the lower half-space,
and of a tangential divergence free vector field on <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>.
This decomposition, that we call the <i>Hardy-Hodge</i> decomposition,
is valid not only for <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mi>p</mi></msup></math></formula> vector fields as mentioned in
Section <ref xlink:href="#uid18" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, but in much more general distribution spaces
like <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>W</mi><mrow><mo>-</mo><mi>∞</mi><mo>,</mo><mi>p</mi></mrow></msup></math></formula> which contains all distributions with compact support
or <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>B</mi><mi>M</mi><msup><mi>O</mi><mrow><mo>-</mo><mi>∞</mi></mrow></msup></mrow></math></formula> which contains all finite sums of derivatives of bounded
functions. This year we extended the decomposition to smooth hypersurfaces,
where divergence-free distributions may be defined as those annihilating
tangential gradient vector fields. We also studied the case where the
hypersurface is only Lipschitz smooth, and then we proved the
decomposition 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> provided that <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>p</mi></math></formula> is close enough to 2
(how close depends on the Lipschitz constant of the hypersurface).</p>
      <p>The Hardy-Hodge decomposition was used in <ref xlink:href="#apics-2014-bid18" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
to find the kernel of the planar magnetization operator, namely a
potential of
the form (<ref xlink:href="#uid28" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>) with <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>m</mi></math></formula> supported in a plane generates the zero
field above that plane if, and only if there is no harmonic
gradient from below in the Hardy-Hodge decomposition of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>m</mi></math></formula>.
The above mentioned generalization is now to the effect that a magnetization
supported on a bounded
closed surface (<i>e.g.</i> a sphere)
is silent in the unbounded component of
the complement of that surface if, and only if there is no harmonic
gradient from inside in its Hardy-Hodge decomposition.
An article is being written on this topic.</p>
      <p>We also considered the case where <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>m</mi></math></formula> is compactly supported in the
bounded component of the complement of that surface. Then <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>m</mi></math></formula> is silent if
and only if it is the sum of a divergence-free distribution and of finitely
many derivatives of gradients of Sobolev functions
having zero trace on the surface <ref xlink:href="#apics-2014-bid67" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <p>These results shed light on the indeterminacy of inverse source problems.</p>
      <subsection id="uid59" level="2">
        <bodyTitle>EEG</bodyTitle>
        <p>This work is conducted 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>In 3-D, functional or clinically active regions
in the cortex are often modeled by point-wise sources that must be
localized from measurements of a potential on the scalp. Inside the cortex,
identified to a ball after the cortical mapping step,
the potential satisfies a Poisson equation whose right-hand side is a linear
combination of gradients of Dirac masses (the sources in EEG).
In the work <ref xlink:href="#apics-2014-bid23" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> it was shown how
best rational approximation on a family of
circles, cut along parallel planes on the sphere, can
be used to recover the sources when they are at most 2 of them.
Later, results on the behavior of poles in
best rational approximation of fixed degree to functions with branch points
<ref xlink:href="#apics-2014-bid21" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> helped justifying the technique for
finitely many sources (see section <ref xlink:href="#uid26" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
        <p>The dedicated software FindSources3D (see section <ref xlink:href="#uid52" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>),
developed, in collaboration with the team Athena and the CMA,
dwells on these ideas. Functions to be approximated in 2-D slices
turn out to have additional <i>multiple</i> poles at their branch points
so that, in the rational approximation step,
it is beneficial to consider approximants with
multiple poles as well
(for EEG data, one should consider <i>triple</i> poles). Though numerically
observed in <ref xlink:href="#apics-2014-bid24" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, there is no mathematical
justification so far why these multiple poles are attracted more strongly than
simple poles to the singularities of the approximated function.
This intriguing property, however,
definitely helps source recovery <ref xlink:href="#apics-2014-bid66" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. This year we used it to automatically estimate the “most plausible”
number of sources (numerically: up to 3 at the moment).
Such enhancements were prompted by
a developing collaboration with the BESA company,
which is interested in automatic detection of the number of sources
(which was left to the user until recently).</p>
        <p>Soon, magnetic data from MEG (magneto-encephalography) will
become available together with EEG data; indeed, it is now
possible to use simultaneously the corresponding measurement devices.
We expect this to improve
the accuracy of our algorithms.</p>
        <p>In relation to other brain exploration modalities
like electrical impedance tomography (EIT, see <ref xlink:href="#apics-2014-bid68" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>), we also consider identifying electrical conductivity in the head.
This is the topic of the PhD of C. Papageorgakis,
co-advised with the Athena project-team and BESA GmbH.
Specifically, in layered models, we are concerned
with estimating conductivity of the skull (intermediate layer).
Indeed, the skull consists of a hard bone part,
the conductivity of which is more or less known,
and spongy bone compartments whose conductivities
may vary considerably with individuals.</p>
        <p>A preliminary question in this connection is:
can one uniquely recover a homogeneous skull conductivity from
a single EEG recording when the sources and the
conductivities of other layers are known? And if sources are not known,
which additional information do we need?
These are issues currently under investigation.
To put them into perspective, recall the famous Caldèron problem of deducing
a bounded (nonconstant) conductivity from the knowledge of all
possible pairs consisting of a potential and its current flux
at the boundary. In dimension 3, when the conductivity is not smooth
(less than <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>3</mn><mo>/</mo><mn>2</mn></mrow></math></formula> of a derivative), it is unknown whether
the problem is even injective (<i>i.e.</i> if two conductivities can have the
same pairs of boundary potential and flux).
A weaker, discrete version of this problem is:
if the conductivity takes on finitely many values and the geometry
of the level sets is known, does a finite set of
pairs of boundary potential and flux allow one to recover it?
This is a significant question to be tackled for
the purpose of source recovery in EEG
with known geometry but unknown conductivities inside the head.</p>
      </subsection>
      <subsection id="uid60" level="2">
        <bodyTitle>Inverse Magnetization problems</bodyTitle>
        <p>This work is carried out in the framework of the “équipe associée Inria”
IMPINGE, comprising Eduardo Andrade Lima and Benjamin Weiss from
the Earth Sciences department at MIT (Boston, USA) and
Douglas Hardin and Edward Saff from the Mathematics
department at Vanderbilt University (Nashville, USA),</p>
        <p>Localizing magnetic sources from measurements of the magnetic field
away from the support of the magnetization is the fundamental
issue under investigation by IMPINGE. The goal is to determine
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 (superconducting coil devices).
Currently, rock samples are cut into thin slabs and the magnetization
distribution is considered to lie in a plane, which makes for a
somewhat less indeterminate framework than EEG
because “less” magnetizations can produce the same field
(for the slab has no inner volume). Note however that EEG data
consist of both potential and current values at the boundary,
whereas in the present setting only
values of the normal magnetic field are provided to us.</p>
        <object id="uid61">
          <table>
            <tr>
              <td>
                <ressource xlink:href="IMG/schema-dispositif.png" type="float" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
              </td>
            </tr>
          </table>
          <caption>Schematic view of the experimental setup</caption>
        </object>
        <p>Figure <ref xlink:href="#uid61" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> presents a schematic view of the experimental setup: the sample lie on a horizontal plane at height 0 and its support is included in a rectangle. The vertical component <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>B</mi><mi>z</mi></msub></math></formula> of the field produced by the sample is measured on points of a horizontal <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>N</mi><mo>×</mo><mi>N</mi></mrow></math></formula> rectangular grid at height <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>h</mi></math></formula>.</p>
        <p>We set up last year a heuristic procedure to recover regularly spaced dipolar magnetizations, <i>i.e.</i> magnetizations composed of dipoles placed at the points of a regular rectangular <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>n</mi><mo>×</mo><mi>n</mi></mrow></math></formula> grid. The latter seems general enough a model class to approximate magnetizations commonly
encountered in samples. However, for reasons of computational complexity,
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula> is significantly smaller than <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>N</mi></math></formula> which limits
the power of the model.
Each dipole of the <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>n</mi><mo>×</mo><mi>n</mi></mrow></math></formula> grid is determined by the 3 components of its moment, thus the magnetization can be represented by a real <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mn>3</mn><msup><mi>n</mi><mn>2</mn></msup></mrow></math></formula>-vector. If we denote by <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>A</mi></math></formula> the matrix of the operator that maps such a vector <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>X</mi></math></formula> to the vector <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>b</mi></math></formula> of measurements (which belongs to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>ℝ</mi><msup><mi>N</mi><mn>2</mn></msup></msup></math></formula>), we want
to find <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>X</mi></math></formula> such that <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>A</mi><mi>X</mi></mrow></math></formula> is close to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>b</mi></math></formula>. For computational simplicity,
we use a Euclidean criterion <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mrow><mo>∥</mo><mi>A</mi><mi>X</mi><mo>-</mo><mi>b</mi><mo>∥</mo></mrow><mn>2</mn></msub></math></formula>, which reduces the problem to a singular value decomposition of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>A</mi></math></formula>. The inverse problem being ill-posed,
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>A</mi></math></formula> is poorly conditioned and we must resort to a
regularization technique. The one we developed initially has been
based on iteratively cropping the support of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>b</mi></math></formula>, using a threshold on the intensity of the dipoles at each step, so as to reduce the number of active components in <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>b</mi></math></formula>. Preliminary experiments were performed last year on synthetic data and also on a real example (Lonar spherule).</p>
        <p>This year, we performed more systematic experiments on real data (namely Allende chondrules and Hawaian basalt) provided by the SQUID scanning microscope at MIT lab. Cropping the support of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>b</mi></math></formula> using thresholding
has proved efficient to improve ill-conditioning
for samples with localized support embedded in the slab (<i>e.g.</i>, chondrules). On the other hand, when the support of the sample is spread out (<i>e.g.</i>, Hawaian basalt), the reduction of active components of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>b</mi></math></formula>
was insignificant. We used this inversion procedure to
estimate the net moment. The importance of the latter has been emphasized by the geophysicists at MIT for at least two reasons: firstly it yields important geological information on the sample in particular to estimate the magnitude of the ambient magnetic field at the time the rock was formed. Secondly, it may
to some extent be measured independently, using a magnetometer, thereby allowing one to cross-validate the approach. A third, computational reason is that knowledge of the net moment should pave the way to a numerically stable reconstruction of an equivalent unidirectional magnetization. The support of the latter would provide us with valuable information to test for unidirectionality of the true magnetization, which is an important question to physicists.</p>
        <p>When the support can be significantly shrunk while keeping the residue small (<i>i.e.</i>, explaining the data satisfactorily), estimates of the net moment based on the dipolar model obtained by inversion seem to be good. They apparently supersede the measurements by magnetometers as well as by dipole fitting procedures set up at MIT. It is interesting to notice that the magnetization obtained by our inversion procedure, either before or after shrinking the support, often does not resemble the true magnetization, even when it yields correct moment and field. This can be seen on synthetic examples and may be surmised on real data, thereby confirming that recovering the net moment and recovering the magnetization are rather different problems, the latter being
considerably more ill-posed than the former.</p>
        <p>One specific difficulty with chondrule-type examples has been
to account for their thickness: they are indeed small spheres and their
3-D character cannot be completely ignored. In order to use the inversion procedure set up in the plane, we investigated the following question.
Assume that the sample has some thickness, but small enough that the
magnetization at a point <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>P</mi><mo>=</mo><mo>(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>,</mo><mi>z</mi><mo>)</mo></mrow></math></formula> inside the sample depends only
on <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>x</mi></math></formula> and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>y</mi></math></formula> (possibly weighted by some function that depends only on <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>z</mi></math></formula>), <i>i.e.</i> that it is of the form <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>m</mi><mo>(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>)</mo><mi>φ</mi><mo>(</mo><mi>z</mi><mo>)</mo></mrow></math></formula>. If we consider a (truly) planar magnetization with the same distribution <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>m</mi><mo>(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>)</mo></mrow></math></formula> but on a plane lying
at some nonzero height <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>ε</mi></math></formula>, how to choose <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>ε</mi></math></formula> so as to produce a field at height <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>h</mi></math></formula> which is closest to the field produced by the thick magnetization? This has been the object of the internship of Olga Permiakova who used local expansion of the dipole-to-field map (see her report <footnote id="uid62" id-text="4"><ref xlink:href="http://www-sop.inria.fr/apics/IMPINGE/Documents/Report_Permiakova_Olga.pdf" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>www-sop.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>apics/<allowbreak/>IMPINGE/<allowbreak/>Documents/<allowbreak/>Report_Permiakova_Olga.<allowbreak/>pdf</ref></footnote>). An article is being written on this subject.</p>
        <p>The case where the magnetization is flat but spread out on the sample
is more difficult. First of all, the computational effort becomes significant and led us to use the cluster at Inria Sophia Antipolis.
We succeeded in obtaining full inversions for the Hawaian basalt. The residue (approximation error) is moderate but not impressively small,
which indicates that we reach the limit of modeling
magnetizations by a regular grid of dipoles. However the computation of the moment compares favorably with estimates previously obtained by a different technique at MIT lab. Still, using a cluster and two days of evaluation to obtain a coarse estimate of the net moment of a sample is rather inefficient and calls for new investigations.</p>
        <p>We also experimented an alternative regularization procedure, based on <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mn>2</mn></msup></math></formula> minimization under <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mn>1</mn></msup></math></formula> penalty as solved by the SALSA algorithm. Such methods
are quite popular today for sparse recovery. However,
the computational load, as well as the quality of the results, do not differ significantly from those obtained previously.</p>
        <p>We now develop new methods in order to estimate the net moment of the magnetization, based on improvements of previously used Fourier techniques, and recently we reformulated the problem with the help of Kelvin transforms.
It has been realized that the success of net moment recovery hinges on
the ability to extrapolate the measurements. In particular, we managed to considerably improve previous estimates by means of data extension based on dipolar field asymptotics.</p>
        <p>In the course of inverting the field map, we singled out magnetizations which are numerically (almost) silent from above though not from below. This illustrates how ill-posed (unstable) the problem, as theory predicts that no compactly supported magnetization can be exactly silent from above without being also exactly silent from below. Although such magnetizations seem to have small moment and therefore do not endanger the possibility of recovering the net moment,
their existence is certainly an obstacle to inversion of the field map without extra measurements or hypotheses (<i>e.g.</i>, measuring from below or
assuming unidirectionality).</p>
        <p>In the course of the doctoral work by D. Ponomarev,
the study of the 2D spectral decomposition of the truncated Poisson operator
has been undertaken. It is a simplified version of the relation between the magnetization and the magnetic potential.
We considered several formulations in terms of singular integral equations and matrix Riemann-Hilbert problems, and focused on finding closed form solutions for various approximations of the Poisson operator in terms of
a the ratio between the distance <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>h</mi></math></formula> to the measurement plane
and the sample support size.</p>
        <p>Lately, Apics became a partner of the
ANR project MagLune, dealing with Lunar magnetism, a
in collaboration with the Geophysics and Planetology Department of Cerege,
CNRS, Aix-en-Provence, see section <ref xlink:href="#uid89" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. The research is
just starting, and will focus on computing net moments of lunar rock samples
collected by NASA.</p>
      </subsection>
    </subsection>
    <subsection id="uid63" level="1">
      <bodyTitle>Boundary value problems</bodyTitle>
      <participants>
        <person key="apics-2014-idp98680">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="apics-2014-idp100160">
          <firstname>Sylvain</firstname>
          <lastname>Chevillard</lastname>
        </person>
        <person key="apics-2014-idp101400">
          <firstname>Juliette</firstname>
          <lastname>Leblond</lastname>
        </person>
        <person key="apics-2014-idp111904">
          <firstname>Dmitry</firstname>
          <lastname>Ponomarev</lastname>
        </person>
      </participants>
      <p>Collaboration with Laurent Bourgeois (ENSTA ParisTech, Lab. Poems), Elodie Pozzi (Univ. Bordeaux, IMB),
Emmanuel Russ (Univ. Grenoble, IJF).</p>
      <p>
        <b>Generalized Hardy classes</b>
      </p>
      <p noindent="true">As we mentioned in section
<ref xlink:href="#uid29" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>,
2-D diffusion 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> with real non-negative valued
conductivity <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>σ</mi></math></formula> can be viewed as compatibility conditions
for the so-called conjugate Beltrami
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><mi>ν</mi><mover><mrow><mi>∂</mi><mi>f</mi></mrow><mo>¯</mo></mover></mrow></math></formula> with
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>ν</mi><mo>=</mo><mo>(</mo><mn>1</mn><mo>-</mo><mi>σ</mi><mo>)</mo><mo>/</mo><mo>(</mo><mn>1</mn><mo>+</mo><mi>σ</mi><mo>)</mo></mrow></math></formula> <ref xlink:href="#apics-2014-bid15" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Thus, the conjugate Beltrami equation is a means to replace the initial
second order diffusion equation by a first order system of two
real equations, merged into a single complex one.
Hardy spaces under study here
are those of this conjugate Beltrami equation: they are comprised
of solutions to that
equation in the considered domain whose <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mi>p</mi></msup></math></formula> means over curves
tending to the boundary
of the domain remain bounded.
They will for example replace holomorphic 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> when dealing with non-constant (isotropic) conductivity.
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>),
which is suitable for identification from
point-wise measurements,
and turn out to be dense on strict subsets of the boundary.
This allows one 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 manner which is reminiscent of what we discussed
for analytic functions in section <ref xlink:href="#uid18" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <p>The study of such Hardy spaces for Lipschitz <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>σ</mi></math></formula> was reduced in
<ref xlink:href="#apics-2014-bid15" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> to that of spaces of
pseudo-holomorphic functions with bounded coefficients,
which were apparently first considered on the disk by S. Klimentov.
Solutions factorize as <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>e</mi><mi>s</mi></msup><mi>F</mi></mrow></math></formula>, where
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>F</mi></math></formula> is a holomorphic Hardy function while <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>s</mi></math></formula> is
in the Sobolev space <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>r</mi></mrow></msup></math></formula> for all <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>r</mi><mo>&lt;</mo><mi>∞</mi></mrow></math></formula>
(Bers factorization), and the analog to the M. Riesz theorem holds
which amounts to solvability of the Dirichlet problem
with <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mi>p</mi></msup></math></formula> boundary data. The case of
finitely connected domains was carried out in <ref xlink:href="#apics-2014-bid16" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
      <p>This year, we addressed in <ref xlink:href="#apics-2014-bid6" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
the uniqueness issue for the classical Robin inverse problem
on a Lipschitz-smooth domain <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>Ω</mi><mo>⊂</mo><msup><mi>ℝ</mi><mi>n</mi></msup></mrow></math></formula>, with <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mi>∞</mi></msup></math></formula> Robin coefficient, <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>L</mi><mn>2</mn></msup></math></formula> Neumann data and isotropic conductivity of class <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msup><mi>W</mi><mrow><mn>1</mn><mo>,</mo><mi>r</mi></mrow></msup><mrow><mo>(</mo><mi>Ω</mi><mo>)</mo></mrow></mrow></math></formula>, <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>r</mi><mo>&gt;</mo><mi>n</mi></mrow></math></formula>. The Robin inverse problem consists in recovering the
ratio of the normal derivative and the solution
(the so-called Robin coefficient) on a subset of the boundary,
knowing them on the complementary subset.
We showed that uniqueness of the Robin coefficient on a subset of the boundary, given Cauchy data on the complementary subset, does hold when <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> whenever the boundary subsets are of positive Lebesgue measure. We also showed
that this no longer holds in higher dimension,
and we gave counterexamples when <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>. The subsets in these
counterexamples look very bad, and it is natural to ask whether
uniqueness prevails if they have interior points.
This raises an interesting open issue on harmonic gradients,
namely: can a nonzero harmonic function vanish together with its normal
derivative on a subset of the boundary of positive measure, and still
the Robin coefficient is bounded in a neighborhood of that set?
This question is worth investigating</p>
      <p>
        <b>Best constrained analytic approximation</b>
      </p>
      <p noindent="true">Several questions about the behavior of solutions to the
bounded extremal 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="#uid18" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, and of some
generalizations thereof,
are still under study by Apics..
We considered additional interpolation constraints on the disk
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>, and derived new stability estimates for the solution
<ref xlink:href="#apics-2014-bid69" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. An article is being written on the subject.
Ongoing work is geared towards applications of <ref xlink:href="#apics-2014-bid69" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
New insight leads us to relate these results to
overdetermined boundary value problems for 2D Laplace equations
on irregular boundaries. This has applications in
set-ups where measurements are obtained from oddly distributed sensors.
Treating some of the measurements as pointwise interpolation
constraints seems a reasonable strategy in comparison with
interpolation of the data along a geometrically complicated
boundary.
Such interpolation constraints arise naturally in inverse boundary problems
like plasma shaping, when
some of the measurements are performed inside the chamber of the tokamak,
see section
<ref xlink:href="#uid29" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
</p>
    </subsection>
    <subsection id="uid64" level="1">
      <bodyTitle>Matching problems and their applications - De-embedding of filters in multiplexers</bodyTitle>
      <participants>
        <person key="apics-2014-idp98680">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="apics-2014-idp102840">
          <firstname>Martine</firstname>
          <lastname>Olivi</lastname>
        </person>
        <person key="apics-2014-idp106768">
          <firstname>Sanda</firstname>
          <lastname>Lefteriu</lastname>
        </person>
        <person key="apics-2014-idp105512">
          <firstname>David</firstname>
          <lastname>Martinez Martinez</lastname>
        </person>
        <person key="apics-2014-idp104272">
          <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 (Siae Microelettronica, Milan, Italy).</p>
      <subsection id="uid65" level="2">
        <bodyTitle>Matching problems and their applications</bodyTitle>
        <p>Filter synthesis is usually performed under the hypothesis that both ports
of the filter are loaded on a constant resistive load (usually 50 Ohm). In complex systems, filters
are however cascaded with other devices, and end up
being loaded, at least at one port, on a non purely resistive frequency varying load. This
is for example the case when synthesizing a multiplexer: each filter is here
loaded at one of its ports on a common junction. Thus,
the load is by construction non constant with the frequency,
and not purely resistive either.
Likewise, in an emitter-receiver, the antenna is followed by a
filter.
Whereas the antenna can usually be regarded as a resistive load at
some frequencies, this is far from being true on the
whole working band.
A mismatch between the antenna and the filter,
however, causes irremediable power losses, both in emission and transmission.
Our goal is therefore to develop a filter synthesis method that allows to match varying loads on specific frequency bands.</p>
        <object id="uid66">
          <table>
            <tr>
              <td>
                <ressource xlink:href="IMG/Figure5.png" type="float" width="384.2974pt" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest" media="WEB"/>
              </td>
            </tr>
          </table>
          <caption>Filter plugged on a system with reflexion coefficient <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>L</mi><mn>11</mn></msub></math></formula></caption>
        </object>
        <p>Figure <ref xlink:href="#uid66" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> shows a filter with scattering matrix <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>S</mi></math></formula>, plugged at its right port on a frequency varying load with reflexion parameter <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>L</mi><mrow><mn>1</mn><mo>,</mo><mn>1</mn></mrow></msub></math></formula>. If the filter is lossless, simple algebraic manipulations show that on the frequency axis the reflexion parameter satisfies:</p>
        <formula type="display">
          <math xmlns="http://www.w3.org/1998/Math/MathML" mode="display" overflow="scroll">
            <mrow>
              <mfenced separators="" open="|" close="|">
                <msub>
                  <mi>G</mi>
                  <mrow>
                    <mn>1</mn>
                    <mo>,</mo>
                    <mn>1</mn>
                  </mrow>
                </msub>
              </mfenced>
              <mo>=</mo>
              <mfenced separators="" open="|" close="|">
                <mfrac>
                  <mrow>
                    <msub>
                      <mi>S</mi>
                      <mrow>
                        <mn>2</mn>
                        <mo>,</mo>
                        <mn>2</mn>
                      </mrow>
                    </msub>
                    <mo>-</mo>
                    <mover>
                      <msub>
                        <mi>L</mi>
                        <mrow>
                          <mn>1</mn>
                          <mo>,</mo>
                          <mn>1</mn>
                        </mrow>
                      </msub>
                      <mo>¯</mo>
                    </mover>
                  </mrow>
                  <mrow>
                    <mn>1</mn>
                    <mo>-</mo>
                    <msub>
                      <mi>S</mi>
                      <mrow>
                        <mn>2</mn>
                        <mo>,</mo>
                        <mn>2</mn>
                      </mrow>
                    </msub>
                    <msub>
                      <mi>L</mi>
                      <mrow>
                        <mn>1</mn>
                        <mo>,</mo>
                        <mn>1</mn>
                      </mrow>
                    </msub>
                  </mrow>
                </mfrac>
              </mfenced>
              <mo>.</mo>
            </mrow>
          </math>
        </formula>
        <p noindent="true">The matching problem of minimizing <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mrow><mo>|</mo></mrow><msub><mi>G</mi><mrow><mn>1</mn><mo>,</mo><mn>1</mn></mrow></msub><mrow><mo>|</mo></mrow></mrow></math></formula>
amounts therefore to minimize the pseudo-hyperbolic distance between
the filter's reflexion parameter <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> and the load's reflexion <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>L</mi><mrow><mn>1</mn><mo>,</mo><mn>1</mn></mrow></msub></math></formula>,
on a given frequency band. For a broad class of filters, namely those that can be modeled by a circuit of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula> coupled resonators, the scattering matrix <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>S</mi></math></formula> is a rational function of McMillan degree <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula> in the frequency.
The matching problem appears therefore as a rational approximation problem in
hyperbolic metric. When <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula> is fixed, the latter is non-convex and led us to
seek methods to derive good initial guesses for classical descent algorithms.
To this effect, if <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>S</mi><mrow><mn>2</mn><mo>,</mo><mn>2</mn></mrow></msub><mo>=</mo><mi>p</mi><mo>/</mo><mi>q</mi></mrow></math></formula> we considered the following
interpolation problem: given <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula> frequency points <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><msub><mi>w</mi><mn>1</mn></msub><mo>⋯</mo><msub><mi>w</mi><mi>n</mi></msub></mrow></math></formula> and a
transmission polynomial <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>r</mi></math></formula>, to find a unitary polynomial <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>p</mi></math></formula>
of degree <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula> such that:</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>
                    <mover>
                      <mrow>
                        <msub>
                          <mi>L</mi>
                          <mrow>
                            <mn>1</mn>
                            <mo>,</mo>
                            <mn>1</mn>
                          </mrow>
                        </msub>
                        <mrow>
                          <mo>(</mo>
                          <msub>
                            <mi>w</mi>
                            <mi>j</mi>
                          </msub>
                          <mo>)</mo>
                        </mrow>
                      </mrow>
                      <mo>¯</mo>
                    </mover>
                    <mspace width="0.166667em"/>
                    <mspace width="0.166667em"/>
                    <mspace width="0.166667em"/>
                  </mrow>
                </mtd>
              </mtr>
            </mtable>
          </math>
        </formula>
        <p noindent="true">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 of degree <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula>
satisfying the Feldtkeller equation</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 noindent="true">which accounts for the losslessness of the filter. This problem can be seen as an extended Nevanlinna-Pick interpolation problem, that was considered in
<ref xlink:href="#apics-2014-bid57" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> when the interpolation points <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>w</mi><mi>j</mi></msub></math></formula>
lie in the <i>open</i> left half-plane. The method in the last reference does
not extend to imaginary interpolation point and we
used rather different, differential-topological techniques
to prove that this problem has a unique solution,
which can be computed by continuation. In the setting of multiplexer synthesis, where this result must e applied recursively to each filter,
we showed the existence of a fixed point for the tuning procedure,
based on Brouwer's fixed point theorem. These results were presented at the MTNS <ref xlink:href="#apics-2014-bid70" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, at the plenary of session of Ernsi workshop 2014, and they lie at the heart of the ANR Cocoram on co-integration of filters and antennas (<ref xlink:href="#uid88" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). Implementation of the continuation algorithm has been done under contract with CNES and yields encouraging results.
Generalizations of the interpolation problem where the monic condition
is relaxed are under study in the framework of co-integration
of filters and antennas.</p>
      </subsection>
      <subsection id="uid67" level="2">
        <bodyTitle>De-embedding of multiplexers</bodyTitle>
        <p>This work is pursued in collaboration with Thales Alenia Space, Siae Microelettronica, Xlim and under
contract with CNES-Toulouse (see section <ref xlink:href="#uid80" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
        <p>Let <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>S</mi></math></formula> be the scattering parameters 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="#uid70" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. The de-embedding problem is to recover 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>
and it can be stated under various hypotheses. Last year we studied this
problem when <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> are known <ref xlink:href="#apics-2014-bid71" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
but no special structure for 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> is assumed. It was shown that for generic <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>T</mi></math></formula> and 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>, the de-embedding problem has a unique solution.
In practice, however, the junction's response is far from being generic,
as it is usually obtained <i>via</i> assembly of T-junctions.
This makes the problem extremely sensitive to measurement noise. It was also noticed that in practical applications, scattering measurements of the junction are hardly available.</p>
        <p>It is therefore natural to consider the following de-embedding problem. Given <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>S</mi></math></formula>, and under the assumption that</p>
        <simplelist>
          <li id="uid68">
            <p noindent="true">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> are rational of known McMillan degree,</p>
          </li>
          <li id="uid69">
            <p noindent="true">the coupling geometry of their circuital realization is known,</p>
          </li>
        </simplelist>
        <p>what can be said about the filter's response? Note that the above assumptions
do not bear on the junction. Nevertheless, we showed that the filter's
responses are identifiable up to a constant matrix chained at their
nearest port to the junction <ref xlink:href="#apics-2014-bid72" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
It was proved also that the uncertainty induced by the chain matrix
bears only on the resonant frequency of the last cavity of each filter,
as well as on their output coupling. Most of the filters' parameters
can therefore be recovered in principle. The approach is constructive and relies on rational approximation to certain scattering parameters, as well as on
some extraction procedure similar to Darlington's synthesis. Software development is under way and experimental studies have started on data
provided to us by Thales Alenia Space and by Siae Microelettronica.
A mid-term objective is to extend Presto-HF (see Section <ref xlink:href="#uid44" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>)
so as to handle de-embedding problems
for multiplexers and more generally for multi-ports.</p>
        <object id="uid70">
          <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="uid71" level="1">
      <bodyTitle>Stability of amplifiers</bodyTitle>
      <participants>
        <person key="apics-2014-idp98680">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
        <person key="apics-2014-idp100160">
          <firstname>Sylvain</firstname>
          <lastname>Chevillard</lastname>
        </person>
        <person key="apics-2014-idp102840">
          <firstname>Martine</firstname>
          <lastname>Olivi</lastname>
        </person>
        <person key="apics-2014-idp104272">
          <firstname>Fabien</firstname>
          <lastname>Seyfert</lastname>
        </person>
      </participants>
      <p>This work is performed under contract with CNES-Toulouse
and the University of Bilbao.
The goal is to help designing 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 detect instability before an amplifying circuit is physically built. Our goal is
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
in the small signal regime. Using this approximation, diodes appear as
negative resistors and transistors as current sources
controlled by the voltage at certain nodes of the circuit.</p>
      <p>Over the last three years,
we studied several features of transfer functions
of amplifying electronic circuits:</p>
      <simplelist>
        <li id="uid72">
          <p noindent="true">We characterized the class of transfer functions which can be realized with ideal components linearized active components, together with standard passive components (resistors, inductors, capacitors and transmission lines).
It is exactly the field of rational functions in the complex variable
and in the hyperbolic cosines and identity-times-hyperbolic sines of
polynomials of degree 2 with real negative roots.</p>
        </li>
        <li id="uid73">
          <p noindent="true">We introduced a realistic notion of stability,
by terming stable a circuit whose transfer function belongs to <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mi>∞</mi></msup></math></formula>,
as long a sufficiently high resistor is added in parallel to that circuit.</p>
        </li>
        <li id="uid74">
          <p noindent="true">We constructed unstable circuits having no pole in the right half-plane, which came as a surprise to our partners.</p>
        </li>
        <li id="uid75">
          <p noindent="true">In order to circumvent these pathological examples, we introduced
a realistic hypothesis that there are small inductive and capacitive
effects to active components. Our main result is that a realistic circuit
without poles on the imaginary axis
is unstable if and only if it has poles in the right half-plane.
Moreover, there can only be finitely many of them.</p>
        </li>
      </simplelist>
      <p>This year, we were led to modify our definition of stability,
taking a hint from scattering theory. We say that a transfer function
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Z</mi></math></formula> is stable whenever <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mo>(</mo><mi>R</mi><mo>-</mo><mi>Z</mi><mo>)</mo><mo>/</mo><mo>(</mo><mi>R</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><mi>H</mi><mi>∞</mi></msup></math></formula>
with uniformly bounded <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mi>H</mi><mi>∞</mi></msup></math></formula>-norm for all <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>R</mi></math></formula> large enough.
Equivalently, this means that the circuit can amplify signals but not
require an unbounded amount of energy from the primary power circuit.
This new definition is really about energy, hence is more natural.
Also, it allows us a unified characterization
in the corner case where instabilities are located
on the imaginary axis. We obtained this way a nice characterization: <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Z</mi></math></formula> is stable if and only if it has no pole in the open right half plane, while each pole it may have on the imaginary axis is simple and has a residue with strictly positive real part. We published a research
report <ref xlink:href="#apics-2014-bid73" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> and an article is being written
to report on our results.
</p>
    </subsection>
    <subsection id="uid76" level="1">
      <bodyTitle>Approximation</bodyTitle>
      <participants>
        <person key="apics-2014-idp98680">
          <firstname>Laurent</firstname>
          <lastname>Baratchart</lastname>
        </person>
      </participants>
      <subsection id="uid77" level="2">
        <bodyTitle>Orthogonal Polynomials</bodyTitle>
        <p>This is joint work with
Nikos Stylianopoulos (Univ. of Cyprus).</p>
        <p>We study the asymptotic behavior of weighted orthogonal polynomials on
a bounded simply connected plane domain <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Ω</mi></math></formula>.
The <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula>-th orthogonal polynomial <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>P</mi><mi>n</mi></msub></math></formula> has
degree <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula>, positive leading coefficient, and satisfies</p>
        <formula type="display">
          <math xmlns="http://www.w3.org/1998/Math/MathML" mode="display" overflow="scroll">
            <mrow>
              <msub>
                <mo>∫</mo>
                <mi>Ω</mi>
              </msub>
              <msub>
                <mi>P</mi>
                <mi>n</mi>
              </msub>
              <msub>
                <mover>
                  <mi>P</mi>
                  <mo>¯</mo>
                </mover>
                <mi>k</mi>
              </msub>
              <mi>w</mi>
              <mspace width="0.166667em"/>
              <mi>d</mi>
              <mi>m</mi>
              <mo>=</mo>
              <msub>
                <mi>δ</mi>
                <mrow>
                  <mi>n</mi>
                  <mo>,</mo>
                  <mi>k</mi>
                </mrow>
              </msub>
            </mrow>
          </math>
        </formula>
        <p noindent="true">where <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>w</mi></math></formula> is an integrable positive weight and
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>δ</mi><mrow><mi>n</mi><mo>,</mo><mi>k</mi></mrow></msub></math></formula> is the Kronecker symbol.
When <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Ω</mi></math></formula> is smooth while <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>w</mi></math></formula> is Hölder-continuous and
non-vanishing, it is known that</p>
        <formula type="display">
          <math xmlns="http://www.w3.org/1998/Math/MathML" mode="display" overflow="scroll">
            <mrow>
              <msub>
                <mi>P</mi>
                <mi>n</mi>
              </msub>
              <mrow>
                <mo>(</mo>
                <mi>z</mi>
                <mo>)</mo>
              </mrow>
              <mo>=</mo>
              <msup>
                <mfenced separators="" open="(" close=")">
                  <mfrac>
                    <mrow>
                      <mi>n</mi>
                      <mo>+</mo>
                      <mn>1</mn>
                    </mrow>
                    <mi>π</mi>
                  </mfrac>
                </mfenced>
                <mrow>
                  <mn>1</mn>
                  <mo>/</mo>
                  <mn>2</mn>
                </mrow>
              </msup>
              <mrow>
                <msup>
                  <mi>Φ</mi>
                  <mi>n</mi>
                </msup>
                <mfrac>
                  <msup>
                    <mi>Φ</mi>
                    <mo>'</mo>
                  </msup>
                  <mrow>
                    <msub>
                      <mi>S</mi>
                      <mi>w</mi>
                    </msub>
                    <mrow>
                      <mo>(</mo>
                      <mi>z</mi>
                      <mo>)</mo>
                    </mrow>
                  </mrow>
                </mfrac>
              </mrow>
              <mrow>
                <mo>{</mo>
                <mn>1</mn>
                <mo>+</mo>
                <mi>o</mi>
                <mrow>
                  <mo>(</mo>
                  <mn>1</mn>
                  <mo>)</mo>
                </mrow>
                <mo>}</mo>
              </mrow>
              <mo>,</mo>
            </mrow>
          </math>
        </formula>
        <p noindent="true">locally uniformly outside the convex hull of
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mover><mi>Ω</mi><mo>¯</mo></mover></math></formula>, where <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Φ</mi></math></formula> is the
conformal map from the complement of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Ω</mi></math></formula>
onto the complement of the unit disk and <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>S</mi><mi>w</mi></msub></math></formula> is the
so-called Szegö function of the trace of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>w</mi></math></formula> on the boundary
<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>∂</mi><mi>Ω</mi></mrow></math></formula> <ref xlink:href="#apics-2014-bid74" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. If we compare it with classical
exterior Szegő asymptotics, the formula asserts that <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>P</mi><mi>n</mi></msub></math></formula> behaves
asymptotically like the <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>n</mi></math></formula>-th orthogonal polynomial with
respect to a weight supported <i>on</i> <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>∂</mi><mi>Ω</mi></mrow></math></formula> (the trace of <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>w</mi></math></formula>),
up to a factor <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msqrt><mrow><mo>(</mo><mi>n</mi><mo>+</mo><mn>1</mn><mo>)</mo><mo>/</mo><mi>π</mi></mrow></msqrt></math></formula>.</p>
        <p>When <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Ω</mi></math></formula> is the unit disk, we proved this result under unprecedented
weak assumptions on <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>w</mi></math></formula>, namely <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>w</mi><mo>(</mo><mi>r</mi><msup><mi>e</mi><mrow><mi>i</mi><mi>θ</mi></mrow></msup><mo>)</mo></mrow></math></formula> should converge 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 <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>r</mi><mo>→</mo><mn>1</mn></mrow></math></formula> for some <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow><mi>p</mi><mo>&gt;</mo><mn>1</mn></mrow></math></formula> and its <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mo form="prefix">log</mo><mo>-</mo></msup></math></formula> should be bounded in
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>. An article is being written on these
findings and the
case of a smooth domain <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>Ω</mi></math></formula>, more general
than a disk, is under examination.</p>
      </subsection>
      <subsection id="uid78" level="2">
        <bodyTitle>Meromorphic approximation</bodyTitle>
        <p>This is joint work with
Maxim Yattselev (Purdue Univ. at Indianapolis, USA).</p>
        <p>We proved in <ref xlink:href="#apics-2014-bid21" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
that the normalized 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
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
(the normalized counting measure is the probability measure with equal mass at each pole).
This result warrants source recovery techniques used in section
<ref xlink:href="#uid59" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
Here we consider the corresponding problem for best uniform meromorphic
approximants on the unit circle
(so-called AAK approximants after Adamjan, Arov and Krein), in the case
where the function may have poles and essential singularities.
This year, we established a similar result when the function has
finitely many essential singularities.
The general case is still pending.
</p>
      </subsection>
    </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>This contract (reference Inria: 7066, CNES: 127 197/00)
involving CNES, XLIM and Inria, focuses on the development
of synthesis algorithms 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 to derive analytical procedures for the design of multiplexers and
routers, as opposed to "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>). Emphasis at the moment
bears on so-called “star-topologies”.</p>
    </subsection>
    <subsection id="uid81" level="1">
      <bodyTitle>Contract CNES-Inria-UPV/EHU</bodyTitle>
      <p>This contract (reference CNES: RS14/TG-0001-019)
involving CNES, University of Bilbao (UPV/EHU) and Inria
aims at setting up a methodology for testing the stability
of amplifying devices.
The work at Inria is concerned with
the design of frequency optimization techniques
to identify the unstable part of the linearized response
and analyze the linear periodic components.
</p>
    </subsection>
    <subsection id="uid82" level="1">
      <bodyTitle>Contract BESA GmbH-Inria</bodyTitle>
      <p>This is a research agreement between Inria (Apics and Athena teams) and the German company BESA <footnote id="uid83" id-text="5"><ref xlink:href="http://www.besa.de/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>www.<allowbreak/>besa.<allowbreak/>de/</ref></footnote>,
which deals with head conductivity estimation and co-advising
of the doctoral work of C. Papageorgakis, see Section <ref xlink:href="#uid59" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
BESA is funding half of the corresponding research grant,
the other half is supported by Region PACA (BDO), see Section <ref xlink:href="#uid86" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
</p>
    </subsection>
  </contrats>
  <partenariat id="uid84">
    <bodyTitle>Partnerships and Cooperations</bodyTitle>
    <subsection id="uid85" level="1">
      <bodyTitle>Regional Initiatives</bodyTitle>
      <subsection id="uid86" level="2">
        <bodyTitle>Contract Provence Alpes Côte d'Azur (PACA) Region - Inria, BDO</bodyTitle>
        <p>Contract (no. 2014-05764) funding the research grant of C. Papageorgakis,
see Sections <ref xlink:href="#uid59" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, <ref xlink:href="#uid82" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.
</p>
      </subsection>
    </subsection>
    <subsection id="uid87" level="1">
      <bodyTitle>National Initiatives</bodyTitle>
      <subsection id="uid88" level="2">
        <bodyTitle>ANR</bodyTitle>
        <p>The ANR (Astrid) project COCORAM (Co-design et co-intégration de réseaux d’antennes actives multi-bandes pour systèmes de radionavigation par satellite) started January 2014. We are associated with three other teams from XLIM (Limoges University), respectively specialized in filters, antennas and amplifiers
design. The core idea of the project is to work on the co-integration of various microwave devices in the context of GPS satellite systems
in particular it provides us with an opportunity
to work on matching problems (see Section <ref xlink:href="#uid65" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>).</p>
      </subsection>
      <subsection id="uid89" level="2">
        <bodyTitle>ANR MagLune</bodyTitle>
        <p>The ANR project MagLune (Magnétisme de la Lune) has been approved by July
2014. It involves the Cerege (Centre de Recherche et d’Enseignement de Géosciences de l’Environnement, joint laboratory between Université Aix-Marseille, CNRS and IRD), the IPGP (Institut de Physique du Globe de Paris) and ISTerre (Institut des Sciences de la Terre). Associated with Cerege are Inria (Apics team) and Irphe (Institut de Recherche sur les Phénomènes Hors Équilibre, joint laboratory between Université Aix-Marseille, CNRS and École Centrale de Marseille). The goal of this project (led by geologists) is to understand the past magnetic activity of the Moon, especially to answer the question whether it had a dynamo in the past and which mechanisms were at work to generate it.
Apics will participate in the project by providing mathematical tools and algorithms to recover the remanent magnetization of rock samples
from the moon on the basis of measurements of the magnetic field it generates. The techniques described in Section <ref xlink:href="#uid58" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/> are
instrumental for this purpose.</p>
      </subsection>
    </subsection>
    <subsection id="uid90" level="1">
      <bodyTitle>European Initiatives</bodyTitle>
      <subsection id="uid91" level="2">
        <bodyTitle>Collaborations with Major European Organizations</bodyTitle>
        <sanspuceslist>
          <li id="uid92">
            <p noindent="true">Apics is part of the European Research Network on System Identification (ERNSI) since 1992.</p>
          </li>
          <li id="uid93">
            <p noindent="true">System identification deals with the derivation, estimation and validation of mathematical models of dynamical phenomena from experimental data.</p>
          </li>
        </sanspuceslist>
      </subsection>
    </subsection>
    <subsection id="uid94" level="1">
      <bodyTitle>International Initiatives</bodyTitle>
      <subsection id="uid95" level="2">
        <bodyTitle>Inria Associate Teams</bodyTitle>
        <subsection id="uid96" level="3">
          <bodyTitle>
            <ref xlink:href="http://www-sop.inria.fr/apics/IMPINGE/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">IMPINGE</ref>
          </bodyTitle>
          <sanspuceslist>
            <li id="uid97">
              <p noindent="true">Title: Inverse Magnetization Problems IN GEosciences.</p>
            </li>
            <li id="uid98">
              <p noindent="true">Inria principal investigator: Laurent Baratchart</p>
            </li>
            <li id="uid99">
              <p noindent="true">International Partner (Institution - Laboratory - Researcher):</p>
              <sanspuceslist>
                <li id="uid100">
                  <p noindent="true">MIT - Department of Earth, Atmospheric and Planetary Sciences (United States) - Benjamin Weiss</p>
                </li>
              </sanspuceslist>
            </li>
            <li id="uid101">
              <p noindent="true">Duration: 2013 - 2015</p>
            </li>
            <li id="uid102">
              <p noindent="true">See details at : <ref xlink:href="http://www-sop.inria.fr/apics/IMPINGE/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>www-sop.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>apics/<allowbreak/>IMPINGE/</ref></p>
            </li>
            <li id="uid103">
              <p noindent="true">The purpose of the associate team IMPINGE is to develop efficient
algorithms to recover the magnetization distribution of rock slabs from
measurements of the magnetic field above the slab using a SQUID microscope
(developed at MIT). The US team also involves a group at Vanderbilt Univ.</p>
            </li>
          </sanspuceslist>
        </subsection>
      </subsection>
      <subsection id="uid104" level="2">
        <bodyTitle>Inria International Partners</bodyTitle>
        <subsection id="uid105" level="3">
          <bodyTitle>Declared Inria International Partners</bodyTitle>
          <p><b>MIT-France seed funding</b> is a competitive collaborative research
program ran
by the Massachusetts Institute of Technology (Cambridge, Ma, USA). Together with
E. Lima and . Weiss from the Earth and Planetary Sciences dept. at MIT,
Apics obtained two-years support from the above-mentioned program to run a project entitled:
“Development of Ultra-high Sensitivity Magnetometry for Analyzing Ancient Rock Magnetism”</p>
          <p><b>Cyprus NF grant</b> was obtained by N. Stylianopoulos (Univ. Cyprus)
to conduct joint research with L. Baratchart, E.B. Saff (Vanderbilt Univ.)
and V. Totik (Univ. Szeged, Hungary). The title of the grant is:
“Orthogonal polynomials in the complex plane: distribution of zeros, strong asymptotics and shape reconstruction”.</p>
        </subsection>
      </subsection>
    </subsection>
    <subsection id="uid106" level="1">
      <bodyTitle>International Research Visitors</bodyTitle>
      <subsection id="uid107" level="2">
        <bodyTitle>Visits of International Scientists</bodyTitle>
        <simplelist>
          <li id="uid108">
            <p noindent="true">Doug Hardin (Vanderbilt Univ., Nashville, USA, Aug 2014)</p>
          </li>
          <li id="uid109">
            <p noindent="true">Benjamin Lanfer (BESA, Munich, Germany, Oct 2014)</p>
          </li>
          <li id="uid110">
            <p noindent="true">Eduardo A. Lima (MIT, Cambridge, USA, Mar 2014)</p>
          </li>
          <li id="uid111">
            <p noindent="true">Moncef Mahjoub (ENIT LAMSIN, Tunis, Tunisia, Jun 2014)</p>
          </li>
          <li id="uid112">
            <p noindent="true">Michael Northington (Vanderbilt Univ., Nashville, USA, Aug 2014)</p>
          </li>
          <li id="uid113">
            <p noindent="true">Yves Rolain (Vrije Universiteit Brussel, Belgium, June 2014)</p>
          </li>
          <li id="uid114">
            <p noindent="true">Maxim Yattselev (Indiana University–Purdue University, Indianapolis, USA, May 2014)</p>
          </li>
        </simplelist>
        <subsection id="uid115" level="3">
          <bodyTitle>Internships</bodyTitle>
          <simplelist>
            <li id="uid116">
              <p noindent="true">Olga Permiakova, Master 2 Computational Biology - UNSA (5 months), Inverse source problem for electromagnetic fields, with physical applications.</p>
            </li>
          </simplelist>
        </subsection>
      </subsection>
    </subsection>
    <subsection id="uid117" level="1">
      <bodyTitle>List of international and industrial partners</bodyTitle>
      <simplelist>
        <li id="uid118">
          <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), BESA company (Munich), Flextronics.</p>
        </li>
        <li id="uid119">
          <p noindent="true">Regular contacts with research groups at
UST (Villeneuve d'Asq),
Universities of Bordeaux-I (Talence),
Orléans (MAPMO),
Aix-Marseille (CMI-LATP),
Nice Sophia Antipolis (Lab. JAD),
Grenoble (IJF and LJK),
Paris 6 (P. et M. Curie, Lab. JLL),
Inria Saclay (Lab. Poems),
Cerege-CNRS (Aix-en-Provence),
CWI (the Netherlands),
MIT (Boston, USA), Vanderbilt University (Nashville USA),
Steklov Institute (Moscow),
Michigan State University (East-Lansing, USA),
Texas A&amp;M University (College Station USA),
University of Urana-Champaign at Indianapolis (Indianapolis, 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),
SIAE Microelettronica (Milano).</p>
        </li>
        <li id="uid120">
          <p noindent="true">The project is involved in the GDR-project AFHP
(CNRS), in the ANR (Astrid program) project COCORAM (with XLIM, Limoges, and DGA),
in the ANR (Défis de tous les savoirs program) project MagLune (with Cerege, IPGP, ISTerre, Irphe),
in a MIT-France collaborative seed funding,
in the Associate Inria Team IMPINGE (with MIT, Boston),
and in a CSF program
(with University of Cyprus).</p>
        </li>
      </simplelist>
    </subsection>
  </partenariat>
  <diffusion id="uid121">
    <bodyTitle>Dissemination</bodyTitle>
    <subsection id="uid122" level="1">
      <bodyTitle>Promoting Scientific Activities</bodyTitle>
      <simplelist>
        <li id="uid123">
          <p noindent="true">L. Baratchart was a plenary speaker
at Constructive Functions 2014 (June 2014) in Nashville, USA (TN). He was an invited speaker at the Complex Analysis Meeting of the Russian Academy of
Sciences (April 2014) in Saint Petersburg, Russia,
at the International Conference on Orthogonal Polynomials, Integrable Systems and their Applications (October 2014) in Shanghai, China,
and at the conference
Foundations of Constructive Mathematics (December 2014) in Montevideo.
He was a visitor at Vanderbilt university, at MIT, at the University of
Macao and at the University of Cyprus.
He was a speaker at the seminar of Université de Bordeaux.</p>
        </li>
        <li id="uid124">
          <p noindent="true">M. Caenepeel gave a talk at the 33th Benelux Meeting on Systems and Control (The Netherlands) at
the 18th IEEE Workshop on Signal and Power Integrity in Ghent (Belgium) and he presented a poster at the ERNSI meeting in Ostende (Belgium).</p>
        </li>
        <li id="uid125">
          <p noindent="true">S. Chevillard gave a talk at PICOF 2014 (May 2014) in Hammamet, Tunisia, at Constructive Functions 2014 (June 2014) in Nashville, USA (TN). He was an invited speaker at “Journée scientifique SMAI-SIGMA 2014” (November 2014) in Paris.</p>
        </li>
        <li id="uid126">
          <p noindent="true">J. Leblond organized an invited session at PICOF 2014 <footnote id="uid127" id-text="6"><ref xlink:href="http://www.lamsin.tn/picof14/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>www.<allowbreak/>lamsin.<allowbreak/>tn/<allowbreak/>picof14/</ref></footnote> (May 2014). A poster about joint work on source estimation in EEG was presented at OHBM 2014 <footnote id="uid128" id-text="7"><ref xlink:href="http://www.humanbrainmapping.org/i4a/pages/index.cfm?pageID=3565" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>www.<allowbreak/>humanbrainmapping.<allowbreak/>org/<allowbreak/>i4a/<allowbreak/>pages/<allowbreak/>index.<allowbreak/>cfm?pageID=3565</ref></footnote> <ref xlink:href="#apics-2014-bid66" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        </li>
        <li id="uid129">
          <p noindent="true">S. Lefteriu was an invited speaker at the Max Planck Institute and presented a poster at the meeting of the working group GT Identification.</p>
        </li>
        <li id="uid130">
          <p noindent="true">M. Olivi gave a talk at the MTNS 2014 conference in Groningen (The Netherlands) <ref xlink:href="#apics-2014-bid70" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
        </li>
        <li id="uid131">
          <p noindent="true">D. Ponomarev gave a talk at the 10th AIMS Conference on
Dynamical Systems, Differential Equations and Applications (July 2014) , in Madrid, Spain, at the seminar of the team Analyse, Géométrie, Topologie (AGT),
Institut de Mathématiques de Marseille, Aix-Marseille Université (May 2014), and at the seminar of the team Defi, Inria Saclay - Ecole Polytechnique (Nov. 2014).</p>
        </li>
        <li id="uid132">
          <p noindent="true">F. Seyfert gave a talk at the MTNS 2014 in Groeningen, at the IMS 2014 in Tampa and was invited to give a plenary lecture at the Ernsi meeting in Ostende.</p>
        </li>
      </simplelist>
      <subsection id="uid133" level="2">
        <bodyTitle>Scientific events selection</bodyTitle>
        <subsection id="uid134" level="3">
          <bodyTitle>member of the conference program committee</bodyTitle>
          <p>L. Baratchart was a member of the program committee of MTNS
(Mathematical Theory of Networks and Systems) 2014, Groningen, The Netherlands.</p>
        </subsection>
      </subsection>
      <subsection id="uid135" level="2">
        <bodyTitle>Journal</bodyTitle>
        <subsection id="uid136" level="3">
          <bodyTitle>member of the editorial board</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>.</p>
        </subsection>
      </subsection>
    </subsection>
    <subsection id="uid137" level="1">
      <bodyTitle>Teaching - Supervision - Juries</bodyTitle>
      <subsection id="uid138" level="2">
        <bodyTitle>Teaching</bodyTitle>
        <sanspuceslist>
          <li id="uid139">
            <p noindent="true"><b>Colles</b>: S. Chevillard is giving “Colles” at Centre International de Valbonne (CIV) (2 hours per week).</p>
          </li>
        </sanspuceslist>
      </subsection>
      <subsection id="uid140" level="2">
        <bodyTitle>Supervision</bodyTitle>
        <sanspuceslist>
          <li id="uid141">
            <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>
          <li id="uid142">
            <p noindent="true">PhD in progress: M. Caenepeel, The development of models for the design of RF/microwave filters,
since Feb. 2013 (advisors: Y. Rolain, M. Olivi, F. Seyfert).</p>
          </li>
          <li id="uid143">
            <p noindent="true">PhD in progress: C. Papageorgakis, Conductivity model estimation, since Oct 2014 (advisors: J. Leblond, M. Clerc, B. Lanfer).</p>
          </li>
        </sanspuceslist>
      </subsection>
      <subsection id="uid144" level="2">
        <bodyTitle>Juries</bodyTitle>
        <simplelist>
          <li id="uid145">
            <p noindent="true">M. Olivi was a referee of the PhD manuscript of P. Vuillemin (Univ. Toulouse) and of the PhD manuscript of F. Cheng (Univ. Lorraine).</p>
          </li>
          <li id="uid146">
            <p noindent="true">J. Leblond was a member of the PhD defense committee of L. Jassionnesse (Univ. Dijon, Nov 2014).</p>
          </li>
          <li id="uid147">
            <p noindent="true">F. Seyfert was a member of the PhD defense committee of Le Ha Vy Nguyen (Univ. Paris Sud, Inria project DISCO)</p>
          </li>
        </simplelist>
      </subsection>
    </subsection>
    <subsection id="uid148" level="1">
      <bodyTitle>Popularization</bodyTitle>
      <simplelist>
        <li id="uid149">
          <p noindent="true">L. Baratchart was a speaker at “Café in” (Oct. 2014,
Inria Sophia-Antipolis-Méditerranée).</p>
        </li>
        <li id="uid150">
          <p noindent="true">J. Leblond is a member of the Committee MASTIC. She was an invited speaker at the seminar associated with the lecture by G. Berry at the Collège de France (Jan. 2014).</p>
        </li>
        <li id="uid151">
          <p noindent="true">M. Olivi is president of the Committee MASTIC (Commission d'Animation et de Médiation 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>
      </simplelist>
    </subsection>
    <subsection id="uid152" level="1">
      <bodyTitle>Community services</bodyTitle>
      <simplelist>
        <li id="uid153">
          <p noindent="true">S. Chevillard is representative at the “comité de centre” and at the “comité des projets” (Research Center Inria-Sophia).</p>
        </li>
        <li id="uid154">
          <p noindent="true">J. Leblond is an elected member of the “Conseil Scientifique”and of the “Commission Administrative Paritaire” of Inria. She is one of the two researchers in charge of the mission “Conseil et soutien aux chercheurs” within the Research Center.</p>
        </li>
        <li id="uid155">
          <p noindent="true">M. Olivi is responsible for scientific mediation and co-president of the committee MASTIC.</p>
        </li>
      </simplelist>
    </subsection>
  </diffusion>
  <biblio id="bibliography" html="bibliography" numero="10" titre="Bibliography">
    
    <biblStruct id="apics-2014-bid27" type="article" rend="refer" n="refercite:ASB2010">
      <analytic>
        <title level="a">Theory of Coupled Resonator Microwave Bandpass Filters of Arbitrary Bandwidth</title>
        <author>
          <persName>
            <foreName>Smain</foreName>
            <surname>Amari</surname>
            <initial>S.</initial>
          </persName>
          <persName key="apics-2014-idp104272">
            <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-2014-bid11" 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-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <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-2014-bid23" 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-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <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-2014-bid15" 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-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <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>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid10" 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-2014-idp98680">
            <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>
            <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-2014-bid21" type="article" rend="refer" n="refercite:BSY">
      <identifiant type="hal" value="hal-00665834"/>
      <analytic>
        <title level="a">Weighted Extremal Domains and Best Rational Approximation</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Herbert</foreName>
            <surname>Stahl</surname>
            <initial>H.</initial>
          </persName>
          <persName>
            <foreName>Maxim</foreName>
            <surname>Yattselev</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <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>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid82" type="article" rend="refer" n="refercite:BaYathreefold">
      <analytic>
        <title level="a">Padé approximants to certain elliptic-type functions</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Maxim</foreName>
            <surname>Yattselev</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Jour. d'Analyse</title>
        <imprint>
          <biblScope type="volume">121</biblScope>
          <biblScope type="number">1</biblScope>
          <dateStruct>
            <year>2013</year>
          </dateStruct>
          <biblScope type="pages">31–86</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid26" type="article" rend="refer" n="refercite:cameron:hal-00663777">
      <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="polsys-2014-idm27936">
            <foreName>Jean-Charles</foreName>
            <surname>Faugère</surname>
            <initial>J.-C.</initial>
          </persName>
          <persName>
            <foreName>Fabrice</foreName>
            <surname>Rouillier</surname>
            <initial>F.</initial>
          </persName>
          <persName key="apics-2014-idp104272">
            <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-2014-bid24" type="article" rend="refer" n="refercite:clerc:hal-00699541">
      <identifiant type="hal" value="inria-00613644"/>
      <analytic>
        <title level="a">Source localization using rational approximation on plane sections</title>
        <author>
          <persName key="athena-2014-idm29272">
            <foreName>Maureen</foreName>
            <surname>Clerc</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>Jean-Paul</foreName>
            <surname>Marmorat</surname>
            <initial>J.-P.</initial>
          </persName>
          <persName key="athena-2014-idm27864">
            <foreName>Théodore</foreName>
            <surname>Papadopoulo</surname>
            <initial>T.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <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/inria-00613644" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>inria-00613644</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid34" 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-2014-idp102840">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Ralf L.M.</foreName>
            <surname>Peeters</surname>
            <initial>R. L.</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-2014-bid29" 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>
            <foreName>Vincent</foreName>
            <surname>Lunot</surname>
            <initial>V.</initial>
          </persName>
          <persName key="apics-2014-idp104272">
            <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-2014-bid33" 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>
            <foreName>Jean-Paul</foreName>
            <surname>Marmorat</surname>
            <initial>J.-P.</initial>
          </persName>
          <persName key="apics-2014-idp102840">
            <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 id="apics-2014-bid25" type="article" rend="refer" n="refercite: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-2014-idp102840">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2014-idp104272">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName>
            <foreName>Jean-Paul</foreName>
            <surname>Marmorat</surname>
            <initial>J.-P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <title level="j">Automatica</title>
        <imprint>
          <biblScope type="volume">49</biblScope>
          <biblScope type="number">2</biblScope>
          <dateStruct>
            <month>January</month>
            <year>2013</year>
          </dateStruct>
          <biblScope type="pages">317-325</biblScope>
          <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 id="apics-2014-bid78" type="book" rend="year" n="cite:oldoni:hal-01096252">
      <identifiant type="hal" value="hal-01096252"/>
      <monogr x-scientific-popularization="no" x-international-audience="yes">
        <title level="m">Synthesis and Modelling Techniques for Microwave Filters and Diplexers: Advances in Analytical Methods with Applications to Design and Tuning</title>
        <author>
          <persName>
            <foreName>Matteo</foreName>
            <surname>Oldoni</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>Giuseppe</foreName>
            <surname>Macchiarella</surname>
            <initial>G.</initial>
          </persName>
          <persName key="apics-2014-idp104272">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName>Scholars’ Press</orgName>
          </publisher>
          <dateStruct>
            <month>February</month>
            <year>2014</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01096252" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01096252</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid16" type="article" rend="year" n="cite:baratchart:hal-00909577">
      <identifiant type="doi" value="10.1080/17476933.2012.755755"/>
      <identifiant type="hal" value="hal-00909577"/>
      <analytic>
        <title level="a">Dirichlet/Neumann problems and Hardy classes for the planar conductivity equation</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Yannick</foreName>
            <surname>Fischer</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid02491">
        <idno type="issn">1747-6933</idno>
        <title level="j">Complex Variables and Elliptic Equations</title>
        <imprint>
          <dateStruct>
            <year>2014</year>
          </dateStruct>
          <biblScope type="pages">41</biblScope>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-00909577" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-00909577</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid76" subtype="nonparu-p" type="article" rend="year" n="cite:ezzeddine:hal-00924828">
      <identifiant type="doi" value="10.1002/mmce.20760"/>
      <identifiant type="hal" value="hal-00924828"/>
      <analytic>
        <title level="a">Design and implementation of compact diplexers using dual-mode cavities</title>
        <author>
          <persName>
            <foreName>Hussein</foreName>
            <surname>Ezzeddine</surname>
            <initial>H.</initial>
          </persName>
          <persName>
            <foreName>Kamel</foreName>
            <surname>Frigui</surname>
            <initial>K.</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-2014-idp104272">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName>
            <foreName>Jérôme</foreName>
            <surname>Puech</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>Laetitia</foreName>
            <surname>Estagerie</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Damien</foreName>
            <surname>Pacaud</surname>
            <initial>D.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid00956">
        <idno type="issn">1096-4290</idno>
        <title level="j">International Journal of RF and Microwave Computer Aided Engineering</title>
        <imprint>
          <dateStruct>
            <year>2014</year>
          </dateStruct>
          <ref xlink:href="https://hal-unilim.archives-ouvertes.fr/hal-00924828" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal-unilim.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-00924828</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid68" type="article" rend="year" n="cite:leblond:hal-00875006">
      <identifiant type="doi" value="10.1007/s10440-014-9951-7"/>
      <identifiant type="hal" value="hal-00875006"/>
      <analytic>
        <title level="a">Identifiability Properties for Inverse Problems in EEG Data Processing and Medical Engineering with Observability and Optimization Issues</title>
        <author>
          <persName key="apics-2014-idp101400">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid00052">
        <idno type="issn">0167-8019</idno>
        <title level="j">Acta Applicandae Mathematicae</title>
        <imprint>
          <dateStruct>
            <year>2014</year>
          </dateStruct>
          <biblScope type="pages">16</biblScope>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-00875006" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-00875006</ref>
        </imprint>
      </monogr>
      <note type="bnote">Proceedings of the Workshop on Control and Observation of Nonlinear Control Systems with Application to Medicine (CONCSAM, Hawaii, 2013)</note>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid80" type="article" rend="year" n="cite:pacaud:hal-01096240">
      <identifiant type="doi" value="10.1109/TMTT.2014.2332135"/>
      <identifiant type="hal" value="hal-01096240"/>
      <analytic>
        <title level="a">Optimized Synthesis of Self-Equalized Microwave Filters</title>
        <author>
          <persName>
            <foreName>Damien</foreName>
            <surname>Pacaud</surname>
            <initial>D.</initial>
          </persName>
          <persName key="apics-2014-idp104272">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName>
            <foreName>Hussein</foreName>
            <surname>Ezzeddine</surname>
            <initial>H.</initial>
          </persName>
          <persName>
            <foreName>Serge</foreName>
            <surname>Verdeyme</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>Stéphane</foreName>
            <surname>Bila</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>Jérôme</foreName>
            <surname>Puech</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>Laetitia</foreName>
            <surname>Estagerie</surname>
            <initial>L.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" id="rid00739">
        <idno type="issn">0018-9480</idno>
        <title level="j">IEEE Transactions on Microwave Theory and Techniques</title>
        <imprint>
          <biblScope type="volume">62</biblScope>
          <biblScope type="number">8</biblScope>
          <dateStruct>
            <month>July</month>
            <year>2014</year>
          </dateStruct>
          <biblScope type="pages">6</biblScope>
          <ref xlink:href="https://hal.inria.fr/hal-01096240" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01096240</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid70" type="inproceedings" rend="year" n="cite:baratchart:hal-00920564">
      <identifiant type="hal" value="hal-00920564"/>
      <analytic>
        <title level="a">Generalized Nevanlinna-Pick interpolation on the boundary. Application to impedance matching</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp102840">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2014-idp104272">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="yes" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">MTNS-21st Symposium on Mathematical Theory of Networks and Systems</title>
        <loc>Groninguen, Netherlands</loc>
        <imprint>
          <dateStruct>
            <month>July</month>
            <year>2014</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-00920564" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00920564</ref>
        </imprint>
        <meeting id="cid316357">
          <title>International Symposium on Mathematical Theory of Networks and Systems</title>
          <num>21</num>
          <abbr type="sigle">MTNS</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid75" type="inproceedings" rend="year" n="cite:seyfert:hal-01052718">
      <identifiant type="hal" value="hal-01052718"/>
      <analytic>
        <title level="a">Deembedding of filters in multiplexers via rational approximation and interpolation</title>
        <author>
          <persName key="apics-2014-idp104272">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName>
            <foreName>Matteo</foreName>
            <surname>Oldoni</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2014-idp102840">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2014-idp106768">
            <foreName>Sanda</foreName>
            <surname>Lefteriu</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>Damien</foreName>
            <surname>Pacaud</surname>
            <initial>D.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="yes" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">IMS - IEEE International Microwave Symposium</title>
        <loc>Tampa Bay, Florida, United States</loc>
        <imprint>
          <dateStruct>
            <month>June</month>
            <year>2014</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01052718" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01052718</ref>
        </imprint>
        <meeting id="cid484476">
          <title>IEEE Microwave Symposium Digest</title>
          <num>2014</num>
          <abbr type="sigle"/>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid81" type="inproceedings" rend="year" n="cite:seyfert:hal-01100790">
      <identifiant type="hal" value="hal-01100790"/>
      <analytic>
        <title level="a">Synthesis of Microwave filters: a novel approach based on computer algebra</title>
        <author>
          <persName key="apics-2014-idp104272">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-scientific-popularization="no" x-international-audience="yes" x-proceedings="yes" x-invited-conference="no" x-editorial-board="yes">
        <title level="m">MTNS-21st Symposium on Mathematical Theory of Networks and Systems</title>
        <loc>Groningen, Netherlands</loc>
        <imprint>
          <dateStruct>
            <month>July</month>
            <year>2014</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-01100790" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-01100790</ref>
        </imprint>
        <meeting id="cid316357">
          <title>International Symposium on Mathematical Theory of Networks and Systems</title>
          <num>21</num>
          <abbr type="sigle">MTNS</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid77" type="techreport" rend="year" n="cite:baratchart:hal-01104629">
      <identifiant type="hal" value="hal-01104629"/>
      <monogr>
        <title level="m">Uniqueness results for 2D inverse Robin problems with bounded coefficient</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="poems-2014-idp72512">
            <foreName>Laurent</foreName>
            <surname>Bourgeois</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
        </author>
        <imprint>
          <biblScope type="number">RR-8665</biblScope>
          <publisher>
            <orgName type="institution">Inria Sophia Antipolis ; Inria Saclay</orgName>
          </publisher>
          <dateStruct>
            <month>January</month>
            <year>2015</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01104629" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01104629</ref>
        </imprint>
      </monogr>
      <note type="bnote">Travail relié à la pré-publication du même titre, hal-01084428, November 2014. On présente ici les résultats dans un cadre plus simple et avec des preuves différentes</note>
      <note type="typdoc">Research Report</note>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid73" type="techreport" rend="year" n="cite:baratchart:hal-01098616">
      <identifiant type="hal" value="hal-01098616"/>
      <monogr>
        <title level="m">On Transfer Functions Realizable with Active Electronic Components</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp100160">
            <foreName>Sylvain</foreName>
            <surname>Chevillard</surname>
            <initial>S.</initial>
          </persName>
          <persName key="apics-2014-idp104272">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
        </author>
        <imprint>
          <biblScope type="number">RR-8659</biblScope>
          <publisher>
            <orgName type="institution">Inria Sophia Antipolis</orgName>
          </publisher>
          <dateStruct>
            <month>December</month>
            <year>2014</year>
          </dateStruct>
          <biblScope type="pages">36</biblScope>
          <ref xlink:href="https://hal.inria.fr/hal-01098616" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01098616</ref>
        </imprint>
      </monogr>
      <note type="typdoc">Research Report</note>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid69" type="techreport" rend="year" n="cite:baratchart:hal-00938491">
      <identifiant type="hal" value="hal-00938491"/>
      <monogr>
        <title level="m">Constrained optimization in classes of analytic functions with prescribed pointwise values</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2014-idp111904">
            <foreName>Dmitry</foreName>
            <surname>Ponomarev</surname>
            <initial>D.</initial>
          </persName>
        </author>
        <imprint>
          <biblScope type="number">RR-8459</biblScope>
          <dateStruct>
            <month>January</month>
            <year>2014</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-00938491" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00938491</ref>
        </imprint>
      </monogr>
      <note type="typdoc">Research Report</note>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid6" type="unpublished" rend="year" n="cite:baratchart:hal-01084428">
      <identifiant type="hal" value="hal-01084428"/>
      <monogr>
        <title level="m">Uniqueness results for inverse Robin problems with bounded coefficient</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="poems-2014-idp72512">
            <foreName>Laurent</foreName>
            <surname>Bourgeois</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>November</month>
            <year>2014</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01084428" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01084428</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid53" subtype="nonparu-n" type="unpublished" rend="year" n="cite:baratchart:hal-00922815">
      <identifiant type="hal" value="hal-00922815"/>
      <monogr>
        <title level="m">Minimax principle and lower bounds in H<formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msup><mrow/><mn>2</mn></msup></math></formula>-rational approximation</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp100160">
            <foreName>Sylvain</foreName>
            <surname>Chevillard</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>Tao</foreName>
            <surname>Qian</surname>
            <initial>T.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>January</month>
            <year>2015</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-00922815" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00922815</ref>
        </imprint>
      </monogr>
      <note type="bnote">Submitted to the special issue of Journal of Approximation Theory / Matematicheskii Sbornik, to the memory of A. A. Gonchar and H. Stahl</note>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid79" type="unpublished" rend="year" n="cite:chaabi:hal-00940237">
      <identifiant type="hal" value="hal-00940237"/>
      <monogr>
        <title level="m">Decomposition theorem and Riesz basis for axisymmetric potentials in the right half-plane</title>
        <author>
          <persName>
            <foreName>Slah</foreName>
            <surname>Chaabi</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>Stephane</foreName>
            <surname>Rigat</surname>
            <initial>S.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>January</month>
            <year>2014</year>
          </dateStruct>
          <ref xlink:href="https://hal.archives-ouvertes.fr/hal-00940237" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>archives-ouvertes.<allowbreak/>fr/<allowbreak/>hal-00940237</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid66" type="misc" rend="year" n="cite:jordanov:hal-01098108">
      <identifiant type="hal" value="hal-01098108"/>
      <monogr x-scientific-popularization="no" x-editorial-board="yes" x-international-audience="yes" x-proceedings="yes" x-invited-conference="no">
        <title level="m">FindSources3D - Source Localization Using Rational Approximation on Plane Sections</title>
        <title level="s">Poster listings</title>
        <author>
          <persName>
            <foreName>Todor</foreName>
            <surname>Jordanov</surname>
            <initial>T.</initial>
          </persName>
          <persName>
            <foreName>Jean-Paul</foreName>
            <surname>Marmorat</surname>
            <initial>J.-P.</initial>
          </persName>
          <persName key="athena-2014-idm29272">
            <foreName>Maureen</foreName>
            <surname>Clerc</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>Andre</foreName>
            <surname>waelkens</surname>
            <initial>A.</initial>
          </persName>
          <persName key="athena-2014-idm27864">
            <foreName>Théodore</foreName>
            <surname>Papadopoulo</surname>
            <initial>T.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>June</month>
            <year>2014</year>
          </dateStruct>
          <ref xlink:href="https://hal.inria.fr/hal-01098108" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">https://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-01098108</ref>
        </imprint>
      </monogr>
      <note type="howpublished">Organization Human Brain Mapping, Annual Meeting</note>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid28" 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-2014-bid32" 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-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <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-2014-bid31" 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-2014-bid52" type="article" rend="foot" n="footcite:Badeg1">
      <analytic>
        <title level="a">A remark on uniqueness of best rational approximants of degree 1 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-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Elec. Trans.on Numerical Anal.</title>
        <imprint>
          <biblScope type="volume">25</biblScope>
          <dateStruct>
            <year>2006</year>
          </dateStruct>
          <biblScope type="pages">54–66</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid62" 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-2014-idp98680">
            <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-2014-bid17" type="unpublished" rend="foot" n="footcite:baratchart:hal-00824224">
      <identifiant type="hal" value="hal-00824224"/>
      <monogr>
        <title level="m">Pseudo-holomorphic functions at the critical exponent</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Alexandre</foreName>
            <surname>Borichev</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>Slah</foreName>
            <surname>Chaabi</surname>
            <initial>S.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>September</month>
            <year>2013</year>
          </dateStruct>
          <ref xlink:href="http://hal.inria.fr/hal-00824224" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00824224</ref>
        </imprint>
      </monogr>
      <note type="bnote">Submitted</note>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid47" 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-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>M.</foreName>
            <surname>Cardelli</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2014-idp102840">
            <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-2014-bid2" type="article" rend="foot" n="footcite:BaChPo">
      <analytic>
        <title level="a">A Grobman-Hartman theorem for control systems</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>M.</foreName>
            <surname>Chyba</surname>
            <initial>M.</initial>
          </persName>
          <persName key="mctao-2014-idp65552">
            <foreName>Jean-Baptiste</foreName>
            <surname>Pomet</surname>
            <initial>J.-B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">J. Dyn. Differential Eqs.</title>
        <imprint>
          <biblScope type="volume">19</biblScope>
          <dateStruct>
            <year>2007</year>
          </dateStruct>
          <biblScope type="pages">75-107</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid59" 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-2014-idp98680">
            <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-2014-bid18" type="article" rend="foot" n="footcite:baratchart:hal-00919261">
      <identifiant type="doi" value="10.1088/0266-5611/29/1/015004"/>
      <identifiant type="hal" value="hal-00919261"/>
      <analytic>
        <title level="a">Characterizing kernels of operators related to thin-plate magnetizations via generalizations of Hodge decompositions</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Douglas</foreName>
            <surname>Hardin</surname>
            <initial>D.</initial>
          </persName>
          <persName>
            <foreName>Eduardo Andrade</foreName>
            <surname>Lima</surname>
            <initial>E. A.</initial>
          </persName>
          <persName>
            <foreName>Edward B.</foreName>
            <surname>Saff</surname>
            <initial>E. B.</initial>
          </persName>
          <persName>
            <foreName>Benjamin</foreName>
            <surname>Weiss</surname>
            <initial>B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-editorial-board="yes" x-international-audience="yes">
        <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://hal.inria.fr/hal-00919261" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00919261</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid19" type="article" rend="foot" n="footcite:BKTE">
      <analytic>
        <title level="a">Zero distributions via orthogonality</title>
        <author>
          <persName key="apics-2014-idp98680">
            <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-2014-bid58" type="article" rend="foot" n="footcite:BKLO1">
      <analytic>
        <title level="a">Multipoint Schur algorithm and orthogonal rational functions: convergence properties, I</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Stanislas</foreName>
            <surname>Kupin</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>Vincent</foreName>
            <surname>Lunot</surname>
            <initial>V.</initial>
          </persName>
          <persName key="apics-2014-idp102840">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <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-2014-bid67" 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-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
        </author>
        <imprint/>
      </monogr>
      <note type="bnote">In preparation</note>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid35" 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-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <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-2014-bid9" type="article" rend="foot" n="footcite:papiercarthage">
      <identifiant type="doi" value="10.1088/0266-5611/15/1/012"/>
      <analytic>
        <title level="a">How can meromorphic approximation help to solve some 2D inverse problems for the Laplacian?</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <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>
            <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>
          <biblScope type="number">1</biblScope>
          <dateStruct>
            <year>1999</year>
          </dateStruct>
          <biblScope type="pages">79–90</biblScope>
          <ref xlink:href="http://dx.doi.org/10.1088/0266-5611/15/1/012" 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/>15/<allowbreak/>1/<allowbreak/>012</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid36" 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-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <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-2014-bid39" 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-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2014-idp104272">
            <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-2014-bid22" type="article" rend="foot" n="footcite:BMSW">
      <analytic>
        <title level="a">2D inverse problems for the Laplacian: a meromorphic approximation approach</title>
        <author>
          <persName key="apics-2014-idp98680">
            <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>
            <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-2014-bid48" 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-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp102840">
            <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-2014-bid61" 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-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp102840">
            <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-2014-bid49" 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-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <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-2014-bid37" 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-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName key="apics-2014-idp104272">
            <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-2014-bid50" 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><mi>L</mi><mn>2</mn></msup></math></formula> of the circle</title>
        <author>
          <persName key="apics-2014-idp98680">
            <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-2014-bid55" type="article" rend="foot" n="footcite:BYFoCM">
      <analytic>
        <title level="a">Convergent interpolation to Cauchy integrals over analytic arcs</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Maxim</foreName>
            <surname>Yattselev</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <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-2014-bid20" type="article" rend="foot" n="footcite:BaYaSb">
      <analytic>
        <title level="a">Meromorphic approximants for complex Cauchy transforms with polar singularities</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Maxim</foreName>
            <surname>Yattselev</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Mat. Sbornik</title>
        <imprint>
          <biblScope type="volume">200</biblScope>
          <biblScope type="number">9</biblScope>
          <dateStruct>
            <year>2009</year>
          </dateStruct>
          <biblScope type="pages">3-40</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid51" 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-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <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.</orgName>
          </publisher>
          <dateStruct>
            <year>2010</year>
          </dateStruct>
          <biblScope type="pages">87–111</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid54" type="article" rend="foot" n="footcite:BYJacobi">
      <identifiant type="hal" value="hal-00508314"/>
      <analytic>
        <title level="a">Convergent Interpolation to Cauchy Integrals over Analytic Arcs with Jacobi-Type Weights</title>
        <author>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>Maxim</foreName>
            <surname>Yattselev</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">International Mathematics Research Notices</title>
        <imprint>
          <biblScope type="volume">2010</biblScope>
          <biblScope type="number">22</biblScope>
          <dateStruct>
            <year>2010</year>
          </dateStruct>
          <biblScope type="pages">4211–4275</biblScope>
          <ref xlink:href="http://hal.inria.fr/hal-00508314" 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-2014-bid12" type="article" rend="foot" n="footcite:MCM-Jul-2008">
      <identifiant type="doi" value="10.1016/j.mcm.2008.07.016"/>
      <analytic>
        <title level="a">Sources recovery from boundary data: a model related to electroencephalography</title>
        <author>
          <persName>
            <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-2014-idp101400">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>Moncef</foreName>
            <surname>Mahjoub</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Mathematical and Computer Modelling</title>
        <imprint>
          <biblScope type="volume">49</biblScope>
          <biblScope type="number">11–12</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-2014-bid65" 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-2014-idp104272">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName key="marelle-2014-idm12240">
            <foreName>José</foreName>
            <surname>Grimm</surname>
            <initial>J.</initial>
          </persName>
          <persName key="apics-2014-idp98680">
            <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-2014-bid63" 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="castor-2014-idm27504">
            <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-2014-bid4" 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">IEEE Transactions on Microwave Theory and Techniques</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-2014-bid13" type="article" rend="foot" n="footcite:Robinstabil">
      <identifiant type="doi" value="10.1088/0266-5611/20/1/003"/>
      <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>
            <foreName>I.</foreName>
            <surname>Fellah</surname>
            <initial>I.</initial>
          </persName>
          <persName>
            <foreName>Mohamed</foreName>
            <surname>Jaoua</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <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>
          <ref xlink:href="http://dx.doi.org/10.1088/0266-5611/20/1/003" 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/>20/<allowbreak/>1/<allowbreak/>003</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid44" type="phdthesis" rend="foot" n="footcite:theseSlah">
      <monogr>
        <title level="m">Analyse complexe et problèmes de Dirichlet dans le plan : équation de Weinstein et autres conductivités non bornées</title>
        <author>
          <persName>
            <foreName>Slah</foreName>
            <surname>Chaabi</surname>
            <initial>S.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName type="school">Mathématiques et Informatique de Marseille</orgName>
          </publisher>
          <dateStruct>
            <year>2013</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="typdoc">Ph. D. Thesis</note>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid56" type="article" rend="foot" n="footcite:CRW">
      <analytic>
        <title level="a">Factorization theorems for Hardy spaces in several variables</title>
        <author>
          <persName>
            <foreName>R.R.</foreName>
            <surname>Coifman</surname>
            <initial>R.</initial>
          </persName>
          <persName>
            <foreName>R.</foreName>
            <surname>Rochberg</surname>
            <initial>R.</initial>
          </persName>
          <persName>
            <foreName>G.</foreName>
            <surname>Weiss</surname>
            <initial>G.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Ann. Math.</title>
        <imprint>
          <biblScope type="volume">103</biblScope>
          <dateStruct>
            <year>1976</year>
          </dateStruct>
          <biblScope type="pages">611–635</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-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>
            <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-2014-bid5" 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-2014-bid60" 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-2014-idp102840">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <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-2014-bid38" 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-2014-bid57" 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>
          <biblScope type="volume">18</biblScope>
          <biblScope type="number">5</biblScope>
          <dateStruct>
            <year>1987</year>
          </dateStruct>
          <biblScope type="pages">1248–1260</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid40" 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-2014-bid43" 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-2014-bid42" type="article" rend="foot" n="footcite:JLMP">
      <analytic>
        <title level="a">A constrained approximation problem arising in parameter identification</title>
        <author>
          <persName>
            <foreName>B.</foreName>
            <surname>Jacob</surname>
            <initial>B.</initial>
          </persName>
          <persName key="apics-2014-idp101400">
            <foreName>Juliette</foreName>
            <surname>Leblond</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>Jean-Paul</foreName>
            <surname>Marmorat</surname>
            <initial>J.-P.</initial>
          </persName>
          <persName>
            <foreName>Jonathan R.</foreName>
            <surname>Partington</surname>
            <initial>J. R.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Linear Algebra and its Applications</title>
        <imprint>
          <biblScope type="volume">351-352</biblScope>
          <dateStruct>
            <year>2002</year>
          </dateStruct>
          <biblScope type="pages">487-500</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid8" 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-2014-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-2014-bid72" type="inproceedings" rend="foot" n="footcite:lefteriu:hal-00904794">
      <identifiant type="hal" value="hal-00904794"/>
      <analytic>
        <title level="a">De-embedding multiplexers by Schur reduction</title>
        <author>
          <persName key="apics-2014-idp106768">
            <foreName>Sanda</foreName>
            <surname>Lefteriu</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>Matteo</foreName>
            <surname>Oldoni</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2014-idp102840">
            <foreName>Martine</foreName>
            <surname>Olivi</surname>
            <initial>M.</initial>
          </persName>
          <persName key="apics-2014-idp104272">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-international-audience="yes" x-proceedings="yes">
        <title level="m">CDC - Conférence on Decision and Control</title>
        <loc>Florence, Italy</loc>
        <imprint>
          <dateStruct>
            <month>December</month>
            <year>2013</year>
          </dateStruct>
          <ref xlink:href="http://hal.inria.fr/hal-00904794" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://<allowbreak/>hal.<allowbreak/>inria.<allowbreak/>fr/<allowbreak/>hal-00904794</ref>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid3" 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">IEEE Transactions on Circuit Theory</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-2014-bid46" type="book" rend="foot" n="footcite:PellerH">
      <monogr>
        <title level="m">Hankel Operators and their Applications</title>
        <author>
          <persName>
            <foreName>Vladimir</foreName>
            <surname>Peller</surname>
            <initial>V.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName>Springer</orgName>
          </publisher>
          <dateStruct>
            <year>2003</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid41" 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>
          <biblScope type="pages">1466–1483</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid30" 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-2014-bid1" type="inproceedings" rend="foot" n="footcite:seyfert:hal-00663504">
      <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-2014-idp104272">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName key="apics-2014-idp98680">
            <foreName>Laurent</foreName>
            <surname>Baratchart</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <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>
        <title level="m">2003 IEEE MTT-S International Microwave Symposium Digest</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-2014-bid71" type="article" rend="foot" n="footcite:seyfert:hal-00763665">
      <identifiant type="hal" value="hal-00763665"/>
      <analytic>
        <title level="a">De-embedding response of filters from diplexer measurements</title>
        <author>
          <persName key="apics-2014-idp104272">
            <foreName>Fabien</foreName>
            <surname>Seyfert</surname>
            <initial>F.</initial>
          </persName>
          <persName>
            <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>
        <title level="j">International Journal of RF and Microwave Computer-Aided Engineering</title>
        <imprint>
          <biblScope type="volume">23</biblScope>
          <biblScope type="number">2</biblScope>
          <dateStruct>
            <month>August</month>
            <year>2012</year>
          </dateStruct>
          <biblScope type="pages">188–199</biblScope>
          <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>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid45" 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-2014-bid64" type="book" rend="foot" n="footcite:SuQu">
      <monogr>
        <title level="m">Stability analysis of nonlinear microwave circuits</title>
        <author>
          <persName>
            <foreName>Almudena</foreName>
            <surname>Suàrez</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>Raymond</foreName>
            <surname>Quéré</surname>
            <initial>R.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName>Artech House</orgName>
          </publisher>
          <dateStruct>
            <year>2003</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid74" type="book" rend="foot" n="footcite:Suetin">
      <monogr>
        <title level="m">Polynomials orthogonal over a region and Bieberbach polynomials</title>
        <author>
          <persName>
            <foreName>P. K.</foreName>
            <surname>Suetin</surname>
            <initial>P. K.</initial>
          </persName>
        </author>
        <imprint>
          <biblScope type="volume">100</biblScope>
          <publisher>
            <orgName>Proc. Steklov Inst. Math.</orgName>
          </publisher>
          <dateStruct>
            <year>1971</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="bnote">A.M.S. Transl. 1974</note>
    </biblStruct>
    
    <biblStruct id="apics-2014-bid7" 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>
        <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>
          <publisher>
            <orgName>Princeton Univ. Press</orgName>
          </publisher>
          <dateStruct>
            <year>1995</year>
          </dateStruct>
          <biblScope type="pages">321–384</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
  </biblio>
</raweb>
