Designing local orthogonal bases on finite groups II: Nonabelian 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 considered the abelian groups of unitary transformations, while here we deal with nonabelian groups. As an example, we show how to build such bases where the group of unitary transformations consists of modulation and rotations. Such bases are useful for building systems for evaluation image quality.     

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.     

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 characterization of minimal left or right ideals of matrix algebras

The algebra of m×m matrices over real numbers, complex numbers or quaternions is equipped with the standard inner product Re tr(xy ^*) Work done in part during the Summer Research Institute of the Canadian Mathematical Congress, 1971.). It is easy to see that the left ideals of this algebra have the property that the projections of unitary matrices on them have constant length. of course, the right ideals have the same property. This property and a condition on dimension give a characterization of minimal left or right ideals of this algebra. We use this characterization to determine all orthogonal transformations of this algebra which preserve unitary matrices.     

The up-down formula for nil-homogeneous spaces

One considers a multiflow on a nil-homogeneous space—that is, the action of a vector group A on a quotient N/H, where N is a simply connected nilpotent Lie group and H is a closed connected subgroup. If A is also a subgroup of N, then the corresponding unitary action of A on L²(N/H) is anup-down representation—a succession of induced and restricted representations. An explicit orbital formula for the direct integral decomposition of this unitary representation is obtained. An unexpectedly simple sufficient condition for finite multiplicity is derived as a consequence. Similarities to ergodic actions are indicated.Supported by NSF # DMS-90-02642.     

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.     

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.     

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.     

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.     

Scattering theory for almost unitary operators,and a functional model

On the basis of a functional model one considers the scattering for operators that are close to unitary. In particular cases the presented scheme contains a series of results of L. de Branges and L. Shulman, S. N. Naboko, L. A. Sakhnovich, and H. Neidhardt. The fundamental new result is: the existence of complete local wave operators for a unitary operator and its nuclear perturbation, where the spectrum of the latter does not fill out the unit circle. In this same situation an invariance principle is obtained.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Institute im. V. A. Steklova Akademii Nauk SSSR, Vol. 178, pp. 92–119, 1989.     

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.     

对称算子自共轭扩张的酉参数化描述(英文)

利用构造性的方法,给出了边值空间理论中几个结果新的证明,其中,边值空间理论是有关对称算子自共轭扩张的一种方法.同时,得到了几个新的结果.如发现了一般的边界三元组所具有的结构.进一步地,利用这个结果证明了辅助Hilbert空间H上的酉变换与亏空间K-和K+之间的等距同构映射间存在一个双解析的映射.发现并证明了一般边界条件:B(ψ):=MΓ1ψ+NΓ2ψ=0(其中M,N是阶数为亏指数的方阵)是自共轭的充要条件以及相应的酉变换和边界映射.     

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.     

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.     

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.     

On tridiagonal matrices unitarily equivalent to normal matrices

In this article the unitary equivalence transformation of normal matrices to tridiagonal form is studied.It is well-known that any matrix is unitarily equivalent to a tridiagonal matrix. In case of a normal matrix the resulting tridiagonal inherits a strong relation between its super- and subdiagonal elements. The corresponding elements of the super- and subdiagonal will have the same absolute value.In this article some basic facts about a unitary equivalence transformation of an arbitrary matrix to tridiagonal form are firstly studied. Both an iterative reduction based on Krylov sequences as a direct tridiagonalization procedure via Householder transformations are reconsidered. This equivalence transformation is then applied to the normal case and equality of the absolute value between the super- and subdiagonals is proved. Self-adjointness of the resulting tridiagonal matrix with regard to a specific scalar product is proved. Properties when applying the reduction on symmetric, skew-symmetric, Hermitian, skew-Hermitian and unitary matrices and their relations with, e.g., complex symmetric and pseudo-symmetric matrices are presented.It is shown that the reduction can then be used to compute the singular value decomposition of normal matrices making use of the Takagi factorization. Finally some extra properties of the reduction as well as an efficient method for computing a unitary complex symmetric decomposition of a normal matrix are given.     

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.     

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.