<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445861991</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145446.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110301xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10092-010-0027-4</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10092-010-0027-4</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Comparison of parameter choices in regularization algorithms in case of different information about noise level</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Uno Hämarik, Reimo Palm, Toomas Raus]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">We consider linear ill-posed problems in Hilbert space with noisy data. The noise level may be given exactly or approximately or there may be no information about the noise level. We regularize the problem using the Landweber method, the Tikhonov method or the extrapolated version of the Tikhonov method. For all three cases of noise information we propose rules for choice of the regularization parameter. Extensive numerical experiments show the advantage of the proposed rules over known rules, including the discrepancy principle, the quasioptimality criterion, the Hanke-Raus rule, the Brezinski-Rodriguez-Seatzu rule and others. Numerical comparison also shows at which information about the noise level our rules for approximately given noise level should be preferred to otherrules.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag, 2010</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Ill-posed problem</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Noise level</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Regularization</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Tikhonov method</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Extrapolated Tikhonov method</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Landweber method</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Regularization parameter choice</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Hämarik</subfield>
   <subfield code="D">Uno</subfield>
   <subfield code="u">Faculty of Mathematics and Informatics, University of Tartu, J. Liivi 2, 50409, Tartu, Estonia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Palm</subfield>
   <subfield code="D">Reimo</subfield>
   <subfield code="u">Faculty of Mathematics and Informatics, University of Tartu, J. Liivi 2, 50409, Tartu, Estonia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Raus</subfield>
   <subfield code="D">Toomas</subfield>
   <subfield code="u">Faculty of Mathematics and Informatics, University of Tartu, J. Liivi 2, 50409, Tartu, Estonia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Calcolo</subfield>
   <subfield code="d">Springer Milan</subfield>
   <subfield code="g">48/1(2011-03-01), 47-59</subfield>
   <subfield code="x">0008-0624</subfield>
   <subfield code="q">48:1&lt;47</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">48</subfield>
   <subfield code="o">10092</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10092-010-0027-4</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.1007/s10092-010-0027-4</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">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Hämarik</subfield>
   <subfield code="D">Uno</subfield>
   <subfield code="u">Faculty of Mathematics and Informatics, University of Tartu, J. Liivi 2, 50409, Tartu, Estonia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Palm</subfield>
   <subfield code="D">Reimo</subfield>
   <subfield code="u">Faculty of Mathematics and Informatics, University of Tartu, J. Liivi 2, 50409, Tartu, Estonia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Raus</subfield>
   <subfield code="D">Toomas</subfield>
   <subfield code="u">Faculty of Mathematics and Informatics, University of Tartu, J. Liivi 2, 50409, Tartu, Estonia</subfield>
   <subfield code="4">aut</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">Calcolo</subfield>
   <subfield code="d">Springer Milan</subfield>
   <subfield code="g">48/1(2011-03-01), 47-59</subfield>
   <subfield code="x">0008-0624</subfield>
   <subfield code="q">48:1&lt;47</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">48</subfield>
   <subfield code="o">10092</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</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-springer</subfield>
  </datafield>
 </record>
</collection>
