Results 21 to 30 of about 171 (65)

THE HYPERBOLIC QUADRATIC EIGENVALUE PROBLEM

open access: yesForum of Mathematics, Sigma, 2015
The hyperbolic quadratic eigenvalue problem (HQEP) was shown to admit Courant–Fischer type min–max principles in 1955 by Duffin and Cauchy type interlacing inequalities in 2010 by Veselić.
XIN LIANG, REN-CANG LI
doaj   +1 more source

A note on certain ergodicity coeflcients

open access: yesSpecial Matrices, 2015
We investigate two ergodicity coefficients ɸ ∥∥ and τn−1, originally introduced to bound the subdominant eigenvalues of nonnegative matrices. The former has been generalized to complex matrices in recent years and several properties for such generalized ...
Tudisco Francesco
doaj   +1 more source

Variational Formulation for Guided and Leaky Modes in Multilayer Dielectric Waveguides

open access: yes, 2009
The guided and leaky modes of a planar dielectric waveguide are eigensolutions of a singular Sturm-Liouville problem. The modes are the roots of a characteristic function which can be found with several methods that have been introduced in the past ...
David O. Stowell, J. Tausch
semanticscholar   +1 more source

New inequalities on eigenvalues of the Hadamard product and the Fan product of matrices

open access: yes, 2013
In the paper, some new upper bounds for the spectral radius of the Hadamard product of nonnegative matrices, and the low bounds for the minimum eigenvalue of the Fan product of nonsingular M-matrices are given.
Qianping Guo, Houbiao Li, Ming-yan Song
semanticscholar   +1 more source

Two iterative algorithms for solving coupled matrix equations over reflexive and anti-reflexive matrices

open access: yes, 2012
An n × n real matrix P is said to be a generalized reflection matrix if PT = P and P2 = I (where PT is the transpose of P). A matrix A ∈ Rn×n is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix P if A = P A
M. Dehghan, M. Hajarian
semanticscholar   +1 more source

Bidiagonalization of (k, k + 1)-tridiagonal matrices

open access: yesSpecial Matrices, 2019
In this paper,we present the bidiagonalization of n-by-n (k, k+1)-tridiagonal matriceswhen n < 2k. Moreover,we show that the determinant of an n-by-n (k, k+1)-tridiagonal matrix is the product of the diagonal elements and the eigenvalues of the matrix ...
Takahira S., Sogabe T., Usuda T.S.
doaj   +1 more source

EXPLICIT MINIMUM POLYNOMIAL, EIGENVECTOR, AND INVERSE FORMULA FOR NONSYMMETRIC ARROWHEAD MATRIX

open access: yes, 2016
In this paper, we treat the eigenvalue problem for a nonsymmetric arrowhead matrix which is the general form of a symmetric arrowhead matrix. The purpose of this paper is to present explicit formula of determinant, inverse, minimum polynomial, and ...
W. Wanicharpichat
semanticscholar   +1 more source

Eigenpairs of adjacency matrices of balanced signed graphs

open access: yesSpecial Matrices
In this article, we study eigenvalues λ\lambda and their associated eigenvectors xx of the adjacency matrices AA of balanced signed graphs. Balanced signed graphs were first introduced and studied by Harary to handle a problem in social psychology ...
Chen Mei-Qin
doaj   +1 more source

SOME SMALL DEVIATION THEOREMS FOR ARBITRARY RANDOM FIELDS WITH RESPECT TO BINOMIAL DISTRIBUTIONS INDEXED BY AN INFINITE TREE ON GENERALIZED RANDOM SELECTION SYSTEMS

open access: yes, 2015
In this paper, we establish a class of strong limit theorems, represented by inequalities, for the arbitrary random field with respect to the product binomial distributions indexed by the infinite tree on the generalized random selection system by ...
Fang Li, Kang-Kang Wang
semanticscholar   +1 more source

Geršhgorin-type theorems for Z1-eigenvalues of tensors with applications

open access: yesDemonstratio Mathematica
In this article, we present several Geršhgorin-type theorems for Z1{Z}_{1}-eigenvalues of tensors, which improve the results provided by Wang et al. (Some upper bounds on Zt{Z}_{t}-eigenvalues of tensors, Appl. Math. Comput.
Shen Xiaowei   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy