Related papers: Moore-Penrose Inverse of some Linear Maps on Infin…
In this paper, we introduce two new generalized inverses of matrices, namely, the $\bra{i}{m}$-core inverse and the $\pare{j}{m}$-core inverse. The $\bra{i}{m}$-core inverse of a complex matrix extends the notions of the core inverse…
In this paper, firstly we study the continuity of the core-EP inverse without explicit error bounds by virtue of two methods. One is the rank equality, followed from the classical generalized inverse. The other one is matrix decomposition.…
Totally invariant divisors of endomorphisms of the projective space are expected to be always unions of linear spaces. Using logarithmic differentials we establish a lower bound for the degree of the non-normal locus of a totally invariant…
Invertible compositions of one-dimensional maps are studied which are assumed to include maps with non-positive Schwarzian derivative and others whose sum of distortions is bounded. If the assumptions of the Koebe principle hold, we show…
The image of a linear space under inversion of some coordinates is an affine variety whose structure is governed by an underlying hyperplane arrangement. In this paper, we generalize work by Proudfoot and Speyer to show that circuit…
This monograph is centred at the intersection of three mathematical topics, that are theoretical in nature, yet with motivations and relevance deep rooted in applications: the linear inverse problems on abstract, in general…
Obtaining meaningful solutions for inverse problems has been a major challenge with many applications in science and engineering. Recent machine learning techniques based on proximal and diffusion-based methods have shown promising results.…
We consider the existence of invariant curves of real analytic reversible mappings which are quasi-periodic in the angle variables. By the normal form theorem, we prove that under some assumptions, the original mapping is changed into its…
The kinematics of a robot manipulator are described in terms of the mapping connecting its joint space and the 6-dimensional Euclidean group of motions $SE(3)$. The associated Jacobian matrices map into its Lie algebra $\mathfrak{se}(3)$,…
The general solution of the inverse Frobenius-Perron problem considering the construction of a fully chaotic dynamical system with given invariant density is obtained within the class of one-dimensional unimodal maps. Some interesting…
We propose a convex-optimization-based framework for computation of invariant measures of polynomial dynamical systems and Markov processes, in discrete and continuous time. The set of all invariant measures is characterized as the feasible…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
Two-grid theory plays a fundamental role in the design and analysis of multigrid methods. This paper is devoted to a new convergence analysis of two-grid methods for singular and symmetric positive semidefinite systems. Specifically, we…
We construct a space which is useful in order to study the entropy of meromorphic maps by using projective limits. We deduce a variational principle for meromorphic maps.
The least squares solutions with the minimum norm of the matrix equations ${\rm {\bf A}}{\rm {\bf X}} = {\rm {\bf B}}$, ${\rm {\bf X}}{\rm {\bf A}} = {\rm {\bf B}}$ and ${\rm {\bf A}}{\rm {\bf X}}{\rm {\bf B}} ={\rm {\bf D}} $ are…
Planar polynomial automorphisms are polynomial maps of the plane whose inverse is also a polynomial map. A map is reversible if it is conjugate to its inverse. Here we obtain a normal form for automorphisms that are reversible by an…
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…
A cumbersome operation in many scientific fields, is inverting large full-rank matrices. In this paper, we propose a coded computing approach for recovering matrix inverse approximations. We first present an approximate matrix inversion…
For mappings in metric spaces satisfying one inequality with respect to modulus of families of curves, there is proved a lightness of the uniform limit of these mappings. It is proved that, the uniform limit of these mappings is light…
This work concerns results on conditions guaranteeing that certain banded $M$-matrices have banded inverses. As a first goal, a graph theoretic characterization for an off-diagonal entry of the inverse of an $M$-matrix to be positive, is…