A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points for multivariate compact sets by basic tools of numerical linear algebra. The fi...
Len Bos, Stefano De Marchi, Alvise Sommariva, Marc...
A set XN of N points on the unit sphere is a spherical t-design if the average value of any polynomial of degree at most t over XN is equal to the average value of the polynomial o...
Congpei An, Xiaojun Chen, Ian H. Sloan, Robert S. ...
Abstract. A variational problem characterizing the density estimator defined by the maximum a posteriori method with Gaussian process priors is derived. It is shown that this probl...
In this paper, we first study two flux recovery procedures for the conforming finite element approximation to general second-order elliptic partial differential equations. One is a...
We develop a mixed finite element method for elliptic problems on hexahedral grids that reduces to cell-centered finite differences. The paper is an extension of our earlier paper...
Abstract. In [9], we introduced and analyzed a recovery-based a posteriori error estimator for conforming linear finite element approximation to interface problems. It was shown th...