An analysis on stochastic Lanczos quadrature with asymmetric quadrature nodes

07/03/2023
by   Wenhao Li, et al.
0

The stochastic Lanczos quadrature method has garnered significant attention recently. Upon examination of the error analyses given by Ubaru, Chen and Saad and Cortinovis and Kressner, certain notable inconsistencies arise. It turns out that the former's results are valid for cases with symmetric quadrature nodes and may not be adequate for many practical cases such as estimating log determinant of matrices. This paper analyzes probabilistic error bound of the stochastic Lanczos quadrature method for cases with asymmetric quadrature nodes. Besides, an optimized error allocation technique is employed to minimize the overall number of matrix vector multiplications required by the stochastic Lanczos quadrature method.

READ FULL TEXT
research
12/25/2021

On computing HITS ExpertRank via lumping the hub matrix

The dangling nodes is the nodes with no out-links in the web graph. It s...
research
08/15/2023

Analysis of stochastic probing methods for estimating the trace of functions of sparse symmetric matrices

We consider the problem of estimating the trace of a matrix function f(A...
research
10/21/2014

On Symmetric and Asymmetric LSHs for Inner Product Search

We consider the problem of designing locality sensitive hashes (LSH) for...
research
12/28/2020

Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem

We present the first nontrivial approximation algorithm for the bottlene...
research
09/11/2018

Deep Asymmetric Networks with a Set of Node-wise Variant Activation Functions

This work presents deep asymmetric networks with a set of node-wise vari...
research
05/31/2021

Asymmetric All-or-nothing Transforms

In this paper, we initiate a study of asymmetric all-or-nothing transfor...

Please sign up or login with your details

Forgot password? Click here to reset