Related papers: Efficient computation of matrix elements of generi…
We introduce a novel algorithm for approximating the logarithm of the determinant of a symmetric positive definite (SPD) matrix. The algorithm is randomized and approximates the traces of a small number of matrix powers of a specially…
For latent class models where the class weights depend on individual covariates, we derive a simple expression for computing the score vector and a convenient hybrid between the observed and the expected information matrices which is always…
In this work I apply a recently proposed improvement procedure, originally conceived to reduce finite lattice spacing effects in transfer matrices for dilute Fermi systems, to tuning operators for the calculation of observables. I…
In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…
In this paper, we first present an algorithm for computing the Hermite normal form of pseudo-matrices over Pr\"ufer domains. This algorithm allows us to provide constructive proofs of the main theoretical results on finitely presented…
In this article we investigate a finite element formulation of strongly monotone quasi-linear elliptic PDEs in the context of fixed-point iterations. As opposed to Newton's method, which requires information from the previous iteration in…
We present a very fast algorithm for general matrix factorization of a data matrix for use in the statistical analysis of high-dimensional data via latent factors. Such data are prevalent across many application areas and generate an…
Hierarchical matrices (usually abbreviated ${\mathcal H}$-matrices) are frequently used to construct preconditioners for systems of linear equations. Since it is possible to compute approximate inverses or $LU$ factorizations in ${\mathcal…
We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist $\tau =2$ local operator insertions corresponding to spin $N$. They contribute to the massive operator matrix elements in QCD describing…
An explicit formula is obtained for the generalized Macdonald functions on the $N$-fold Fock tensor spaces, calculating a certain matrix element of a composition of several screened vertex operators. As an application, we prove the…
The characteristic identity formalism discussed in our recent articles is further utilized to derive matrix elements of type 2 unitary irreducible $gl(m|n)$ modules. In particular, we give matrix element formulae for all gl(m|n) generators,…
We present a comparison of a number of iterative solvers of linear systems of equations for obtaining the fermion propagator in lattice QCD. In particular, we consider chirally invariant overlap and chirally improved Wilson (maximally)…
We report on recent results obtained for the massive operator matrix elements which contribute to the massive Wilson coefficients in deep-inelastic scattering for $Q^2 \gg m_i^2$ in case of sub-processes with two fermion lines and different…
In this talk I propose a new computational scheme with overlap fermions and a fast algorithm to invert the corresponding Dirac operator.
Matrix elements of spherical tensor operators are fundamental to the analysis of lanthanide spectra in both amorphous and crystalline host materials. In the intermediate coupling scheme, the eigenvectors of the Hamiltonian define the…
We use proper-time regularizations to define the one-loop fermion determinant in the form suggested by Gasser and Leutwyler some years ago. We show how to obtain the polynomial by which this definition of ln det D needs to be modified in…
We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3})$. This paper is argued the finiteness of proposed…
We study a matrix that arises from a singular form of the Woodbury matrix identity. We present generalized inverse and pseudo-determinant identities for this matrix, which have direct applications for Gaussian process regression,…
In this paper, we propose an adaptive fast solver for a general class of symmetric positive definite (SPD) matrices which include the well-known graph Laplacian. We achieve this by developing an adaptive operator compression scheme and a…
We construct explicit formulae for the eigenvalues of certain invariants of the Lie superalgebra gl(m|n) using characteristic identities. We discuss how such eigenvalues are related to reduced Wigner coefficients and the reduced matrix…