Related papers: Interpolation-based reproducing kernel particle me…

Meshless methods are commonly used to determine numerical solutions to partial differential equations (PDEs) for problems involving free surfaces and/or complex geometries, approximating spatial derivatives at collocation points via local…

The performance evaluation of a potentially unstable slope involves two key components: the initiation of the slope failure and the post-failure runout. The Finite Element Method (FEM) excels at modeling the initiation of instability but…

Modern GPGPUs provide massive arithmetic throughput, yet many scientific kernels remain limited by memory bandwidth. In particular, repeatedly loading precomputed auxiliary data wastes abundant compute resources while stressing the memory…

In this paper we combine an infeasible Interior Point Method (IPM) with the Proximal Method of Multipliers (PMM). The resulting algorithm (IP-PMM) is interpreted as a primal-dual regularized IPM, suitable for solving linearly constrained…

Radial basis functions (RBFs) are prominent examples for reproducing kernels with associated reproducing kernel Hilbert spaces (RKHSs). The convergence theory for the kernel-based interpolation in that space is well understood and optimal…

$H^1$-conforming Galerkin methods on polygonal meshes such as VEM, BEM-FEM and Trefftz-FEM employ local finite element functions that are implicitly defined as solutions of Poisson problems having polynomial source and boundary data.…

This paper applies the Recursive Projection Method (RPM) to the problem of finding the effective mechanical response of a periodic heterogeneous solid. Previous works apply the Fast Fourier Transform (FFT) in combination with various…

Conventional vision algorithms adopt a single type of feature or a simple concatenation of multiple features, which is always represented in a high-dimensional space. In this paper, we propose a novel unsupervised spectral embedding…

In this paper, we present a NURBS-enhanced finite element method that integrates the NURBS-based boundary representation of a geometric domain into a standard finite element framework for hexahedral meshes. We decompose an open, bounded,…

Conventionally, piecewise polynomials have been used in the boundary elements method (BEM) to approximate unknown boundary values. Since infinitely smooth radial basis functions (RBFs) are more stable and accurate than the polynomials for…

In this paper we propose a new stable and accurate approximation technique which is extremely effective for interpolating large scattered data sets. The Partition of Unity (PU) method is performed considering Radial Basis Functions (RBFs)…

In this work we propose an efficient and accurate multi-scale optical simulation algorithm by applying a numerical version of slowly varying envelope approximation in FEM. Specifically, we employ the fast iterative method to quickly compute…

Numerical homogenization and multiscale finite element methods construct effective properties on a coarse grid by solving local problems and extracting the average effective properties from these local solutions. In some cases, the…

In boundary element methods (BEM) in $\mathbb{R}^3$, matrix elements and right hand sides are typically computed via analytical or numerical quadrature of the layer potential multiplied by some function over line, triangle and tetrahedral…

In this paper, a Feature-preserving Particle Generation (FPPG) method for arbitrary complex geometry is proposed. Instead of basing on implicit geometries, such as level-set, FPPG employs an explicit geometric representation for the…

The reproducing kernel Hilbert space (RKHS) embedding method is a recently introduced estimation approach that seeks to identify the unknown or uncertain function in the governing equations of a nonlinear set of ordinary differential…

We present a model reduction approach that extends the original empirical interpolation method to enable accurate and efficient reduced basis approximation of parametrized nonlinear partial differential equations (PDEs). In the presence of…

Gaussian processes are typically used for smoothing and interpolation on small datasets. We introduce a new Bayesian nonparametric framework -- GPatt -- enabling automatic pattern extrapolation with Gaussian processes on large…

In this paper we propose a new efficient interpolation tool, extremely suitable for large scattered data sets. The partition of unity method is used and performed by blending Radial Basis Functions (RBFs) as local approximants and using…

We have developed a parallel algorithm for radial basis function (RBF) interpolation that exhibits O(N) complexity,requires O(N) storage, and scales excellently up to a thousand processes. The algorithm uses a GMRES iterative solver with a…