Related papers: Blending attractors of Iterated Function Systems
We show that for the attractor $(K_{1},\dots,K_{q})$ of a graph directed iterated function system, for each $1\leq j\leq q$ and $\varepsilon>0$ there exits a self-similar set $K\subseteq K_{j}$ that satisfies the strong separation condition…
We present a systematically improvable tensor hypercontraction (THC) factorization based on interpolative separable density fitting (ISDF). We illustrate algorithmic details to achieve this within the framework of Becke's atom-centered…
This paper expands the Cyclic Block Proximal Gradient method for block separable composite minimization by allowing for inexactly computed gradients and proximal maps. The resultant algorithm, the Inexact Cyclic Block Proximal Gradient…
We propose a new class of random feature methods for linearizing softmax and Gaussian kernels called hybrid random features (HRFs) that automatically adapt the quality of kernel estimation to provide most accurate approximation in the…
The basin of attraction is the set of initial points that will eventually converge to some attracting set. Its knowledge is important in understanding the dynamical behavior of a given dynamical system of interest. In this work, we address…
In this paper a periodic parameter switching scheme is applied to the Hindmarsh-Rose neuronal system to synthesize certain attractors. Results show numerically, via computer graphic simulations, that the obtained synthesized attractor…
This paper proposes a heterogenous density fusion approach to scalable multisensor multitarget tracking where the inter-connected sensors run different types of random finite set (RFS) filters according to their respective capacity and…
A collaborative filtering recommender system predicts user preferences by discovering common features among users and items. We implement such inference using a Bayesian double feature allocation model, that is, a model for random pairs of…
In the paper, we define a class of new fractals named ``non-autonomous attractors", which are the generalization of classic Moran sets and attractors of iterated function systems. Simply to say, we replace the similarity mappings by…
The Newton-Raphson basins of convergence, corresponding to the coplanar libration points (which act as attractors), are unveiled in the Copenhagen problem, where instead of the Newtonian potential and forces, a quasi-homogeneous potential…
Feature selection has been proven a powerful preprocessing step for high-dimensional data analysis. However, most state-of-the-art methods tend to overlook the structural correlation information between pairwise samples, which may…
A feature-mapping framework for inverse reconstruction of density-based topology optimization results is proposed. Unlike SIMP, whose voxelized outputs are hard to interpret or reuse, the method represents designs with high-level geometric…
In this paper, it is presented a novel method for increasing the number of scrolls in a hybrid nonlinear switching system. Using the definition of the "Round to the Nearest Integer Function", as a generalization of a PWL function, which is…
This article is concerned with a new filtered two-step variational integrator for solving the charged-particle dynamics in a mildly non-uniform moderate or strong magnetic field with a dimensionless parameter $\varepsilon$ inversely…
Fractal geometry deals mainly with irregularity and captures the complexity of a structure or phenomenon. In this article, we focus on the approximation of set-valued functions using modern machinery on the subject of fractal geometry. We…
We consider the iterated function systems (IFSs) that consist of three general similitudes in the plane with centres at three non-collinear points, and with a common contraction factor $\la\in(0,1)$. As is well known, for $\la=1/2$ the…
The boundary integral method is an efficient approach for solving time-harmonic obstacle scattering problems by a bounded scatterer. This paper presents the directional preconditioner for the iterative solution of linear systems of the…
We give fully polynomial-time approximation schemes (FPTAS) for the partition function of ferromagnetic 2-spin systems in certain parameter regimes. The threshold we obtain is almost tight up to an integrality gap. Our technique is based on…
We present new rectangular mixed finite elements for linear elasticity. The approach is based on a modification of the Hellinger-Reissner functional in which the symmetry of the stress field is enforced weakly through the introduction of a…
Bundling crossings is a strategy which can enhance the readability of drawings. In this paper we consider good drawings, i.e., we require that any two edges have at most one common point which can be a common vertex or a crossing. Our main…