Metrics Spaces for the Matrix Groups

Author(s):  
Ulf Grenander ◽  
Michael I. Miller

In this chapter the metric space structure of shape is developed. We do this by first studying the action of the matrix groups on the coordinate systems of shape. We begin by reviewing the well-known properties of the finite-dimensional matrix groups, including their properties as smooth Riemannian manifolds, allowing us to develop metric distances between the groupelements. We explore the construction of the metric structure of these diffeomorphisms and develop many of the properties which hold for the finite dimensional matrix groups and subsequently in the infinite dimensional setting as well.

Author(s):  
Ulf Grenander ◽  
Michael I. Miller

In this chapter the metric space structure of shape is developed by studying the action of the infinite dimensional diffeomorphisms on the coordinate systems of shape. Riemannian manifolds allow us to developmetric distances between the groupelements. We examine the natural analog of the finite dimensional matrix groups corresponding to the infinite dimensional diffeomorphisms which are generated as flows of ordinary differential equations.We explore the construction of the metric structure of these diffeomorphisms and develop many of the properties which hold for the finite dimensional matrix groups in this infinite dimensional setting.


2014 ◽  
Vol 10 (S306) ◽  
pp. 9-12
Author(s):  
Ewan Cameron

AbstractIn astronomical and cosmological studies one often wishes to infer some properties of an infinite-dimensional field indexed within a finite-dimensional metric space given only a finite collection of noisy observational data. Bayesian inference offers an increasingly-popular strategy to overcome the inherent ill-posedness of this signal reconstruction challenge. However, there remains a great deal of confusion within the astronomical community regarding the appropriate mathematical devices for framing such analyses and the diversity of available computational procedures for recovering posterior functionals. In this brief research note I will attempt to clarify both these issues from an “applied statistics” perpective, with insights garnered from my post-astronomy experiences as a computational Bayesian / epidemiological geostatistician.


Author(s):  
S.A. Ayupov ◽  
F.N. Arzikulov

The present paper is devoted to 2-local derivations. In 1997, P. Semrl introduced the notion of 2-local derivations and described 2-local derivations on the algebra B(H) of all bounded linear operators on the infinite-dimensional separable Hilbert space H. After this, a number of paper were devoted to 2-local maps on different types of rings, algebras, Banach algebras and Banach spaces. A similar description for the finite-dimensional case appeared later in the paper of S. O. Kim and J. S. Kim. Y. Lin and T. Wong described 2-local derivations on matrix algebras over a finite-dimensional division ring. Sh. A. Ayupov and K. K. Kudaybergenov suggested a new technique and have generalized the above mentioned results for arbitrary Hilbert spaces. Namely they considered 2-local derivations on the algebra B(H) of all linear bounded operators on an arbitrary Hilbert space H and proved that every 2-local derivation on B(H) is a derivation. Then there appeared several papers dealing with 2-local derivations on associative algebras. In the present paper 2-lo\-cal derivations on various algebras of infinite dimensional matrix-valued functions on a compactum are described. We develop an algebraic approach to investigation of derivations and \mbox{2-local} derivations on algebras of infinite dimensional matrix-valued functions on a compactum and prove that every such 2-local derivation is a derivation. As the main result of the paper it is established that every \mbox{2-local} derivation on a ∗-algebra C(Q,Mn(F)) or C(Q,Nn(F)), where Q is a compactum, Mn(F) is the ∗-algebra of infinite dimensional matrices over complex numbers (real numbers or quaternoins) defined in section 1, Nn(F) is the ∗-subalgebra of Mn(F) defined in section 2, is a derivation. Also we explain that the method developed in the paper can be applied to Jordan and Lie algebras of infinite dimensional matrix-valued functions on a compactum.


1990 ◽  
Vol 33 (1) ◽  
pp. 97-111 ◽  
Author(s):  
B. A. F. Wehrfritz

Let n be a positive integer and D a division algebra of finite dimension m over its centre. We describe in detail the structure of a soluble subgroup G of GL(n,D). (More generally we consider subgroups of GL{n,D) with no free subgroup of rank 2.) Of course G is isomorphic to a linear group of degree mn and hence linear theory describes G, but the object here is to reduce as far as possible the dependence of the description on m. The results are particularly sharp if n=l. They will be used in later papers to study matrix groups over certain types of infinite-dimensional division algebra. This present paper was very much inspired by A. I. Lichtman's work: Free subgroups in linear groups over some skew fields, J. Algebra105 (1987), 1–28.


2010 ◽  
Vol 16 (7-8) ◽  
pp. 1151-1168 ◽  
Author(s):  
Xinhua Long ◽  
B. Balachandran

In this article, a stability treatment is presented for up-milling and down-milling processes with a variable spindle speed (VSS). This speed variation is introduced by superimposing a sinusoidal modulation on a nominal spindle speed. The VSS milling dynamics is described by a set of delay differential equations with time varying periodic coefficients and a time delay. A semi-discretization scheme is used to discretize the system over one period, and the infinite-dimensional transition matrix is reduced to a finite-dimensional matrix over this period. The eigenvalues of this finite-dimensional matrix provide information on VSS milling stability with respect to control parameters, such as the axial depth of cut and the nominal spindle speed. The stability charts obtained for VSS milling operations are compared with those obtained for constant spindle speed milling operations, and the benefits of VSS milling operations are discussed.


Author(s):  
X.-H. Long ◽  
B. Balachandran

In this effort, a stability treatment is presented for a milling process with a variable spindle speed (VSS). This variation is caused by superimposing a sinusoidal modulation on a nominal spindle speed. The dynamics of the VSS milling process is described by a set of delay differential equations (DDEs) with time varying periodic coefficients and a time delay. A semi-discretization scheme is used to discretize the system over one period, and the infinite dimensional transition matrix is converted to a finite dimensional matrix over this period. The eigenvalues of this finite dimensional matrix are used to determine the stability of the VSS milling operation with respect to selected control parameters, such as the axis depth of cut and the nominal spindle speed. The benefits of VSS milling operations are discussed by comparing the stability charts obtained for VSS milling operations with those obtained for constant spindle speed (CSS) milling operations.


2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Ahmed Morsy ◽  
Nashat Faried ◽  
Samy A. Harisa ◽  
Kottakkaran Sooppy Nisar

AbstractIn this work, we establish an approach to constructing compact operators between arbitrary infinite-dimensional Banach spaces without a Schauder basis. For this purpose, we use a countable number of basic sequences for the sake of verifying the result of Morrell and Retherford. We also use a nuclear operator, represented as an infinite-dimensional matrix defined over the space $\ell _{1}$ℓ1 of all absolutely summable sequences. Examples of nuclear operators over the space $\ell _{1}$ℓ1 are given and used to construct operators over general Banach spaces with specific approximation numbers.


Stats ◽  
2021 ◽  
Vol 4 (1) ◽  
pp. 184-204
Author(s):  
Carlos Barrera-Causil ◽  
Juan Carlos Correa ◽  
Andrew Zamecnik ◽  
Francisco Torres-Avilés ◽  
Fernando Marmolejo-Ramos

Expert knowledge elicitation (EKE) aims at obtaining individual representations of experts’ beliefs and render them in the form of probability distributions or functions. In many cases the elicited distributions differ and the challenge in Bayesian inference is then to find ways to reconcile discrepant elicited prior distributions. This paper proposes the parallel analysis of clusters of prior distributions through a hierarchical method for clustering distributions and that can be readily extended to functional data. The proposed method consists of (i) transforming the infinite-dimensional problem into a finite-dimensional one, (ii) using the Hellinger distance to compute the distances between curves and thus (iii) obtaining a hierarchical clustering structure. In a simulation study the proposed method was compared to k-means and agglomerative nesting algorithms and the results showed that the proposed method outperformed those algorithms. Finally, the proposed method is illustrated through an EKE experiment and other functional data sets.


1985 ◽  
Vol 31 (3) ◽  
pp. 445-450 ◽  
Author(s):  
Charles Swartz

Shimizu, Aiyoshi and Katayama have recently given a finite dimensional generalization of the classical Farkas Lemma. In this note we show that a result of Pshenichnyi on convex programming can be used to give a generalization of the result of Shimizu, Aiyoshi and Katayama to infinite dimensional spaces. A generalized Farkas Lemma of Glover is also obtained.


2005 ◽  
Vol 02 (03) ◽  
pp. 251-258
Author(s):  
HANLIN HE ◽  
QIAN WANG ◽  
XIAOXIN LIAO

The dual formulation of the maximal-minimal problem for an objective function of the error response to a fixed input in the continuous-time systems is given by a result of Fenchel dual. This formulation probably changes the original problem in the infinite dimensional space into the maximal problem with some restrained conditions in the finite dimensional space, which can be researched by finite dimensional space theory. When the objective function is given by the norm of the error response, the maximum of the error response or minimum of the error response, the dual formulation for the problems of L1-optimal control, the minimum of maximal error response, and the minimal overshoot etc. can be obtained, which gives a method for studying these problems.


Sign in / Sign up

Export Citation Format

Share Document