Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
From MaRDI portal
Publication:1371672
DOI10.1007/BF02510247zbMATH Open0888.65050MaRDI QIDQ1371672FDOQ1371672
Authors: Gene H. Golub, G. Meurant 
Publication date: 14 December 1997
Published in: BIT (Search for Journal in Brave)
Recommendations
momentsorthogonal polynomialsquadraturematrix functionsquadrature formulaLanczos methodStieltjes integral
Cites Work
Cited In (50)
- Interplay between discretization and algebraic computation in adaptive numerical solution of elliptic PDE problems
- The behavior of the Gauss-Radau upper bound of the error norm in CG
- Approximating the extreme Ritz values and upper bounds for the \(A\)-norm of the error in CG
- Acceleration of iterative solution of series of systems due to better initial guess
- Model reduction using the Vorobyev moment problem
- Stopping criteria for iterations in finite element methods
- A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching
- Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions
- Generalized anti-Gauss quadrature rules
- Global Golub-Kahan bidiagonalization applied to large discrete ill-posed problems
- Title not available (Why is that?)
- Statistical properties of BayesCG under the Krylov prior
- A GENERAL OUTPUT BOUND RESULT: APPLICATION TO DISCRETIZATION AND ITERATION ERROR ESTIMATION AND CONTROL
- Application of Gauss quadrature rule in finding bounds for solution of linear systems of equations
- On the computation of Gauss quadrature rules for measures with a monomial denominator
- A null space algorithm for mixed finite-element approximations of Darcy's equation
- Accurate error estimation in CG
- Error estimation in preconditioned conjugate gradients
- Block conjugate gradient type methods for the approximation of bilinear form \(C^HA^{-1}B\)
- Low-Rank Updates of Matrix Functions
- Quadrature rule-based bounds for functions of adjacency matrices
- Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
- Estimates of the \(l_2\) norm of the error in the conjugate gradient algorithm
- Preconditioning for Allen-Cahn variational inequalities with non-local constraints
- An iterative Lavrentiev regularization method
- Numerical solution of fractional differential equations with a collocation method based on Müntz polynomials
- Addendum to: Why Gaussian quadrature in the complex plane?
- Euclidean-Norm Error Bounds for SYMMLQ and CG
- An iterative method with error estimators
- On computing quadrature-based bounds for the \(A\)-norm of the error in conjugate gradients
- Truncated generalized averaged Gauss quadrature rules
- The stabilization of weights in the Lanczos and conjugate gradient method
- From numerical quadrature to Padé approximation
- Error norm estimation and stopping criteria in preconditioned conjugate gradient iterations
- Bounding matrix functionals via partial global block Lanczos decomposition
- Linear regression models, least-squares problems, normal equations, and stopping criteria for the conjugate gradient method
- Estimating and localizing the algebraic and total numerical errors using flux reconstructions
- LSLQ: An Iterative Method for Linear Least-Squares with an Error Minimization Property
- Some large-scale matrix computation problems
- Sharp 2-Norm Error Bounds for LSQR and the Conjugate Gradient Method
- Personal report : Gene Howard Golub, 1932--2007
- Towards understanding CG and GMRES through examples
- Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations
- Accuracy controlled data assimilation for parabolic problems
- Title not available (Why is that?)
- New error estimates for the conjugate gradient method
- Title not available (Why is that?)
- Interval simulated annealing applied to electrical impedance tomography image reconstruction with fast objective function evaluation
- Estimating the error in matrix function approximations
- A Lanczos method for approximating composite functions
This page was built for publication: Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1371672)
