In this paper we introduce a general class of level dependent Quasi-Birth-and-Death (QBD) processes and their stationary solution. We obtain the complete characterization of their fundamental matrices in terms of minimal non-negative solution of number of matrix quadratic equations. Our results will provide mixed-geometric solution for the stationary solution of level dependent chains. Applicat...

The current paper contributes a novel framework for solving a class of linear matrix differential equations. To do so, the operational matrix of the derivative based on the shifted Bernoulli polynomials together with the collocation method are exploited to reduce the main problem to system of linear matrix equations. An error estimation of presented method is provided. Numerical experiments are...

This paper discusses a new class of matrix nearness problems that measure approximation error using a directed distance measure called a Bregman divergence. Bregman divergences offer an important generalization of the squared Frobenius norm and relative entropy, and they all share fundamental geometric properties. In addition, these divergences are intimately connected with exponential families...

Card shuffling is an interesting topic to explore because of its complexity. Initially, card shuffling seems simple because it is ubitquitous. The majority of people know how to shuffle a deck of cards but few consider the math behind it. However, when it comes to analyzing the elements of card shuffling, it incorporates linear algebra, group theory, probability theory, and Markov Chains. When ...

This paper briefly reviews the conventional method of obtaining the canonical form of an antisymmetric (skewsymmetric, alternating) matrix. Conventionally a vector space over the complex field has to be introduced. After a short introduction to the universal mathematical “language” Geometric Calculus, its fundamentals, i.e. its “grammar” Geometric Algebra (Clifford Algebra) is explained. This l...

A Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. The aim of this paper is to compute the automorphism group of the Euclide...

In this paper, we propose a unified framework to address the problem of cytological computeraided diagnosis. Such an approach relies on our previously introduced formalisms: general formulation of discrete functional regularization, PDEs based morphology and geometric diffusion on graphs. The approach is illustrated through two applications in cytopathology, with examples of nucleus extraction ...

This tutorial provides an exposition of a flexible geometric framework for high dimensional estimation problems with constraints. The tutorial develops geometric intuition about high dimensional sets, justifies it with some results of asymptotic convex geometry, and demonstrates connections between geometric results and estimation problems. The theory is illustrated with applications to sparse ...

A positive de…nite symmetric matrix quali…es as a quantum mechanical covariance matrix if and only if + 12 i~ 0 where is the standard symplectic matrix. This well-known condition is a strong version of the uncertainty principle, which can be reinterpreted in terms of the topological notion of symplectic capacity, closely related to Gromov’s non-squeezing theorem. We show that a recent re…nement...

Characterizations are given of the optimal scaiings of a complex square matrix within its diagonal similarity class and its restricted diagonal equivalence class with respect to the maximum element norm. The characterizations are in terms of a finite number of products, principally circuit and diagonal products. The proofs proceed by reducing the optimal scaling problems from the multiplicative...