Related papers: Pseudo-spectral apparent horizon finders: an effic…

The geometric Cauchy problem for a class of surfaces in a pseudo-Riemannian manifold of dimension 3 is to find the surface which contains a given curve with a prescribed tangent bundle along the curve. We consider this problem for constant…

The symmetry of complex networks is a global property that has recently gained attention since MacArthur et al. 2008 showed that many real-world networks contain a considerable number of symmetries. These authors work with a very strict…

This paper explores variants of the subspace iteration algorithm for computing approximate invariant subspaces. The standard subspace iteration approach is revisited and new variants that exploit gradient-type techniques combined with a…

The presence and evolution of apparent horizons in a two-parameter family of spherically symmetric, time-dependent solutions of Brans-Dicke gravity are analyzed. These solutions were introduced to model space- and time-varying gravitational…

The aim of this article is further development of the theory of linear difference equations with constant coefficients. We present a new algorithm for calculating the solution to the Cauchy problem for a three-dimensional difference…

Effective cross-modal retrieval requires robust alignment of heterogeneous data types. Most existing methods focus on bi-modal retrieval tasks and rely on distributional alignment techniques such as Kullback-Leibler divergence, Maximum Mean…

The gravitational wave detectors currently in operation perform the analysis of their scientific data jointly. Concerning the search for bursting sources, coherent data analysis methods have been shown to be more efficient. In the coherent…

In this paper, we propose a successive pseudo-convex approximation algorithm to efficiently compute stationary points for a large class of possibly nonconvex optimization problems. The stationary points are obtained by solving a sequence of…

This paper gives a detailed pedagogic presentation of the central concepts underlying a new algorithm for the numerical solution of Einstein's equations for gravitation. This approach incorporates the best features of the two leading…

This paper is concerned with the mean curvature flow, which describes the dynamics of a hypersurface whose normal velocity is determined by local mean curvature. We present a Cartesian grid-based method for solving mean curvature flows in…

This paper considers some fundamental questions concerning marginally trapped surfaces, or apparent horizons, in Cauchy data sets for the Einstein equation. An area estimate for outermost marginally trapped surfaces is proved. The proof…

We propose a new stochastic algorithm (generalized simulated annealing) for computationally finding the global minimum of a given (not necessarily convex) energy/cost function defined in a continuous D-dimensional space. This algorithm…

This paper proposes a receding horizon active learning and control problem for dynamical systems in which Gaussian Processes (GPs) are utilized to model the system dynamics. The active learning objective in the optimization problem is…

Several challenging problem in clustering, partitioning and imaging have traditionally been solved using the "spectral technique". These problems include the normalized cut problem, the graph expander ratio problem, the Cheeger constant…

We propose an efficient algorithm for the immersed boundary method on distributed-memory architectures, with the computational complexity of a completely explicit method and excellent parallel scaling. The algorithm utilizes the…

In this paper, we present a stochastic gradient algorithm for minimizing a smooth objective function that is an expectation over noisy cost samples, and only the latter are observed for any given parameter. Our algorithm employs a gradient…

We consider the Cauchy problem for a second-order nonlinear evolution equation in a Hilbert space. This equation represents the abstract generalization of the Ball integro-differential equation. The general nonlinear case with respect to…

Coherent wide parameter-space searches for continuous gravitational waves are typically limited in sensitivity by their prohibitive computing cost. Therefore semi-coherent methods (such as StackSlide) can often achieve a better sensitivity.…

This paper proposes a method for computing the visible occluding contours of subdivision surfaces. The paper first introduces new theory for contour visibility of smooth surfaces. Necessary and sufficient conditions are introduced for when…

Feasibility problem aims to find a common point of two or more closed (convex) sets whose intersection is nonempty. In the literature, projection based algorithms are widely adopted to solve the problem, such as the method of alternating…