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...

The paper proposes a very straightforward change of the general layout of the geometric approach to the feedforward and feedback model following problems for nonminimum-phase systems. The design technique relies on the replacement of the output matrix of the controlled system with an equally dimensioned matrix ensuring H2-optimality in the standard disturbance decoupling problem, while maintain...

The Barzilai-Borwein method, an effective gradient descent method with cleaver choice of the step-length, is adapted from nonlinear optimization to Riemannian manifold optimization. More generally, global convergence of a nonmonotone line-search strategy for Riemannian optimization algorithms is proved under some standard assumptions. By a set of numerical tests, the Riemannian Barzilai-Borwein...

In this paper we present the tool spn2mgm that can be used to construct and solve stochastic Petri nets using matrix-geometric techniques. The tool automatically recognizes the \matrix-geometric structure" of the Markov chain underlying the stochastic Petri net, and solves the Markov chain with these well-known and ef-cient techniques. We informally characterize the class of stochastic Petri ne...

Membranes holomorphically embedded in flat noncompact space are constructed in terms of the degrees of freedom of an infinite collection of 0-branes. To each holomorphic curve we associate infinite-dimensional matrices which are static solutions to the matrix theory equations of motion, and which can be interpreted as the matrix theory representation of the holomorphically embedded membrane. Th...