Pages that link to "Item:Q3016255"

The following pages link to Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix (Q3016255):

Displaying 31 items.

• Improved Variants of the Hutch++ Algorithm for Trace Estimation (Q5094217) (← links)
• A Multilevel Approach to Variance Reduction in the Stochastic Estimation of the Trace of a Matrix (Q5097607) (← links)
• Probing for the Trace Estimation of a Permuted Matrix Inverse Corresponding to a Lattice Displacement (Q5099863) (← links)
• Optimal Experimental Design for Inverse Problems in the Presence of Observation Correlations (Q5101014) (← links)
• Extending Hierarchical Probing for Computing the Trace of Matrix Inverses (Q5112562) (← links)
• A parameter choice rule for Tikhonov regularization based on predictive risk (Q5113627) (← links)
• Norm and Trace Estimation with Random Rank-one Vectors (Q5150838) (← links)
• Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators (Q5230654) (← links)
• Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation (Q5230655) (← links)
• Optimal Regularized Inverse Matrices for Inverse Problems (Q5270416) (← links)
• A-optimal encoding weights for nonlinear inverse problems, with application to the Helmholtz inverse problem (Q5348010) (← links)
• Approximating Spectral Sums of Large-Scale Matrices using Stochastic Chebyshev Approximations (Q5350223) (← links)
• Fast Estimation of Approximate Matrix Ranks Using Spectral Densities (Q5380703) (← links)
• Deflation as a Method of Variance Reduction for Estimating the Trace of a Matrix Inverse (Q5738167) (← links)
• Optimal experimental design for infinite-dimensional Bayesian inverse problems governed by PDEs: a review (Q5854065) (← links)
• Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis (Q5874469) (← links)
• Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix (Q5885812) (← links)
• Stochastic algorithms for self-consistent calculations of electronic structures (Q5886872) (← links)
• A literature survey of matrix methods for data science (Q6068265) (← links)
• A FEAST SVDsolver based on Chebyshev-Jackson series for computing partial singular triplets of large matrices (Q6077289) (← links)
• M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions (Q6083984) (← links)
• Adaptive minimax optimality in statistical inverse problems via SOLIT—Sharp Optimal Lepskiĭ-Inspired Tuning (Q6136775) (← links)
• Scalable Physics-Based Maximum Likelihood Estimation Using Hierarchical Matrices (Q6177922) (← links)
• An Augmented Matrix-Based CJ-FEAST SVDsolver for Computing a Partial Singular Value Decomposition with the Singular Values in a Given Interval (Q6180351) (← links)
• A scalable framework for multi-objective PDE-constrained design of building insulation under uncertainty (Q6185171) (← links)
• The symbol approximation method: a numerical approach to the approximation of the symbol of self-adjoint operators (Q6495452) (← links)
• Learning a stable approximation of an existing but unknown inverse mapping: application to the half-time circular Radon transform (Q6569720) (← links)
• A robust randomized indicator method for accurate symmetric eigenvalue detection (Q6592271) (← links)
• Visualizing high-dimensional loss landscapes with Hessian directions (Q6625316) (← links)
• Faster randomized partial trace estimation (Q6638206) (← links)
• Analysis of stochastic probing methods for estimating the trace of functions of sparse symmetric matrices (Q6657191) (← links)