Related papers: Core-EP Decomposition and its Applications
In this note we mainly study the fine Jordan-Chevalley decomposition: a refinement of the classical Jordan-Chevalley decomposition of a matrix and we pay a particular attention to the field of the coefficients of the matrix. Moreover we…
The key idea of this contribution is the partial compensation of non-minimum phase zeros or unstable poles. Therefore the integer-order zero/pole is split into a product of fractional-order pseudo zeros/poles. The amplitude and phase…
PCA can be used for rotation invariant features, describing a shape with its $p_{ab}=E[(x_i-E[x_a])(x_b-E[x_b])]$ covariance matrix approximating shape by ellipsoid, allowing for rotation invariants like its traces of powers. However, real…
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…
This article, is devoted to $n$-EP and $n$-hypo-EP operators. We give some characteristic properties of these two classes and various links with other known classes in the literature, especially the classes of EP, SD, hypo-EP and $n$-normal…
Decomposition techniques for linear programming are difficult to extend to conic optimization problems with general non-polyhedral convex cones because the conic inequalities introduce an additional nonlinear coupling between the variables.…
An ordered graph is a graph enhanced with a linear order on the vertex set. An ordered graph is a core if it does not have an order-preserving homomorphism to a proper subgraph. We say that $H$ is the core of $G$ if (i) $H$ is a core, (ii)…
Inverse spectral problems are studied for first-order integro-differential operators on a finite interval. These problems consist in recovering some components of the kernel from one or multiple spectra. Uniqueness theorems are proved for…
It has been recently pointed out that dynamical systems depending on future values of the unknowns may be useful in different areas of knowledge. We explore in this context the extension of the concept of order reduction that has been…
Kernelization algorithms, usually a preprocessing step before other more traditional algorithms, are very special in the sense that they return (reduced) instances, instead of final results. This characteristic excludes the freedom of…
Order parameters based on spherical harmonics and Fourier coefficients already play a significant role in condensed matter research in the context of systems of spherical or point particles. Here, we extend these types of order parameter to…
In this paper we characterize EP operators through the existence of different types of factorizations. Our results extend to EP operators existing characterizations for EP matrices and give new characterizations both for EP matrices and EP…
Higher-order tensors appear in various areas of mechanics as well as physics, medicine or earth sciences. As these tensors are highly complex, most are not well understood. Thus, the analysis and the visualization process form a highly…
In this paper, we mainly focus on formal deformation theory of module homomorphisms. We first introduce the cohomology of module homomorphisms and study formal one-parameter deformation. We obtain some properties about obstructions. Then we…
The main purpose of this paper is to present a decomposition theorem for nonnegative sesquilinear forms. The key notion is the short of a form to a linear subspace. This is a generalization of the well-known operator short defined by M. G.…
The core inverse for a complex matrix was introduced by Baksalary and Trenkler. Raki\'c, Din\v{c}i\'c and Djordjevi\'c generalized the core inverse of a complex matrix to the case of an element in a ring. They also proved that the core…
In this paper we have investigated enumeration orders of elements of r.e. sets enumerated by means of Turing machines. We have defined a reducibility based on enumeration orders named "Enumeration Order Reducibility" on computable functions…
The EMD algorithm, first proposed in [11], made more robust as well as more versatile in [12], is a technique that aims to decompose into their building blocks functions that are the superposition of a (reasonably) small number of…
We construct a theory to introduce the concept of topologically robust exceptional points (EP). Starting from an ordered system with $N$ elements, we find the necessary condition to have the highest order exceptional point, namely…
We propose an interpretation of quantum separability based on a physical principle: local time reversal. It immediately leads to a simple characterization of separable quantum states that reproduces results known to hold for binary…