Strong linear preservers of rank reverse permutability on triangular matrices

Let F be a field with ∣F∣ > 2 and T_n(F) be the set of all n × n upper triangular matrices, where n ? 2. Let k ? 2 be a given integer. A k-tuple of matrices A₁, …, A_k ∈ T_n(F) is called rank reverse permutable if rank(A₁ A₂ ? A_k) = rank(A_k A_k−1 ? A₁). We characterize the linear maps on T_n(F) that strongly preserve the set of rank reverse permutable matrix k-tuples.     

On linear preservers of normal maps

We study group induced cone (GIC) orderings generating normal maps. Examples of normal maps cover, among others, the eigenvalue map on the space of n × n Hermitian matrices as well as the singular value map on n × n complex matrices. In this paper, given two linear spaces equipped with GIC orderings induced by groups of orthogonal operators, we investigate linear operators preserving normal maps of the orderings. A characterization of the preservers is obtained in terms of the groups. The result is applied to show that the normal structure of the spaces is preserved under the action of the operators. In addition, examples are given.     

Jordan isomorphisms of upper triangular matrix rings

Let R be a 2-torsionfree ring with identity 1 and let T_n(R), n ? 2, be the ring of all upper triangular n × n matrices over R. We describe additive Jordan isomorphisms of T_n(R) onto an arbitrary ring and generalize several results on this line.     

On the spectral radius of trees with fixed diameter

Let T_{(n, d)} be the set of trees on n vertices with diameter d. In this paper, the first spectral radii of trees in the set T_{(n, d)} (3 ? d ? n − 4) are characterized.     

Dirac-bracket structure in multidimensional mode conversion

The intersection of two (2n − 1)-dimensional dispersion manifolds D_a and D_b in the 2n-dimensional ray phase space P yields a (2n − 2)-dimensional conversion manifold M≡D_a∩D_b that naturally possesses a Dirac-bracket structure that is inherited from the canonical Poisson bracket on ray phase space. The canonical symplectic two-form Ω ≡ Ω_∥ + Ω_⊥, defined on the 2n-dimensional tangent plane T_z0P≡T_z0M⊕(T_z0M)_⊥, can thus be decomposed into the Dirac two-form Ω_∥ on the (2n − 2)-dimensional tangent plane T_z0M at a conversion point z₀∈M, and the symplectic two-form Ω_⊥ on its orthogonal 2-dimensional complement (T_z0M)_⊥. These two symplectic two-forms are introduced in our analysis of multidimensional mode conversion, where their respective geometrical roles are defined. We note that since the Dirac-bracket structure Ω_∥ vanishes identically when n = 1, it represents a new structure in multidimensional (n > 1) mode conversion theory.     

On single and double Soules matrices

Until now the concept of a Soules basis matrix of sign patternN consisted of an orthogonal matrix R∈R^n,n, generated in a certain way from a positive n-vector, which has the property that for any diagonal matrix Λ = diag(λ₁, … , λ_n), with λ₁ ? ? ? λ_n ? 0, the symmetric matrix A = RΛR^T has nonnegative entries only. In the present paper we introduce the notion of a pair of double Soules basis matrices of sign patternN which is a pair of matrices (P, Q), each in R^n,n, which are not necessarily orthogonal and which are generated in a certain way from two positive vectors, but such that PQ^T = I and such that for any of the aforementioned diagonal matrices Λ, the matrix A = PΛQ^T (also) has nonnegative entries only. We investigate the interesting properties which such matrices A have.As a preamble to the above investigation we show that the iterates, , generated in the course of the QR-algorithm when it is applied to A = RΛR^T, where R is a Soules basis matrix of sign pattern N, are again symmetric matrices generated by the Soules basis matrices R_k of sign pattern N which are themselves modified as the algorithm progresses.Our work here extends earlier works by Soules and Elsner et al.     

Transition matrices for well-conditioned Markov chains

Let T∈R^n×n be an irreducible stochastic matrix with stationary distribution vector π. Set A = I − T, and define the quantity , where A_j, j = 1, … , n, are the (n − 1) × (n − 1) principal submatrices of A obtained by deleting the jth row and column of A. Results of Cho and Meyer, and of Kirkland show that κ₃ provides a sensitive measure of the conditioning of π under perturbation of T. Moreover, it is known that .In this paper, we investigate the class of irreducible stochastic matrices T of order n such that , for such matrices correspond to Markov chains with desirable conditioning properties. We identify some restrictions on the zero-nonzero patterns of such matrices, and construct several infinite classes of matrices for which κ₃ is as small as possible.     

Efficient Chebyshev spectral methods for solving multi-term fractional orders differential equations

In this paper, we state and prove a new formula expressing explicitly the derivatives of shifted Chebyshev polynomials of any degree and for any fractional-order in terms of shifted Chebyshev polynomials themselves. We develop also a direct solution technique for solving the linear multi-order fractional differential equations (FDEs) with constant coefficients using a spectral tau method. The spatial approximation with its fractional-order derivatives (described in the Caputo sense) are based on shifted Chebyshev polynomials T_L,n(x) with x ∈ (0, L), L > 0 and n is the polynomial degree. We presented a shifted Chebyshev collocation method with shifted Chebyshev–Gauss points used as collocation nodes for solving nonlinear multi-order fractional initial value problems. Several numerical examples are considered aiming to demonstrate the validity and applicability of the proposed techniques and to compare with the existing results.     

Preemptive scheduling of two uniform parallel machines to minimize total tardiness

We consider the problem of preemptive scheduling n jobs on two uniform parallel machines. All jobs have equal processing requirements. For each job we are given its due date. The objective is to find a schedule minimizing total tardiness ∑T_i. We suggest an O(n log n) algorithm to solve this problem.