Skip to main content
Erschienen in: BIT Numerical Mathematics 3/2016

01.09.2016

Generalized averaged Gauss quadrature rules for the approximation of matrix functionals

verfasst von: Lothar Reichel, Miodrag M. Spalević, Tunan Tang

Erschienen in: BIT Numerical Mathematics | Ausgabe 3/2016

Einloggen

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

search-config
loading …

Abstract

The need to compute expressions of the form \(u^*f(A)v\), where A is a large square matrix, u and v are vectors, and f is a function, arises in many applications, including network analysis, quantum chromodynamics, and the solution of linear discrete ill-posed problems. Commonly used approaches first reduce A to a small matrix by a few steps of the Hermitian or non-Hermitian Lanczos processes and then evaluate the reduced problem. This paper describes a new method to determine error estimates for computed quantities and shows how to achieve higher accuracy than available methods for essentially the same computational effort. Our methods are based on recently proposed generalized averaged Gauss quadrature formulas.

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!

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!

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!

Fußnoten
1
The requirements on the bounds of the spectrum of A can be weakened depending on the location of the node \(\zeta \).
 
Literatur
1.
Zurück zum Zitat Ammar, G.S., Calvetti, D., Reichel, L.: Computation of Gauss-Kronrod quadrature rules with nonpositive weights. Electron. Trans. Numer. Anal. 9, 29–38 (1999)MathSciNetMATH Ammar, G.S., Calvetti, D., Reichel, L.: Computation of Gauss-Kronrod quadrature rules with nonpositive weights. Electron. Trans. Numer. Anal. 9, 29–38 (1999)MathSciNetMATH
2.
4.
Zurück zum Zitat Benzi, M., Boito, P.: Quadrature rule-based bounds for functions of adjacency matrices. Linear Algebra Appl. 433, 637–652 (2010)MathSciNetCrossRefMATH Benzi, M., Boito, P.: Quadrature rule-based bounds for functions of adjacency matrices. Linear Algebra Appl. 433, 637–652 (2010)MathSciNetCrossRefMATH
5.
Zurück zum Zitat Benzi, M., Klymko, C.: Total communicability as a centrality measure. J. Complex Netw. 1, 124–149 (2014)CrossRef Benzi, M., Klymko, C.: Total communicability as a centrality measure. J. Complex Netw. 1, 124–149 (2014)CrossRef
6.
Zurück zum Zitat Borges, C.F., Gragg, W.B.: A parallel divide and conquer algorithm for the generalized symmetric definite tridiagonal eigenvalue problem. In: Reichel, L., Ruttan, A., Varga, R.S. (eds.) Numer. Linear Algebra, pp. 11–29. de Gruyter, Berlin (1993) Borges, C.F., Gragg, W.B.: A parallel divide and conquer algorithm for the generalized symmetric definite tridiagonal eigenvalue problem. In: Reichel, L., Ruttan, A., Varga, R.S. (eds.) Numer. Linear Algebra, pp. 11–29. de Gruyter, Berlin (1993)
7.
Zurück zum Zitat Calvetti, D., Golub, G.H., Reichel, L.: An adaptive Chebyshev iterative method for nonsymmetric linear systems of equations based on modified moments. Numer. Math. 67, 21–40 (1997)MathSciNetCrossRefMATH Calvetti, D., Golub, G.H., Reichel, L.: An adaptive Chebyshev iterative method for nonsymmetric linear systems of equations based on modified moments. Numer. Math. 67, 21–40 (1997)MathSciNetCrossRefMATH
8.
Zurück zum Zitat Calvetti, D., Golub, G.H., Gragg, W.B., Reichel, L.: Computation of Gauss-Kronrod quadrature rules. Math. Comp. 69, 1035–1052 (2000)MathSciNetCrossRefMATH Calvetti, D., Golub, G.H., Gragg, W.B., Reichel, L.: Computation of Gauss-Kronrod quadrature rules. Math. Comp. 69, 1035–1052 (2000)MathSciNetCrossRefMATH
9.
Zurück zum Zitat Calvetti, D., Reichel, L., Sgallari, F.: Applications of anti-Gauss quadrature rules in linear algebra. In: Gautschi, W., Golub, G.H., Opfer, G. (eds.) Applications and Computation of Orthogonal Polynomials, pp. 41–56. Birkhäuser, Basel (1999)CrossRef Calvetti, D., Reichel, L., Sgallari, F.: Applications of anti-Gauss quadrature rules in linear algebra. In: Gautschi, W., Golub, G.H., Opfer, G. (eds.) Applications and Computation of Orthogonal Polynomials, pp. 41–56. Birkhäuser, Basel (1999)CrossRef
10.
11.
Zurück zum Zitat Ehrich, S.: On stratified extensions of Gauss-Laguerre and Gauss-Hermite quadrature formulas. J. Comput. Appl. Math. 140, 291–299 (2002)MathSciNetCrossRefMATH Ehrich, S.: On stratified extensions of Gauss-Laguerre and Gauss-Hermite quadrature formulas. J. Comput. Appl. Math. 140, 291–299 (2002)MathSciNetCrossRefMATH
12.
Zurück zum Zitat Estrada, E.: The Structure of Complex Networks. Oxford University Press, Oxford (2012)MATH Estrada, E.: The Structure of Complex Networks. Oxford University Press, Oxford (2012)MATH
14.
Zurück zum Zitat Estrada, E., Higham, D.J., Hatano, N.: Communicability betweenness in complex networks. Phys. A 388, 764–774 (2009)CrossRef Estrada, E., Higham, D.J., Hatano, N.: Communicability betweenness in complex networks. Phys. A 388, 764–774 (2009)CrossRef
15.
Zurück zum Zitat Fenu, C., Martin, D., Reichel, L., Rodriguez, G.: Network analysis via partial spectral factorization and Gauss quadrature. SIAM J. Sci. Comput. 35, A2046–A2068 (2013)MathSciNetCrossRefMATH Fenu, C., Martin, D., Reichel, L., Rodriguez, G.: Network analysis via partial spectral factorization and Gauss quadrature. SIAM J. Sci. Comput. 35, A2046–A2068 (2013)MathSciNetCrossRefMATH
16.
Zurück zum Zitat 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 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
18.
Zurück zum Zitat Gautschi, W.: Orthogonal Polynomials: Approximation and Computation. Oxford University Press, Oxford (2004)MATH Gautschi, W.: Orthogonal Polynomials: Approximation and Computation. Oxford University Press, Oxford (2004)MATH
19.
Zurück zum Zitat Golub, G.H., Meurant, G.: Matrices, moments and quadrature. In: Griffiths, D.F., Watson, G.A. (eds.) Numerical Analysis 1993, pp. 105–156. Longman, Essex (1993) Golub, G.H., Meurant, G.: Matrices, moments and quadrature. In: Griffiths, D.F., Watson, G.A. (eds.) Numerical Analysis 1993, pp. 105–156. Longman, Essex (1993)
20.
Zurück zum Zitat Golub, G.H., Meurant, G.: Matrices, Moments and Quadrature with Applications. Princeton University Press, Princeton (2010)MATH Golub, G.H., Meurant, G.: Matrices, Moments and Quadrature with Applications. Princeton University Press, Princeton (2010)MATH
22.
Zurück zum Zitat Gragg, W.B.: Matrix interpretation and application of the continued fraction algorithm. Rocky Mt. J. Math. 4, 213–225 (1974)MathSciNetCrossRefMATH Gragg, W.B.: Matrix interpretation and application of the continued fraction algorithm. Rocky Mt. J. Math. 4, 213–225 (1974)MathSciNetCrossRefMATH
23.
Zurück zum Zitat Higham, N.J.: Functions of Matrices: Theory and Computation. SIAM, Philadelphia (2008)CrossRefMATH Higham, N.J.: Functions of Matrices: Theory and Computation. SIAM, Philadelphia (2008)CrossRefMATH
25.
Zurück zum Zitat Martin, D.R., Reichel, L.: Minimization of functionals on the solution of a large-scale discrete ill-posed problem. BIT 53, 153–173 (2013)MathSciNetCrossRefMATH Martin, D.R., Reichel, L.: Minimization of functionals on the solution of a large-scale discrete ill-posed problem. BIT 53, 153–173 (2013)MathSciNetCrossRefMATH
26.
29.
Zurück zum Zitat Saad, Y.: Analysis of some Krylov subspace approximations to the matrix exponential operator. SIAM J. Numer. Anal. 29, 209–228 (1992)MathSciNetCrossRefMATH Saad, Y.: Analysis of some Krylov subspace approximations to the matrix exponential operator. SIAM J. Numer. Anal. 29, 209–228 (1992)MathSciNetCrossRefMATH
30.
33.
Zurück zum Zitat Sun, S., Ling, L., Zhang, N., Li, G., Chen, R.: Topological structure analysis of the protein-protein interaction network in budding yeast. Nucl. Acids Res. 31, 2443–2450 (2003)CrossRef Sun, S., Ling, L., Zhang, N., Li, G., Chen, R.: Topological structure analysis of the protein-protein interaction network in budding yeast. Nucl. Acids Res. 31, 2443–2450 (2003)CrossRef
Metadaten
Titel
Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
verfasst von
Lothar Reichel
Miodrag M. Spalević
Tunan Tang
Publikationsdatum
01.09.2016
Verlag
Springer Netherlands
Erschienen in
BIT Numerical Mathematics / Ausgabe 3/2016
Print ISSN: 0006-3835
Elektronische ISSN: 1572-9125
DOI
https://doi.org/10.1007/s10543-015-0592-7

Weitere Artikel der Ausgabe 3/2016

BIT Numerical Mathematics 3/2016 Zur Ausgabe