Some large-scale matrix computation problems
From MaRDI portal
Publication:2564249
A numerical method is outlined to bound the bilinear form \(u^T f(A)v\) for a given matrix \(A\) and vectors \(u\) and \(v\). A simulation method is also given to estimate the trace of the inverse and the determinant of sparse matrices. Computational results are presented.
Recommendations
Cites work
- A Stochastic Estimator of the Trace of the Influence Matrix for Laplacian Smoothing Splines
- Convergence of stochastic processes
- Estimates in quadratic formulas
- scientific article; zbMATH DE number 3649937 (Why is no real title available?)
- scientific article; zbMATH DE number 3854294 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3753925 (Why is no real title available?)
- scientific article; zbMATH DE number 4115838 (Why is no real title available?)
- Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
- Modified moments for indefinite weight functions
- Orthogonal polynomials: Variable-signed weight functions
- Some Modified Matrix Eigenvalue Problems
- Variational bounds on the entries of the inverse of a matrix
Cited in
(65)- Estimates of the trace of the inverse of a symmetric matrix using the modified Chebyshev algorithm
- A computable error bound for matrix functionals
- Computational methods for UV-suppressed fermions
- Lanczos methods for UV-suppressed fermions
- Global convergence of nonmonotone strategies in parallel methods for block-bordered nonlinear systems
- Eigenfunction properties and approximations of selected incidence matrices employed in spatial analyses
- Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse
- GCV for Tikhonov regularization by partial SVD
- On Russian roulette estimates for Bayesian inference with doubly-intractable likelihoods
- Bounds for eigenvalues of matrix polynomials
- Accelerating data uncertainty quantification by solving linear systems with multiple right-hand sides
- Block conjugate gradient type methods for the approximation of bilinear form \(C^HA^{-1}B\)
- An efficient contour integral based eigensolver for 3D dispersive photonic crystal
- Computation of error bounds via generalized Gauss-Radau and Gauss-Lobatto rules
- Interpolating log-determinant and trace of the powers of matrix \(\mathbf{A}+ t\mathbf{B}\)
- The extended global Lanczos method, Gauss-Radau quadrature, and matrix function approximation
- Effective new methods for automated parameter selection in regularized inverse problems
- Bounding matrix functionals via partial global block Lanczos decomposition
- Aitken's method for estimating bilinear forms arising in applications
- Randomized matrix-free trace and log-determinant estimators
- Graphs with absorption: numerical methods for the absorption inverse and the computation of centrality measures
- Fast estimates for the diagonal of the inverse of large scale matrices appearing in applications
- On randomized trace estimates for indefinite matrices with an application to determinants
- Estimating the trace of matrix functions with application to complex networks
- Irr: An algorithm for computing the smallest singular value of large scale matrices
- Approximation of the determinant of large sparse symmetric positive definite matrices
- Estimation of the bilinear form y^ f(A)x for Hermitian matrices
- GCV for Tikhonov regularization via global Golub-Kahan decomposition.
- How accurately should I compute implicit matrix-vector products when applying the Hutchinson trace estimator?
- Moments of a linear operator, with applications to the trace of the inverse of matrices and the solution of equations.
- Large matrix, small rank
- Filter analysis for the stochastic estimation of eigenvalue counts
- Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
- scientific article; zbMATH DE number 5674690 (Why is no real title available?)
- Emergence of invariance and disentanglement in deep representations
- Fast estimation of \(\mathrm{tr}(f(A))\) via stochastic Lanczos quadrature
- scientific article; zbMATH DE number 2152273 (Why is no real title available?)
- Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems
- A probing method for computing the diagonal of a matrix inverse.
- A new subtraction-free formula for lower bounds of the minimal singular value of an upper bidiagonal matrix
- scientific article; zbMATH DE number 7626767 (Why is no real title available?)
- Improved Variants of the Hutch++ Algorithm for Trace Estimation
- The short-term rational Lanczos method and applications
- Extending Hierarchical Probing for Computing the Trace of Matrix Inverses
- The structure of matrices in rational Gauss quadrature
- Approximating spectral sums of large-scale matrices using stochastic Chebyshev approximations
- Krylov-Aware Stochastic Trace Estimation
- Approximate factoring of the inverse
- The symbol approximation method: a numerical approach to the approximation of the symbol of self-adjoint operators
- Correlation bias correction in two-way fixed-effects linear regression
- A determinant-free method to simulate the parameters of large Gaussian fields
- Visualizing high-dimensional loss landscapes with Hessian directions
- A posteriori error bounds for the block-Lanczos method for matrix function approximation
- Simplified anti-Gauss quadrature rules with applications in linear algebra
- Numerical methods for A-optimal designs with a sparsity constraint for ill-posed inverse problems
- Randomized matrix-free quadrature: unified and uniform bounds for stochastic Lanczos quadrature and the kernel polynomial method
- Query lower bounds for log-concave sampling
- Multivariate trace estimation using quantum state space linear algebra
- Reviving pseudo-inverses: asymptotic properties of large dimensional Moore-Penrose and ridge-type inverses with applications
- Optimal sensor placement under model uncertainty in the weak-constraint 4D-Var framework
- Improved bounds on sample size for implicit matrix trace estimators
- Schur properties of convolutions of gamma random variables
- Parameter estimation in high dimensional Gaussian distributions
- Geometrical properties of the Frobenius condition number for positive definite matrices
- Matrices, moments, and rational quadrature
This page was built for publication: Some large-scale matrix computation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564249)
