相关论文: Numerical Computation of approximate Generalized P…
Generalized Polynomial Chaos (gPC) expansions are well established for forward uncertainty propagation in many application areas. Although the associated computational effort may be reduced in comparison to Monte Carlo techniques, for…
Multivariate polynomials arise in many different disciplines. Representing such a polynomial as a vector of univariate polynomials can offer useful insight, as well as more intuitive understanding. For this, techniques based on tensor…
We present a new and general Monte Carlo iteration method for generalized ensembles. It consists of two elements: (1) a simple algorithm to distinguish between distributions arising from respectively equilibrium- and non-equilibrium…
We introduce interpolation operators with approximation and stability properties suited for parabolic problems in primal and mixed formulations. We derive localized error estimates for tensor product meshes (occurring in classical…
This paper is concerned with the open problem proposed in Ammari et. al. Commun. Math.Phys, 2013. We first investigate the existence and uniqueness of Generalized Polarization Tensors (GPTs) vanishing structures locally in both two and…
In this paper, we study a mixed variational problem subject to perturbations, where the noise term is modelled by means of a bilinear form that has to be understood to be "small" in some sense. Indeed, we consider a family of such problems…
By using the Poisson formula for resultants and the variants of chip-firing game on graphs, we provide a combinatorial method for computing a class of of resultants, i.e. the characteristic polynomials of the adjacency tensors of starlike…
This paper presents a new concept of geometric multipole expansion for the conductivity or anti-plane elasticity problem in two dimensions by using the Faber polynomials. As an application, we construct semi-neutral inclusions of general…
A generalization of the polar coding scheme called mixed-kernels is introduced. This generalization exploits several homogeneous kernels over alphabets of different sizes. An asymptotic analysis of the proposed scheme shows that its…
Tensor decomposition is a well-known tool for multiway data analysis. This work proposes using stochastic gradients for efficient generalized canonical polyadic (GCP) tensor decomposition of large-scale tensors. GCP tensor decomposition is…
Anti-circulant tensors have applications in exponential data fitting. They are special Hankel tensors. In this paper, we extend the definition of anti-circulant tensors to generalized anti-circulant tensors by introducing a circulant index…
A uniform strategy to derive metric tensors in two spatial dimension for interpolation errors and their gradients in $L^p$ norm is presented. It generates anisotropic adaptive meshes as quasi-uniform ones in corresponding metric space, with…
Multipolar expansions are a foundational tool for describing basis functions in quantum mechanics, many-body polarization, and other distributions on the unit sphere. Progress on these topics is often held back by complicated and competing…
The approximate computation of all gravitational forces between $N$ interacting particles via the fast multipole method (FMM) can be made as accurate as direct summation, but requires less than $\mathcal{O}(N)$ operations. FMM groups…
An efficient way to calculate one-loop counterterms within the Feynman diagrammatic approach and dimensional regularization is to expand the propagators in the integrands of the Feynman integrals around vanishing external momentum. In this…
We propose a new method for low-rank approximation of Moore-Penrose pseudoinverses (MPPs) of large-scale matrices using tensor networks. The computed pseudoinverses can be useful for solving or preconditioning of large-scale overdetermined…
Canonical Polyadic (CP) tensor decomposition is a workhorse algorithm for discovering underlying low-dimensional structure in tensor data. This is accomplished in conventional CP decomposition by fitting a low-rank tensor to data with…
Tensor network diagram (graphical notation) is a useful tool that graphically represents multiplications between multiple tensors using nodes and edges. Using the graphical notation, complex multiplications between tensors can be described…
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
We present the hyperasymptotic expansions for a certain group of solutions of the heat equation. We extend this result to a more general case of linear PDEs with constant coefficients. The generalisation is based on the method of Borel…