982 resultados para Eigenvalues and eigenfuctions
Resumo:
Some properties of the eigenvalues of the integral operator Kgt defined as Kτf(x) = ∫0τK(x − y) f (y) dy were studied by [1.], 554–566), with some assumptions on the kernel K(x). In this paper the eigenfunctions of the operator Kτ are shown to be continuous functions of τ under certain circumstances. Also, the results of Vittal Rao and the continuity of eigenfunctions are shown to hold for a larger class of kernels.
Resumo:
The Shifman-Vainshtein-Zakharov method of determining the eigenvalues and coupling strengths, from the operator product expansion, for the current correlation functions is studied in the nonrelativistic context, using the semiclassical expansion. The relationship between the low-lying eigenvalues, and the leading corrections to the imaginary-time Green function is elucidated by comparing systems which have almost identical spectra. In the case of an anharmonic oscillator it is found that with the procedure stated in the paper, that inclusion of more terms to the asymptotic expansion does not show any simple trend towards convergence to the exact values. Generalization to higher partial waves is given. In particular for the P-level of the oscillator, the procedure gives poorer results than for the S-level, although the ratio of the two comes out much better.
Resumo:
A (κ, τ)-regular set is a subset of the vertices of a graph G, inducing a κ-regular subgraph such that every vertex not in the subset has τ neighbors in it. A main eigenvalue of the adjacency matrix A of a graph G has an eigenvector not orthogonal to the all-one vector j. For graphs with a (κ, τ)-regular set a necessary and sufficient condition for an eigenvalue be non-main is deduced and the main eigenvalues are characterized. These results are applied to the construction of infinite families of bidegreed graphs with two main eigenvalues and the same spectral radius (index) and some relations with strongly regular graphs are obtained. Finally, the determination of (κ, τ)-regular sets is analyzed. © 2009 Elsevier Inc. All rights reserved.
Resumo:
Relations between Laplacian eigenvectors and eigenvalues and the existence of almost equitable partitions (which are generalizations of equitable partitions) are presented. Furthermore, on the basis of some properties of the adjacency eigenvectors of a graph, a necessary and sufficient condition for the graph to be primitive strongly regular is introduced. © 2006 Elsevier Ltd. All rights reserved.
Resumo:
A new approach is presented for the solution of spectral problems on infinite domains with regular ends, which avoids the need to solve boundary-value problems for many trial values of the spectral parameter. We present numerical results both for eigenvalues and for resonances, comparing with results reported by Aslanyan, Parnovski and Vassiliev.
Resumo:
2000 Mathematics Subject Classification: 35J05, 35C15, 44P05
Resumo:
Some changes in the application of the numeric trapezoidal integration are analyzed for applications considering pi circuits. It is considered numeric and computational proceedings for improving the numeric results obtained with associations of pi circuits. In numeric integration solutions of the linear systems, it is common to represent these associations of pi circuits by only one matrix. This representation introduces undesirable numeric oscillations in simulations of the dynamics of wave propagation in electrical systems. The proposed changes improve the results of application of cascades of pi circuits associated to the trapezoidal integration, avoiding that the numerical oscillations, or Gibb's oscillations, have high values and are slowly damped. For the carried out simulations, different number of pi circuits and voltage sources are checked, confirming the reduction of the influence of the numeric oscillations on the obtained results. (C) 2014 Elsevier B.V. All rights reserved.
Relationship between the controllability grammian and closed-loop eigenvalues: the single input case
Resumo:
The controllability grammian is important in many control applications. Given a set of closed-loop eigenvalues the corresponding controllability grammian can be obtained by computing the controller which assigns the eigenvalues and then by solving the Lyapunov equation that defines the grammian. The relationship between the controllability grammian, resulting from state feedback, and the closed-loop eigenvalues of a single input linear time invariant (LTI) system is obtained. The proposed methodology does not require the computation of the controller that assigns the specified eigenvalues. The closed-loop system matrix is obtained from the knowledge of the open-loop system matrix, control influence matrix and the specified closed-loop eigenvalues. Knowing the closed-loop system matrix, the grammian is then obtained from the solution of the Lyapunov equation that defines it. Finally the proposed idea is extended to find the state covariance matrix for a specified set of closed-loop eigenvalues (without computing the controller), due to impulsive input in the disturbance channel and to solve the eigenvalue assignment problem for the single input case.
Resumo:
Abstract—In this paper we investigate the capacity of a general class of the slotted amplify and forward (SAF) relaying protocol where multiple, though a finite number of relays may transmit in a given cooperative slot and the relay terminals being half-duplex have a finite slot memory capacity. We derive an expression for the capacity per channel use of this generalized SAF channel assuming all source to relay, relay to destination and source to destination channel gains are independent and modeled as complex Gaussian. We show through the analysis of eigenvalue distributions that the increase in limiting capacity per channel use is marginal with the increase of relay terminals.