Publication:5851422

Publication date: 22 January 2010

monograph; numerical examples; moment; Gauss quadrature; conjugate gradient algorithm; Tikhonov regularization; ill-posed problems; tridiagonal matrices; orthogonal polynomial; Riemann-Stieltjes integral; least squares fit; Lanczos process

Mathematics Subject Classification ID

65D10: Numerical smoothing, curve fitting

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

65F20: Numerical solutions to overdetermined systems, pseudoinverses

65F22: Ill-posedness and regularization problems in numerical linear algebra

42C05: Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis

65F10: Iterative numerical methods for linear systems

41A55: Approximate quadratures

65D32: Numerical quadrature and cubature formulas

65-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis

15-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to linear algebra

Related Items

Filtering Frequencies in a Shift-and-Invert Lanczos Algorithm for the Dynamic Analysis of Structures, LNLQ: An Iterative Method for Least-Norm Problems with an Error Minimization Property, Gaussian Quadrature and Polynomial Approximation for One-Dimensional Ridge Functions, The structure of matrices in rational Gauss quadrature, Block Matrix Formulations for Evolving Networks, The Radau--Lanczos Method for Matrix Functions, Low-Rank Updates of Matrix Functions, Fast Estimation of Approximate Matrix Ranks Using Spectral Densities, The generation of arbitrary order, non-classical, Gauss-type quadrature for transport applications, The discrete moment method for the numerical integration of piecewise higher order convex functions, A global Lanczos method for image restoration, Error Bounds for Lanczos-Based Matrix Function Approximation, Randomized numerical linear algebra: Foundations and algorithms, Matrix functions in network analysis, Limited‐memory polynomial methods for large‐scale matrix functions, Gauss-type quadrature rules for variable-sign weight functions, The behavior of the Gauss-Radau upper bound of the error norm in CG, Krylov-Aware Stochastic Trace Estimation, Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches, Optimal averaged Padé-type approximants, Approximation of the Tikhonov regularization parameter through Aitken's extrapolation, Elliptic finite-band potentials of a non-self-adjoint Dirac operator, Gauss-type quadrature rules with respect to external zeros of the integrand, Fast Estimation of $tr(f(A))$ via Stochastic Lanczos Quadrature, Bayes Meets Krylov: Statistically Inspired Preconditioners for CGLS, Exploring the “Middle Earth” of network spectra via a Gaussian matrix function, A Structure Preserving Lanczos Algorithm for Computing the Optical Absorption Spectrum, On the Stability of Network Indices Defined by Means of Matrix Functions, Inexact Half-Quadratic Optimization for Linear Inverse Problems, Unnamed Item, Unnamed Item, Unnamed Item, Stochastic estimates for the trace of functions of matrices via Hadamard matrices, On the cost of iterative computations, A non-parametric structural hybrid modeling approach for electricity prices, Unnamed Item, Divide-and-Conquer Methods for Functions of Matrices with Banded or Hierarchical Low-Rank Structure, Numerical methods for estimating the tuning parameter in penalized least squares problems, The Short-Term Rational Lanczos Method and Applications, A sensitivity analysis of probabilistic sensitivity analysis in terms of the density function for the input variables, Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM, A Comparison of Limited-memory Krylov Methods for Stieltjes Functions of Hermitian Matrices, On the relationship between the discrete and continuous bounding moment problems and their numerical solutions, Estimation of the bilinear form $y^\ast f(A)x$ for Hermitian matrices, New block quadrature rules for the approximation of matrix functions, Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions, Generalized averaged Gauss quadrature rules for the approximation of matrix functionals, Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations, Fast variants of the Golub and Welsch algorithm for symmetric weight functions in Matlab, A new subtraction-free formula for lower bounds of the minimal singular value of an upper bidiagonal matrix, Simplified anti-Gauss quadrature rules with applications in linear algebra, Solution of nonlinear time-dependent PDEs through componentwise approximation of matrix functions, On prescribing the convergence behavior of the conjugate gradient algorithm, Extended nonsymmetric global Lanczos method for matrix function approximation, The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization, Vertex-frequency analysis on graphs, Estimates for the generalized cross-validation function via an extrapolation and statistical approach, Algebraic description of the finite Stieltjes moment problem, Multiple orthogonal polynomials applied to matrix function evaluation, The block Lanczos algorithm for linear ill-posed problems, GCV for Tikhonov regularization by partial SVD, Orthogonal rational functions on the unit circle with prescribed poles not on the unit circle, A dynamical polynomial chaos approach for long-time evolution of SPDEs, The genesis and early developments of Aitken's process, Shanks' transformation, the $\varepsilon$-algorithm, and related fixed point methods, An optimal Q-OR Krylov subspace method for solving linear systems, Vector estimates for $f(A)\mathbf b$ via extrapolation, Enhanced matrix function approximation, Solution methods for linear discrete ill-posed problems for color image restoration, Linear strong structural controllability and observability of an $n$-link underactuated revolute planar robot with active intermediate joint or joints, On computing quadrature-based bounds for the $A$-norm of the error in conjugate gradients, Ranking hubs and authorities using matrix functions, Minimization of functionals on the solution of a large-scale discrete ill-posed problem, Accelerating data uncertainty quantification by solving linear systems with multiple right-hand sides, Old and new parameter choice rules for discrete ill-posed problems, Comparison of a-posteriori parameter choice rules for linear discrete ill-posed problems, The e-MoM approach for approximating matrix functionals, Efficient estimates in regression models with highly correlated covariates, The Lanczos algorithm and complex Gauss quadrature, A numerical study of fractional linear algebraic systems, A new representation of generalized averaged Gauss quadrature rules, Computation of error bounds via generalized Gauss-Radau and Gauss-Lobatto rules, Shifted extended global Lanczos processes for trace estimation with application to network analysis, Exponentially confining potential well, Inexpensive guaranteed and efficient upper bounds on the algebraic error in finite element discretizations, An inverse eigenvalue problem for doubly periodic pseudo-Jacobi matrices, The extended symmetric block Lanczos method for matrix-valued Gauss-type quadrature rules, Interpolating log-determinant and trace of the powers of matrix $\mathbf{A}+ t\mathbf{B}$, Hessenberg-Sobolev matrices and Favard type theorem, Generalized fractional algebraic linear system solvers, Averaged Gauss quadrature formulas: properties and applications, When does the Lanczos algorithm compute exactly?, On the rational approximation of Markov functions, with applications to the computation of Markov functions of Toeplitz matrices, The extended global Lanczos method, Gauss-Radau quadrature, and matrix function approximation, Lanczos-like algorithm for the time-ordered exponential: the $\ast$-inverse problem., Estimating the error in matrix function approximations, Analysis of directed networks via partial singular value decomposition and Gauss quadrature, Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices, A Monte Carlo method for computing the action of a matrix exponential on a vector, Gauss-Christoffel quadrature for inverse regression: applications to computer experiments, Stability and uniqueness properties of Taylor approximations of matrix functions, Generalized block anti-Gauss quadrature rules, Approximating the extreme Ritz values and upper bounds for the $A$-norm of the error in CG, Regularized reconstruction of a surface from its measured gradient field, A contour integral approach to the computation of invariant pairs, Aitken's method for estimating bilinear forms arising in applications, A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching, Graphs with absorption: numerical methods for the absorption inverse and the computation of centrality measures, Direct and inverse computation of Jacobi matrices of infinite iterated function systems, New matrix function approximations and quadrature rules based on the Arnoldi process, Spectra of Jacobi operators via connection coefficient matrices, Gauss-Laurent-type quadrature rules for the approximation of functionals of a nonsymmetric matrix, Rational Gauss quadrature rules for the approximation of matrix functionals involving Stieltjes functions, On randomized trace estimates for indefinite matrices with an application to determinants, The global Golub-Kahan method and Gauss quadrature for tensor function approximation, A Lanczos-type procedure for tensors, Estimating the trace of matrix functions with application to complex networks, A Lanczos-like method for non-autonomous linear ordinary differential equations, Edge Modification Criteria for Enhancing the Communicability of Digraphs, Predicting Triadic Closure in Networks Using Communicability Distance Functions, Euclidean-Norm Error Bounds for SYMMLQ and CG, Computation of Generalized Matrix Functions, Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions, Updating and Downdating Techniques for Optimizing Network Communicability

Uses Software