Search results for "Eigenvector"
showing 10 items of 303 documents
Invariant Feature Matching for Image Registration Application Based on New Dissimilarity of Spatial Features
2016
An invariant feature matching method is proposed as a spatially invariant feature matching approach. Deformation effects, such as affine and homography, change the local information within the image and can result in ambiguous local information pertaining to image points. New method based on dissimilarity values, which measures the dissimilarity of the features through the path based on Eigenvector properties, is proposed. Evidence shows that existing matching techniques using similarity metrics--such as normalized cross-correlation, squared sum of intensity differences and correlation coefficient--are insufficient for achieving adequate results under different image deformations. Thus, new…
Sharp estimates and saturation phenomena for a nonlocal eigenvalue problem
2011
Abstract We determine the shape which minimizes, among domains with given measure, the first eigenvalue of a nonlocal operator consisting of a perturbation of the standard Dirichlet Laplacian by an integral of the unknown function. We show that this problem displays a saturation behaviour in that the corresponding value of the minimal eigenvalue increases with the weight affecting the average up to a (finite) critical value of this weight, and then remains constant. This critical point corresponds to a transition between optimal shapes, from one ball as in the Faber–Krahn inequality to two equal balls.
Distribution of Eigenvalues for Semi-classical Elliptic Operators with Small Random Perturbations, Results and Outline
2019
In this chapter we will state a result asserting that for elliptic semi-classical (pseudo-)differential operators the eigenvalues are distributed according to Weyl’s law “most of the time” in a probabilistic sense. The first three sections are devoted to the formulation of the results and in the last section we give an outline of the proof that will be carried out in Chaps. 16 and 17.
A correction method for dynamic analysis of linear continuous systems
2005
A method to improve the dynamic response analysis of continuous classically damped linear system is proposed. As in fact usually, following a classical approach, a reduced number of eigenfunctions are accounted for and the response is evaluated by integrating the uncoupled differential equations of motion in modal space, neglecting the contribution of high frequency modes (truncation procedure). Here, starting from the given system, it is proposed to set up two differential equations governing the motion of two new continuous systems: the first one contains only the first m non-zero eigenvalues of the given system and the second one contains the remainder non-zero infinity - m eigenvalues. …
Isotropic stochastic flow of homeomorphisms on Sd for the critical Sobolev exponent
2006
Abstract In this work, we shall deal with the critical Sobolev isotropic Brownian flows on the sphere S d . Based on previous works by O. Raimond and LeJan and Raimond (see [O. Raimond, Ann. Inst. H. Poincare 35 (1999) 313–354] and [Y. LeJan, O. Raimond, Ann. of Prob. 30 (2002) 826–873], we prove that the associated flows are flows of homeomorphisms.
Modified Landau levels, damped harmonic oscillator and two-dimensional pseudo-bosons
2010
In a series of recent papers one of us has analyzed in some details a class of elementary excitations called {\em pseudo-bosons}. They arise from a special deformation of the canonical commutation relation $[a,a^\dagger]=\1$, which is replaced by $[a,b]=\1$, with $b$ not necessarily equal to $a^\dagger$. Here, after a two-dimensional extension of the general framework, we apply the theory to a generalized version of the two-dimensional Hamiltonian describing Landau levels. Moreover, for this system, we discuss coherent states and we deduce a resolution of the identity. We also consider a different class of examples arising from a classical system, i.e. a damped harmonic oscillator.
The second Weyl coefficient for a first-order system
2020
For a scalar elliptic self-adjoint operator on a compact manifold without boundary we have two-term asymptotics for the number of eigenvalues between 0 and λ when λ → ∞, under an additional dynamical condition. (See [3, Theorem 3.5] for an early result in this direction.) In the case of an elliptic system of first order, the existence of two-term asymptotics was also established quite early and as in the scalar case Fourier integral operators have been the crucial tool. The complete computation of the coefficient of the second term was obtained only in the 2013 paper [2]. In the present paper we simplify that calculation. The main observation is that with the existence of two-term asymptoti…
Tests against stationary and explosive alternatives in vector autoregressive models
2008
. The article proposes new tests for the number of unit roots in vector autoregressive models based on the eigenvalues of the companion matrix. Both stationary and explosive alternatives are considered. The limiting distributions of test statistics depend only on the number of unit roots. Size and power are investigated, and it is found that the new test against some stationary alternatives compares favourably with the widely used likelihood ratio test for the cointegrating rank. The powers are prominently higher against explosive than against stationary alternatives. Some empirical examples are provided to show how to use the new tests with real data.
Vector coherent states and intertwining operators
2009
In this paper we discuss a general strategy to construct vector coherent states of the Gazeau-Klauder type and we use them to built up examples of isospectral hamiltonians. For that we use a general strategy recently proposed by the author and which extends well known facts on intertwining operators. We also discuss the possibility of constructing non-isospectral hamiltonians with related eigenstates.
The rank of random regular digraphs of constant degree
2018
Abstract Let d be a (large) integer. Given n ≥ 2 d , let A n be the adjacency matrix of a random directed d -regular graph on n vertices, with the uniform distribution. We show that the rank of A n is at least n − 1 with probability going to one as n grows to infinity. The proof combines the well known method of simple switchings and a recent result of the authors on delocalization of eigenvectors of A n .