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.展开更多
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 article studies the Dirichlet eigenvalue problem for the Laplacian equations △u = -λu, x ∈Ω , u = 0, x ∈δΩ, where Ω belong to R^n is a smooth bounded convex domain. By using the method of appropriate barr...This article studies the Dirichlet eigenvalue problem for the Laplacian equations △u = -λu, x ∈Ω , u = 0, x ∈δΩ, where Ω belong to R^n is a smooth bounded convex domain. By using the method of appropriate barrier function combined with the maximum principle, authors obtain a sharp lower bound of the difference of the first two eigenvalues for the Dirichlet eigenvalue problem. This study improves the result of S.T. Yau et al.展开更多
Direct numerical simulations are carried out with different disturbance forms introduced into the inlet of a flat plate boundary layer with the Mach number 4.5. According to the biorthogonal eigenfunction system of th...Direct numerical simulations are carried out with different disturbance forms introduced into the inlet of a flat plate boundary layer with the Mach number 4.5. According to the biorthogonal eigenfunction system of the linearized Navier-Stokes equations and the adjoint equations, the decomposition of the direct numerical simulation results into the discrete normal mode is easily realized. The decomposition coefficients can be solved by doing the inner product between the numerical results and the eigenfunctions of the adjoint equations. For the quadratic polynomial eigenvalue problem, the inner product operator is given in a simple form, and it is extended to an Nth-degree polynomial eigenvalue problem. The examples illustrate that the simplified mode decomposition is available to analyze direct numerical simulation results.展开更多
In this paper,we first propose a new stabilized finite element method for the Stokes eigenvalue problem.This new method is based on multiscale enrichment,and is derived from the Stokes eigenvalue problem itself.The co...In this paper,we first propose a new stabilized finite element method for the Stokes eigenvalue problem.This new method is based on multiscale enrichment,and is derived from the Stokes eigenvalue problem itself.The convergence of this new stabilized method is proved and the optimal priori error estimates for the eigenfunctions and eigenvalues are also obtained.Moreover,we combine this new stabilized finite element method with the two-level method to give a new two-level stabilized finite element method for the Stokes eigenvalue problem.Furthermore,we have proved a priori error estimates for this new two-level stabilized method.Finally,numerical examples confirm our theoretical analysis and validate the high effectiveness of the new methods.展开更多
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.展开更多
A two-level stabilized finite element method for the Stokes eigenvalue problem based on the local Gauss integration is considered. This method involves solving a Stokes eigenvalue problem on a coarse mesh with mesh si...A two-level stabilized finite element method for the Stokes eigenvalue problem based on the local Gauss integration is considered. This method involves solving a Stokes eigenvalue problem on a coarse mesh with mesh size H and a Stokes problem on a fine mesh with mesh size h -- O(H2), which can still maintain the asymptotically optimal accuracy. It provides an approximate solution with the convergence rate of the same order as the usual stabilized finite element solution, which involves solving a Stokes eigenvalue problem on a fine mesh with mesh size h. Hence, the two-level stabilized finite element method can save a large amount of computational time. Moreover, numerical tests confirm the theoretical results of the present method.展开更多
In this paper, we investigate the eigenvalue problem of forward-backward doubly stochastic dii^erential equations with boundary value conditions. We show that this problem can be represented as an eigenvalue problem o...In this paper, we investigate the eigenvalue problem of forward-backward doubly stochastic dii^erential equations with boundary value conditions. We show that this problem can be represented as an eigenvalue problem of a bounded continuous compact operator. Hence using the famous Hilbert-Schmidt spectrum theory, we can characterize the eigenvalues exactly.展开更多
The uniqueness theorem and the theorem of reciprocity in the linearized porous piezoelectricity are established under the assumption of positive definiteness of elastic and electric fields. General theorems in the lin...The uniqueness theorem and the theorem of reciprocity in the linearized porous piezoelectricity are established under the assumption of positive definiteness of elastic and electric fields. General theorems in the linear theory of porous piezoelectric materials are proved for the quasi-static electric field approximation. The uniqueness theorem is also proved without using the positive definiteness of the elastic field. An eigenvalue problem associated with free vibrations of a porous piezoelectric body is stud- ied using the abstract formulation. Some properties of operators are also proved. The problem of frequency shift due to small disturbances, based on an abstract formulation, is studied using a variational and operator approach. A perturbation analysis of a special ease is also given.展开更多
A new matrix perturbation analysis method is presented for efficient approximate solution of the complex modal quadratic generalized eigenvalue problem of viscously damped linear vibration systems. First, the damping ...A new matrix perturbation analysis method is presented for efficient approximate solution of the complex modal quadratic generalized eigenvalue problem of viscously damped linear vibration systems. First, the damping matrix is decomposed into the sum of a proportional-and a nonproportional-damping parts, and the solutions of the real modal eigenproblem with the proportional dampings are determined, which are a set of initial approximate solutions of the complex modal eigenproblem. Second, by taking the nonproportional-damping part as a small modification to the proportional one and using the matrix perturbation analysis method, a set of approximate solutions of the complex modal eigenvalue problem can be obtained analytically. The result is quite simple. The new method is applicable to the systems with viscous dampings-which do not deviate far away from the proportional-damping case. It is particularly important that the solution technique be also effective to the systems with heavy, but not over, dampings. The solution formulas of complex modal eigenvlaues and eigenvectors are derived up to second-order perturbation terms. The effectiveness of the perturbation algorithm is illustrated by an exemplar numerical problem with heavy dampings. In addition, the practicability of approximately estimating the complex modal eigenvalues, under the proportional-damping hypothesis, of damped vibration systems is discussed by several numerical examples.展开更多
In this article, we focus on the eigenvalue problem of the following linear biharmonic equation in R^N:△^2u-αu+λg(x)u=0 with u ∈H^2(R^N),u≠0,N≥5Note that there are two parameters α and λ in it, which is ...In this article, we focus on the eigenvalue problem of the following linear biharmonic equation in R^N:△^2u-αu+λg(x)u=0 with u ∈H^2(R^N),u≠0,N≥5Note that there are two parameters α and λ in it, which is different from the usual eigenvalue problems. Here, we consider λ as an eigenvalue and seek Ior a sulble range of parameter α, which ensures that problem (*) has a maximal eigenvalue. As the loss of strong maximum principle for our problem, we can only get the existence of non-trivial solutions, not positive solutions, in this article. As an application, by using these results, we studied also the existence of non-trivial solutions for an asymptotically linear biharmonic equation in R^N.展开更多
The dynamic analysis of damped structural system by using finite element method leads to nonlinear eigenvalue problem(NEP)(particularly,quadratic eigenvalue problem).In general,the parameters of NEP are considered as ...The dynamic analysis of damped structural system by using finite element method leads to nonlinear eigenvalue problem(NEP)(particularly,quadratic eigenvalue problem).In general,the parameters of NEP are considered as exact values.But in actual practice because of different errors and incomplete information,the parameters may have uncertain or vague values and such uncertain values may be considered in terms of fuzzy numbers.This article proposes an efficient fuzzy-affine approach to solve fully fuzzy nonlinear eigenvalue problems(FNEPs)where involved parameters are fuzzy numbers viz.triangular and trapezoidal.Based on the parametric form,fuzzy numbers have been transformed into family of standard intervals.Further due to the presence of interval overestimation problem in standard interval arithmetic,affine arithmetic based approach has been implemented.In the proposed method,the FNEP has been linearized into a generalized eigenvalue problem and further solved by using the fuzzy-affine approach.Several application problems of structures and also general NEPs with fuzzy parameters are investigated based on the proposed procedure.Lastly,fuzzy eigenvalue bounds are illustrated with fuzzy plots with respect to its membership function.Few comparisons are also demonstrated to show the reliability and efficacy of the present approach.展开更多
The main aim of this paper is to discuss the following two problems: Problem I: Given X ∈ Hn×m (the set of all n×m quaternion matrices), A = diag(λ1,…, λm) EEEEE Hm×m, find A ∈ BSHn×n≥such th...The main aim of this paper is to discuss the following two problems: Problem I: Given X ∈ Hn×m (the set of all n×m quaternion matrices), A = diag(λ1,…, λm) EEEEE Hm×m, find A ∈ BSHn×n≥such that AX = X(?), where BSHn×n≥ denotes the set of all n×n quaternion matrices which are bi-self-conjugate and nonnegative definite. Problem Ⅱ2= Given B ∈ Hn×m, find B ∈ SE such that ||B-B||Q = minAE∈=sE ||B-A||Q, where SE is the solution set of problem I , || ·||Q is the quaternion matrix norm. The necessary and sufficient conditions for SE being nonempty are obtained. The general form of elements in SE and the expression of the unique solution B of problem Ⅱ are given.展开更多
In this article, multiple solutions for the eigenvalue problem of nonlinear fractional differential equation is considered. We obtain the existence and multiplicity results of positive solutions by using some fixed po...In this article, multiple solutions for the eigenvalue problem of nonlinear fractional differential equation is considered. We obtain the existence and multiplicity results of positive solutions by using some fixed point theorems.展开更多
Based on Arnoldi's method, a version of generalized Arnoldi algorithm has been developed for the reduction of gyroscopic eigenvalue problems. By utilizing the skew symmetry of system matrix, a very simple recurren...Based on Arnoldi's method, a version of generalized Arnoldi algorithm has been developed for the reduction of gyroscopic eigenvalue problems. By utilizing the skew symmetry of system matrix, a very simple recurrence scheme, named gyroscopic Arnoldi reduction algorithm has been obtained, which is even simpler than the Lanczos algorithm for symmetric eigenvalue problems. The complex number computation is completely avoided. A restart technique is used to enable the reduction algorithm to have iterative characteristics. It has been found that the restart technique is not only effective for the convergence of multiple eigenvalues but it also furnishes the reduction algorithm with a technique to check and compute missed eigenvalues. By combining it with the restart technique, the algorithm is made practical for large-scale gyroscopic eigenvalue problems. Numerical examples are given to demonstrate the effectiveness of the method proposed.展开更多
In(relativistic)electronic structure methods,the quaternion matrix eigenvalue problem and the linear response(Bethe-Salpeter)eigenvalue problem for excitation energies are two frequently encoun-tered structured eigenv...In(relativistic)electronic structure methods,the quaternion matrix eigenvalue problem and the linear response(Bethe-Salpeter)eigenvalue problem for excitation energies are two frequently encoun-tered structured eigenvalue problems.While the former problem was thoroughly studied,the later problem in its most general form,namely,the complex case without assuming the positive definiteness of the electronic Hessian,was not fully understood.In view of their very similar mathematical structures,we examined these two problems from a unified point of view.We showed that the identification of Lie group structures for their eigenvectors provides a framework to design diagonalization algorithms as well as numerical optimizations techniques on the corresponding manifolds.By using the same reduction algorithm for the quaternion matrix eigenvalue problem,we provided a necessary and sufficient condition to characterize the different scenarios,where the eigenvalues of the original linear response eigenvalue problem are real,purely imaginary,or complex.The result can be viewed as a natural generalization of the well-known condition for the real matrix case.展开更多
is gained by deleting the k<sup>th</sup> row and the k<sup>th</sup> column (k=1,2,...,n) from T<sub>n</sub>.We put for-ward an inverse eigenvalue problem to be that:If we don’t k...is gained by deleting the k<sup>th</sup> row and the k<sup>th</sup> column (k=1,2,...,n) from T<sub>n</sub>.We put for-ward an inverse eigenvalue problem to be that:If we don’t know the matrix T<sub>1,n</sub>,but weknow all eigenvalues of matrix T<sub>1,k-1</sub>,all eigenvalues of matrix T<sub>k+1,k</sub>,and all eigenvaluesof matrix T<sub>1,n</sub> could we construct the matrix T<sub>1,n</sub>.Let μ<sub>1</sub>,μ<sub>2</sub>,…,μ<sub>k-1</sub>,μ<sub>k</sub>,μ<sub>k+1</sub>,…,μ<sub>n-1</sub>,展开更多
In this paper we first consider the existence and the general form of solution to the following generalized inverse eigenvalue problem(GIEP): given a set of n-dimension complex vectors {x j}m j=1 and a set of co...In this paper we first consider the existence and the general form of solution to the following generalized inverse eigenvalue problem(GIEP): given a set of n-dimension complex vectors {x j}m j=1 and a set of complex numbers {λ j}m j=1, find two n×n centrohermitian matrices A,B such that {x j}m j=1 and {λ j}m j=1 are the generalized eigenvectors and generalized eigenvalues of Ax=λBx, respectively. We then discuss the optimal approximation problem for the GIEP. More concretely, given two arbitrary matrices, , ∈C n×n, we find two matrices A and B such that the matrix (A*,B*) is closest to (,) in the Frobenius norm, where the matrix (A*,B*) is the solution to the GIEP. We show that the expression of the solution of the optimal approximation is unique and derive the expression for it.展开更多
The inverse design method of a dynamic system with linear parameters has been studied. For some specified eigenvalues and eigenvectors, the design parameter vector which is often composed of whole or part of coefficie...The inverse design method of a dynamic system with linear parameters has been studied. For some specified eigenvalues and eigenvectors, the design parameter vector which is often composed of whole or part of coefficients of spring and mass of the system can be obtained and the rigidity and mass matrices of an initially designed structure can be reconstructed through solving linear algebra equations. By using implicit function theorem, the conditions of existence and uniqueness of the solution are also deduced. The theory and method can be used for inverse vibration design of complex structure system.展开更多
This paper considers an eigenvalue problem containing small stochastic processes. For every fixed is, we can use the Prufer substitution to prove the existence of the random solutions lambda(n) and u(n) in the meaning...This paper considers an eigenvalue problem containing small stochastic processes. For every fixed is, we can use the Prufer substitution to prove the existence of the random solutions lambda(n) and u(n) in the meaning of large probability. These solutions can be expanded in epsilon regularly, and their correction terms can be obtained by solving some random linear differential equations.展开更多
基金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.
文摘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 research was supported by the National Natural Science Foundation of Chinathe Scientific Research Foundation of the Ministry of Education of China (02JA790014)+1 种基金the Natural Science Foundation of Fujian Province Education Department(JB00078)the Developmental Foundation of Science and Technology of Fuzhou University (2004-XQ-16)
文摘This article studies the Dirichlet eigenvalue problem for the Laplacian equations △u = -λu, x ∈Ω , u = 0, x ∈δΩ, where Ω belong to R^n is a smooth bounded convex domain. By using the method of appropriate barrier function combined with the maximum principle, authors obtain a sharp lower bound of the difference of the first two eigenvalues for the Dirichlet eigenvalue problem. This study improves the result of S.T. Yau et al.
基金supported by the National Natural Science Foundation of China(Nos.1133200711202147+2 种基金and 9216111)the Specialized Research Fund for the Doctoral Program of Higher Education(No.20120032120007)the Open Fund from State Key Laboratory of Aerodynamics(Nos.SKLA201201 and SKLA201301)
文摘Direct numerical simulations are carried out with different disturbance forms introduced into the inlet of a flat plate boundary layer with the Mach number 4.5. According to the biorthogonal eigenfunction system of the linearized Navier-Stokes equations and the adjoint equations, the decomposition of the direct numerical simulation results into the discrete normal mode is easily realized. The decomposition coefficients can be solved by doing the inner product between the numerical results and the eigenfunctions of the adjoint equations. For the quadratic polynomial eigenvalue problem, the inner product operator is given in a simple form, and it is extended to an Nth-degree polynomial eigenvalue problem. The examples illustrate that the simplified mode decomposition is available to analyze direct numerical simulation results.
基金supported by the National Key R&D Program of China(2018YFB1501001)the NSF of China(11771348)China Postdoctoral Science Foundation(2019M653579)。
文摘In this paper,we first propose a new stabilized finite element method for the Stokes eigenvalue problem.This new method is based on multiscale enrichment,and is derived from the Stokes eigenvalue problem itself.The convergence of this new stabilized method is proved and the optimal priori error estimates for the eigenfunctions and eigenvalues are also obtained.Moreover,we combine this new stabilized finite element method with the two-level method to give a new two-level stabilized finite element method for the Stokes eigenvalue problem.Furthermore,we have proved a priori error estimates for this new two-level stabilized method.Finally,numerical examples confirm our theoretical analysis and validate the high effectiveness of the new methods.
基金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.
基金Project supported by the National Natural Science Foundation of China(Nos.10901131,10971166, and 10961024)the National High Technology Research and Development Program of China (No.2009AA01A135)the Natural Science Foundation of Xinjiang Uygur Autonomous Region (No.2010211B04)
文摘A two-level stabilized finite element method for the Stokes eigenvalue problem based on the local Gauss integration is considered. This method involves solving a Stokes eigenvalue problem on a coarse mesh with mesh size H and a Stokes problem on a fine mesh with mesh size h -- O(H2), which can still maintain the asymptotically optimal accuracy. It provides an approximate solution with the convergence rate of the same order as the usual stabilized finite element solution, which involves solving a Stokes eigenvalue problem on a fine mesh with mesh size h. Hence, the two-level stabilized finite element method can save a large amount of computational time. Moreover, numerical tests confirm the theoretical results of the present method.
基金The NSF (10601019 and J0630104) of ChinaChinese Postdoctoral Science Foundation and 985 Program of Jilin University.
文摘In this paper, we investigate the eigenvalue problem of forward-backward doubly stochastic dii^erential equations with boundary value conditions. We show that this problem can be represented as an eigenvalue problem of a bounded continuous compact operator. Hence using the famous Hilbert-Schmidt spectrum theory, we can characterize the eigenvalues exactly.
基金the University Grant Commission for providing the financial support for this work (No. 8(42)/2010 (MRP/NRCB))
文摘The uniqueness theorem and the theorem of reciprocity in the linearized porous piezoelectricity are established under the assumption of positive definiteness of elastic and electric fields. General theorems in the linear theory of porous piezoelectric materials are proved for the quasi-static electric field approximation. The uniqueness theorem is also proved without using the positive definiteness of the elastic field. An eigenvalue problem associated with free vibrations of a porous piezoelectric body is stud- ied using the abstract formulation. Some properties of operators are also proved. The problem of frequency shift due to small disturbances, based on an abstract formulation, is studied using a variational and operator approach. A perturbation analysis of a special ease is also given.
文摘A new matrix perturbation analysis method is presented for efficient approximate solution of the complex modal quadratic generalized eigenvalue problem of viscously damped linear vibration systems. First, the damping matrix is decomposed into the sum of a proportional-and a nonproportional-damping parts, and the solutions of the real modal eigenproblem with the proportional dampings are determined, which are a set of initial approximate solutions of the complex modal eigenproblem. Second, by taking the nonproportional-damping part as a small modification to the proportional one and using the matrix perturbation analysis method, a set of approximate solutions of the complex modal eigenvalue problem can be obtained analytically. The result is quite simple. The new method is applicable to the systems with viscous dampings-which do not deviate far away from the proportional-damping case. It is particularly important that the solution technique be also effective to the systems with heavy, but not over, dampings. The solution formulas of complex modal eigenvlaues and eigenvectors are derived up to second-order perturbation terms. The effectiveness of the perturbation algorithm is illustrated by an exemplar numerical problem with heavy dampings. In addition, the practicability of approximately estimating the complex modal eigenvalues, under the proportional-damping hypothesis, of damped vibration systems is discussed by several numerical examples.
基金supported by the National Science Foundation of China (11071245)
文摘In this article, we focus on the eigenvalue problem of the following linear biharmonic equation in R^N:△^2u-αu+λg(x)u=0 with u ∈H^2(R^N),u≠0,N≥5Note that there are two parameters α and λ in it, which is different from the usual eigenvalue problems. Here, we consider λ as an eigenvalue and seek Ior a sulble range of parameter α, which ensures that problem (*) has a maximal eigenvalue. As the loss of strong maximum principle for our problem, we can only get the existence of non-trivial solutions, not positive solutions, in this article. As an application, by using these results, we studied also the existence of non-trivial solutions for an asymptotically linear biharmonic equation in R^N.
文摘The dynamic analysis of damped structural system by using finite element method leads to nonlinear eigenvalue problem(NEP)(particularly,quadratic eigenvalue problem).In general,the parameters of NEP are considered as exact values.But in actual practice because of different errors and incomplete information,the parameters may have uncertain or vague values and such uncertain values may be considered in terms of fuzzy numbers.This article proposes an efficient fuzzy-affine approach to solve fully fuzzy nonlinear eigenvalue problems(FNEPs)where involved parameters are fuzzy numbers viz.triangular and trapezoidal.Based on the parametric form,fuzzy numbers have been transformed into family of standard intervals.Further due to the presence of interval overestimation problem in standard interval arithmetic,affine arithmetic based approach has been implemented.In the proposed method,the FNEP has been linearized into a generalized eigenvalue problem and further solved by using the fuzzy-affine approach.Several application problems of structures and also general NEPs with fuzzy parameters are investigated based on the proposed procedure.Lastly,fuzzy eigenvalue bounds are illustrated with fuzzy plots with respect to its membership function.Few comparisons are also demonstrated to show the reliability and efficacy of the present approach.
基金This work is supported by the NSF of China (10471039, 10271043) and NSF of Zhejiang Province (M103087).
文摘The main aim of this paper is to discuss the following two problems: Problem I: Given X ∈ Hn×m (the set of all n×m quaternion matrices), A = diag(λ1,…, λm) EEEEE Hm×m, find A ∈ BSHn×n≥such that AX = X(?), where BSHn×n≥ denotes the set of all n×n quaternion matrices which are bi-self-conjugate and nonnegative definite. Problem Ⅱ2= Given B ∈ Hn×m, find B ∈ SE such that ||B-B||Q = minAE∈=sE ||B-A||Q, where SE is the solution set of problem I , || ·||Q is the quaternion matrix norm. The necessary and sufficient conditions for SE being nonempty are obtained. The general form of elements in SE and the expression of the unique solution B of problem Ⅱ are given.
文摘In this article, multiple solutions for the eigenvalue problem of nonlinear fractional differential equation is considered. We obtain the existence and multiplicity results of positive solutions by using some fixed point theorems.
基金This research is supported by The National Science FoundationThe Doctoral Training Foundation
文摘Based on Arnoldi's method, a version of generalized Arnoldi algorithm has been developed for the reduction of gyroscopic eigenvalue problems. By utilizing the skew symmetry of system matrix, a very simple recurrence scheme, named gyroscopic Arnoldi reduction algorithm has been obtained, which is even simpler than the Lanczos algorithm for symmetric eigenvalue problems. The complex number computation is completely avoided. A restart technique is used to enable the reduction algorithm to have iterative characteristics. It has been found that the restart technique is not only effective for the convergence of multiple eigenvalues but it also furnishes the reduction algorithm with a technique to check and compute missed eigenvalues. By combining it with the restart technique, the algorithm is made practical for large-scale gyroscopic eigenvalue problems. Numerical examples are given to demonstrate the effectiveness of the method proposed.
基金supported by the National Natural Science Foundation of China (No.21973003)the Beijing Normal University Startup Package
文摘In(relativistic)electronic structure methods,the quaternion matrix eigenvalue problem and the linear response(Bethe-Salpeter)eigenvalue problem for excitation energies are two frequently encoun-tered structured eigenvalue problems.While the former problem was thoroughly studied,the later problem in its most general form,namely,the complex case without assuming the positive definiteness of the electronic Hessian,was not fully understood.In view of their very similar mathematical structures,we examined these two problems from a unified point of view.We showed that the identification of Lie group structures for their eigenvectors provides a framework to design diagonalization algorithms as well as numerical optimizations techniques on the corresponding manifolds.By using the same reduction algorithm for the quaternion matrix eigenvalue problem,we provided a necessary and sufficient condition to characterize the different scenarios,where the eigenvalues of the original linear response eigenvalue problem are real,purely imaginary,or complex.The result can be viewed as a natural generalization of the well-known condition for the real matrix case.
基金Project 19771020 supported by National Science Foundation of China
文摘is gained by deleting the k<sup>th</sup> row and the k<sup>th</sup> column (k=1,2,...,n) from T<sub>n</sub>.We put for-ward an inverse eigenvalue problem to be that:If we don’t know the matrix T<sub>1,n</sub>,but weknow all eigenvalues of matrix T<sub>1,k-1</sub>,all eigenvalues of matrix T<sub>k+1,k</sub>,and all eigenvaluesof matrix T<sub>1,n</sub> could we construct the matrix T<sub>1,n</sub>.Let μ<sub>1</sub>,μ<sub>2</sub>,…,μ<sub>k-1</sub>,μ<sub>k</sub>,μ<sub>k+1</sub>,…,μ<sub>n-1</sub>,
文摘In this paper we first consider the existence and the general form of solution to the following generalized inverse eigenvalue problem(GIEP): given a set of n-dimension complex vectors {x j}m j=1 and a set of complex numbers {λ j}m j=1, find two n×n centrohermitian matrices A,B such that {x j}m j=1 and {λ j}m j=1 are the generalized eigenvectors and generalized eigenvalues of Ax=λBx, respectively. We then discuss the optimal approximation problem for the GIEP. More concretely, given two arbitrary matrices, , ∈C n×n, we find two matrices A and B such that the matrix (A*,B*) is closest to (,) in the Frobenius norm, where the matrix (A*,B*) is the solution to the GIEP. We show that the expression of the solution of the optimal approximation is unique and derive the expression for it.
基金Science Developing Plan of Beijing Educational Committee, Beijing Natural Science Fund (No. 3022003), and NationalNatural Science Fund of China(No.50375002)
文摘The inverse design method of a dynamic system with linear parameters has been studied. For some specified eigenvalues and eigenvectors, the design parameter vector which is often composed of whole or part of coefficients of spring and mass of the system can be obtained and the rigidity and mass matrices of an initially designed structure can be reconstructed through solving linear algebra equations. By using implicit function theorem, the conditions of existence and uniqueness of the solution are also deduced. The theory and method can be used for inverse vibration design of complex structure system.
文摘This paper considers an eigenvalue problem containing small stochastic processes. For every fixed is, we can use the Prufer substitution to prove the existence of the random solutions lambda(n) and u(n) in the meaning of large probability. These solutions can be expanded in epsilon regularly, and their correction terms can be obtained by solving some random linear differential equations.