相关论文: Blocking of Dynamical Triangulations with Matter

The problem of polycube construction or deformation is an essential problem in computer graphics. In this paper, we present a robust, simple, efficient and automatic algorithm to deform the meshes of arbitrary shapes into their polycube…

The decomposition method which makes the parallel solution of the block-tridiagonal matrix systems possible is presented. The performance of the method is analytically estimated based on the number of elementary multiplicative operations…

We introduce two improvements in the numerical scheme to simulate collision and slow shearing of irregular particles. First, we propose an alternative approach based on simple relations to compute the frictional contact forces. The approach…

Trimming is a ubiquitous operation in computer-aided-design whereby parts of a geometry are merged, intersected, or simply discarded. While it grants virtually unlimited flexibility in geometric design, it introduces a plethora of other…

Denoising, the process of reducing random fluctuations in a signal to emphasize essential patterns, has been a fundamental problem of interest since the dawn of modern scientific inquiry. Recent denoising techniques, particularly in…

Arclength continuation and branch switching are enormously successful algorithms for the computation of bifurcation diagrams. Nevertheless, their combination suffers from three significant disadvantages. The first is that they attempt to…

Drawing analogies with block spin techniques used to study continuum limits in critical phenomena, we attempt to block up D-branes by averaging over near neighbour elements of their (in general noncommuting) matrix coordinates, i.e.\ in a…

A family of the Block Matching 3-D (BM3D) algorithms for various imaging problems has been recently proposed within the framework of nonlocal patch-wise image modeling [1], [2]. In this paper we construct analysis and synthesis frames,…

In this article we study the energy level spectrum of fractals which have block-hierarchical structures. We develop a method to study the spectral properties in terms of linearization of spectral decimation procedure and verify it…

This paper is concerned with partial Joint SVD-type Block Diagonalization of several matrices so that the extracted diagonal parts collectively optimally assume part of the total mass of all given matrices. For that reason, it will be…

Recently, we pointed out that on a class on non exactly decimable fractals two different parameters are required to describe diffusive and vibrational dynamics. This phenomenon we call dynamical dimension splitting is related to the lack of…

The dynamically triangulated random surface (DTRS) approach to Euclidean quantum gravity in two dimensions is considered for the case of the elemental building blocks being quadrangles instead of the usually used triangles. The well-known…

We study numerically the dynamical triangulation formulation of two-dimensional quantum gravity using a restricted class of triangulation, so-called minimal triangulations, in which only vertices of coordination number 5, 6, and 7 are…

A nonlinear block-coupled Finite Volume methodology is developed for large displacement and large strain regime. The new methodology uses the same normal and tangential face derivative discretisations found in the original fully coupled…

Differential complexes such as the de Rham complex have recently come to play an important role in the design and analysis of numerical methods for partial differential equations. The design of stable discretizations of systems of partial…

We propose inertial versions of block coordinate descent methods for solving non-convex non-smooth composite optimization problems. Our methods possess three main advantages compared to current state-of-the-art accelerated first-order…

In this paper we explore the use of block coordinate descent (BCD) to optimize the centroidal momentum dynamics for dynamically consistent multi-contact behaviors. The centroidal dynamics have recently received a large amount of attention…

In a containment problem, the goal is to preprocess a set of geometric objects so that, given a geometric query object, we can report all the objects containing the query object. We consider the containment problem where input objects are…

We introduce and investigate numerically a minimal class of dynamical triangulations of two-dimensional gravity on the sphere in which only vertices of order five, six or seven are permitted. We show firstly that this restriction of the…

We propose a new geometric method of IR factorization in sector decomposition. The problem is converted into a set of problems in convex geometry. The latter problems are solved using algorithms in combinatorial geometry. This method…