Search Results for author:
Found 5 papers, 2 papers with code
Samplet basis pursuit: Multiresolution scattered data approximation with sparsity constraints
Leveraging on the sparse representation of kernel matrices in samplet coordinates, this approach converges faster than the fast iterative shrinkage thresholding algorithm and is feasible for large-scale data.
Samplets: A new paradigm for data compression
In this article, we introduce the concept of samplets by transferring the construction of Tausch-White wavelets to the realm of data.
Boosting quantum machine learning models with multi-level combination technique: Pople diagrams revisited
Inspired by Pople diagrams popular in quantum chemistry, we introduce a hierarchical scheme, based on the multi-level combination (C) technique, to combine various levels of approximations made when calculating molecular energies within quantum chemistry.
Chemical Physics
A scalable H-matrix approach for the solution of boundary integral equations on multi-GPU clusters
In this work, we consider the solution of boundary integral equations by means of a scalable hierarchical matrix approach on clusters equipped with graphics hardware, i. e. graphics processing units (GPUs).
Mathematical Software Distributed, Parallel, and Cluster Computing Numerical Analysis Numerical Analysis
A Fast Isogeometric BEM for the Three Dimensional Laplace- and Helmholtz Problems
We present an indirect higher order boundary element method utilising NURBS mappings for exact geometry representation and an interpolation-based fast multipole method for compression and reduction of computational complexity, to counteract the problems arising due to the dense matrices produced by boundary element methods.
Numerical Analysis 65M38 G.1.8; G.1.2
