<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="review-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">geophystech</journal-id><journal-title-group><journal-title xml:lang="ru">Геофизические технологии</journal-title><trans-title-group xml:lang="en"><trans-title>Russian Journal of Geophysical Technologies</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">2619-1563</issn><publisher><publisher-name>IPGG SB RAS</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18303/2619-1563-2024-1-29</article-id><article-id custom-type="elpub" pub-id-type="custom">geophystech-345</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group></article-categories><title-group><article-title>Крыловские и рациональные крыловские методы численного решения некоторых задач вычислительной геофизики</article-title><trans-title-group xml:lang="en"><trans-title>Krylov and rational Krylov methods of numerical solution of some problems of computational geophysics</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-8622-1503</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Книжнерман</surname><given-names>Л. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Knizhnerman</surname><given-names>L. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>КНИЖНЕРМАН Леонид Аронович – доктор физико-математических наук, ведущий научный сотрудник,</p><p>119333, Москва, ул. Губкина, 8.</p></bio><bio xml:lang="en"><p>8, Gubkin Str., Moscow, 119333.</p></bio><email xlink:type="simple">lknizhnerman@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">Институт вычислительной математики РАН им. Г.И. Марчука<country>Россия</country></aff><aff xml:lang="en">Marchuk Institute of Numerical Mathematics RAS<country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2024</year></pub-date><pub-date pub-type="epub"><day>16</day><month>07</month><year>2024</year></pub-date><volume>0</volume><issue>1</issue><issue-title>Спецвыпуск</issue-title><fpage>29</fpage><lpage>46</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Книжнерман Л.А., 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Книжнерман Л.А.</copyright-holder><copyright-holder xml:lang="en">Knizhnerman L.A.</copyright-holder><license license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.rjgt.ru/jour/article/view/345">https://www.rjgt.ru/jour/article/view/345</self-uri><abstract><p>Решения многих дискретизированных по пространству задач, связанных с вычислительной геофизикой, представляются в виде 𝑢 = 𝑓(𝐴)𝜑, где 𝐴 ∈ 𝑹𝑁×𝑁, 𝜑 ∈ 𝑹𝑁, 𝑓 – функция. Мы рассматриваем аппроксимации к 𝑢 на основе подхода Галёркина для полиномиальных и рациональных подпространств Крылова. Мы описываем соответствующие вычислительные методы – метод Ланцоша и рациональный метод Арнольди, а также их приложение к решению некоторых задач вычислительной геофизики (из области электрокаротажа, термокаротажа, электроразведки). Цель этой обзорной статьи – научить читателя применять описанные здесь методы к его прикладным задачам.</p><p> </p></abstract><trans-abstract xml:lang="en"><p>The solutions of many spatially discretized problems, related with computational geophysics, are presented as 𝑢 = 𝑓(𝐴)𝜑, where 𝐴 ∈ 𝑹𝑁×𝑁, 𝜑 ∈ 𝑹𝑁, 𝑓 is a function. We consider approximations to 𝑢 on the basis of Galerkin approach for polynomial and rational Krylov subspaces. We describe the corresponding computational methods – the ones of Lanczos and rational Arnoldi, and also their application to solving some problems of computational geophysics (in the area of electrologging, thermal logging, electrical prospecting). The aim of this review paper is to instruct the reader to apply the methods described here to his applied problems.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>вычислительная геофизика</kwd><kwd>численное решение уравнений в частных производных</kwd><kwd>крыловские методы</kwd><kwd>рациональные крыловские методы</kwd></kwd-group><kwd-group xml:lang="en"><kwd>computational geophysics</kwd><kwd>numerical solution of partial differential equations</kwd><kwd>Krylov methods</kwd><kwd>rational Krylov methods</kwd></kwd-group><funding-group xml:lang="ru"><funding-statement>Работа поддержана Отделением Московского центра фундаментальной и прикладной математики в ИВМ РАН (соглашение 075-15-2022-286 с Министерством науки и высшего образования Российской Федерации).</funding-statement></funding-group><funding-group xml:lang="en"><funding-statement>The study was supported by Moscow Center of Fundamental and Applied Mathematics at Marchuk Institute of Numerical Mathematics of Russian Academy of Sciences (Agreement No. 075-15-2022-286 with the Ministry of Science and Higher Education of the Russian Federation).</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Бейтмен Г., Эрдейи А. Высшие трансцендентные функции. Т. 2. М.: Наука, 1974. 296 с.</mixed-citation><mixed-citation xml:lang="en">Baglama J., Calvetti D., Reichel L. Fast Leja points // ETNA (electronic only). 1998. Vol. 7. P. 124–140. https://www.emis.de/journals/ETNA/vol.7.1998/pp124-140.dir/pp124-140.pdf.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Гончар А.А. О задачах Е. И. Золотарева, связанных с рациональными функциями // Математический сборник. 1969. T. 78, № 4. С. 640–654.</mixed-citation><mixed-citation xml:lang="en">Bateman H., Magnus W., Oberhettinger F., Tricomi F.G., Bertin D., Fulks W.B., Harvey A.R., Thomsen D.L. Jr., Weber M.A., Whitney E.L., Erdélyi А. Higher transcendental functions. Vol. 2. McGraw Hill Book Company, N.Y., 1953.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Гончар А.А. О скорости рациональной аппроксимации некоторых аналитических функций // Математический сборник. 1978. Т. 105, № 2. С. 147–163.</mixed-citation><mixed-citation xml:lang="en">Beckermann B., Reichel L. Error estimates and evaluation of matrix functions via the Faber transform // SIAM Journal on Numerical Analysis. 2009. Vol. 47 (5). P. 3849–3883. doi: 10.1137/080741744.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Друскин В.Л., Книжнерман Л.А. Спектральный дифференциально-разностный метод численного решения трехмерных нестационарных задач электроразведки // Известия АН СССР. Физика Земли. 1988. № 8. С. 63–74.</mixed-citation><mixed-citation xml:lang="en">Druskin V.L., Knizhnerman L.A. Spectral differential-difference method for numeric solution of threedimensional nonstationary problems of electric prospecting // Izvestiya. Earth Physics. 1988. Vol. 24 (8), P. 641– 648.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Друскин B.Л., Книжнерман Л.А. Два полиномиальных метода вычисления функций от симметричных матриц // Журнал вычислительной математики и математической физики. 1989. T. 29, № 12. С. 1763–1775.</mixed-citation><mixed-citation xml:lang="en">Druskin V.L., Knizhnerman L.A. Two polynomial methods of calculating functions of symmetric matrices // USSR Computational Mathematics and Mathematical Physics. 1989. Vol. 29 (6). P. 112–121. doi:10.1016/S00415553(89)80020-5.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Друскин B.Л., Книжнерман Л.А. Оценки ошибок в простом процессе Ланцоша при вычислении функций от симметричных матриц и собственных значений // Журнал вычислительной математики и математической физики. 1991. Т. 31, № 7. С. 970–983.</mixed-citation><mixed-citation xml:lang="en">Druskin V.L., Knizhnerman L.A. Error bounds in the simple Lanczos procedure for computing functions of symmetric matrices and eigenvalues // USSR Computational Mathematics and Mathematical Physics. 1991. Vol. 31, No. 7. P. 20–30.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Оселедец И.В. Оценки снизу для сепарабельных аппроксимаций ядра Гильберта // Математический сборник. 2007. Т. 198, № 3. С. 137–144. doi: 10.4213/sm1530.</mixed-citation><mixed-citation xml:lang="en">Druskin V., Knizhnerman L. The Lanczos optimization of a splitting-up method to solve homogeneous evolutionary equations // Journal of Computational and Applied Mathematics. 1992. Vol. 42 (2). P. 221–231. doi: 10.1016/0377-0427(92)90076-A.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Парлетт Б. Симметричная проблема собственных значений. Численные методы. М.: Мир, 1983. 384 с.</mixed-citation><mixed-citation xml:lang="en">Druskin V., Knizhnerman L. Extended Krylov subspaces: approximation of the matrix square root and related functions // SIAM Journal on Matrix Analysis and Application. 1998. Vol. 19 (3). P. 755–771. doi: 10.1137/S0895479895292400.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Пашковский С. Вычислительные применения многочленов и рядов Чебышева. М.: Наука, 1983. 384 с.</mixed-citation><mixed-citation xml:lang="en">Druskin V.L., Knizhnerman L.A., Ping Lee. New spectral Lanczos decomposition method for induction modeling in arbitrary 3-D geometry // Geophysics. 1999. Vol. 64 (3). P. 701–706. doi: 10.1190/1.1444579.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Baglama J., Calvetti D., Reichel L. Fast Leja points // ETNA (electronic only). 1998. Vol. 7. P. 124–140. https://www.emis.de/journals/ETNA/vol.7.1998/pp124-140.dir/pp124-140.pdf.</mixed-citation><mixed-citation xml:lang="en">Druskin V., Knizhnerman L., Zaslavsky M. Solution of large scale evolutionary problems using rational Krylov subspaces with optimized shifts // SIAM Journal on Scientific Computing. 2009. Vol. 31 (5). P. 3760–3780. doi: 10.1137/080742403.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Beckermann B., Reichel L. Error estimates and evaluation of matrix functions via the Faber transform // SIAM Journal on Numerical Analysis. 2009. Vol. 47 (5). P. 3849–3883. doi: 10.1137/080741744.</mixed-citation><mixed-citation xml:lang="en">Druskin V., Lieberman C., Zaslavsky M. On adaptive choice of shifts in rational Krylov subspace reduction of evolutionary problems // SIAM Journal on Scientific Computing. 2010. Vol. 32. P. 2485–2496. doi: 10.1137/090774082.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Druskin V., Knizhnerman L. The Lanczos optimization of a splitting-up method to solve homogeneous evolutionary equations // Journal of Computational and Applied Mathematics. 1992. Vol. 42 (2). P. 221–231. doi: 10.1016/0377-0427(92)90076-A.</mixed-citation><mixed-citation xml:lang="en">Gončar A.A. Zolotarev problems connected with rational functions // Mathematics of the USSR-Sbornik.1969. Vol. 7 (4). P. 623–635. doi: 10.1070/SM1969v007n04ABEH001107.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Druskin V., Knizhnerman L. Extended Krylov subspaces: approximation of the matrix square root and related functions // SIAM Journal on Matrix Analysis and Application. 1998. Vol. 19 (3). P. 755–771. doi: 10.1137/S0895479895292400.</mixed-citation><mixed-citation xml:lang="en">Gončar A.A. On the speed of rational approximation of some analytic functions // Mathematics of the USSRSbornik. 1978. Vol. 34 (2). P. 131–145. doi: 10.1070/sm1978v034n02abeh001152.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Druskin V.L., Knizhnerman L.A., Ping Lee. New spectral Lanczos decomposition method for induction modeling in arbitrary 3-D geometry // Geophysics. 1999. Vol. 64 (3). P. 701–706. doi: 10.1190/1.1444579.</mixed-citation><mixed-citation xml:lang="en">Greenbaum A. Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences // Linear Algebra and its Applications. 1989. Vol. 113. P. 7–63. doi: 10.1016/0024-3795(89)90285-1.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Druskin V., Knizhnerman L., Zaslavsky M. Solution of large scale evolutionary problems using rational Krylov subspaces with optimized shifts // SIAM Journal on Scientific Computing. 2009. Vol. 31 (5). P. 3760–3780. doi: 10.1137/080742403.</mixed-citation><mixed-citation xml:lang="en">Knizhnerman L., Druskin V., Zaslavsky M. On optimal convergence rate of the Rational Krylov Subspace Reduction for electromagnetic problems in unbounded domains // SIAM Journal on Numerical Analysis. 2009. Vol. 47 (2). P. 953–971. doi: 10.1137/080715159.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Druskin V., Lieberman C., Zaslavsky M. On adaptive choice of shifts in rational Krylov subspace reduction of evolutionary problems // SIAM Journal on Scientific Computing. 2010. Vol. 32. P. 2485–2496. doi: 10.1137/090774082.</mixed-citation><mixed-citation xml:lang="en">Le Bailly B., Thiran J.P. Optimal rational functions for the generalized Zolotarev problem in the complex plane // SIAM Journal on Numerical Analysis. 2000. Vol. 38 (5). P. 1409–1424. doi: 10.1137/S003614299936068.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Greenbaum A. Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences // Linear Algebra and its Applications. 1989. Vol. 113. P. 7–63. doi: 10.1016/0024-3795(89)90285-1.</mixed-citation><mixed-citation xml:lang="en">Leja F. Sur certaines suits liées aux ensemble plan et leur application à la représentation conforme // Annales Polonici Mathematici. 1957. Vol. 4 (1). P. 8–13.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Knizhnerman L., Druskin V., Zaslavsky M. On optimal convergence rate of the Rational Krylov Subspace Reduction for electromagnetic problems in unbounded domains // SIAM Journal on Numerical Analysis. 2009. Vol. 47 (2). P. 953–971. doi: 10.1137/080715159.</mixed-citation><mixed-citation xml:lang="en">Oseledets I.V. Lower bounds for separable approximations of the Hilbert kernel // Sbornik: Mathematics. 2007. Vol. 198, No. 3. P. 425–432. doi: 10.1070/SM2007v198n03ABEH003842.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Le Bailly B., Thiran J.P. Optimal rational functions for the generalized Zolotarev problem in the complex plane // SIAM Journal on Numerical Analysis. 2000. Vol. 38 (5). P. 1409–1424. doi: 10.1137/S003614299936068.</mixed-citation><mixed-citation xml:lang="en">Parlett B.N. The symmetric eigenvalue problems. Philadelphia, SIAM, 1998.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Leja F. Sur certaines suits liées aux ensemble plan et leur application à la représentation conforme // Annales Polonici Mathematici. 1957. Vol. 4 (1). P. 8–13.</mixed-citation><mixed-citation xml:lang="en">Paszkowski S. Computational applications of Chebyshev polynomials and series [in Russian]. Nauka, Moscow, 1983. 384 p.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Ruhe A. The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices // BIT Numerical Mathematics. 1994. Vol. 34. P. 165–176. doi: 10.1007/BF01935024.</mixed-citation><mixed-citation xml:lang="en">Ruhe A. The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices // BIT Numerical Mathematics. 1994. Vol. 34. P. 165–176. doi: 10.1007/BF01935024.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Saff E.B., Totik V. Logarithmic potentials with external fields. Springer Berlin, Heidelberg, 1997. 505 p. doi: 10.1007/978-3-662-03329-6.</mixed-citation><mixed-citation xml:lang="en">Saff E.B., Totik V. Logarithmic potentials with external fields. Springer Berlin, Heidelberg, 1997. 505 p. doi: 10.1007/978-3-662-03329-6.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Simoncini V. A new iterative method for solving large-scale Lyapunov matrix equations // SIAM Journal on Science Computing. 2007. Vol. 29 (3). P. 1268–1288. doi: 10.1137/06066120X.</mixed-citation><mixed-citation xml:lang="en">Simoncini V. A new iterative method for solving large-scale Lyapunov matrix equations // SIAM Journal on Science Computing. 2007. Vol. 29 (3). P. 1268–1288. doi: 10.1137/06066120X.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Tyrtyshnikov E.E. Mosaic-skeleton approximations // Calcolo. 1996. Vol. 33. P. 47–57. doi: 10.1007/BF02575706.</mixed-citation><mixed-citation xml:lang="en">Tyrtyshnikov 	E.E. 	Mosaic-skeleton 	approximations 	// 	Calcolo. 	1996. 	Vol. 	33. 	P. 	47–57. doi: 10.1007/BF02575706.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
