In this paper,we investigate the weighted Dirichlet eigenvalue problem of polynomial operator of the drifting Laplacian on the cigar soliton■as follows■where is a positive continuous function on,denotes the outward ...In this paper,we investigate the weighted Dirichlet eigenvalue problem of polynomial operator of the drifting Laplacian on the cigar soliton■as follows■where is a positive continuous function on,denotes the outward unit normal to the boundary,and are two nonnegative constants.We establish some universal inequalities for eigenvalues of this problem.展开更多
Quantum physics is primarily concerned with real eigenvalues,stemming from the unitarity of time evolutions.With the introduction of PT symmetry,a widely accepted consensus is that,even if the Hamiltonian of the syste...Quantum physics is primarily concerned with real eigenvalues,stemming from the unitarity of time evolutions.With the introduction of PT symmetry,a widely accepted consensus is that,even if the Hamiltonian of the system is not Hermitian,the eigenvalues can still be purely real under specific symmetry.Hence,great enthusiasm has been devoted to exploring the eigenvalue problem of non-Hermitian systems.In this work,from a distinct perspective,we demonstrate that real eigenvalues can also emerge under the appropriate recursive condition of eigenstates.Consequently,our findings provide another path to extract the real energy spectrum of non-Hermitian systems,which guarantees the conservation of probability and stimulates future experimental observations.展开更多
A numerical method is proposed to calculate the eigenvalues of the Zakharov–Shabat system based on Chebyshev polynomials. A mapping in the form of tanh(ax) is constructed according to the asymptotic of the potential ...A numerical method is proposed to calculate the eigenvalues of the Zakharov–Shabat system based on Chebyshev polynomials. A mapping in the form of tanh(ax) is constructed according to the asymptotic of the potential function for the Zakharov–Shabat eigenvalue problem. The mapping can distribute Chebyshev nodes very well considering the gradient for the potential function. Using Chebyshev polynomials, tanh(ax) mapping, and Chebyshev nodes, the Zakharov–Shabat eigenvalue problem is transformed into a matrix eigenvalue problem. This method has good convergence for the Satsuma–Yajima potential and the convergence rate is faster than the Fourier collocation method. This method is not only suitable for simple potential functions but also converges quickly for a complex Y-shape potential. It can also be further extended to other linear eigenvalue problems.展开更多
Wave propagation in horizontally layered media is a classical problem in seismic-wave theory.In semi-infinite space,a nondispersive Rayleigh wave mode exists,and the eigendisplacement decays exponentially with depth.I...Wave propagation in horizontally layered media is a classical problem in seismic-wave theory.In semi-infinite space,a nondispersive Rayleigh wave mode exists,and the eigendisplacement decays exponentially with depth.In a layered model with increasing layer velocity,the phase velocity of the Rayleigh wave varies between the S-wave velocity of the bottom half-space and that of the classical Rayleigh wave propagated in a supposed half-space formed by the parameters of the top layer.If the phase velocity is the same as the P-or S-wave velocity of the layer,which is called the critical mode or critical phase velocity of surface waves,the general solution of the wave equation is not a homogeneous(expressed by trigonometric functions)or inhomogeneous(expressed by exponential functions)plane wave,but one whose amplitude changes linearly with depth(expressed by a linear function).Theories based on a general solution containing only trigonometric or exponential functions do not apply to the critical mode,owing to the singularity at the critical phase velocity.In this study,based on the classical framework of generalized reflection and transmission coefficients,the propagation of surface waves in horizontally layered media was studied by introducing a solution for the linear function at the critical phase velocity.Therefore,the eigenvalues and eigenfunctions of the critical mode can be calculated by solving a singular problem.The eigendisplacement characteristics associated with the critical phase velocity were investigated for different layered models.In contrast to the normal mode,the eigendisplacement associated with the critical phase velocity exhibits different characteristics.If the phase velocity is equal to the S-wave velocity in the bottom half-space,the eigendisplacement remains constant with increasing depth.展开更多
In this article, an attempt based on Spin Topological Space, STS, to give areasonable detailed account of the cause of photonic fermionization phenomena of light photon is made. STS is an unconventional spin space in ...In this article, an attempt based on Spin Topological Space, STS, to give areasonable detailed account of the cause of photonic fermionization phenomena of light photon is made. STS is an unconventional spin space in quantum mechanics, which can be used to account for where the unconventional half-integer spin eigenvalues phenomenon of light photon comes from. We suggest to dectect the possible existence of photonic one-third-spinization phenomenon of light photon, by using three beams of light photon in interference experiment.展开更多
In this study, the boundary-value problem with eigenvalue parameter generated by the differential equation with discontinuous coefficients and boundary conditions which contains not only endpoints of the considered in...In this study, the boundary-value problem with eigenvalue parameter generated by the differential equation with discontinuous coefficients and boundary conditions which contains not only endpoints of the considered interval, but also point of discontinuity and linear functionals is investigated. So, the problem is not pure boundary-value. The authors single out a class of linear functionals and find simple algebraic conditions on coefficients, which garantee the existence of infinit number eigenvalues. Also the asymptotic formulas for eigenvalues are found.展开更多
Let Ω be a bounded open domain in Rn with smooth boundary Ω, X =（X1,X2,... ,Xm） be a system of real smooth vector fields defined on Ω and the bound-ary Ω is non-characteristic for X. If X satisfies the HSrmande...Let Ω be a bounded open domain in Rn with smooth boundary Ω, X =（X1,X2,... ,Xm） be a system of real smooth vector fields defined on Ω and the bound-ary Ω is non-characteristic for X. If X satisfies the HSrmander＇s condition, then the vectorfield is finitely degenerate and the sum of square operator △X =m∑j=1 X2 j is a finitely de-generate elliptic operator. In this paper, we shall study the sharp estimate of the Dirichlet eigenvalue for a class of general Grushin type degenerate elliptic operators △x on Ω.展开更多
A procedure is presented for computing the derivatives of repeated eigenvalues and the corresponding eigenvectors of damped systems. The derivatives are calculated in terms of the eigenvalues and eigenvectors of the s...A procedure is presented for computing the derivatives of repeated eigenvalues and the corresponding eigenvectors of damped systems. The derivatives are calculated in terms of the eigenvalues and eigenvectors of the second-order system, and the use of rather undesirable state space representation is avoided. Hence the cost of computation is greatly reduced. The efficiency of the proposed procedure is illustrated by considering a 5-DOF non-proportionally damped system.展开更多
For a non-zero real number α, let sα（G） denote the sum of the αth power of thenon-zero Laplacian eigenvalues of a graph G. In this paper, we establish a connection betweensα（G） and the first Zagreb index in wh...For a non-zero real number α, let sα（G） denote the sum of the αth power of thenon-zero Laplacian eigenvalues of a graph G. In this paper, we establish a connection betweensα（G） and the first Zagreb index in which the H¨older’s inequality plays a key role. By usingthis result, we present a lot of bounds of sα（G） for a connected （molecular） graph G in terms ofits number of vertices （atoms） and edges （bonds）. We also present other two bounds for sα（G）in terms of connectivity and chromatic number respectively, which generalize those results ofZhou and Trinajsti′c for the Kirchho？ index [B Zhou, N Trinajsti′c. A note on Kirchho？ index,Chem. Phys. Lett., 2008, 455： 120-123].展开更多
A new method for estimating the bounds of eigenvalues ispresented. In order to show that the method proposed is as effectiveas Qiu's an undamping spring-mass system with 5 nodes and 5 degrees ofreedom is given. To...A new method for estimating the bounds of eigenvalues ispresented. In order to show that the method proposed is as effectiveas Qiu's an undamping spring-mass system with 5 nodes and 5 degrees ofreedom is given. To illustrate that the present method can beapplied to structures which cannot be treated by non-negativedecomposition, a plane frame with 202 nodes and 357 beam elements isgiven. The results show that the present method is effective forestimating the bounds of eigenvalues and is more common than Qiu's.展开更多
Edge detection of potential field interpretation is an important task. The traditional edge detection methods have poor ability in outlining weak amplitude anomalies clearly. The resolved edges position is blurred.We ...Edge detection of potential field interpretation is an important task. The traditional edge detection methods have poor ability in outlining weak amplitude anomalies clearly. The resolved edges position is blurred.We purposed new edge detection methods based on directional eigenvalues of potential field gradient tensor for the causative sources. In order to balance strong and weak amplitude anomalies simultaneously,we present one normalization method using different orders of vertical derivatives to improve the new filters. The presented filters were tested on synthetic and real potential field data to verify its feasibility. All of the results have shown that the new edge detection methods can not only display the sources edges precisely and clearly,but also bring out more geological subtle details.展开更多
This paper presents a method for estimating the upper and lowerbounds of eigenvalues of structures with uncertainties. The uncertainparameters re described by the convex model. A numerical ex- ample ofthe frame struct...This paper presents a method for estimating the upper and lowerbounds of eigenvalues of structures with uncertainties. The uncertainparameters re described by the convex model. A numerical ex- ample ofthe frame structure is given to illustrate the efficiency of themethod.展开更多
The Rayleigh-Ritz and the inverse iteration methods are used in order to compute the eigenvalues of 3D Fredholm-Stieltjes integral equations, i.e. 3D Fredholm equations with respect to suitable Stieltjes-type measures...The Rayleigh-Ritz and the inverse iteration methods are used in order to compute the eigenvalues of 3D Fredholm-Stieltjes integral equations, i.e. 3D Fredholm equations with respect to suitable Stieltjes-type measures. Some applications are shown, relevant to the problem of computing the eigenvalues of a body charged by a finite number of masses concentrated on points, curves or surfaces lying in.展开更多
Let G be a simple graph. We first show that δ≥di-√[i/2][i/2], where δiand di denote the i-th signless Laplacian eigenvalue and the i-th degree of vertex in G, respectively.Suppose G is a simple and connected graph...Let G be a simple graph. We first show that δ≥di-√[i/2][i/2], where δiand di denote the i-th signless Laplacian eigenvalue and the i-th degree of vertex in G, respectively.Suppose G is a simple and connected graph, then some inequalities on the distance signless Laplacian eigenvalues are obtained by deleting some vertices and some edges from G. In addition, for the distance signless Laplacian spectral radius ρQ（G）, we determine the extremal graphs with the minimum ρQ（G） among the trees with given diameter, the unicyclic and bicyclic graphs with given girth, respectively.展开更多
We construct one multi-sender authentication code by algebraic combination method from eigenvalues and eigenvectors of the matrix over nite elds. Some parameters and the probabilities of three kinds of successful atta...We construct one multi-sender authentication code by algebraic combination method from eigenvalues and eigenvectors of the matrix over nite elds. Some parameters and the probabilities of three kinds of successful attack of this code are also computed. For multi-sender authentication code,it allows a group of senders to construct an authenticated message for a receiver such that the receiver can verify authenticity of the received message.展开更多
In this article,we study different molecular structures such as Polythiophene network,PLY(n)for n=1,2,and 3,Orthosilicate(Nesosilicate)SiO4,Pyrosilicates(Sorosilicates)Si2O7,Chain silicates(Pyroxenes)(SiO3)n,and Cycli...In this article,we study different molecular structures such as Polythiophene network,PLY(n)for n=1,2,and 3,Orthosilicate(Nesosilicate)SiO4,Pyrosilicates(Sorosilicates)Si2O7,Chain silicates(Pyroxenes)(SiO3)n,and Cyclic silicates(Ring Silicates)Si3O9 for their cardinalities,chromatic numbers,graph variations,eigenvalues obtained from the adjacency matrices which are square matrices in order and their corresponding characteristics polynomials.We convert the general structures of these chemical networks in to mathematical graphical structures.We transform the molecular structures of these chemical networks which are mentioned above,into a simple and undirected planar graph and sketch them with various techniques of mathematics.The matrices obtained from these simple undirected graphs are symmetric.We also label the molecular structures by assigning different colors.Their graphs have also been studied for analysis.For a connected graph,the eigenvalue that shows its peak point(largest value)obtained from the adjacency matrix has multiplicity 1.Therefore,the gap between the largest and its smallest eigenvalues is interlinked with some form of“connectivity measurement of the structural graph”.We also note that the chemical structures,Orthosilicate(Nesosilicate)SiO4,Pyrosilicates(Sorosilicates)Si2O7,Chain silicates(Pyroxenes)(SiO3)n,and Cyclic silicates(Ring Silicates)Si3O9 generally have two same eigenvalues.Adjacency matrices have great importance in the field of computer science.展开更多
In this paper, an extended spectral theorem is given, which enables one to calculate the correlation functions when complex eigenvalues appear. To do so, a Fourier transformation with a complex argument is utilized. W...In this paper, an extended spectral theorem is given, which enables one to calculate the correlation functions when complex eigenvalues appear. To do so, a Fourier transformation with a complex argument is utilized. We treat all the Matsbara frequencies, including Fermionic and Bosonic frequencies, on an equal footing. It is pointed out that when complex eigenvalues appear, the dissipation of a system cannot simply be ascribed to the pure imaginary part of the Green function. Therefore, the use of the name fluctuation-dissipation theorem should be careful.展开更多
A detailed procedure based on an analytical transfer matrix method is presented to solve bound-state problems. The derivation is strict and complete. The energy eigenvalues for an arbitrary one-dimensional potential c...A detailed procedure based on an analytical transfer matrix method is presented to solve bound-state problems. The derivation is strict and complete. The energy eigenvalues for an arbitrary one-dimensional potential can be obtained by the method. The anharmonic oscillator potential and the rational potential are two important examples. Checked by numerical techniques, the results for the two potentials by the present method are proven to be exact and reliable.展开更多
A sign pattern(matrix)is a matrix whose entries are the symbols+,-and 0.Foran n×n sign pattern matrix A,the sign pattern class of A,denoted by Q(A),is the set ofall n×n real matrices whose entries have signs...A sign pattern(matrix)is a matrix whose entries are the symbols+,-and 0.Foran n×n sign pattern matrix A,the sign pattern class of A,denoted by Q(A),is the set ofall n×n real matrices whose entries have signs indicated by the corresponding entries of A.We say that a sign pattern matrix A requires a matrix property P if every real matrix in Q(A)has the property P.A matrix with all distinct eigenvalues has many nice展开更多
From the formulas of the conjugate gradient, a similarity between a symmetric positive definite (SPD) matrix A and a tridiagonal matrix B is obtained. The elements of the matrix B are determined by the parameters of t...From the formulas of the conjugate gradient, a similarity between a symmetric positive definite (SPD) matrix A and a tridiagonal matrix B is obtained. The elements of the matrix B are determined by the parameters of the conjugate gradient. The computation of eigenvalues of A is then reduced to the case of the tridiagonal matrix B. The approximation of extreme eigenvalues of A can be obtained as a 'by-product' in the computation of the conjugate gradient if a computational cost of O(s) arithmetic operations is added, where s is the number of iterations This computational cost is negligible compared with the conjugate gradient. If the matrix A is not SPD, the approximation of the condition number of A can be obtained from the computation of the conjugate gradient on AT A. Numerical results show that this is a convenient and highly efficient method for computing extreme eigenvalues and the condition number of nonsingular matrices.展开更多
基金Supported by National Natural Science Foundation of China(11001130,12272062)Fundamental Research Funds for the Central Universities(30917011335).
文摘In this paper,we investigate the weighted Dirichlet eigenvalue problem of polynomial operator of the drifting Laplacian on the cigar soliton■as follows■where is a positive continuous function on,denotes the outward unit normal to the boundary,and are two nonnegative constants.We establish some universal inequalities for eigenvalues of this problem.
基金This work was supported by the National Natural Science Foundation of China(Grant No.62071248)the Natural Science Foundation of Nanjing University of Posts and Telecommunications(Grant No.NY223109)China Postdoctoral Science Foundation(Grant No.2022M721693).
文摘Quantum physics is primarily concerned with real eigenvalues,stemming from the unitarity of time evolutions.With the introduction of PT symmetry,a widely accepted consensus is that,even if the Hamiltonian of the system is not Hermitian,the eigenvalues can still be purely real under specific symmetry.Hence,great enthusiasm has been devoted to exploring the eigenvalue problem of non-Hermitian systems.In this work,from a distinct perspective,we demonstrate that real eigenvalues can also emerge under the appropriate recursive condition of eigenstates.Consequently,our findings provide another path to extract the real energy spectrum of non-Hermitian systems,which guarantees the conservation of probability and stimulates future experimental observations.
基金Project supported by the National Natural Science Foundation of China (Grant Nos.52171251,U2106225,and 52231011)Dalian Science and Technology Innovation Fund (Grant No.2022JJ12GX036)。
文摘A numerical method is proposed to calculate the eigenvalues of the Zakharov–Shabat system based on Chebyshev polynomials. A mapping in the form of tanh(ax) is constructed according to the asymptotic of the potential function for the Zakharov–Shabat eigenvalue problem. The mapping can distribute Chebyshev nodes very well considering the gradient for the potential function. Using Chebyshev polynomials, tanh(ax) mapping, and Chebyshev nodes, the Zakharov–Shabat eigenvalue problem is transformed into a matrix eigenvalue problem. This method has good convergence for the Satsuma–Yajima potential and the convergence rate is faster than the Fourier collocation method. This method is not only suitable for simple potential functions but also converges quickly for a complex Y-shape potential. It can also be further extended to other linear eigenvalue problems.
基金supported by the National Natural Science Foundation of China(No.U1839209).
文摘Wave propagation in horizontally layered media is a classical problem in seismic-wave theory.In semi-infinite space,a nondispersive Rayleigh wave mode exists,and the eigendisplacement decays exponentially with depth.In a layered model with increasing layer velocity,the phase velocity of the Rayleigh wave varies between the S-wave velocity of the bottom half-space and that of the classical Rayleigh wave propagated in a supposed half-space formed by the parameters of the top layer.If the phase velocity is the same as the P-or S-wave velocity of the layer,which is called the critical mode or critical phase velocity of surface waves,the general solution of the wave equation is not a homogeneous(expressed by trigonometric functions)or inhomogeneous(expressed by exponential functions)plane wave,but one whose amplitude changes linearly with depth(expressed by a linear function).Theories based on a general solution containing only trigonometric or exponential functions do not apply to the critical mode,owing to the singularity at the critical phase velocity.In this study,based on the classical framework of generalized reflection and transmission coefficients,the propagation of surface waves in horizontally layered media was studied by introducing a solution for the linear function at the critical phase velocity.Therefore,the eigenvalues and eigenfunctions of the critical mode can be calculated by solving a singular problem.The eigendisplacement characteristics associated with the critical phase velocity were investigated for different layered models.In contrast to the normal mode,the eigendisplacement associated with the critical phase velocity exhibits different characteristics.If the phase velocity is equal to the S-wave velocity in the bottom half-space,the eigendisplacement remains constant with increasing depth.
文摘In this article, an attempt based on Spin Topological Space, STS, to give areasonable detailed account of the cause of photonic fermionization phenomena of light photon is made. STS is an unconventional spin space in quantum mechanics, which can be used to account for where the unconventional half-integer spin eigenvalues phenomenon of light photon comes from. We suggest to dectect the possible existence of photonic one-third-spinization phenomenon of light photon, by using three beams of light photon in interference experiment.
文摘In this study, the boundary-value problem with eigenvalue parameter generated by the differential equation with discontinuous coefficients and boundary conditions which contains not only endpoints of the considered interval, but also point of discontinuity and linear functionals is investigated. So, the problem is not pure boundary-value. The authors single out a class of linear functionals and find simple algebraic conditions on coefficients, which garantee the existence of infinit number eigenvalues. Also the asymptotic formulas for eigenvalues are found.
基金partially supported by the NSFC(11631011,11626251)
文摘Let Ω be a bounded open domain in Rn with smooth boundary Ω, X =（X1,X2,... ,Xm） be a system of real smooth vector fields defined on Ω and the bound-ary Ω is non-characteristic for X. If X satisfies the HSrmander＇s condition, then the vectorfield is finitely degenerate and the sum of square operator △X =m∑j=1 X2 j is a finitely de-generate elliptic operator. In this paper, we shall study the sharp estimate of the Dirichlet eigenvalue for a class of general Grushin type degenerate elliptic operators △x on Ω.
基金Project supported by the Mathematical Tianyuan Foundation of China (No. 10626019)
文摘A procedure is presented for computing the derivatives of repeated eigenvalues and the corresponding eigenvectors of damped systems. The derivatives are calculated in terms of the eigenvalues and eigenvectors of the second-order system, and the use of rather undesirable state space representation is avoided. Hence the cost of computation is greatly reduced. The efficiency of the proposed procedure is illustrated by considering a 5-DOF non-proportionally damped system.
基金Supported by the National Natural Science Foundation of China(10831001)
文摘For a non-zero real number α, let sα（G） denote the sum of the αth power of thenon-zero Laplacian eigenvalues of a graph G. In this paper, we establish a connection betweensα（G） and the first Zagreb index in which the H¨older’s inequality plays a key role. By usingthis result, we present a lot of bounds of sα（G） for a connected （molecular） graph G in terms ofits number of vertices （atoms） and edges （bonds）. We also present other two bounds for sα（G）in terms of connectivity and chromatic number respectively, which generalize those results ofZhou and Trinajsti′c for the Kirchho？ index [B Zhou, N Trinajsti′c. A note on Kirchho？ index,Chem. Phys. Lett., 2008, 455： 120-123].
基金the National Natural Science Foundation (No.19872028)the Mechanical Technology Development Foundation of China
文摘A new method for estimating the bounds of eigenvalues ispresented. In order to show that the method proposed is as effectiveas Qiu's an undamping spring-mass system with 5 nodes and 5 degrees ofreedom is given. To illustrate that the present method can beapplied to structures which cannot be treated by non-negativedecomposition, a plane frame with 202 nodes and 357 beam elements isgiven. The results show that the present method is effective forestimating the bounds of eigenvalues and is more common than Qiu's.
基金financially supported by Sino Probe-09-01 Grant No. 201311192Project 2014100 Supported by Graduate Innovation Fund of Jilin University
文摘Edge detection of potential field interpretation is an important task. The traditional edge detection methods have poor ability in outlining weak amplitude anomalies clearly. The resolved edges position is blurred.We purposed new edge detection methods based on directional eigenvalues of potential field gradient tensor for the causative sources. In order to balance strong and weak amplitude anomalies simultaneously,we present one normalization method using different orders of vertical derivatives to improve the new filters. The presented filters were tested on synthetic and real potential field data to verify its feasibility. All of the results have shown that the new edge detection methods can not only display the sources edges precisely and clearly,but also bring out more geological subtle details.
基金the National Natural Science Foundation of China(No.19872028)
文摘This paper presents a method for estimating the upper and lowerbounds of eigenvalues of structures with uncertainties. The uncertainparameters re described by the convex model. A numerical ex- ample ofthe frame structure is given to illustrate the efficiency of themethod.
文摘The Rayleigh-Ritz and the inverse iteration methods are used in order to compute the eigenvalues of 3D Fredholm-Stieltjes integral equations, i.e. 3D Fredholm equations with respect to suitable Stieltjes-type measures. Some applications are shown, relevant to the problem of computing the eigenvalues of a body charged by a finite number of masses concentrated on points, curves or surfaces lying in.
基金Supported by the National Natural Science Foundation of China(Grant No.11171343)
文摘Let G be a simple graph. We first show that δ≥di-√[i/2][i/2], where δiand di denote the i-th signless Laplacian eigenvalue and the i-th degree of vertex in G, respectively.Suppose G is a simple and connected graph, then some inequalities on the distance signless Laplacian eigenvalues are obtained by deleting some vertices and some edges from G. In addition, for the distance signless Laplacian spectral radius ρQ（G）, we determine the extremal graphs with the minimum ρQ（G） among the trees with given diameter, the unicyclic and bicyclic graphs with given girth, respectively.
基金Sponsored by the National Natural Science Foundation of China(Grant No.61179026)the Fundamental Research of the Central Universities of China Civil Aviation University of Science Special(Grant No.3122016L005)
文摘We construct one multi-sender authentication code by algebraic combination method from eigenvalues and eigenvectors of the matrix over nite elds. Some parameters and the probabilities of three kinds of successful attack of this code are also computed. For multi-sender authentication code,it allows a group of senders to construct an authenticated message for a receiver such that the receiver can verify authenticity of the received message.
文摘In this article,we study different molecular structures such as Polythiophene network,PLY(n)for n=1,2,and 3,Orthosilicate(Nesosilicate)SiO4,Pyrosilicates(Sorosilicates)Si2O7,Chain silicates(Pyroxenes)(SiO3)n,and Cyclic silicates(Ring Silicates)Si3O9 for their cardinalities,chromatic numbers,graph variations,eigenvalues obtained from the adjacency matrices which are square matrices in order and their corresponding characteristics polynomials.We convert the general structures of these chemical networks in to mathematical graphical structures.We transform the molecular structures of these chemical networks which are mentioned above,into a simple and undirected planar graph and sketch them with various techniques of mathematics.The matrices obtained from these simple undirected graphs are symmetric.We also label the molecular structures by assigning different colors.Their graphs have also been studied for analysis.For a connected graph,the eigenvalue that shows its peak point(largest value)obtained from the adjacency matrix has multiplicity 1.Therefore,the gap between the largest and its smallest eigenvalues is interlinked with some form of“connectivity measurement of the structural graph”.We also note that the chemical structures,Orthosilicate(Nesosilicate)SiO4,Pyrosilicates(Sorosilicates)Si2O7,Chain silicates(Pyroxenes)(SiO3)n,and Cyclic silicates(Ring Silicates)Si3O9 generally have two same eigenvalues.Adjacency matrices have great importance in the field of computer science.
文摘In this paper, an extended spectral theorem is given, which enables one to calculate the correlation functions when complex eigenvalues appear. To do so, a Fourier transformation with a complex argument is utilized. We treat all the Matsbara frequencies, including Fermionic and Bosonic frequencies, on an equal footing. It is pointed out that when complex eigenvalues appear, the dissipation of a system cannot simply be ascribed to the pure imaginary part of the Green function. Therefore, the use of the name fluctuation-dissipation theorem should be careful.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 60877055 and 60806041)the Shanghai Rising-Star Program,China (Grant No. 08QA14030)+1 种基金the Innovation Funds for Graduates of Shanghai University,China (Grant No. SHUCX092021)the Foundation of the Science and Technology Commission of Shanghai Municipality,China (Grant No. 08JC14097)
文摘A detailed procedure based on an analytical transfer matrix method is presented to solve bound-state problems. The derivation is strict and complete. The energy eigenvalues for an arbitrary one-dimensional potential can be obtained by the method. The anharmonic oscillator potential and the rational potential are two important examples. Checked by numerical techniques, the results for the two potentials by the present method are proven to be exact and reliable.
文摘A sign pattern(matrix)is a matrix whose entries are the symbols+,-and 0.Foran n×n sign pattern matrix A,the sign pattern class of A,denoted by Q(A),is the set ofall n×n real matrices whose entries have signs indicated by the corresponding entries of A.We say that a sign pattern matrix A requires a matrix property P if every real matrix in Q(A)has the property P.A matrix with all distinct eigenvalues has many nice
文摘From the formulas of the conjugate gradient, a similarity between a symmetric positive definite (SPD) matrix A and a tridiagonal matrix B is obtained. The elements of the matrix B are determined by the parameters of the conjugate gradient. The computation of eigenvalues of A is then reduced to the case of the tridiagonal matrix B. The approximation of extreme eigenvalues of A can be obtained as a 'by-product' in the computation of the conjugate gradient if a computational cost of O(s) arithmetic operations is added, where s is the number of iterations This computational cost is negligible compared with the conjugate gradient. If the matrix A is not SPD, the approximation of the condition number of A can be obtained from the computation of the conjugate gradient on AT A. Numerical results show that this is a convenient and highly efficient method for computing extreme eigenvalues and the condition number of nonsingular matrices.
