Related papers: GCA-$\mathcal{H}^2$ matrix compression for electro…
We introduce a general scheme to consistently truncate equations of motion for Green's functions. Our scheme is guaranteed to generate physical Green's functions with real excitation energies and positive spectral weights. There are free…
Here we study theoretically and compare experimentally an efficient method for solving systems of algebraic equations, where the matrix comes from the discretization of a fractional diffusion operator. More specifically, we focus on…
A formalism for the study of highly interacting electronic systems is presented. The proposed scheme is based on two key concepts: composite operators and algebra constraints. Composite field operators, that naturally appear as a…
Matrix sketching is a recently developed data compression technique. An input matrix A is efficiently approximated with a smaller matrix B, so that B preserves most of the properties of A up to some guaranteed approximation ratio. In so…
Usage of GPUs as co-processors is a well-established approach to accelerate costly algorithms operating on matrices and vectors. We aim to further improve the performance of the Global Neutrino Analysis framework (GNA) by adding GPU support…
As nowadays Machine Learning (ML) techniques are generating huge data collections, the problem of how to efficiently engineer their storage and operations is becoming of paramount importance. In this article we propose a new lossless…
Recently it was shown that the calculation of quasiparticle energies using the $G_0W_0$ approximation can be performed without computing explicitly any virtual electronic states, by expanding the Green function and screened Coulomb…
A method of the self-consistent calculation of the thermodynamical and correlation functions is presented. This approach is based on the GRPA (generalized random phase approximation) scheme with the inclusion of the mean field corrections.…
Nowadays integration of mass matrix components in the element domain is performed using various numerical integration schemes, each one possess different level of accuracy, alters in number of integration (Gauss) points and requires…
We consider the efficient solution of strongly elliptic partial differential equations with random load based on the finite element method. The solution's two-point correlation can efficiently be approximated by means of an…
We propose a novel optimization-based approach to embedding heterogeneous high-dimensional data characterized by a graph. The goal is to create a two-dimensional visualization of the graph structure such that edge-crossings are minimized…
Embedding tables are used by machine learning systems to work with categorical features. In modern Recommendation Systems, these tables can be very large, necessitating the development of new methods for fitting them in memory, even during…
Combining sum factorization, weighted quadrature, and row-based assembly enables efficient higher-order computations for tensor product splines. We aim to transfer these concepts to immersed boundary methods, which perform simulations on a…
Gaussian processes regression models are an appealing machine learning method as they learn expressive non-linear models from exemplar data with minimal parameter tuning and estimate both the mean and covariance of unseen points. However,…
We study the approximability of an existing framework for clustering edge-colored hypergraphs, which is closely related to chromatic correlation clustering and is motivated by machine learning and data mining applications where the goal is…
In this article we use linear algebra to improve the computational time for the obtaining of Green's functions of linear differential equations with reflection (DER). This is achieved by decomposing both the `reduced' equation (the ODE…
Lattice spin models are useful for studying critical phenomena and allow the extraction of equilibrium and dynamical properties. Simulations of such systems are usually based on Monte Carlo (MC) techniques, and the main difficulty is often…
The ill-posed analytic continuation problem for Green's functions and self-energies is investigated by revisiting the Pad\'{e} approximants technique. We propose to remedy the well-known problems of the Pad\'{e} approximants by performing…
Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve on a classical computer. Current generation noisy…
We present a calculation of the spectral properties of a single charge doped at a Cu($3d$) site of the Cu-F plane in KCuF$_{3}$. The problem is treated by generating the equations of motion for the Green's function by means of subsequent…