Many applications give rise to structured, in particular T-palindromic, matrix polynomials. In order to solve a polynomial eigenvalue problem P (λ)x = 0, where P (λ) is a T-palindromic matrix polynomial, it is convenient to use palindromic linearizations to ensure that the symmetries in the eigenvalues, elementary divisors, and minimal indices of P (λ) due to the palindromicity are preserved. I...

Many applications give rise to structured, in particular T-palindromic, matrix polynomials. In order to solve a polynomial eigenvalue problem P (λ)x = 0, where P (λ) is a T-palindromic matrix polynomial, it is convenient to use palindromic linearizations to ensure that the symmetries in the eigenvalues, elementary divisors, and minimal indices of P (λ) due to the palindromicity are preserved. I...

In this paper, the exact formulae for the generalized degree distance, degree distance and reciprocal degree distance of strong product of a connected and the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr&minus1 are obtained. Using the results obtained here, the formulae for the degree distance and reciprocal degree distance of the closed and open fence graphs are co...

The purpose of this study was to investigate how reciprocal teaching and self-regulation affected reading comprehension of EFL learners at the high school level. 60 participants were selected and randomly assigned into two groups: an experimental group and a control group. The experimental group was taught through reciprocal teaching while the control group was taught through skill-based teachi...

We derive a result on the boundedness of the multiplicity of the singular values for Hankel operator, whose symbol is of the form F (z) := ∫ dλ(t ) z − t +R(z), where λ is a complex measure with infinitely many points in its support which is contained in the interval (−1,1), and whose argument has bounded variation there, while R is a rational function with all its poles inside of the unit disk...

A detailed structured backward error analysis for four kinds of Palindromic Polynomial Eigenvalue Problems (PPEP) ( d ∑ l=0 Alλ l ) x = 0, Ad−l = εA ⋆ l for l = 0, 1, . . . , ⌊d/2⌋, where ⋆ is one of the two actions: transpose and conjugate transpose, and ε ∈ {±1}. Each of them has its application background with the case ⋆ taking transpose and ε = 1 attracting a great deal of attention lately ...

Many applications give rise to structured, in particular T-palindromic, matrix polynomials. In order to solve a polynomial eigenvalue problem P (λ)x = 0, where P (λ) is a T-palindromic matrix polynomial, it is convenient to use palindromic linearizations to ensure that the symmetries in the eigenvalues, elementary divisors, and minimal indices of P (λ) due to the palindromicity are preserved. I...

The interest in self-reciprocal polynomials in coding theory originated with Massey (1963, 1964), who has shown tha t whenever a self-reciprocal polynomial is used as a convolutional code-generating polynomial, the resulting code may be decoded backward us well as forward, with the same hardware and the same probabil i ty of decoding error. Let G( D ) = go 4glD 4g~D ~ 4" . . 4g , D ' , where n ...