Results 71 to 80 of about 863,069 (264)

On the Properties of r-Circulant Matrices Involving Generalized Fermat Numbers

open access: yesSakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2023
-circulant matrices have applied in numerical computation, signal processing, coding theory, etc. In this study, our main goal is to investigate the r-circulant matrices of generalized Fermat numbers which are shown by We obtain the eigenvalues ...
Engin Özkan, Engin Eser, Bahar Kuloǧlu
doaj   +1 more source

On the Approximation of Isolated Eigenvalues of Ordinary Differential Operators

open access: yes, 2007
We extend a result of Stolz and Weidmann on the approximation of isolated eigenvalues of singular Sturm-Liouville and Dirac operators by the eigenvalues of regular operators.Comment: 4 ...
Communicated Joseph A. Ball   +1 more
core   +2 more sources

A formula for the sum of $n$ weak$^\star $ closed sets in $L^\infty $

open access: yesComptes Rendus. Mathématique, 2023
In this note, we derive an equation which describes the closure of a particular set comprising $n-$valued functions. This result provides an answer to a long standing question for which the particular case $n=2$ had been known and used frequently in the ...
Zivari-Rezapour, Mohsen   +2 more
doaj   +1 more source

H$^+$-Eigenvalues of Laplacian and Signless Laplacian Tensors [PDF]

open access: yes, 2013
We propose a simple and natural definition for the Laplacian and the signless Laplacian tensors of a uniform hypergraph. We study their H$^+$-eigenvalues, i.e., H-eigenvalues with nonnegative H-eigenvectors, and H$^{++}$-eigenvalues, i.e., H-eigenvalues ...
L. Qi
semanticscholar   +1 more source

On regular graphs with four distinct eigenvalues

open access: yes, 2016
Let $\mathcal{G}(4,2)$ be the set of connected regular graphs with four distinct eigenvalues in which exactly two eigenvalues are simple, $\mathcal{G}(4,2,-1)$ (resp. $\mathcal{G}(4,2,0)$) the set of graphs belonging to $\mathcal{G}(4,2)$ with $-1$ (resp.
Huang, Qiongxiang, Huang, Xueyi
core   +1 more source

Shape optimization for an elliptic operator with infinitely many positive and negative eigenvalues

open access: yesAdvances in Nonlinear Analysis, 2018
This paper deals with an eigenvalue problem possessing infinitely many positive and negative eigenvalues. Inequalities for the smallest positive and the largest negative eigenvalues, which have the same properties as the fundamental frequency, are ...
Bandle Catherine, Wagner Alfred
doaj   +1 more source

General results on the eigenvalues of operators with gaps, arising from both ends of the gaps. Application to Dirac operators

open access: yes, 2005
This paper is concerned with {an extension and reinterpretation} of previous results on the variational characterization of eigenvalues in gaps of the essential spectrum of self-adjoint operators.
Dolbeault, Jean   +2 more
core   +2 more sources

OPTIMAL BUSINESS DECISION SYSTEM FOR MULTINATIONALS: A MULTIFACTOR ANALYSIS OF SELECTED MANUFACTURING FIRMS [PDF]

open access: yesSerbian Journal of Management, 2011
Traditional MIS has been made more effective through the integration of organization, human andtechnology factors into a decision matrix. The study is motivated by the need to find an optimal mixof interactive factors that will optimize the result of ...
Oforegbunam Thaddeus Ebiringa
doaj  

Double, borderline, and extraordinary eigenvalues of Kac-Murdock-Szeg\"o matrices with a complex parameter

open access: yes, 2019
For all sufficiently large complex $\rho$, and for arbitrary matrix dimension $n$, it is shown that the Kac--Murdock--Szeg\H{o} matrix $K_n(\rho)=\left[\rho^{|j-k|}\right]_{j,k=1}^{n}$ possesses exactly two eigenvalues whose magnitude is larger than $n$.
Fikioris, George   +1 more
core   +1 more source

Factor analysis of correlation matrices when the number of random variables exceeds the sample size

open access: yesStatistical Theory and Related Fields, 2017
Factor analysis which studies correlation matrices is an effective means of data reduction whose inference on the correlation matrix typically requires the number of random variables, p, to be relatively small and the sample size, n, to be approaching ...
Miguel Marino, Yi Li
doaj   +1 more source

Home - About - Disclaimer - Privacy