On sensitivity of Gauss-Christoffel quadrature
From MaRDI portal
Publication:2642282
DOI10.1007/s00211-007-0078-xzbMath1117.41023OpenAlexW1965763804MaRDI QIDQ2642282
Zdeněk Strakoš, Dianne P. O'Leary, 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
Related Items
Algebraic description of the finite Stieltjes moment problem, The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology, When does the Lanczos algorithm compute exactly?, The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data, A Lanczos method for approximating composite functions, The behavior of the Gauss-Radau upper bound of the error norm in CG, Stability of the Lanczos algorithm on matrices with regular spectral distributions, Direct and inverse computation of Jacobi matrices of infinite iterated function systems, Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations, A note on generalized averaged Gaussian formulas, Accuracy of the Lanczos Process for the Eigenproblem and Solution of Equations, Model reduction using the Vorobyev moment problem, Associated orthogonal polynomials of the first kind and Darboux transformations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Is the recurrence relation for orthogonal polynomials always stable?
- Jacobi matrices for sums of weight functions
- The numerically stable reconstruction of Jacobi matrices from spectral data
- On the real convergence rate of the conjugate gradient method
- On the calculation of Jacobi matrices
- The rate of convergence of conjugate gradients
- The convergence behavior of Ritz values in the presence of close eigenvalues
- The numerically stable reconstruction of a Jacobi matrix from spectral data
- How to choose modified moments?
- A stability analysis of the Jacobi matrix inverse eigenvalue problem
- Perturbation bounds of the Krylov bases and associated Hessenberg forms
- Relative perturbation theory. III: More bounds on eigenvalue variation
- On generating orthogonal polynomials for discrete measures
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- On the sensitivity of Lanczos recursions to the spectrum
- The interplay between classical analysis and (numerical) linear algebra -- a tribute to Gene H. Golub
- Orthogonal polynomials (in Matlab)
- On error estimation in the conjugate gradient method and why it works in finite precision computations
- Accurate recovery of recursion coefficients from Gaussian quadrature formulas
- Relatively robust representations of symmetric tridiagonals
- Condition number of the Krylov bases and subspaces
- Sensitivity analysis of the Lanczos reduction
- Error Bounds for Gaussian Quadrature of Analytic Functions
- Updating and Downdating of Orthogonal Polynomials with Data Fitting Applications
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- Accurate Singular Values of Bidiagonal Matrices
- A survey of matrix inverse eigenvalue problems
- Estimating the Largest Eigenvalue of a Positive Definite Matrix
- On Estimating the Largest Eigenvalue with the Lanczos Algorithm
- On Generating Orthogonal Polynomials
- Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
- Orthogonal polynomials
- Orthogonal Eigenvectors and Relative Gaps
- On Computing the Points and Weights for Gauss--Legendre Quadrature
- On Symmetric Eigenproblems Induced by the Bidiagonal SVD
- Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
- Construction of Gauss-Christoffel Quadrature Formulas
- On the Construction of Gaussian Quadrature Rules from Modified Moments
- Methods of conjugate gradients for solving linear systems
- Computation of Gauss-type quadrature formulas