Designing local orthogonal bases on finite groups I: Abelian case

We extend to general finite groups a well-known relation used for checking the orthogonality of a system of vectors as well as for orthogonalizing a nonorthogonal one. This, in turn, is used for designing local orthogonal bases obtained by unitary transformations of a single prototype filter. The first part of this work considers abelian groups. The second part considers nonabelian groups where, as an example, we show how to build such bases where the group of unitary transformations consists of modulations and rotations. These bases are useful for building systems for evaluating image quality.     

On ɛ-representations

For certain classes of groups we show that a map to the group of unitary transformations of a Hilbert space which is “almost” a homomorphism is uniformly close to a unitary representation.     

A new algorithm for pole assignment of single-input linear systems using state feedback

In this paper we present a new algorithm for the single-input pole assignment problem using state feedback. This algorithm is based on the Schur decomposition of the closed-loop system matrix, and the numerically stable unitary transformations are used whenever possible, and hence it is numerically reliable.The good numerical behavior of this algorithm is also illustrated by numerical examples.     

A method of congruent type for linear systems with conjugate-normal coefficient matrices

Minimal residual methods, such as MINRES and GMRES, are well-known iterative versions of direct procedures for reducing a matrix to special condensed forms. The method of reduction used in these procedures is a sequence of unitary similarity transformations, while the condensed form is a tridiagonal matrix (MINRES) or a Hessenberg matrix (GMRES). The algorithm CSYM proposed in the 1990s for solving systems with complex symmetric matrices was based on the tridiagonal reduction performed via unitary congruences rather than similarities. In this paper, we construct an extension of this algorithm to the entire class of conjugate-normal matrices. (Complex symmetric matrices are a part of this class.) Numerical results are presented. They show that, on many occasions, the proposed algorithm has a superior convergence rate compared to GMRES.     

Tight Frames and Their Symmetries

The aim of this paper is to investigate the symmetry properties of tight frames, with a view to constructing tight frames of orthogonal polynomials in several variables which share the symmetries of the weight function, and other similar applications. This is achieved by using representation theory to give methods for constructing tight frames as orbits of groups of unitary transformations acting on a given finite-dimensional Hilbert space. Along the way, we show that a tight frame is determined by its Gram matrix and discuss how the symmetries of a tight frame are related to its Gram matrix. We also give a complete classification of those tight frames which arise as orbits of an abelian group of symmetries.     

Old wine in fractal bottles I: Orthogonal expansions on self-referential spaces via fractal transformations

Our results and examples show how transformations between self-similar sets may be continuous almost everywhere with respect to measures on the sets and may be used to carry well known notions from analysis and functional analysis, for example flows and spectral analysis, from familiar settings to new ones. The focus of this paper is on a number of surprising applications including what we call fractal Fourier analysis, in which the graphs of the basis functions are Cantor sets, discontinuous at a countable dense set of points, yet have good approximation properties. In a sequel, the focus will be on Lebesgue measure-preserving flows whose wave-fronts are fractals. The key idea is to use fractal transformations to provide unitary transformations between Hilbert spaces defined on attractors of iterated function systems.     

A Schur decomposition for Hamiltonian matrices

A Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplectic similarity transformations. These transformations preserve the Hamiltonian structure and are numerically stable, making them ideal for analysis and computation. Using this decomposition and a special singular-value decomposition for unitary symplectic matrices, a canonical reduction of the algebraic Riccati equation is obtained which sheds light on the sensitivity of the nonnegative definite solution. After presenting some real decompositions for real Hamiltonian matrices, we look into the possibility of an orthogonal symplectic version of the QR algorithm suitable for Hamiltonian matrices. A finite-step initial reduction to a Hessenberg-type canonical form is presented. However, no extension of the Francis implicit-shift technique was found, and reasons for the difficulty are given.     

Generalized isometries of the special unitary group

In this paper we determine the structure of all so-called generalized isometries of the special unitary group which are transformations that respect any member of a large collection of generalized distance measures.     

Classification of squared normal operators on unitary and Euclidean spaces

We give a canonical form for a complex matrix whose square is normal under transformations of unitary similarity as well as a canonical form for a real matrix whose square is normal under transformations of orthogonal similarity. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 13, No. 4, pp. 225–232, 2007.     

Multidimensional <Emphasis Type="Italic">p</Emphasis>-adic wavelets for the deformed metric

The approach to p-adic wavelet theory from the point of view of representation theory is discussed. p-Adic wavelet frames can be constructed as orbits of some p-adic groups of transformations. These groups are automorphisms of the tree of balls in the p-adic space. In the present paper we consider deformations of the standard p-adic metric in many dimensions and construct some corresponding groups of transformations. We build several examples of p-adic wavelet bases. We show that the constructed wavelets are eigenvectors of some pseudodifferential operators.     

Rational curves and isoparametric transformations

Curve approximation associated with the finite element method usually implies linear or parabolic approximating segments when the transformation of polygonal master-elements is involved. We consider the construction of transformations and of associated bases that result in general conic approximating curve segments, while still allowing us to do all the required calculations on the simpler straight-edged elements. We show that projective transformations can be used to produce conic parameterizations in a systematic way. Examples of transformations and of suitable bases are given for triangular elements with one conic and two straight edges.     

Furstenberg Transformations on Cartesian Products of Infinite-Dimensional Tori

We consider in this note Furstenberg transformations on Cartesian products of infinite-dimensional tori. Under some appropriate assumptions, we show that these transformations are uniquely ergodic with respect to the Haar measure and have countable Lebesgue spectrum in a suitable subspace. These results generalise to the infinite-dimensional setting previous results of H. Furstenberg, A. Iwanik, M. Lemanzyk, D. Rudolph and the second author in the one-dimensional setting. Our proofs rely on the use of commutator methods for unitary operators and Bruhat functions on the infinite-dimensional torus.     

Critical Landscape Topology for Optimization on the Symplectic Group

Optimization problems over compact Lie groups have been studied extensively due to their broad applications in linear programming and optimal control. This paper analyzes an optimization problem over a noncompact symplectic Lie group Sp(2N,ℝ), i.e., minimizing the Frobenius distance from a target symplectic transformation, which can be used to assess the fidelity function over dynamical transformations in classical mechanics and quantum optics. The topology of the set of critical points is proven to have a unique local minimum and a number of saddlepoint submanifolds, exhibiting the absence of local suboptima that may hinder the search for ultimate optimal solutions. Compared with those of previously studied problems on compact Lie groups, such as the orthogonal and unitary groups, the topology is more complicated due to the significant nonlinearity brought by the incompatibility of the Frobenius norm with the pseudo-Riemannian structure on the symplectic group.     

Unitary Bases and Noncommutative Wavelets

In this paper, we construct new unitary bases in noncommutative wavelets.     

On Dynamical Properties of a One-Parameter Family of Transformations Arising in Averaging of Semigroups

To describe the dynamics of quantum systems with degenerate symmetric but not self-adjoint Hamiltonian, we consider the Naimark extension of the Hamiltonian to a self-adjoint operator in an extended Hilbert space. We relate to the symmetric Hamiltonian a one-parameter family of averaged dynamical transformations of the set of quantum states obtained from a unitary group of transformations of the extended Hilbert space by using a conditional expected value to an algebra of bounded operators acting in the original space. We establish the absence of the semigroup property and injectivity of the family of averaged dynamical transformations. We obtain a representation of trajectories of the averaged family of dynamical transformations by maximum points of functionals on the space of mappings of the time interval into the set of quantum states.     

A few pedagogical designs in linear algebra with Cabri and Maple

Since the 90’s, with the creation of new electronic environments for learning and teaching, several research groups in Mathematics Education have been emerging and developing. This article elaborates few pedagogical designs in Linear Algebra supported by both the geometrical micro-world Cabri and the computer algebra system Maple. Stumbling blocks in the learning of Linear Algebra are examined, more exactly linear transformations, eigenvectors, quadratic forms, conics with changes of bases and finally singular values. Encountering a special group of students very eager to explore the world of linear algebra, we initiated a classification of linear transformations of the Euclidean plane R² via ellipses.     

Reachability of condensed forms via unitary congruence transformations

There are several well-known facts about unitary similarity transformations of complex n-by-n matrices: every matrix of order n = 3 can be brought to tridiagonal form by a unitary similarity transformation; if n ≥ 5, then there exist matrices that cannot be brought to tridiagonal form by a unitary similarity transformation; for any fixed set of positions (pattern) S whose cardinality exceeds n(n ? 1)/2, there exists an n-by-n matrix A such that none of the matrices that are unitarily similar to A can have zeros in all of the positions in S. It is shown that analogous facts are valid if unitary similarity transformations are replaced by unitary congruence ones.     

Composing dinatural transformations: Towards a calculus of substitution

Dinatural transformations, which generalise the ubiquitous natural transformations to the case where the domain and codomain functors are of mixed variance, fail to compose in general; this has been known since they were discovered by Dubuc and Street in 1970. Many ad hoc solutions to this remarkable shortcoming have been found, but a general theory of compositionality was missing until Petri?, in 2003, introduced the concept of g-dinatural transformations, that is, dinatural transformations together with an appropriate graph: he showed how acyclicity of the composite graph of two arbitrary dinatural transformations is a sufficient and essentially necessary condition for the composite transformation to be in turn dinatural. Here we propose an alternative, semantic rather than syntactic, proof of Petri?'s theorem, which the authors independently rediscovered with no knowledge of its prior existence; we then use it to define a generalised functor category, whose objects are functors of mixed variance in many variables, and whose morphisms are transformations that happen to be dinatural only in some of their variables.We also define a notion of horizontal composition for dinatural transformations, extending the well-known version for natural transformations, and prove it is associative and unitary. Horizontal composition embodies substitution of functors into transformations and vice-versa, and is intuitively reflected from the string-diagram point of view by substitution of graphs into graphs.This work represents the first, fundamental steps towards a substitution calculus for dinatural transformations as sought originally by Kelly, with the intention then to apply it to describe coherence problems abstractly. There are still fundamental difficulties that are yet to be overcome in order to achieve such a calculus, and these will be the subject of future work; however, our contribution places us well in track on the path traced by Kelly towards a calculus of substitution for dinatural transformations.     

On the equivalence of functional bases of differential invariants for nonconjugate subgroups of the local Lie groups of point transformations

We formulate and prove a criterion of the equivalence of functional bases of differential invariants of an arbitrary finite order k for nonconjugate subgroups of the local Lie groups of point transformations.     

The limitations of nice mutually unbiased bases

Mutually unbiased bases of a Hilbert space can be constructed by partitioning a unitary error basis. We consider this construction when the unitary error basis is a nice error basis. We show that the number of resulting mutually unbiased bases can be at most one plus the smallest prime power contained in the dimension, and therefore that this construction cannot improve upon previous approaches. We prove this by establishing a correspondence between nice mutually unbiased bases and abelian subgroups of the index group of a nice error basis and then bounding the number of such subgroups. This bound also has implications for the construction of certain combinatorial objects called nets.