<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-004-02-0178</article-id>
      <article-id pub-id-type="publisher-id">27472</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Enclosing Solutions of an Inverse Sturm-Liouville Problem for an Impedance</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Neher</surname>
            <given-names>Markus</given-names>
          </name>
          <email xlink:type="simple">markus.neher@math.uni-karlsruhe.de</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Institut für Angewandte Mathematik, Universität Karlsruhe, Karlsruhe, Germany</addr-line>
        <institution>Institut für Angewandte Mathematik, Universität Karlsruhe</institution>
        <addr-line content-type="city">Karlsruhe</addr-line>
        <country>Germany</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Markus Neher (<email xlink:type="simple">markus.neher@math.uni-karlsruhe.de</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>1998</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>02</month>
        <year>1998</year>
      </pub-date>
      <volume>4</volume>
      <issue>2</issue>
      <fpage>178</fpage>
      <lpage>192</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/9AFD6C30-C322-548D-84C4-2CC1E54BB520">9AFD6C30-C322-548D-84C4-2CC1E54BB520</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/6995520">6995520</uri>
      <permissions>
        <copyright-statement>Markus Neher</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>This paper is concerned with the reconstruction of an unknown impedance p(x) in the Sturm-Liouville problem with Dirichlet boundary conditions, when only a finite number of eigenvalues are known. The problem is transformed into a system of nonlinear equations. A solution of this system is enclosed in an interval vector by an interval Newton's method. From the interval vector, an interval function [p](x) is constructed that encloses an impedance p(x) corresponding to the prescribed eigenvalues. To make this numerical existence proof rigorous, all discretization and roundoff errors have to be taken into account in the computation.</p>
      </abstract>
    </article-meta>
  </front>
</article>
