相关论文: Approximation of integral operators by Green quadr…
Hierarchical matrices approximate a given matrix by a decomposition into low-rank submatrices that can be handled efficiently in factorized form. $\mathcal{H}^2$-matrices refine this representation following the ideas of fast multipole…
In this work we have presented a rather general and easy-to-apply method for discrete Hilbert space representation of quantum mechanical Green's operators. We have shown that if in some discrete Hilbert space basis representation the…
We present a family of algorithms for the numerical approximation of the Schr\"odinger equation with potential concentrated at a finite set of points. Our methods belong to the so-called fast and oblivious convolution quadrature algorithms.…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
With the emergence of Artificial Intelligence, numerical algorithms are moving towards more approximate approaches. For methods such as PCA or diffusion maps, it is necessary to compute eigenvalues of a large matrix, which may also be dense…
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…
A method based on separated integration to estimate anharmonic corrections to energy and vibration of molecules in a second-order diagrammatic vibrational many-body Green's function formalism has already been presented. A severe bottleneck…
Multiple scattering methods are widely used to reduce the computational complexity of acoustic or electromagnetic scattering problems when waves propagate through media containing many identical inclusions. Historically, this numerical…
This work presents a novel matrix-based method for constructing an approximation Hessian using only function evaluations. The method requires less computational power than interpolation-based methods and is easy to implement in matrix-based…
The aim of this work is to develop a fast algorithm for approximating the matrix function $f(A)$ of a square matrix $A$ that is symmetric and has hierarchically semiseparable (HSS) structure. Appearing in a wide variety of applications,…
Boundary element methods for elliptic partial differential equations typically lead to boundary integral operators with translation-invariant kernel functions. Taking advantage of this property is fairly simple for particle methods, e.g.,…
Efficient ab initio calculations of correlated materials at finite temperature require compact representations of the Green's functions both in imaginary time and Matsubara frequency. In this paper, we introduce a general procedure which…
Hierarchical Matrix (H-matrix) is an approximation technique which splits a target dense matrix into multiple submatrices, and where a selected portion of submatrices are low-rank approximated. The technique substantially reduces both time…
We present quadrature schemes to calculate matrices, where the so-called modified Hilbert transformation is involved. These matrices occur as temporal parts of Galerkin finite element discretizations of parabolic or hyperbolic problems when…
The Hilbert-space Gaussian Process (HGP) approach offers a hyperparameter-independent basis function approximation for speeding up Gaussian Process (GP) inference by projecting the GP onto M basis functions. These properties result in a…
Basing on the relation between the Coulomb Green function and the Green function of harmonic oscillator, the algebraic representation of the many-particle Coulomb Green function in the form of annihilation and creation operators is…
Hybrid spectral-spatial representations are introduced to rapidly calculate periodic scalar and dyadic Green's functions of the Helmholtz equation for 2D and 3D configurations with a 1D (linear) periodicity. The presented schemes work…
A modified Green operator is proposed as an improvement of Fourier-based numerical schemes commonly used for computing the electrical or thermal response of heterogeneous media. Contrary to other methods, the number of iterations necessary…
In the equation of motion approach to the two-time Green's functions, conventional Tyablikov-type truncation of the chain of equations is rather arbitrary and apt to violate the analytical structure of Green's functions. Here, we propose a…
In this letter, an accelerated quadratic programming (QP) algorithm is proposed based on the proximal gradient method. The algorithm can achieve convergence rate $O(1/p^{\alpha})$, where $p$ is the iteration number and $\alpha$ is the given…