Matrices, moments, and rational quadrature

DOI10.1016/j.laa.2008.04.047zbMath1191.65010OpenAlexW2038273756MaRDI QIDQ952044

B. E. Eshmatov

Publication date: 6 November 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10016/6275

zbMATH Keywords

Lanczos processrational Gauss quadraturelower and upper bounds for suitable functionals

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15)

Related Items (14)

Global Golub-Kahan bidiagonalization applied to large discrete ill-posed problems ⋮ The structure of matrices in rational Gauss quadrature ⋮ Estimating the trace of matrix functions with application to complex networks ⋮ Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches ⋮ Recursion relations for the extended Krylov subspace method ⋮ Comparison of a-posteriori parameter choice rules for linear discrete ill-posed problems ⋮ Analysis of directed networks via partial singular value decomposition and Gauss quadrature ⋮ A global Lanczos method for image restoration ⋮ Error estimates for large-scale ill-posed problems ⋮ GCV for Tikhonov regularization via global Golub–Kahan decomposition ⋮ Matrix methods for quadrature formulas on the unit circle. A survey ⋮ Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection ⋮ On the computation of Gauss quadrature rules for measures with a monomial denominator ⋮ Bounding matrix functionals via partial global block Lanczos decomposition

Uses Software

• GQRAT
• OPQ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Moment inequalities and the Riemann hypothesis
• A study of semiiterative methods for nonsymmetric systems of linear equations
• Geometric convergence to \(e^{-z}\) by rational functions with real poles
• A hybrid iterative method for symmetric indefinite linear systems
• The computation of bounds for the norm of the error in the conjugate gradient algorithm
• A note on Tikhonov regularization of large linear problems
• Quadrature rules for rational functions
• \(L\)-curve curvature bounds via Lanczos bidiagonalization
• Incomplete partial fractions for parallel evaluation of rational matrix functions
• On the convergence of quadrature formulas connected with multipoint Padé-type approximation
• An iterative Lavrentiev regularization method
• Some large-scale matrix computation problems
• Error bounds for rational quadrature formulae of analytic functions
• Error Estimates and Evaluation of Matrix Functions via the Faber Transform
• Error Bounds for Gaussian Quadrature of Analytic Functions
• Stopping Criteria for Rational Matrix Functions of Hermitian and Symmetric Matrices
• Superfast Solution of Real Positive Definite Toeplitz Systems
• A Unified Theory for Real Vs. Complex Rational Chebyshev Approximation on an Interval
• CONDITIONS FOR CONVERGENCE OF MULTIPOINT PADÉ APPROXIMANTS FOR FUNCTIONS OF STIELTJES TYPE
• ON MARKOV'S THEOREM FOR MULTIPOINT PADÉ APPROXIMANTS
• Quadrature Formulas Based on Rational Interpolation
• On Krylov Subspace Approximations to the Matrix Exponential Operator
• Some Modified Matrix Eigenvalue Problems
• Two polynomial methods of calculating functions of symmetric matrices
• An iterative method with error estimators

This page was built for publication: Matrices, moments, and rational quadrature