Numerical methods and programming
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Num. Meth. Prog.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Num. Meth. Prog., 2015, Volume 16, Issue 2, Pages 268–280 (Mi vmp538)  

Solution of the Helmholtz problem using the preconditioned low-rank approximation technique

K. V. Voronina, S. A. Solovyevb

a Institute of Computational Mathematics and Mathematical Geophysics of Siberian Branch of Russian Academy of Sciences, Novosibirsk
b A. A. Trofimuk Institute of Petroleum Geology and Geophysics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk

Abstract: An algorithm for solving the Helmholtz problem in 3D heterogeneous media using the low-rank approximation technique is proposed. This technique is applied as a preconditioner for two different iterative processes: an iterative refinement and BiCGStab. The iterative refinement approach is known to be very simple and straightforward but can suffer from the lack of convergence; BiCGStab is more stable and more sophisticated as well. A dependence of the convergence rate on low-rank approximation quality is studied for these iterative processes. For typical problems of seismic exploration, it is shown that, starting with some low-rank accuracy, the convergence rate of the iterative refinement is very similar to BiCGStab. Therefore, it is preferable to use the more efficient iterative refinement method. Numerical experiments also show that, for reasonable (from the practical standpoint) low-rank accuracy, the proposed method provides three times performance gain (for sequential code) and reduces the memory usage up to a factor of two in comparison with the Intel MKL PARDISO high performance direct solver.

Keywords: 3D Helmholtz problem, algorithms for sparse systems of linear algebraic equations, Gaussian elimination method, low-rank approximation, HSS matrix representation, BiCGStab method, iterative refinement.

Full text: PDF file (731 kB)
UDC: 519.612
Received: 19.03.2015

Citation: K. V. Voronin, S. A. Solovyev, “Solution of the Helmholtz problem using the preconditioned low-rank approximation technique”, Num. Meth. Prog., 16:2 (2015), 268–280

Citation in format AMSBIB
\Bibitem{VorSol15}
\by K.~V.~Voronin, S.~A.~Solovyev
\paper Solution of the Helmholtz problem using the preconditioned low-rank approximation technique
\jour Num. Meth. Prog.
\yr 2015
\vol 16
\issue 2
\pages 268--280
\mathnet{http://mi.mathnet.ru/vmp538}


Linking options:
  • http://mi.mathnet.ru/eng/vmp538
  • http://mi.mathnet.ru/eng/vmp/v16/i2/p268

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Numerical methods and programming
    Number of views:
    This page:71
    Full text:50

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022