Related papers: The Inverse Iteration Method for Julia Sets in the…
The Fatou-Julia decomposition is significant in the study of iterations of holomorphic mappings. Such a decomposition can be also considered for foliations in a unified manner. Although the decomposition will be fundamental in the study, it…
We present a general scheme for the construction of new eficient generalized Schultz iterative methods for computing the inverse matrix. These methods have the form $$ X_{k+1} = X_k(a_0^{(k)}I+a_1^{(k)}AX_k),\quad k\in\mathbb{N}, $$ where…
Let $f:\hat{C}\to\hat{C}$ be a subhyperbolic rational map of degree $d$. We construct a set of coding maps $Cod(f)=\{\pi_r:\Sigma\to J\}_r$ of the Julia set $J$ by geometric coding trees, where the parameter $r$ ranges over mappings from a…
The computability of Julia sets of rational maps on the Riemann sphere has been intensively studied in recent years (see, e.g. https://doi.org/10.17323/1609-4514-2008-8-2-185-231, https://doi.org/10.1090/conm/797/15936) for an overview. For…
The Bayesian approach to inverse problems provides a practical way to solve ill-posed problems by augmenting the observation model with prior information. Due to the measure-theoretic underpinnings, the approach has raised theoretical…
We study the dynamics of the family $f_c(x, y)= (xy+c, x)$ of endomorphisms of $\mathbb{R}^2$ and $\mathbb{C}^2$, where $c$ is a real or complex parameter. Such maps can be seen as perturbations of the map $f_0(x,y)=(xy,x)$, which is a…
We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…
The inverse scattering problem, whose goal is to reconstruct an unknown scattering object from its scattered wave, is essential in fundamental wave physics and its wide applications in imaging sciences. However, it remains challenging to…
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approaches for manipulating constructible sets. In this paper, for an…
Many matching, tracking, sorting, and ranking problems require probabilistic reasoning about possible permutations, a set that grows factorially with dimension. Combinatorial optimization algorithms may enable efficient point estimation,…
For any polynomial diffeomorphism $f$ of ${\Bbb C}^2$ with positive entropy, neither the Julia set of $f$ nor of its inverse $f^{-1}$ is semi-analytic.
Let $f$ be a rational map with degree $d\geq 2$ whose Julia set is connected but not equal to the whole Riemann sphere. It is proved that there exists a rational map $g$ such that $g$ contains a buried Julia component on which the dynamics…
We propose a two-stage deep learning framework for the inverse design of rectangular patch antennas. Our approach leverages generative modeling to learn a latent representation of antenna frequency response curves and conditions a…
In a recent paper, a new method was proposed to find the common invariant subspaces of a set of matrices. This paper invstigates the more general problem of putting a set of matrices into block triangular or block-diagonal form…
Recent results in control systems and numerical integration literature utilize invariant set theory to lift dynamical systems evolving on nonlinear manifolds to those evolving on vector spaces. We leverage this technique to propose an…
In this paper, we provide a modern synthesis of the classic inverse compositional algorithm for dense image alignment. We first discuss the assumptions made by this well-established technique, and subsequently propose to relax these…
In electromagnetic inverse scattering, the goal is to reconstruct object permittivity using scattered waves. While deep learning has shown promise as an alternative to iterative solvers, it is primarily used in supervised frameworks which…
This paper deals with developing techniques for the reconstruction of high-dimensional datasets given each bivariate projection, as would be found in a matrix scatterplot. A graph-based solution is introduced, involving clique-finding,…
We propose a characterization of a $p$-Laplace higher eigenvalue based on the inverse iteration method with balancing the Rayleigh quotients of the positive and negative parts of solutions to consecutive $p$-Poisson equations. The approach…
We show that if a polynomial filled Julia set has empty interior, then it is computable.