<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>03822cam a2200301 a 4500</leader>
  <controlfield tag="008">100927s2011    gw a     b    001 0 eng  </controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9783110250640</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">3110250640</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">SDU</subfield>
  </datafield>
  <datafield tag="050" ind1="0" ind2="0">
    <subfield code="a">QA377</subfield>
    <subfield code="b">B166 I 2011</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Bakushinski&#x12D;, A. B.</subfield>
    <subfield code="9">193027</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Iterative methods for ill-posed problems :</subfield>
    <subfield code="b">an introduction /</subfield>
    <subfield code="c">Anatoly B. Bakushinsky, Mikhail Yu. Kokurin, Alexandra Smirnova.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Berlin ;</subfield>
    <subfield code="a">New York :</subfield>
    <subfield code="b">De Gruyter,</subfield>
    <subfield code="c">2011.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">136 p. :</subfield>
    <subfield code="b">ill.</subfield>
  </datafield>
  <datafield tag="490" ind1="1" ind2=" ">
    <subfield code="a">Inverse and ill-posed problems series ;</subfield>
    <subfield code="v">54</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2="0">
    <subfield code="t">The regularity condition. Newton's method --</subfield>
    <subfield code="t">Preliminary results --</subfield>
    <subfield code="t">Linearization procedure --</subfield>
    <subfield code="t">Error analysis --</subfield>
    <subfield code="t">Problems --</subfield>
    <subfield code="t">The Gauss -- Newton method --</subfield>
    <subfield code="t">Motivation --</subfield>
    <subfield code="t">Convergence rates --</subfield>
    <subfield code="t">Problems --</subfield>
    <subfield code="t">The gradient method --</subfield>
    <subfield code="t">The gradient method for regular problems --</subfield>
    <subfield code="t">Ill-posed case --</subfield>
    <subfield code="t">Problems --</subfield>
    <subfield code="t">Tikhonov's scheme --</subfield>
    <subfield code="t">The Tikhonov functional --</subfield>
    <subfield code="t">Properties of a minimizing sequence --</subfield>
    <subfield code="t">Other types of convergence --</subfield>
    <subfield code="t">Equations with noisy data --</subfield>
    <subfield code="t">Problems --</subfield>
    <subfield code="t">Tikhonov's scheme for linear equations --</subfield>
    <subfield code="t">The main convergence result --</subfield>
    <subfield code="t">Elements of spectral theory --</subfield>
    <subfield code="t">Minimizing sequences for linear equations</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2="0">
    <subfield code="t">A priori agreement between the regularization parameter and the error for equations with perturbed right-hand sides --</subfield>
    <subfield code="t">The discrepancy principle --</subfield>
    <subfield code="t">Approximation of a quasi-solution --</subfield>
    <subfield code="t">Problems --</subfield>
    <subfield code="t">The gradient scheme for linear equations --</subfield>
    <subfield code="t">The technique of spectral analysis --</subfield>
    <subfield code="t">A priori stopping rule --</subfield>
    <subfield code="t">A posteriori stopping rule --</subfield>
    <subfield code="t">Problems --</subfield>
    <subfield code="t">Convergence rates for the approximation methods in the case of linear irregular equations --</subfield>
    <subfield code="t">The source-type condition (STC) --</subfield>
    <subfield code="t">STC for the gradient method --</subfield>
    <subfield code="t">The saturation phenomena --</subfield>
    <subfield code="t">Approximations in case of a perturbed STC --</subfield>
    <subfield code="t">Accuracy of the estimates --</subfield>
    <subfield code="t">Problems --</subfield>
    <subfield code="t">Equations with a convex discrepancy functional by Tikhonov's method --</subfield>
    <subfield code="t">Some difficulties associated with Tikhonov's method in case of a convex discrepancy functional</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2="0">
    <subfield code="t">An illustrative example --</subfield>
    <subfield code="t">Problems --</subfield>
    <subfield code="t">Iterative regularization principle --</subfield>
    <subfield code="t">The idea of iterative regularization --</subfield>
    <subfield code="t">The iteratively regularized gradient method --</subfield>
    <subfield code="t">Problems --</subfield>
    <subfield code="t">The iteratively regularized Gauss -- Newton method --</subfield>
    <subfield code="t">Convergence analysis --</subfield>
    <subfield code="t">Further properties of IRGN iterations --</subfield>
    <subfield code="t">A unified approach to the construction of iterative methods for irregular equations --</subfield>
    <subfield code="t">The reverse connection control --</subfield>
    <subfield code="t">Problems --</subfield>
    <subfield code="t">The stable gradient method for irregular nonlinear equations --</subfield>
    <subfield code="t">Solving an auxiliary finite dimensional problem by the gradient descent method --</subfield>
    <subfield code="t">Investigation of a difference inequality --</subfield>
    <subfield code="t">The case of noisy data --</subfield>
    <subfield code="t">Problems --</subfield>
    <subfield code="t">Relative computational efficiency of iteratively regularized methods --</subfield>
    <subfield code="t">Generalized Gauss -- Newton methods --</subfield>
    <subfield code="t">A more restrictive source condition</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2="0">
    <subfield code="t">Comparison to iteratively regularized gradient scheme --</subfield>
    <subfield code="t">Problems --</subfield>
    <subfield code="t">Numerical investigation of two-dimensional inverse gravimetry problem --</subfield>
    <subfield code="t">Problem formulation --</subfield>
    <subfield code="t">The algorithm --</subfield>
    <subfield code="t">Simulations --</subfield>
    <subfield code="t">Problems --</subfield>
    <subfield code="t">Iteratively regularized methods for inverse problem in optical tomography --</subfield>
    <subfield code="t">Statement of the problem --</subfield>
    <subfield code="t">Simple example --</subfield>
    <subfield code="t">Forward simulation --</subfield>
    <subfield code="t">The inverse problem --</subfield>
    <subfield code="t">Numerical results --</subfield>
    <subfield code="t">Problems --</subfield>
    <subfield code="t">Feigenbaum's universality equation --</subfield>
    <subfield code="t">The universal constants --</subfield>
    <subfield code="t">Ill-posedness --</subfield>
    <subfield code="t">Numerical algorithm for 2 &amp;le; z &amp;le; 12 --</subfield>
    <subfield code="t">Regularized method for z &amp;ge; 13 --</subfield>
    <subfield code="t">Problems --</subfield>
    <subfield code="t">Conclusion.</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2="0">
    <subfield code="t">HKBU library</subfield>
  </datafield>
  <datafield tag="518" ind1=" " ind2=" ">
    <subfield code="a">YT2025 M10</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Differential equations, Partial</subfield>
    <subfield code="x">Improperly posed problems.</subfield>
    <subfield code="9">193028</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Iterative methods (Mathematics)</subfield>
    <subfield code="9">193029</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Kokurin, M. I&#xFE20;U&#xFE21;.</subfield>
    <subfield code="9">193030</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Smirnova, A. B.</subfield>
    <subfield code="9">193031</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2=" ">
    <subfield code="a">= C.1 SDU</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">GBE</subfield>
    <subfield code="2">lcc</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">103936</subfield>
    <subfield code="d">103936</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">lcc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="6">QA0377 B166 I2011</subfield>
    <subfield code="7">0</subfield>
    <subfield code="8">CGB</subfield>
    <subfield code="9">283933</subfield>
    <subfield code="a">SDU</subfield>
    <subfield code="b">SDU</subfield>
    <subfield code="c">GEN3</subfield>
    <subfield code="d">2025-10-03</subfield>
    <subfield code="e">2</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">QA377 B166 I 2011</subfield>
    <subfield code="p">1000386005</subfield>
    <subfield code="r">2025-10-03 00:00:00</subfield>
    <subfield code="t">C.1</subfield>
    <subfield code="w">2025-10-03</subfield>
    <subfield code="y">GBE</subfield>
  </datafield>
</record>
