Results 201 to 210 of about 80,905 (218)

Harnessing exceptional points for ultrahigh sensitive acoustic wave sensing. [PDF]

open access: yesMicrosyst Nanoeng
Lu X   +8 more
europepmc   +1 more source

Highly efficient general method for sensitivity analysis of eigenvectors with repeated eigenvalues without passing through adjacent eigenvectors

International Journal for Numerical Methods in Engineering, 2020
It is well known that the sensitivity analysis of the eigenvectors corresponding to multiple eigenvalues is a difficult problem. The main difficulty is that for given multiple eigenvalues, the eigenvector derivatives can be computed for a specific ...
G. Yoon   +3 more
semanticscholar   +1 more source

PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS*

, 1990
The problem ofcomputing a small vertex separator in a graph arises in the context ofcomputing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper.
K. Liou, A. Pothen
semanticscholar   +1 more source

The distribution of overlaps between eigenvectors of Ginibre matrices

Probability theory and related fields, 2018
We study the overlaps between eigenvectors of nonnormal matrices. They quantify the stability of the spectrum, and characterize the joint eigenvalues increments under Dyson-type dynamics.
P. Bourgade, Guillaume Dubach
semanticscholar   +1 more source

Disentangling good from bad practices in the selection of spatial or phylogenetic eigenvectors

, 2018
Eigenvector mapping techniques are widely used by ecologists and evolutionary biologists to describe and control for spatial and/or phylogenetic patterns in their data.
D. Bauman   +3 more
semanticscholar   +1 more source

Combining eigenvalues and variation of eigenvectors for order determination

, 2016
In applying statistical methods such as principal component analysis, canonical correlation analysis, and sufficient dimension reduction, we need to determine how many eigenvectors of a random matrix are important for estimation. This problem is known as
Wei Luo, Bing Li
semanticscholar   +1 more source

Discrete Fractional Fourier Transforms Based on Closed-Form Hermite–Gaussian-Like DFT Eigenvectors

IEEE Transactions on Signal Processing, 2017
In this paper, we construct discrete fractional Fourier transforms (DFrFT) using recently introduced closed-form Hermite–Gaussian-like (HGL) eigenvectors. With respect to such eigenvectors, we discuss the convergence of their components to samples of the
J. R. D. Oliveira-Neto, Juliano B. Lima
semanticscholar   +1 more source

Weighted Graph Cuts without Eigenvectors A Multilevel Approach

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2007
A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods.
I. Dhillon, Yuqiang Guan, Brian Kulis
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy