Sharif Digital Repository

Mesh point positions in Finite Difference Method (FDM) of discretization for the neutron diffusion equation can remarkably affect the averaged neutron fluxes as well as the effective multiplication factor. In this study, by aid of improving the mesh point positions, an enhanced finite difference scheme for the neutron diffusion equation is proposed based on the neutron importance function. In order to determine the neutron importance function, the adjoint (backward) neutron diffusion calculations are performed in the same procedure as for the forward calculations. Considering the neutron importance function, the mesh points can be improved through the entire reactor core. Accordingly, in... 

This paper presents a model-based method for applying online proactive generators redispatch to improve damping of the critical electromechanical oscillations of power system. The proposed method comprises two stages: 1) monitoring modal characteristics of oscillatory modes in ambient condition, and 2) applying generators redispatch based on sensitivities of the critical mode to the generators active power changes using a new analytic method. An online identification method such as error feedback lattice recursive least square adaptive filter is applied for online estimation of the oscillatory modes. Then, whenever the damping ratio of an identified mode is less than a preset threshold, its... 

From the birth of multi-spectral imaging techniques, there has been a tendency to consider and process this new type of data as a set of parallel gray-scale images, instead of an ensemble of an n-D realization. However, it has been proved that using vector-based tools leads to a more appropriate understanding of color images and thus more efficient algorithms for processing them. Such tools are able to take into consideration the high correlation of the color components and thus to successfully carry out energy compaction. In this paper, a novel method is proposed to utilize the principal component analysis in the neighborhoods of an image in order to extract the corresponding eigenimages.... 

The free linear vibration of an adaptive sandwich beam consisting of a frequency and field-dependent magnetorheological fluid core and an axially functionally graded constraining layer is investigated. The Euler-Bernoulli and Timoshenko beam theories are utilized for defining the longitudinal and lateral deformation of the sandwich beam. The Rayleigh-Ritz method is used to derive the frequency-dependent eigenvalue problem through the kinetic and strain energy expressions of the sandwich beam. In order to deal with the frequency dependency of the core, the approached complex eigenmodes method is implemented. The validity of the formulation and solution method is confirmed through comparison... 

The present research is performed to calculate the natural frequencies, loss factors, and associated mode shapes of a sandwich cylinder with moderately thick functionally graded (FG) face sheets and an electrorheological (ER) fluid core. Each face sheet is assumed to be made of FG materials, and its displacement field is estimated based on the first-order shear deformation theory, like the ER constrained layer. A suitable displacement continuity condition is considered between layers. The ER fluid used in the central middle is analyzed in the pre-yield area and considered electric field dependent. Hamilton's principle is used to acquire the motion equations related to each layer and... 

The present article intends to provide a size-dependent generalized thermoelasticity model and closed-form solution for thermoelastic damping (TED) in cylindrical nanoshells. With the aim of incorporating size effect within constitutive relations and heat conduction equation, nonlocal elasticity theory and Guyer–Krumhansl (GK) heat conduction model are exploited. Donnell–Mushtari–Vlasov (DMV) equations are also employed to model the cylindrical nanoshell. By adopting asymmetric simple harmonic form for oscillations of nanoshell and merging the motion, compatibility and heat conduction equations, the nonclassical frequency equation is extracted. By solving this eigenvalue problem and... 

A system is called prescribed-time attractive if its solution converges at an arbitrary user-defined finite time. In this note, necessary and sufficient conditions are developed for the prescribed-time attractivity of linear time-varying (LTV) systems. It is proved that the frozen-time eigenvalues of a prescribed-time attractive LTV system have negative real parts when the time is sufficiently close to the convergence moment. This result shows that the ubiquitous singularity problem of prescribed-time attractive LTV systems can be avoided without instability effects by switching to the corresponding frozen-time system at an appropriate time. Consequently, it is proved that the time-varying... 

This paper proposes a comprehensive analytic method for applying various optimal remedial actions to improve critical electromechanical modes damping without jeopardizing damping of non-critical modes and violating security constraints of power system. Generators and reactive power sources redisptach, demand side management and the generators voltage reference tuning are remedial actions that are considered here. Dynamic equations of the flux-decay dynamic model of generators, standard dynamic models of excitation system and power system stabilizer and algebraic equations of active and reactive powers balance are formulated in the quadratic eigenvalue problem framework. With simultaneous use... 

This paper investigates the free vibrations of a shell made of n cone segments joined together. The governing equations of the conical shell were obtained by applying the Sanders shell theory and the Hamilton principle. Then, these governing equations are solved by using the power series method and considering a displacement field which is harmonic function about the time and the circumferential coordinate. Using the boundary conditions of the two ends of the shell and the continuity conditions at the interface section of shell segments, and solving the eigenvalue problem, the natural frequencies and the mode shapes are obtained. Very good agreements exist between the analytical results of... 

For a graph G, let λ2(G) denote its second smallest Laplacian eigenvalue. It was conjectured that λ2(G)+λ2(G‾)≥1, where G‾ is the complement of G. In this paper, it is shown that max⁡{λ2(G),λ2(G‾)}≥[Formula presented]. © 2018 Elsevier Inc  

Signed graphs are graphs whose edges get signs ±1 and, as for unsigned graphs, they can be studied by means of graph matrices. Here we focus our attention to the largest eigenvalue, also known as the index of the adjacency matrix of signed graphs. Firstly we give some general results on the index variation when the corresponding signed graph is perturbed. Also, we determine signed graphs achieving the minimal or the maximal index in the class of unbalanced unicyclic graphs of order n≥3. © 2019  

The energy of a graph G, E(G), is the sum of absolute values of the eigenvalues of its adjacency matrix. Gutman et al. proved that for every cubic graph of order n, E(G)≥n. Here, we improve this result by showing that if G is a connected subcubic graph of order n≥8, then E(G)≥1.01n. Also, we prove that if G is a traceable subcubic graph of order n≥8, then E(G)>1.1n. Let G be a connected cubic graph of order n≥8, it is shown that E(G)>n+2. It was proved that if G is a connected cubic graph of order n, then E(G)≤1.65n. Also, in this paper we would like to present the best lower bound for the energy of a connected cubic graph. We introduce an infinite family of connected cubic graphs whose for... 

For a graph G of order n, let λ 2 (G) denote its second smallest Laplacian eigenvalue. It was conjectured that λ 2 (G)+λ 2 (G‾)≥1, where G‾ is the complement of G. For any x∈R n , let ∇ x ∈R (n2) be the vector whose {i,j}-th entry is |x i −x j |. In this paper, we show the aforementioned conjecture is equivalent to prove that every two orthonormal vectors f,g∈R n with zero mean satisfy ‖∇ f −∇ g ‖ 2 ≥2. In this article, it is shown that for the validity of the conjecture it suffices to prove that the conjecture holds for all permutation graphs. © 2019 Elsevier Inc  

The singular values of a matrix A are defined as the square roots of the eigenvalues of A⁎A, and the energy of A denoted by E(A) is the sum of its singular values. The energy of a graph G, E(G), is defined as the sum of absolute values of the eigenvalues of its adjacency matrix. In this paper, we prove that if A is a Hermitian matrix with the block form A=(BDD⁎C), then E(A)≥2E(D). Also, we show that if G is a graph and H is a spanning subgraph of G such that E(H) is an edge cut of G, then E(H)≤E(G), i.e., adding any number of edges to each part of a bipartite graph does not decrease its energy. Let G be a connected graph of order n and size m with the adjacency matrix A. It is well-known... 

In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than 1 are simple and also the multiplicity of Laplacian eigenvalue 1 has been well studied before. Here we consider the multiplicities of the other (non-integral) Laplacian eigenvalues. We give an upper bound and determine the trees of order n that have a multiplicity that is close to the upper bound [Formula presented], and emphasize the particular role of the algebraic connectivity. © 2019 Elsevier Inc  

A signed graph Gσ is an ordered pair (V(G),E(G)), where V(G) and E(G) are the set of vertices and edges of G, respectively, along with a map σ that signs every edge of G with +1 or −1. An eigenvalue of the associated adjacency matrix of Gσ, denoted by A(Gσ), is a main eigenvalue if the corresponding eigenspace has a non-orthogonal eigenvector to the all-one vector j. We conjectured that for every graph G≠K2,K4{e}, there is a switching σ such that all eigenvalues of Gσ are main. We show that this conjecture holds for every Cayley graphs, distance-regular graphs, vertex and edge-transitive graphs as well as double stars and paths. © 2020 Elsevier Inc  

The energy of a graph G, E(G), is the sum of absolute values of the eigenvalues of its adjacency matrix. This concept was extended by Nikiforov to arbitrary complex matrices. Recall that the trace norm of a digraph D is defined as, N(D)=∑i=1nσi, where σ1≥⋯≥σn are the singular values of the adjacency matrix of D. In this paper we would like to present some lower and upper bounds for N(D). For any digraph D it is proved that N(D)≥rank(D) and the equality holds if and only if D is a disjoint union of directed cycles and directed paths. Finally, we present a lower bound on σ1 and N(D) in terms of the size of digraph D. © 2021 Elsevier Inc  

A signed graph Gσ is an ordered pair (V(G),E(G)), where V(G) and E(G) are the set of vertices and edges of G, respectively, along with a map σ that signs every edge of G with +1 or −1. An eigenvalue of the associated adjacency matrix of Gσ, denoted by A(Gσ), is a main eigenvalue if the corresponding eigenspace has a non-orthogonal eigenvector to the all-one vector j. We conjectured that for every graph G≠K2,K4{e}, there is a switching σ such that all eigenvalues of Gσ are main. We show that this conjecture holds for every Cayley graphs, distance-regular graphs, vertex and edge-transitive graphs as well as double stars and paths. © 2020 Elsevier Inc  

The energy of a graph G, E(G), is the sum of absolute values of the eigenvalues of its adjacency matrix. This concept was extended by Nikiforov to arbitrary complex matrices. Recall that the trace norm of a digraph D is defined as, N(D)=∑i=1nσi, where σ1≥⋯≥σn are the singular values of the adjacency matrix of D. In this paper we would like to present some lower and upper bounds for N(D). For any digraph D it is proved that N(D)≥rank(D) and the equality holds if and only if D is a disjoint union of directed cycles and directed paths. Finally, we present a lower bound on σ1 and N(D) in terms of the size of digraph D. © 2021 Elsevier Inc  

A signed graph Gσ is an ordered pair (V(G),E(G)), where V(G) and E(G) are the set of vertices and edges of G, respectively, along with a map σ that signs every edge of G with +1 or −1. An eigenvalue of the associated adjacency matrix of Gσ, denoted by A(Gσ), is a main eigenvalue if the corresponding eigenspace has a non-orthogonal eigenvector to the all-one vector j. We conjectured that for every graph G≠K2,K4{e}, there is a switching σ such that all eigenvalues of Gσ are main. We show that this conjecture holds for every Cayley graphs, distance-regular graphs, vertex and edge-transitive graphs as well as double stars and paths. © 2020 Elsevier Inc