Let f,g and h be three distinct primitive holomorphic cusp forms of even integral weights k_(1),k_(2)and k_(3)for the full modular groupΓ=SL(2,Z),and denote byλ_(f)(n),λ_(g)(n),λ_(h)(n)the corresponding normalized...Let f,g and h be three distinct primitive holomorphic cusp forms of even integral weights k_(1),k_(2)and k_(3)for the full modular groupΓ=SL(2,Z),and denote byλ_(f)(n),λ_(g)(n),λ_(h)(n)the corresponding normalized Fourier coefficients,respectively.In this paper,we investigate the correlations of triple sums associated to these Fourier coefficientsλ_(f)(n),λ_(g)(n),λ_(h)(n)over certain polynomials,and obtain some power-saving asymptotic estimates which beat the trivial bounds.展开更多
Given an open bounded subset Ω of ℝ^(n) we consider the eigenvalue problem{Δu-(■u,■V)=-λvu,u>0inΩ,u=0 onδΩ,where V is a given function defined inΩandλV is the relevant eigenvalue.We determine sufficient c...Given an open bounded subset Ω of ℝ^(n) we consider the eigenvalue problem{Δu-(■u,■V)=-λvu,u>0inΩ,u=0 onδΩ,where V is a given function defined inΩandλV is the relevant eigenvalue.We determine sufficient conditions on V such that ifΩis convex,the solution u is log-concave.We also determine sufficient conditions ensuring that λ_(V),as a function of the setΩ,verifies a convexity inequality with respect to the Minkowski addition of sets.展开更多
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.展开更多
This paper is devoted to the Polynomial Preserving Recovery (PPR) based a posteriori error analysis for the second-order elliptic non-symmetric eigenvalue problem. An asymptotically exact a posteriori error estimator ...This paper is devoted to the Polynomial Preserving Recovery (PPR) based a posteriori error analysis for the second-order elliptic non-symmetric eigenvalue problem. An asymptotically exact a posteriori error estimator is proposed for solving the convection-dominated non-symmetric eigenvalue problem with non-smooth eigenfunctions or multiple eigenvalues. Numerical examples confirm our theoretical analysis.展开更多
Let G be a simple undirected graph.For any real numberα∈[0,1],Nikiforov defined the A_(α)-matrix of G as A_(α)(G)=αD(G)+(1-α)A(G),where A(G)and D(G)are the adjacency matrix and the degree diagonal matrix of G,re...Let G be a simple undirected graph.For any real numberα∈[0,1],Nikiforov defined the A_(α)-matrix of G as A_(α)(G)=αD(G)+(1-α)A(G),where A(G)and D(G)are the adjacency matrix and the degree diagonal matrix of G,respectively.In this paper,we investigate how the least eigenvalue of A_(α)(G)changes when the graph G is perturbed by deleting a vertex,subdividing edges or moving edges,respectively.展开更多
In this paper,we study the eigenvalue problem of the Markov diffusion operator L^(2),and give generalized inequalities for eigenvalues of the operator L^(2)on a Markov diffusion triple.By applying these inequalities,w...In this paper,we study the eigenvalue problem of the Markov diffusion operator L^(2),and give generalized inequalities for eigenvalues of the operator L^(2)on a Markov diffusion triple.By applying these inequalities,we then get some new universal bounds for eigenvalues of a special Markov diffusion operator L^(2)on bounded domains in an Euclidean space.Moreover,our results can reveal the relationship between the(k+1)-th eigenvalue and the first k eigenvalues in a relatively straightforward manner.展开更多
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.展开更多
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.展开更多
The problem of joint eigenvalue estimation for the non-defective commuting set of matrices A is addressed. A procedure revealing the joint eigenstructure by simultaneous diagonalization of. A with simultaneous Schur d...The problem of joint eigenvalue estimation for the non-defective commuting set of matrices A is addressed. A procedure revealing the joint eigenstructure by simultaneous diagonalization of. A with simultaneous Schur decomposition （SSD） and balance procedure alternately is proposed for performance considerations and also for overcoming the convergence difficulties of previous methods based only on simultaneous Schur form and unitary transformations, it is shown that the SSD procedure can be well incorporated with the balancing algorithm in a pingpong manner, i. e., each optimizes a cost function and at the same time serves as an acceleration procedure for the other. Under mild assumptions, the convergence of the two cost functions alternately optimized, i. e., the norm of A and the norm of the left-lower part of A is proved. Numerical experiments are conducted in a multi-dimensional harmonic retrieval application and suggest that the presented method converges considerably faster than the methods based on only unitary transformation for matrices which are not near to normality.展开更多
In present paper, using some methods of approximation theory, the trace formulas for eigenvalues of a eigenvalue problem are calculated under the periodic condition and the decaying condition at x∞.
This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solve...This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.展开更多
A connected graph G=(V,E)is called a quasi-tree graph if there exists a vertex v0∈V(G)such that G-v0 is a tree.In this paper,we determine all quasi-tree graphs of order n with the second largest signless Laplacian ei...A connected graph G=(V,E)is called a quasi-tree graph if there exists a vertex v0∈V(G)such that G-v0 is a tree.In this paper,we determine all quasi-tree graphs of order n with the second largest signless Laplacian eigenvalue greater than or equal to n-3.As an application,we determine all quasi-tree graphs of order n with the sum of the two largest signless Laplacian eigenvalues greater than to 2 n-5/4.展开更多
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.展开更多
This paper considers one computational method of the eigenvalues approximate value of the horizontal vibration problem of beam. The proof of our main result is based on the variational formula. First of all, Cauchy in...This paper considers one computational method of the eigenvalues approximate value of the horizontal vibration problem of beam. The proof of our main result is based on the variational formula. First of all, Cauchy inequality is used to obtain a basic inequality. Secondly, the functions of basis are made by Galerkin method, and the error estimates of eignevalues are obtained by Cauchy inequality. At last, the computational method of the approximate value of the eigenvalues turns out immediately, and acc...展开更多
In this article, we consider the eigenvalue problem for the bi-Kohn Laplacian and obtain universal bounds on the （k ＋ 1）-th eigenvalue in terms of the first k eigenvalues independent of the domains.
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.展开更多
Machine learning-based modeling of reactor physics problems has attracted increasing interest in recent years.Despite some progress in one-dimensional problems,there is still a paucity of benchmark studies that are ea...Machine learning-based modeling of reactor physics problems has attracted increasing interest in recent years.Despite some progress in one-dimensional problems,there is still a paucity of benchmark studies that are easy to solve using traditional numerical methods albeit still challenging using neural networks for a wide range of practical problems.We present two networks,namely the Generalized Inverse Power Method Neural Network(GIPMNN)and Physics-Constrained GIPMNN(PC-GIPIMNN)to solve K-eigenvalue problems in neutron diffusion theory.GIPMNN follows the main idea of the inverse power method and determines the lowest eigenvalue using an iterative method.The PC-GIPMNN additionally enforces conservative interface conditions for the neutron flux.Meanwhile,Deep Ritz Method(DRM)directly solves the smallest eigenvalue by minimizing the eigenvalue in Rayleigh quotient form.A comprehensive study was conducted using GIPMNN,PC-GIPMNN,and DRM to solve problems of complex spatial geometry with variant material domains from the fleld of nuclear reactor physics.The methods were compared with the standard flnite element method.The applicability and accuracy of the methods are reported and indicate that PC-GIPMNN outperforms GIPMNN and DRM.展开更多
Let A= (aij)∈Cn×n and ri = ∑ j≠i｜aij｜. Suppose thatforeach row of A there isatleastonenonzero off-diagonalentry. Itis proved thatalleigenvalues ofAarecontained in Ω～= ∪aij≠0,i≠j｛z∈C:｜z- aii｜｜z- ...Let A= (aij)∈Cn×n and ri = ∑ j≠i｜aij｜. Suppose thatforeach row of A there isatleastonenonzero off-diagonalentry. Itis proved thatalleigenvalues ofAarecontained in Ω～= ∪aij≠0,i≠j｛z∈C:｜z- aii｜｜z- ajj｜≤rirj｝. The resultre- duces the num berofovals in originalBrauer'stheorem in m any cases. Eigenval- ues(and associated eigenvectors) thatlocate in theboundary ofΩ～ arediscussed.展开更多
基金Supported in part by NSFC(Nos.12401011,12201214)National Key Research and Development Program of China(No.2021YFA1000700)+3 种基金Shaanxi Fundamental Science Research Project for Mathematics and Physics(No.23JSQ053)Science and Technology Program for Youth New Star of Shaanxi Province(No.2025ZC-KJXX-29)Natural Science Basic Research Program of Shaanxi Province(No.2025JC-YBQN-091)Scientific Research Foundation for Young Talents of WNU(No.2024XJ-QNRC-01)。
文摘Let f,g and h be three distinct primitive holomorphic cusp forms of even integral weights k_(1),k_(2)and k_(3)for the full modular groupΓ=SL(2,Z),and denote byλ_(f)(n),λ_(g)(n),λ_(h)(n)the corresponding normalized Fourier coefficients,respectively.In this paper,we investigate the correlations of triple sums associated to these Fourier coefficientsλ_(f)(n),λ_(g)(n),λ_(h)(n)over certain polynomials,and obtain some power-saving asymptotic estimates which beat the trivial bounds.
基金supported by the project Disuguaglianze analitiche e geometriche,funded by the Gruppo per Analisi Matematica la Probabilitàe le loro Applicazioni.
文摘Given an open bounded subset Ω of ℝ^(n) we consider the eigenvalue problem{Δu-(■u,■V)=-λvu,u>0inΩ,u=0 onδΩ,where V is a given function defined inΩandλV is the relevant eigenvalue.We determine sufficient conditions on V such that ifΩis convex,the solution u is log-concave.We also determine sufficient conditions ensuring that λ_(V),as a function of the setΩ,verifies a convexity inequality with respect to the Minkowski addition of sets.
基金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.
基金Supported by the National Natural Science Foundation of China (Grant Nos.1236108412001130)。
文摘This paper is devoted to the Polynomial Preserving Recovery (PPR) based a posteriori error analysis for the second-order elliptic non-symmetric eigenvalue problem. An asymptotically exact a posteriori error estimator is proposed for solving the convection-dominated non-symmetric eigenvalue problem with non-smooth eigenfunctions or multiple eigenvalues. Numerical examples confirm our theoretical analysis.
基金Supported by the National Natural Science Foundation of China(Grant Nos.1207141112171222)the Basic Research Program(Natural Science)of Yancheng(Grant No.YCBK2024043)。
文摘Let G be a simple undirected graph.For any real numberα∈[0,1],Nikiforov defined the A_(α)-matrix of G as A_(α)(G)=αD(G)+(1-α)A(G),where A(G)and D(G)are the adjacency matrix and the degree diagonal matrix of G,respectively.In this paper,we investigate how the least eigenvalue of A_(α)(G)changes when the graph G is perturbed by deleting a vertex,subdividing edges or moving edges,respectively.
基金Supported by the Open Research Fund of Key Laboratory of Nonlinear Analysis and Applications(Central China Normal University),Ministry of Education,P.R.China(Grant No.NAA2025ORG011)Science and Technology Plan Project of Jingmen(Grant No.2024YFZD076)+3 种基金Research Team Project of Jingchu University of Technology(Grant No.TD202006)Research Project of Jingchu University of Technology(Grant Nos.HX20240049HX20240200)the Teaching Reform Research Project of Hubei Province(Grant No.2024496)。
文摘In this paper,we study the eigenvalue problem of the Markov diffusion operator L^(2),and give generalized inequalities for eigenvalues of the operator L^(2)on a Markov diffusion triple.By applying these inequalities,we then get some new universal bounds for eigenvalues of a special Markov diffusion operator L^(2)on bounded domains in an Euclidean space.Moreover,our results can reveal the relationship between the(k+1)-th eigenvalue and the first k eigenvalues in a relatively straightforward manner.
基金Supported by the National Basic Research Program(973 Program)of China(2013CB329402)the National Natural Science Foundation of China(61473215,61472306,61271302,61272282,61272176)
基金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.
基金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.
基金The National Natural Science Foundation of China(No.60572072,60496311),the National High Technology Researchand Development Program of China (863Program ) ( No.2003AA123310),the International Cooperation Project on Beyond 3G Mobile of China (No.2005DFA10360).
文摘The problem of joint eigenvalue estimation for the non-defective commuting set of matrices A is addressed. A procedure revealing the joint eigenstructure by simultaneous diagonalization of. A with simultaneous Schur decomposition （SSD） and balance procedure alternately is proposed for performance considerations and also for overcoming the convergence difficulties of previous methods based only on simultaneous Schur form and unitary transformations, it is shown that the SSD procedure can be well incorporated with the balancing algorithm in a pingpong manner, i. e., each optimizes a cost function and at the same time serves as an acceleration procedure for the other. Under mild assumptions, the convergence of the two cost functions alternately optimized, i. e., the norm of A and the norm of the left-lower part of A is proved. Numerical experiments are conducted in a multi-dimensional harmonic retrieval application and suggest that the presented method converges considerably faster than the methods based on only unitary transformation for matrices which are not near to normality.
文摘In present paper, using some methods of approximation theory, the trace formulas for eigenvalues of a eigenvalue problem are calculated under the periodic condition and the decaying condition at x∞.
基金the National Science and Tech-nology Council,Taiwan for their financial support(Grant Number NSTC 111-2221-E-019-048).
文摘This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.
基金Supported by the National Natural Science Foundation of China(Grant No.11771443)the Fundamental Research Funds for the Central Universities(Grant No.2018BSCXB24)the Postgraduate Research&Practice Innovation Program of Jiangsu Province(Grant No.KYCX18JL980).
文摘A connected graph G=(V,E)is called a quasi-tree graph if there exists a vertex v0∈V(G)such that G-v0 is a tree.In this paper,we determine all quasi-tree graphs of order n with the second largest signless Laplacian eigenvalue greater than or equal to n-3.As an application,we determine all quasi-tree graphs of order n with the sum of the two largest signless Laplacian eigenvalues greater than to 2 n-5/4.
文摘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.
文摘This paper considers one computational method of the eigenvalues approximate value of the horizontal vibration problem of beam. The proof of our main result is based on the variational formula. First of all, Cauchy inequality is used to obtain a basic inequality. Secondly, the functions of basis are made by Galerkin method, and the error estimates of eignevalues are obtained by Cauchy inequality. At last, the computational method of the approximate value of the eigenvalues turns out immediately, and acc...
文摘In this article, we consider the eigenvalue problem for the bi-Kohn Laplacian and obtain universal bounds on the （k ＋ 1）-th eigenvalue in terms of the first k eigenvalues independent of the domains.
文摘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 National Natural Science Foundation of China(No.11971020)Natural Science Foundation of Shanghai(No.23ZR1429300)Innovation Funds of CNNC(Lingchuang Fund)。
文摘Machine learning-based modeling of reactor physics problems has attracted increasing interest in recent years.Despite some progress in one-dimensional problems,there is still a paucity of benchmark studies that are easy to solve using traditional numerical methods albeit still challenging using neural networks for a wide range of practical problems.We present two networks,namely the Generalized Inverse Power Method Neural Network(GIPMNN)and Physics-Constrained GIPMNN(PC-GIPIMNN)to solve K-eigenvalue problems in neutron diffusion theory.GIPMNN follows the main idea of the inverse power method and determines the lowest eigenvalue using an iterative method.The PC-GIPMNN additionally enforces conservative interface conditions for the neutron flux.Meanwhile,Deep Ritz Method(DRM)directly solves the smallest eigenvalue by minimizing the eigenvalue in Rayleigh quotient form.A comprehensive study was conducted using GIPMNN,PC-GIPMNN,and DRM to solve problems of complex spatial geometry with variant material domains from the fleld of nuclear reactor physics.The methods were compared with the standard flnite element method.The applicability and accuracy of the methods are reported and indicate that PC-GIPMNN outperforms GIPMNN and DRM.
文摘Let A= (aij)∈Cn×n and ri = ∑ j≠i｜aij｜. Suppose thatforeach row of A there isatleastonenonzero off-diagonalentry. Itis proved thatalleigenvalues ofAarecontained in Ω～= ∪aij≠0,i≠j｛z∈C:｜z- aii｜｜z- ajj｜≤rirj｝. The resultre- duces the num berofovals in originalBrauer'stheorem in m any cases. Eigenval- ues(and associated eigenvectors) thatlocate in theboundary ofΩ～ arediscussed.
