On sensitivity of Gauss-Christoffel quadrature

DOI10.1007/S00211-007-0078-XzbMATH Open1117.41023OpenAlexW1965763804MaRDI QIDQ2642282FDOQ2642282

Authors: Dianne P. O'Leary, Zdeněk Strakoš, Petr Tichý 

Publication date: 20 August 2007

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-007-0078-x

Recommendations

• On the variation of error of a cubature formula due to small perturbations of its weights
• scientific article; zbMATH DE number 4070160
• Is Gauss quadrature optimal for analytic functions?
• Gauss-Chebyshev quadrature formulas
• Accurate computation of weights in classical Gauss-Christoffel quadrature rules

Mathematics Subject Classification ID

Approximate quadratures (41A55) Interpolation in approximation theory (41A05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Methods of conjugate gradients for solving linear systems
• Title not available (Why is that?)
• The numerically stable reconstruction of a Jacobi matrix from spectral data
• A survey of matrix inverse eigenvalue problems
• Orthogonal polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Construction of Gaussian Quadrature Rules from Modified Moments
• Title not available (Why is that?)
• Error Bounds for Gaussian Quadrature of Analytic Functions
• The rate of convergence of conjugate gradients
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the calculation of Jacobi matrices
• The interplay between classical analysis and (numerical) linear algebra -- a tribute to Gene H. Golub
• On Generating Orthogonal Polynomials
• The Lanczos and conjugate gradient algorithms in finite precision arithmetic
• On the real convergence rate of the conjugate gradient method
• Accurate Singular Values of Bidiagonal Matrices
• Construction of Gauss-Christoffel Quadrature Formulas
• On error estimation in the conjugate gradient method and why it works in finite precision computations
• Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
• The numerically stable reconstruction of Jacobi matrices from spectral data
• A stability analysis of the Jacobi matrix inverse eigenvalue problem
• Is the recurrence relation for orthogonal polynomials always stable?
• Relatively robust representations of symmetric tridiagonals
• Condition number of the Krylov bases and subspaces
• Computation of Gauss-type quadrature formulas
• Title not available (Why is that?)
• Orthogonal polynomials (in Matlab)
• On generating orthogonal polynomials for discrete measures
• Accurate recovery of recursion coefficients from Gaussian quadrature formulas
• Estimating the Largest Eigenvalue of a Positive Definite Matrix
• On Estimating the Largest Eigenvalue with the Lanczos Algorithm
• Jacobi matrices for sums of weight functions
• Orthogonal Eigenvectors and Relative Gaps
• Title not available (Why is that?)
• Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
• Updating and Downdating of Orthogonal Polynomials with Data Fitting Applications
• Relative perturbation theory. III: More bounds on eigenvalue variation
• How to choose modified moments?
• Title not available (Why is that?)
• On the sensitivity of Lanczos recursions to the spectrum
• The convergence behavior of Ritz values in the presence of close eigenvalues
• Perturbation bounds of the Krylov bases and associated Hessenberg forms
• Sensitivity analysis of the Lanczos reduction
• On Computing the Points and Weights for Gauss--Legendre Quadrature
• Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
• On Symmetric Eigenproblems Induced by the Bidiagonal SVD

Cited In (15)

• The behavior of the Gauss-Radau upper bound of the error norm in CG
• Model reduction using the Vorobyev moment problem
• Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations
• Algebraic description of the finite Stieltjes moment problem
• Direct and inverse computation of Jacobi matrices of infinite iterated function systems
• Accuracy of the Lanczos process for the eigenproblem and solution of equations
• The numerical stability analysis of pipelined conjugate gradient methods: historical context and methodology
• Stability of the Lanczos algorithm on matrices with regular spectral distributions
• When does the Lanczos algorithm compute exactly?
• Title not available (Why is that?)
• A note on generalized averaged Gaussian formulas
• Sensitivity of the Lanczos recurrence to Gaussian quadrature data: how malignant can small weights be?
• The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
• Associated orthogonal polynomials of the first kind and Darboux transformations
• A Lanczos method for approximating composite functions

Uses Software

• OPQ

This page was built for publication: On sensitivity of Gauss-Christoffel quadrature

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642282)