Related papers: Intrinsic Integration
An efficient direct solver for volume integral equations with O(N) complexity for a broad range of problems is presented. The solver relies on hierarchical compression of the discretized integral operator, and exploits that off-diagonal…
We present an efficient solution to the following problem, of relevance in a numerical optimization scheme: calculation of integrals of the type \[\iint_{T \cap \{f\ge0\}} \phi_1\phi_2 \, dx\,dy\] for quadratic polynomials $f,\phi_1,\phi_2$…
A stochastic-gradient-based interior-point algorithm for minimizing a continuously differentiable objective function (that may be nonconvex) subject to bound constraints is presented, analyzed, and demonstrated through experimental results.…
Point discretization of curved surfaces is required in many applications ranging from object rendering to the solution of surface partial differential equations (PDEs). These applications often impose that surfaces are sampled with local…
Spatial numerical integration is essential for finite element analysis. Currently, numerical integration schemes, mostly based on Gauss quadrature, are widely used. Herein, we present an alternative semi-analytical approach for mass matrix…
We present a numerical method for computing the single layer (Stokeslet) and double layer (stresslet) integrals in Stokes flow. The method applies to smooth, closed surfaces in three dimensions, and achieves high accuracy both on and near…
An accurate implicit description of geometries is enabled by the level-set method. Level-set data is given at the nodes of a higher-order background mesh and the interpolated zero-level sets imply boundaries of the domain or interfaces…
We describe a reverse integration approach for the exploration of low-dimensional effective potential landscapes. Coarse reverse integration initialized on a ring of coarse states enables efficient "navigation" on the landscape terrain:…
A numerical method using implicit surface representations is proposed to solve the linearized Poisson-Boltzmann equations that arise in mathematical models for the electrostatics of molecules in solvent. The proposed method used an implicit…
We introduce a continuous global optimization method to the field of surface reconstruction from discrete noisy cloud of points with weak information on orientation. The proposed method uses an energy functional combining flux-based…
A prerequisite for many biomechanical simulation techniques is discretizing a bounded volume into a tetrahedral mesh. In certain contexts, such as cortical surface simulations, preserving input surface connectivity is critical. However,…
We present a methodology for numerically integrating ordinary differential equations containing rapidly oscillatory terms. This challenge is distinct from that for differential equations which have rapidly oscillatory solutions: here the…
Surface reconstruction with preservation of geometric features is a challenging computer vision task. Despite significant progress in implicit shape reconstruction, state-of-the-art mesh extraction methods often produce aliased,…
We propose a multi-index algorithm for the Monte Carlo (MC) discretization of a linear, elliptic PDE with affine-parametric input. We prove an error vs. work analysis which allows a multi-level finite-element approximation in the physical…
The calculation of g-functions is essential for the design and simulation of geothermal boreholes. However, existing methods, such as the stacked finite line source (SFLS) model, face challenges regarding computational efficiency and…
Monocular depth estimation is a challenging task in complex compositions depicting multiple objects of diverse scales. Albeit the recent great progress thanks to the deep convolutional neural networks (CNNs), the state-of-the-art monocular…
Incremental computation aims to compute more efficiently on changed input by reusing previously computed results. We give a high-level overview of works on incremental computation, and highlight the essence underlying all of them, which we…
Many applications like subseismic fault modeling, fractured reservoir modeling and interpretation/validation of fault connectivity involve the solution to an elliptic boundary value problem in a background medium perturbed by the presence…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
An efficient $hp$-multigrid scheme is presented for local discontinuous Galerkin (LDG) discretizations of elliptic problems, formulated around the idea of separately coarsening the underlying discrete gradient and divergence operators. We…