Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
Let \(A\) be a large square complex matrix and \(u\), \(v\) complex vectors. Further let \(f\) be a function. In many applications, one has to compute the matrix functional \(u^{\ast}f(A)v\). Usually one reduces \(A\) to a small matrix by a few steps of a Lanczos process and then one evaluates the reduced problem. In this paper, the authors discuss the application of generalized averaged Gauss quadrature rules to the approximation of the matrix functional. First matrix functionals \(u^{\ast}f(A)u\) with a Hermitian matrix \(A\) are approximated by generalized averaged Gauss quadrature rule introduced by \textit{M. M. Spalević} [Math. Comput. 76, No. 259, 1483--1492 (2007; Zbl 1113.65025)]. If \(A\) is non-Hermitian, then \(A\) can be reduced to a small non-Hermitian tridiagonal matrix by a few steps of the non-Hermitian Lanczos process. Then the non-Hermitian tridiagonal matrix defines a Gauss-type quadrature rule, and the authors introduce new generalized averaged Gauss quadrature rules, because this yields higher accuracy and requires almost the same computational effort. In numerical examples, the functions \(f(x) = (1 + x^2)^{-1}\), \(e^x\), and \(\log (x+ c)\) with \(c>0\) are considered. Examples from network analysis are given too.
- New block quadrature rules for the approximation of matrix functions
- A new representation of generalized averaged Gauss quadrature rules
- Truncated generalized averaged Gauss quadrature rules
- Computation of generalized matrix functions
- Gauss-Laurent-type quadrature rules for the approximation of functionals of a nonsymmetric matrix
- A note on generalized averaged Gaussian formulas for a class of weight functions
- Estimating the error in matrix function approximations
- Rational Gauss quadrature rules for the approximation of matrix functionals involving Stieltjes functions
- A note on generalized averaged Gaussian formulas
- scientific article; zbMATH DE number 850082
- A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
- A method for numerical integration on an automatic computer
- A note on generalized averaged Gaussian formulas
- An adaptive Chebyshev iterative method for nonsymmetric linear systems based on modified moments
- An overview of the computational aspects of Kronrod quadrature rules
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Block Gauss and anti-Gauss quadrature with application to networks
- Calculation of Gauss Quadrature Rules
- Calculation of Gauss-Kronrod quadrature rules
- Computation of Gauss-Kronrod quadrature rules
- Computation of Gauss-Kronrod quadrature rules with non-positive weights
- Functions of Matrices
- scientific article; zbMATH DE number 2084315 (Why is no real title available?)
- scientific article; zbMATH DE number 5977361 (Why is no real title available?)
- scientific article; zbMATH DE number 554737 (Why is no real title available?)
- scientific article; zbMATH DE number 592764 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2107939 (Why is no real title available?)
- scientific article; zbMATH DE number 1404572 (Why is no real title available?)
- Matrices, moments and quadrature with applications
- Matrix interpretations and applications of the continued fraction algorithm
- Minimization of functionals on the solution of a large-scale discrete ill-posed problem
- Network analysis via partial spectral factorization and Gauss quadrature
- Network properties revealed through matrix functions
- On generalized averaged Gaussian formulas
- On Generating Orthogonal Polynomials
- On stratified extensions of Gauss-Laguerre and Gauss-Hermite quadrature formulas
- Positive quadrature formulas. III: Asymptotics of weights
- Quadrature rule-based bounds for functions of adjacency matrices
- Some large-scale matrix computation problems
- Modified Stieltjes polynomials and Gauss-Kronrod quadrature rules
- The extended global Lanczos method for matrix function approximation
- Enhanced matrix function approximation
- Internality of generalized averaged Gaussian quadrature rules and truncated variants for modified Chebyshev measures of the second kind
- A new representation of generalized averaged Gauss quadrature rules
- Internality of generalized averaged Gauss quadrature rules and truncated variants for modified Chebyshev measures of the first kind
- Averaged Gauss quadrature formulas: properties and applications
- The extended global Lanczos method, Gauss-Radau quadrature, and matrix function approximation
- A note on generalized averaged Gaussian formulas for a class of weight functions
- Estimating the error in matrix function approximations
- Internality of generalized averaged Gaussian quadrature rules and truncated variants for measures induced by Chebyshev polynomials
- New matrix function approximations and quadrature rules based on the Arnoldi process
- Gauss-Laurent-type quadrature rules for the approximation of functionals of a nonsymmetric matrix
- Averaged cubature schemes on the real positive semiaxis
- Approximating spectral densities of large matrices
- New block quadrature rules for the approximation of matrix functions
- Network analysis via partial spectral factorization and Gauss quadrature
- On generalized averaged Gaussian formulas. II
- Computing f(A)b via least squares polynomial approximations
- Computation of generalized matrix functions
- scientific article; zbMATH DE number 554737 (Why is no real title available?)
- A structure preserving Lanczos algorithm for computing the optical absorption spectrum
- Generalized averaged Gaussian formulas for certain weight functions
- Block Gauss and anti-Gauss quadrature with application to networks
- Matrix functions in network analysis
- Decompositions of optimal averaged Gauss quadrature rules
- Optimal averaged Padé-type approximants
- Error estimates for quadrature rules based on the Arnoldi process
- The set of anti-Gaussian quadrature rules for the optimal set of quadrature rules in Borges' sense
- A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks
- Weighted averaged Gaussian quadrature rules for modified Chebyshev measures
- A new class of quadrature rules for estimating the error in Gauss quadrature
- New error estimates for the conjugate gradient method
- Quadrature rules for trigonometric polynomials
- Enhanced averaged quadrature rules with application to error estimation
- On the accuracy of averaged Gauss quadrature rules
- Generalized averaged Szegő quadrature rules
- Truncated generalized averaged Gauss quadrature rules
- Approximate iterations for structured matrices
This page was built for publication: Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329025)