Results 91 to 100 of about 1,914,031 (237)

Large amplitude MHD waves upstream of the Jovian bow shock [PDF]

Observations of large amplitude magnetohydrodynamics (MHD) waves upstream of Jupiter's bow shock are analyzed. The waves are found to be right circularly polarized in the solar wind frame which suggests that they are propagating in the fast magnetosonic ...
Goldstein, M. L., Matthaeus, W. H., Smith, C. W.   +2 more
core   +1 more source

Higher Order Properties of the Symmetricallr Normalized Instrumental Variable Estimator [PDF]

This paper provides the second order bias for the Symmetrically Normalized Instrumental Variable Estimator (SNIV), using Edgeworth expansions for both the estimator and the minimum eigenvalue. SNIV was proposed by Alonso-Borrego and Arellano (1999) as an
Rodrigo Alfaro
core  

An eigenvalue distribution derived ‘Stability Measure’ for evaluating Minimum Variance portfolios

, 2022
William Smyth, Daniel Broby
openalex   +1 more source

Lower bounds on the minimum eigenvalue of the Fan product of several M-matrices

Journal of Inequalities and Applications
The concept of the Fan product of several M-matrices is introduced. Furthermore, two new lower bounds of the minimum eigenvalue of the Fan product of several M-matrices are proposed.
Qin Zhong
doaj   +1 more source

Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs

, 2023
Aida Abiad, Shaun Fallat, Mark Kempton, Rupert H. Levene, Polona Oblak, Helena Šmigoc, Michael Tait, Kevin N. Vander Meulen   +7 more
openalex   +1 more source

Eigenvalue/eigenvector assignment using output feedback [PDF]

The problem of eigenvalue assignment in a linear time-invariant system using output feedback is considered. New sufficient conditions are derived to assign an almost arbitrary set of minimum (n,m + r - 1) distinct eigenvalues where n, m, and r are the ...
Srinathkumar, S.
core   +1 more source

Least eigenvalue of the connected graphs whose complements are cacti

Open Mathematics, 2019
Suppose that Γ is a graph of order n and A(Γ) = [ai,j] is its adjacency matrix such that ai,j is equal to 1 if vi is adjacent to vj and ai,j is zero otherwise, where 1 ≤ i, j ≤ n.
Wang Haiying, Javaid Muhammad, Akram Sana, Jamal Muhammad, Wang Shaohui   +4 more
doaj   +1 more source

A projection method for computing the minimum eigenvalue of a symmetric positive definite Toeplitz matrix

, 1998
Wolfgang Mackens, Heinrich Voß
openalex   +2 more sources

The minimum number of distinct eigenvalues of a threshold graph is at most 4

Linear Algebra and its Applications
In this note we show that the minimum number of distinct eigenvalues of a threshold graph is at most $4$. Moreover, given any threshold graph $G$ and any nonzero real number $λ$, we explicitly construct a matrix $M$ associated with $G$ such that DSpec$(M)\subseteq\{-λ,0,λ,2λ\}$.
L. Emilio Allem, Carlos Hoppen, João Lazzarin, Lucas Siviero Sibemberg, Fernando Colman Tura   +4 more
openaire   +2 more sources