Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
MTZ-Fachkongress

Antriebe und Energiesysteme von morgen


Austausch von Automobil- und Energiewirtschaft

Am 14./15. Mai geht es in Chemnitz um die Mobilitätswende durch Elektro- und Wasserstofffahrzeuge.
Erweiterte Suche
Anmelden
nach oben
BIT Numerical Mathematics
Erschienen in: BIT Numerical Mathematics 2/2019

18.12.2018

Extended and rational Hessenberg methods for the evaluation of matrix functions

verfasst von: Z. Ramezani, F. Toutounian

Erschienen in: BIT Numerical Mathematics | Ausgabe 2/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Some Krylov subspace methods for approximating the action of matrix functions are presented in this paper. The main idea of these techniques is to project the approximation problem onto a subspace of much smaller dimension. Then the matrix function operation is performed with a much smaller matrix. These methods are projection methods that use the Hessenberg process to generate bases of the approximation spaces. We also use the introduced methods to solve shifted linear systems. Some numerical experiments are presented in order to show the efficiency of the proposed methods.
Vorheriger Artikel Rank one interval enclosure of the parametric united solution set
Nächster Artikel Mimetic properties of difference operators: product and chain rules as for functions of bounded variation and entropy stability of second derivatives

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren
Literatur
1.
Afanasjew, M., Eiermann, M., Ernst, O.G., Güttel, S.: A generalization of the steepest descent method for matrix functions. Electron. Trans. Numer. Anal. 28, 206–222 (2008)MathSciNetMATH
2.
Allen, E.J., Baglama, J., Boyd, S.K.: Numerical approximation of the product of the square root of a matrix with a vector. Linear Algebra Appl. 310, 167–181 (2000)MathSciNetCrossRefMATH
3.
Amini, S., Toutounian, F., Gachpazan, M.: The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides. J. Comput. Appl. Math. 337, 166–174 (2018)MathSciNetCrossRefMATH
4.
Amini, S., Toutounian, F.: Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides. Comput. Math. Appl. 76, 2011–2021 (2018)MathSciNetCrossRef
5.
Beckermann, B., Güttel, S.: Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions. Numer. Math. 121, 205–236 (2012)MathSciNetCrossRefMATH
6.
Beckermann, B., Reichel, L.: Error estimation and evaluation of matrix functions via the Faber transform. SIAM J. Numer. Anal. 47, 3849–3883 (2009)MathSciNetCrossRefMATH
7.
Benzi, M., Razouk, N.: Decay bounds and O(n) algorithms for approximating functions of sparse matrices. Electron. Trans. Numer. Anal. 28, 16–39 (2007)MathSciNetMATH
8.
Calvetti, D., Reichel, L.: Lanczos-based exponential filtering for discrete ill-posed problems. Numer. Algorithms 29, 45–65 (2002)MathSciNetCrossRefMATH
9.
Calvetti, D., Reichel, L., Zhang, Q.: Iterative exponential filtering for large discrete ill-posed problems. Numer. Math. 83, 535–556 (1999)MathSciNetCrossRefMATH
10.
Crouzeix, M., Palencia, C.: The numerical range is a \( 1+\sqrt{2} \)-spectral set. SIAM J. Matrix Anal. Appl. 38, 649–655 (2017)MathSciNetCrossRefMATH
11.
Datta, B.N., Saad, Y.: Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment. Linear Algebra Appl. 154–156, 225–244 (1991)MathSciNetCrossRefMATH
12.
Druskin, V., Knizhnerman, L.: Two polynomial methods of calculating functions of symmetric matrices. U.S.S.R. Comput. Math. Math. Phys. 29, 112–121 (1989)MathSciNetCrossRefMATH
13.
Druskin, V., Knizhnerman, L.: Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic. Numer. Linear Algebra Appl. 2, 205–217 (1995)MathSciNetCrossRefMATH
14.
Druskin, V., Knizhnerman, L.: Extended Krylov subspace approximations of the matrix square root and related functions. SIAM J. Matrix Anal. Appl. 19, 755–771 (1998)MathSciNetCrossRefMATH
15.
Druskin, V., Knizhnerman, L., Zaslavsky, M.: Solution of large scale evolutionary problems using rational Krylov subspaces with optimized shifts. SIAM J. Sci. Comput. 31, 3760–3780 (2009)MathSciNetCrossRefMATH
16.
17.
Eiermann, M., Ernst, O.G.: A restarted Krylov subspace method for the evaluation of matrix functions. SIAM J. Numer. Anal. 44, 2481–2504 (2006)MathSciNetCrossRefMATH
18.
Fenu, C., Martin, D., Reichel, L., Rodriguez, G.: Block Gauss and anti-Gauss quadrature with application to networks. SIAM J. Matrix Anal. Appl. 34, 1655–1684 (2013)MathSciNetCrossRefMATH
19.
Fenu, C., Martin, D., Reichel, L., Rodriguez, G.: Network analysis via partial spectral factorization and Gauss quadrature. SIAM J. Sci. Comput. 35, 2046–2068 (2013)MathSciNetCrossRefMATH
20.
Feriani, A., Perotti, F., Simoncini, V.: Iterative system solvers for the frequency analysis of linear mechanical systems. Comput. Meth. Appl. Mech. Eng. 190, 1719–1739 (2000)CrossRefMATH
21.
Freund, R.W.: Solution of shifted linear systems by quasi-minimal residual iterations. In: Reichel, L., Ruttan, A., Varga, R.S. (eds.) Numerical Linear Algebra, pp. 101–121. W. de Gruyter, Berlin, Germany (1993)
22.
23.
Gallopoulos, E., Saad, Y.: On the parallel solution of parabolic equations. In: Proceedings of the 3rd International Conference on Supercomputing, pp. 17–28. ACM (1989)
24.
Gallopoulos, E., Saad, Y.: Efficient solution of parabolic equations by Krylov approximation methods. SIAM J. Sci. Stat. Comput. 13, 1236–1264 (1992)MathSciNetCrossRefMATH
25.
Gu, G.: Restarted GMRES augmented with harmonic Ritz vectors for shifted linear systems. Int. J. Comput. Math. 82, 837–849 (2005)MathSciNetCrossRefMATH
26.
Gu, G., Zhang, J., Li, Z.: Restarted GMRES augmented with eigenvectors for shifted linear systems. Int. J. Comput. Math. 80, 1037–1047 (2003)MathSciNetCrossRefMATH
27.
Gu, X.M., Huang, T. Z., Carpentieri, B., Imakura, A., Zhang, K., Du, L.: Efficient variants of the CMRH method for solving multi-shifted non-Hermitian linear systems. arXiv:​1611.​00288. Accessed on 24 Feb 2018
28.
Gu, X.M., Huang, T.Z., Yin, G., Carpentieri, B., Wen, C., Du, L.: Restarted Hessenberg method for solving shifted nonsymmetric linear systems. J. Comput. Appl. Math. 331, 166–177 (2018)MathSciNetCrossRefMATH
29.
Güttel, S., Knizhnerman, L.: A black-box rational Arnoldi variant for Cauchy–Stietljes matrix functions. BIT Numer. Math. 53, 595–616 (2013)CrossRefMATH
30.
Güttel, S.: Rational Krylov methods for operator functions. Ph.D. thesis (2010)
31.
Güttel, S.: Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection. GAMM-Mitteilungen 36, 8–31 (2013)MathSciNetCrossRefMATH
32.
Hessenberg, K.: Behandlung der linearen Eigenwert-Aufgaben mit Hilfe der HamiltonCayleychen Gleichung. Darmstadt dissertation (1940)
33.
Heyouni, M.: Extended Arnoldi methods for large low-rank Sylvester matrix equations. Appl. Numer. Math. 60, 1171–1182 (2010)MathSciNetCrossRefMATH
34.
Heyouni, M., Sadok, H.: A new implementation of the CMRH method for solving dense linear systems. J. Comput. Appl. Math. 213, 387–399 (2008)MathSciNetCrossRefMATH
35.
Heyouni, M., Jbilou, K.: An extended block method for large-scale continuous-time algebraic Riccati equations. Technical report. L.M.P.A. Université du Littoral (2007)
36.
Heyouni, M., Essai, A.: Matrix Krylov subspace methods for linear systems with multiple right-hand sides. Numer. Algorithms 40, 137–156 (2005)MathSciNetCrossRefMATH
37.
Heyouni, M.: The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides. Numer. Algorithms 26, 317–332 (2001)MathSciNetCrossRefMATH
38.
Higham, N.J.: Functions of Matrices: Theory and Computation. SIAM, Philadelphia (2008)CrossRefMATH
39.
Hochbruck, M., Lubich, C.: On Krylov subspace approximations to the matrix exponential operator. SIAM J. Numer. Anal. 34, 1911–1925 (1997)MathSciNetCrossRefMATH
40.
Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)CrossRefMATH
41.
Jagels, C., Reichel, L.: The extended Krylov subspace method and orthogonal Laurent polynomials. Linear Algebra Appl. 431, 441–458 (2009)MathSciNetCrossRefMATH
42.
Jagels, C., Reichel, L.: Recursion relations for the extended Krylov subspace method. Linear Algebra Appl. 434, 1716–1732 (2011)MathSciNetCrossRefMATH
43.
Jing, Y.-F., Huang, T.-Z.: Restarted weighted full orthogonalization method for shifted linear systems. Comput. Math. Appl. 57, 1583–1591 (2009)MathSciNetCrossRefMATH
44.
Knizhnerman, L.: Calculation of functions of unsymmetric matrices using Arnoldis method. Comput. Math. Math. Phys. 31, 1–9 (1992)
45.
Knizhnerman, L., Simoncini, V.: A new investigation of the extended Krylov subspace method for matrix function evaluations. Numer. Linear Algebra Appl. 17, 615–638 (2010)MathSciNetMATH
46.
Knizhnerman, L., Simoncini, V.: Convergence analysis of the extended Krylov subspace method for the Lyapunov equation. Numer. Math. 118, 567–586 (2011)MathSciNetCrossRefMATH
47.
48.
49.
Pranić, S., Reichel, L., Rodriguez, G., Wang, Z., Yu, X.: A rational Arnoldi process with applications. Numer. Linear Algebra Appl. 23, 1007–1022 (2016)MathSciNetCrossRefMATH
50.
51.
Ruhe, A.: Rational Krylov algorithms for nonsymmetric eigenvalue problems. IMA Vol. Math. Appl. 60, 149–164 (1994)MathSciNetMATH
52.
Ruhe, A.: Rational Krylov algorithms for nonsymmetric eigenvalue problems II. Matrix pairs. Linear Algebra Appl. 197–198, 283–295 (1994)MathSciNetCrossRefMATH
53.
Ruhe, A.: The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: complex shifts for real matrices. BIT Numer. Math. 34, 165–176 (1994)MathSciNetCrossRefMATH
54.
Ruhe, A.: Rational Krylov: a practical algorithm for large sparse nonsymmetric matrix pencils. SIAM J. Sci. Comput. 19, 1535–1551 (1998)MathSciNetCrossRefMATH
55.
Saad, Y.: Analysis of some Krylov subspace approximations to the matrix exponential operator. SIAM J. Numer. Anal. 29, 209–228 (1992)MathSciNetCrossRefMATH
56.
Sadok, H.: CMRH: a new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm. Numer. Algorithms 20, 303–321 (1999)MathSciNetCrossRefMATH
57.
58.
Schmelzer, T., Trefethen, L.N.: Evaluating matrix functions for exponential integrators via Carathodory–Fejr approximation and contour integrals. Electron. Trans. Numer. Anal. 29, 1–18 (2007)MathSciNetMATH
59.
Schweitzer, M.: Restarting and error estimation in polynomial and extended Krylov subspace methods for the approximation of matrix functions. Ph.D. Thesis, Bergische Universität Wuppertal (2016)
60.
61.
Simoncini, V.: A new iterative method for solving large-scale Lyapunov matrix equations. SIAM J. Sci. Comput. 29, 1268–1288 (2007)MathSciNetCrossRefMATH
62.
63.
Simoncini, V., Szyld, D.B.: Recent computational developments in Krylov subspace methods for linear systems. J. Numer. Linear Algebra Appl. 14, 1–59 (2007)MathSciNetCrossRefMATH
64.
Sogabe, T., Hoshi, T., Zhang, S.-L., Fujiwara, T.: A numerical method for calculating the Greens function arising from electronic structure theory. In: Kaneda, Y., Kawamura, H., Sasai, M. (eds.) Frontiers of Computational Science, pp. 189–195. Springer, Berlin, Heidelberg (2007)CrossRef
65.
Sogabe, T., Hoshi, T., Zhang, S.-L., Fujiwara, T.: On a weighted quasi-residual minimization strategy for solving complex symmetric shifted linear systems. Electron. Trans. Numer. Anal. 31, 126–140 (2008)MathSciNetMATH
66.
Sogabe, T., Zhang, S.-L.: An extension of the COCR method to solving shifted linear systems with complex symmetric matrices. East Asian J. Appl. Math. 1, 97–107 (2011)MathSciNetCrossRefMATH
67.
Takayama, R., Hoshi, T., Sogabe, T., Zhang, S.-L., Fujiwara, T.: Linear algebraic calculation of Green’s function for large-scale electronic structure theory. Phys. Rev. B 73, 1–9 (2006)CrossRef
68.
Teng, Z., Wang, X.: Heavy ball restarted CMRH methods for linear systems. Math. Comput. Appl. 23, 10 (2018)MathSciNetMATH
69.
van der Vorst, H.A.: An iterative solution method for solving \(f (A)x = b\) using Krylov subspace information obtained for the symmetric positive definite matrix A. J. Comput. Appl. Math. 18, 249–263 (1987)MathSciNetCrossRefMATH
70.
van der Vorst, H.A.: Iterative Krylov Methods for Large Linear Systems. Cambridge University Press, Cambridge (2003)CrossRefMATH
71.
van Gijzen, M.B., Sleijpen, G.L.G., Zemke, J.P.M.: Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems. Numer. Linear Algebra Appl. 22, 1–25 (2015)MathSciNetCrossRefMATH
72.
Wilkinson, J.H.: The Algebraic Eigenvalue Problem. Clarendon Press, Oxford (1965)MATH
73.
Metadaten
Titel
Extended and rational Hessenberg methods for the evaluation of matrix functions
verfasst von
Z. Ramezani
F. Toutounian
Publikationsdatum
18.12.2018
Verlag
Springer Netherlands
Erschienen in
BIT Numerical Mathematics / Ausgabe 2/2019
Print ISSN: 0006-3835
Elektronische ISSN: 1572-9125
DOI
https://doi.org/10.1007/s10543-018-0742-9

Weitere Artikel der Ausgabe 2/2019

BIT Numerical Mathematics 2/2019 Zur Ausgabe

OriginalPaper

Mimetic properties of difference operators: product and chain rules as for functions of bounded variation and entropy stability of second derivatives

OriginalPaper

A new version of a preconditioning method for certain two-by-two block matrices with square blocks

OriginalPaper

On Motzkin’s method for inconsistent linear systems

OriginalPaper

Numerical computation of H-bases

OriginalPaper

Explicit computational wave propagation in micro-heterogeneous media

OriginalPaper

Computation of matrix gamma function

Premium Partner

    Bildnachweise