A note on the sequence of consecutive powers of a nonnegative matrix in max algebra

In this note, we shall consider the sequence of consecutive powers in max algebra of a nonnegative matrix with each element less than or equal to 1. The notion of asymptotic period is defined to study the ‘limiting behavior' of this sequence. A simple and effective characterization for the asymptotic period of the sequence is given.     

On the eigenvalues of double band matrices

We consider matrices containing two diagonal bands of positive entries. We show that all eigenvalues of such matrices are of the form rζ, where r is a nonnegative real number and ζ is a pth root of unity, where p is the period of the matrix, which is computed from the distance between the bands. We also present a problem in the asymptotics of spectra in which such double band matrices are perturbed by banded matrices.     

A note on a Carlson-type inequality for the Sugeno integral

In this short note, we present a general version of Carlson’s inequality for the Sugeno integral, which generalizes some recent results obtained by others.     

A note on k-generalized projections

In this note, we investigate characterizations for k-generalized projections (i.e., A^k = A^*) on Hilbert spaces. The obtained results generalize those for generalized projections on Hilbert spaces in [Hong-Ke Du, Yuan Li, The spectral characterization of generalized projections, Linear Algebra Appl. 400 (2005) 313–318] and those for matrices in [J. Benítez, N. Thome, Characterizations and linear combinations of k-generalized projectors, Linear Algebra Appl. 410 (2005) 150–159].     

A mixed random walk on nonnegative matrices: A law of large numbers

In this paper a mixed random walk on nonnegative matrices has been studied. Under reasonable conditions, existence of a unique invariant probability measure and a law of large numbers have been established for such walks.     

A note on the Chebyshev-type inequality of Sugeno integrals

This paper improves on previous work presenting a Chebyshev-type inequality for Sugeno integrals. It derives a new inequality applicable to the Sugeno integrals and of real functions f,g on [0, 1]. Examples are given to illustrate the results.     

A note on biorthogonal ensembles

We study multiple orthogonal polynomials in the context of biorthogonal ensembles of random matrices. In these ensembles, the eigenvalue probability density function factorizes into a product of two determinants while the eigenvalue correlation functions can be written as a determinant of a kernel function. We show that the kernel is itself an average of a single ratio of characteristic polynomials. In the same vein, we prove that the type I multiple polynomials can be expressed as an average of the inverse of a characteristic polynomial. We finally introduce a new biorthogonal matrix ensemble, namely the chiral unitary perturbed by a source term, whose multiple polynomials are related to the modified Bessel function of the first kind.     

A note on the strength and minimum color sum of bipartite graphs

The strength of a graph G is the smallest integer s such that there exists a minimum sum coloring of G using integers {1,…,s}, only. For bipartite graphs of maximum degree Δ we show the following simple bound: s≤⌈Δ/2⌉+1. As a consequence, there exists a quadratic time algorithm for determining the strength and minimum color sum of bipartite graphs of maximum degree Δ≤4.     

A short note on weighted mean matrices

In the present paper we have established a relation between (N, p _n ) and (N, q _n ) weighted mean matrices, when considered as bounded operators on 1^p, 1 < p < ∞.     

A note on the domination dot-critical graphs

A graph G is dot-critical if contracting any edge decreases the domination number. Nader Jafari Rad (2009) [3] posed the problem: Is it true that a connected k-dot-critical graph G with G^′=0? is 2-connected? In this note, we give a family of 1-connected 2k-dot-critical graph with G^′=0? and show that this problem has a negative answer.     

A note on flux limiting for diffusion discretizations

In this note, a limiting technique is presented to enforcemonotonicity for higher-order spatial diffusion discretizations.The aim is to avoid spurious oscillations and to improve thequalitative behaviour on coarse grids. The technique is relatedto known ones for convection equations, using limiters to boundthe numerical fluxes. Applications arise in pattern formationproblems for reaction–diffusion equations.     

Spectra of principal submatrices of nonnegative matrices

Let A be an n×n nonnegative matrix with the spectrum (λ₁,λ₂,…,λ_n) and let A₁ be an m×m principal submatrix of A with the spectrum (μ₁,μ₂,…,μ_m). In this paper we present some cases where the realizability of (μ₁,μ₂,…,μ_m,ν₁,ν₂,…,ν_s) implies the realizability of (λ₁,λ₂,…,λ_n,ν₁,ν₂,…,ν_s) and consider the question whether this holds in general. In particular, we show that the list

(λ₁,λ₂,…,λ_n,-μ₁,-μ₂,…,-μ_m)     

On vector and matrix median computation

The aim of this paper is to gain more insight into vector and matrix medians and to investigate algorithms to compute them. We prove relations between vector and matrix means and medians, particularly regarding the classical structure tensor. Moreover, we examine matrix medians corresponding to different unitarily invariant matrix norms for the case of symmetric 2×2 matrices, which frequently arise in image processing. Our findings are explained and illustrated by numerical examples. To solve the corresponding minimization problems, we propose several algorithms. Existing approaches include Weiszfeld’s algorithm for the computation of ?₂ vector medians and semi-definite programming, in particular, second order cone programming, which has been used for matrix median computation. In this paper, we adapt Weiszfeld’s algorithm for our setting and show that also two splitting methods, namely the alternating direction method of multipliers and the parallel proximal algorithm, can be applied for generalized vector and matrix median computations. Besides, we compare the performance of these algorithms numerically and apply them within local median filters.     

A note on “The integrable KdV6 equation: Multiple soliton solutions and multiple singular soliton solutions”

The goal of this short note is to provide another kind soliton solutions with Hirota form, which is different from what Wazwaz obtained in [A.M. Wazwaz, The integrable KdV6 equations: Multiple soliton solutions and multiple singular soliton solutions, Appl. Math. Comput. 204 (2008) 963-972]. Meanwhile we newly construct the MKdV6 equation and derive a Miura transformation between KdV6 equation and MKdV6 equation.     

A note on an unusual type of polar decomposition

Motivated by applications in the theory of unitary congruence, we introduce the factorization of a square complex matrix A of the form A=SU, where S is complex symmetric and U is unitary. We call this factorization a symmetric–unitary polar decomposition or an SUPD. It is shown that an SUPD exists for every matrix A and is always nonunique. Even the symmetric factor S can be chosen in infinitely many ways. Nevertheless, we show that many properties of the conventional polar decomposition related to normal matrices have their counterparts for the SUPD, provided that normal matrices are replaced with conjugate–normal ones.     

A small note on the scaling of symmetric positive definite semiseparable matrices

In this paper we will adapt a known method for diagonal scaling of symmetric positive definite tridiagonal matrices towards the semiseparable case. Based on the fact that a symmetric, positive definite tridiagonal matrix satisfies property A, one can easily construct a diagonal matrix such that has the lowest condition number over all matrices , for any choice of diagonal matrix . Knowing that semiseparable matrices are the inverses of tridiagonal matrices, one can derive similar properties for semiseparable matrices. Here, we will construct the optimal diagonal scaling of a semiseparable matrix, based on a new inversion formula for semiseparable matrices. Some numerical experiments are performed. In a first experiment we compare the condition numbers of the semiseparable matrices before and after the scaling. In a second numerical experiment we compare the scalability of matrices coming from the reduction to semiseparable form and matrices coming from the reduction to tridiagonal form. *The research was partially supported by the Research Council K.U. Leuven, project OT/00/16 (SLAP: Structured Linear Algebra Package), by the Fund for Scientific Research–Flanders (Belgium), projects G.0078.01 (SMA: Structured Matrices and their Applications), G.0176.02 (ANCILA: Asymptotic aNalysis of the Convergence behavior of Iterative methods in numerical Linear Algebra), G.0184.02 (CORFU: Constructive study of Orthogonal Functions) and G.0455.0 (RHPH: Riemann–Hilbert problems, random matrices and Padé–Hermite approximation), and by the Belgian Programme on Interuniversity Poles of Attraction, initiated by the Belgian State, Prime Minister's Office for Science, Technology and Culture, project IUAP V-22 (Dynamical Systems and Control: Computation, Identification & Modelling). The scientific responsibility rests with the authors. The second author participates in the SCCM program, Gates 2B, Stanford University, CA, USA and is also partially supported by the NSF. The first author visited the second one with a grant by the Fund for Scientific Research–Flanders (Belgium).     

A note on total colourings of digraphs

In the paper two different arc-colourings and two associated with the total colourings of digraphs are considered. In one of these colourings we show that the problem of calculating the total chromatic index reduces to that of calculating the chromatic number of the underlying graph. In the other colouring we find the total chromatic indices of complete symmetric digraphs and tournaments.