<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">378866532</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180305123359.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">161128e20030901xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1515/156939403769237051</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)gruyter-10.1515/156939403769237051</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Schuster</subfield>
   <subfield code="D">T.</subfield>
   <subfield code="u">Fachbereich Mathematik, Geb. 36, Universität des Saarlandes, 66041 Saarbrücken, Germany. E-mail: thomas.schuster@num.uni-sb.de</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="2">
   <subfield code="a">A stable inversion scheme for the Laplace transform using arbitrarily distributed data scanning points</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[T. Schuster]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In many industrial applications inversion of the Laplace transform is necessary to reconstruct a searched for object function. In X-ray diffractometry, a method from non-destructive testing, we want to recover the stress tensor of a specimen with the help of X-ray measurements. The mathematical model is described by the Laplace transform of the stress tensor at finitely many scanning points that are not equally distributed. In this article we present an inversion method for the Laplace transform using a non-equispaced sampling grid that applies the approximate inverse to this transform. The approximate inverse is a regularization technique for inverse problems based on evaluations of the given data with so called reconstruction kernels. Each kernel solves a system of linear equations defined by the adjoint of the Laplace transform and dilation invariant mollifiers, which are designed particularly for this operator. An error estimate is given and point-wise convergence of the approximate inverse to the exact solution is proved. The paper ends with some numerical results.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Copyright 2003, Walter de Gruyter</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of Inverse and Ill-posed Problems</subfield>
   <subfield code="d">Walter de Gruyter</subfield>
   <subfield code="g">11/3(2003-09-01), 263-287</subfield>
   <subfield code="x">0928-0219</subfield>
   <subfield code="q">11:3&lt;263</subfield>
   <subfield code="1">2003</subfield>
   <subfield code="2">11</subfield>
   <subfield code="o">jiip</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1515/156939403769237051</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1515/156939403769237051</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Schuster</subfield>
   <subfield code="D">T.</subfield>
   <subfield code="u">Fachbereich Mathematik, Geb. 36, Universität des Saarlandes, 66041 Saarbrücken, Germany. E-mail: thomas.schuster@num.uni-sb.de</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Journal of Inverse and Ill-posed Problems</subfield>
   <subfield code="d">Walter de Gruyter</subfield>
   <subfield code="g">11/3(2003-09-01), 263-287</subfield>
   <subfield code="x">0928-0219</subfield>
   <subfield code="q">11:3&lt;263</subfield>
   <subfield code="1">2003</subfield>
   <subfield code="2">11</subfield>
   <subfield code="o">jiip</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="b">CC0</subfield>
   <subfield code="u">http://creativecommons.org/publicdomain/zero/1.0</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-gruyter</subfield>
  </datafield>
 </record>
</collection>
