THE EIGENVALUE PROBLEM EQUIVALENT TO MULTIVARIATE POLYNOMIAL SYSTEM

In this paper, the authors proved that finding all solutions of a given multivariate polynomial system is equivalent to solving a relative joint eigenvalue problem(Theorem 1) and in some cases one can find all solutions of the given system from the eigenvalues and vectors of one matrix or matrix pencil (Theorem 2). Especially the situation that the ideal generated by the given system is 0-dimensional is discussed.     

Convergence of algorithms for finding eigenvectors

1. IntroductionMethods for finding eigenvectors and eigenvalues of a matrix have importallt applications in colltrol theory, pattern recognition, signal processing and many other fields. Withthese applications the computational methods themselves have been developing rapidly. See[1--4] for some developments.For a square matriX of order n, when n is sufficiently large, it is very difficult to findits eigenvalues directly and one usually uses methods of iteration. Esseniiajly, we can evensac th…     

一类多项式型迭代函数方程在共振点附近的解析解

In this paper existence of local analytic solutions of a polynomial-like iterative functional equation is studied. As well as in previous work, we reduce this problem with the SchrSder transformation to finding analytic solutions of a functional equation without iteration of the unknown function f. For technical reasons, in previous work the constant α given in the Schroder transformation, i.e., the eigenvalue of the linearized f at its fixed point O, is required to fulfill that α is off the unit circle S^1 or lies on the circle with the Diophantine condition. In this paper, we obtain results of analytic solutions in the case of α at resonance, i.e., at a root of the unity and the case of α near resonance under the Brjuno condition.     

A DIRECT METHOD FOR THE UNIT CIRCLE PROBLEM

The unit circle problem is the problem of finding the number of eigenvalues of a non-Hermitian matrix inside and outside the unit circle . To reduce the cost of computing eigenvalues for the problem, a direct method, which is analogous to that given in [5], is proposed in this paper.     

Improvement of Hartman''''s linearization theorem

Hartman's linearization theorem tells us that if matrix A has no zero real part and f(x) is bounded and satisfies Lipchitz condition with small Lipchitzian constant, then there exists a homeomorphism of Rn sending the solutions of nonlinear system x' = Ax + f(x) onto the solutions of linear system x = Ax. In this paper, some components of the nonlinear item f(x) are permitted to be unbounded and we prove the result of global topological linearization without any special limitation and adding any condition. Thus, Hartman's linearization theorem is improved essentially.     

SIGN MATRIX, REGULAR SPLITTINGS AND MONOTONIC ENCLOSURE OF SOLUTIONS FOR NONLINEAR SYSTEM OF EQUATIONS, PARTI

In this paper we introduce the sign matrix of a nonlinear system of equations x = Gx to characterize its hybrid and asynchronous monotonicity as well as convexity. Based on the configuration of the matrix, we define a new type of regular splittings of the system with which the solvability and construction of solutions for the system are transformed to those of the couple systems of the splitting formIt is shown that this couple systems is a general model for developing monotonic enclosure methods of solutions for various types of nonlinear system of equations.     

THE SPACES OF CESARO ALMOST CONVERGENT SEQUENCES AND CORE THEOREMB

As known,the method to obtain a sequence space by using convergence field of an infinite matrix is an old method in the theory of sequence spaces.However,the study of convergence field of an infinite matrix in the space of almost convergent sequences is so new(see [15]).The purpose of this paper is to introduce the new spaces f and f0 consisting of all sequences whose Cesa`ro transforms of order one are in the spaces f and f0,respectively.Also,in this paper,we show that f and f0 are linearly isomorphic to the spaces f and f0,respectively.The β-and γ-duals of the spaces f and f0 are computed.Furthermore,the classes(f:) and(:f) of infinite matrices are characterized for any given sequence space,and determined the necessary and sufficient conditions on a matrix A to satisfy BC-core(Ax) K-core(x),K-core(Ax) BC-core(x),BC-core(Ax) BC-core(x),BC-core(Ax) st-core(x) for all x ∈∞.     

On the isentropic approximation to two-dimension isothermal Euler system

In this paper we mainly study the difference between the weak solutions generated by a wave front tracking algorithm to isentropic and non-isentropic isothermal Euler system of steady supersonic flow. Under the hypothesis that the initial data are of sufficiently small total variation, we prove that the difference between solutions to isentropic and non-isentropic isothermal Euler system of steady supersonic flow can be bounded by the cube of the total variation of the initial perturbation.     

Maximum likelihood character of distributions

In this paper,some distributions in the family of those with invariance under orthogonaltransformations within an s-dimensional linear subspace are characterized by maximun likelihoodcriteria.Specially,the main result is:suppose P_v is a projection matrix of a given s-dimensionalsubspace V,and x_1,…,x_n are i.i.d.samples drawn from a population with a pdf f(x′P_vx),wheref(·) is a positive and continuously differentiable function.Then P_v(M_n) is the maximum likelihoodestimator of P_v ifff(x)=c_kexp(kx) (k>0),where M_n=sum from i=1 to n x_ix′_i,P_v(M_n)=sum from i=1 to (?) (?)_i(?)′_t,λ_1,…,λ_(?) are the first s largest eigenvalues of matrix M_n,and(?)_1,…,(?)_(?) are their associated eigenvectors.     

ON MONOTONE METHOD FOR NONLINEAR REACTION-DIFFUSION SYSTEM

If we knew the existence of upper and lower solutions u, v of a coupled reaction-diffusion system with quasi-monotone nonlinear reaction functions, then we can prove the existence of a solution ω of the same system such that u<ω相似文献   

A Constrained Optimization Approach for LCP

In this paper, LCP is converted to an equivalent nonsmooth nonlinear equation system H(x,y) = 0 by using the famous NCP function-Fischer-Burmeister function. Note that some equations in H(x, y) = 0 are nonsmooth and nonlinear hence difficult to solve while the others are linear hence easy to solve. Then we further convert the nonlinear equation system H(x, y) = 0 to an optimization problem with linear equality constraints. After that we study the conditions under which the K-T points of the optimization problem are the solutions of the original LCP and propose a method to solve the optimization problem. In this algorithm, the search direction is obtained by solving a strict convex programming at each iterative point, However, our algorithm is essentially different from traditional SQP method. The global convergence of the method is proved under mild conditions. In addition, we can prove that the algorithm is convergent superlinearly under the conditions: M is P0 matrix and the limit point is a strict complementarity solution of LCP. Preliminary numerical experiments are reported with this method.     

Orthogonal separable Hamiltonian systems on T~2

In this paper we characterize the Liouvillian integrable orthogonal separable Hamiltonian systems on T~2 for a given metric,and prove that the Hamiltonian flow on any compact level hypersurface has zero topological entropy.Furthermore,by examples we show that the integrable Hamiltonian systems on T~2 can have complicated dynamical phenomena.For instance they can have several families of invariant tori,each family is bounded by the homoclinic-loop-like cylinders and heteroclinic-loop-like cylinders.As we know,it is the first concrete example to present the families of invariant tori at the same time appearing in such a complicated way.     

Conformally flat Lorentzian hypersurfaces in R_1~4 with three distinct principal curvatures

A three dimensional Lorentzian hypersurface x : M_1~3→ R_1~4 is called conformally flat if its induced metric is conformal to the flat Lorentzian metric, and this property is preserved under the conformal transformation of R_1~4. Using the projective light-cone model, for those whose shape operators have three distinct real eigenvalues, we calculate the integrability conditions by constructing a scalar conformal invariant and a canonical moving frame in this paper. Similar to the Riemannian case, these hypersurfaces can be determined by the solutions to some system of partial differential equations.     

PERIODIC SOLUTIONS AND ALMOST PERIODIC SOLUTIONS OF A NONAUTONOMOUS PREDATOR-PREY SYSTEM WITH STAGE-STRUCTURE AND DELAY

In this paper, by using the comparing theorem, Razumikhin-type theorem and V-function method, we consider a nonautonomous predator-prey system with stage-structure and time-delay. We get the sufficient conditions for the uniform persistence and the solutions global attractivity of this system. For a periodic system, we obtain the existence and uniqueness of a positive periodic solution of this system. For an almost periodic system, we prove the existence and the uniform asymptotic stability of the almost periodic solutions of this system.     

ON THE ACCURACY OF THE LEAST SQUARES AND THE TOTAL LEAST SQUARES METHODS

Consider solving an overdetermined system of linear algebraic equations by both the least squares method (LS) and the total least squares method (TLS). Extensive published computational evidence shows that when the original system is consistent. one often obtains more accurate solutions by using the TLS method rather than the LS method. These numerical observations contrast with existing analytic perturbation theories for the LS and TLS methods which show that the upper bounds for the LS solution are always smaller than the corresponding upper bounds for the TLS solutions. In this paper we derive a new upper bound for the TLS solution and indicate when the TLS method can be more accurate than the LS method.Many applied problems in signal processing lead to overdetermined systems of linear equations where the matrix and right hand side are determined by the experimental observations (usually in the form of a lime series). It often happens that as the number of columns of the matrix becomes larger, the ra     

BLOCK-SYMMETRIC AND BLOCK-LOWER-TRIANGULAR PRECONDITIONERS FOR PDE-CONSTRAINED OPTIMIZATION PROBLEMS＊

Optimization problems with partial differential equations as constraints arise widely in many areas of science and engineering, in particular in problems of the design. The solution of such class of PDE-constrained optimization problems is usually a major computational task. Because of the complexion for directly seeking the solution of PDE-constrained op- timization problem, we transform it into a system of linear equations of the saddle-point form by using the Galerkin finite-element discretization. For the discretized linear system, in this paper we construct a block-symmetric and a block-lower-triangular preconditioner, for solving the PDE-constrained optimization problem. Both preconditioners exploit the structure of the coefficient matrix. The explicit expressions for the eigenvalues and eigen- vectors of the corresponding preconditioned matrices are derived. Numerical implementa- tions show that these block preconditioners can lead to satisfactory experimental results for the preconditioned GMRES methods when the regularization parameter is suitably small.     

Riemann boundary value problems and reflection of shock for the Chaplygin gas

In this paper,we study two-dimensional Riemann boundary value problems of Euler system for the isentropic and irrotational Chaplygin gas with initial data being two constant states given in two sectors respectively,where one sector is a quadrant and the other one has an acute vertex angle.We prove that the Riemann boundary value problem admits a global self-similar solution,if either the initial states are close,or the smaller sector is also near a quadrant.Our result can be applied to solving the problem of shock reflection by a ramp.     

DERIVATIVES OF EIGENPAIRS OF SYMMETRIC QUADRATIC EIGENVALUE PROBLEM

Derivatives of eigenvalues and eigenvectors with respect to parameters in symmetric quadratic eigenvalue problem are studied. The first and second order derivatives of eigenpairs are given. The derivatives are calculated in terms of the eigenvalues and eigenvectors of the quadratic eigenvalue problem, and the use of state space representation is avoided, hence the cost of computation is greatly reduced. The efficiency of the presented method is demonstrated by considering a spring-mass-damper system.     

A New Approach to Synchronization Analysis of Linearly Coupled Map Lattices

In this paper, a new approach to analyze synchronization of linearly coupled map lattices (LCMLs) is presented. A reference vector x(t) is introduced as the projection of the trajectory of the coupled system on the synchronization manifold. The stability analysis of the synchronization manifold can be regarded as investigating the difference between the trajectory and the projection. By this method, some criteria are given for both local and global synchronization. These criteria indicate that the left and right eigenvectors corresponding to the eigenvalue "0" of the coupling matrix play key roles in the stability of synchronization manifold for the coupled system. Moreover, it is revealed that the stability of synchronization manifold for the coupled system is different from the stability for dynamical system in usual sense. That is, the solution of the coupled system does not converge to a certain knowable s(t) satisfying s(t 1) = f(s(t)) but to the reference vector on the synchronization manifold, which in fact is a certain weighted average of each xi(t) for i = 1, ... ,m, but not a solution s(t) satisfying s(t 1) = f(s(t)).     

AN ADAPTIVE TRUST-REGION METHOD FOR GENERALIZED EIGENVALUES OF SYMMETRIC TENSORS

For symmetric tensors,computing generalized eigenvalues is equivalent to a homogenous polynomial optimization over the unit sphere.In this paper,we present an adaptive trustregion method for generalized eigenvalues of symmetric tensors.One of the features is that the trust-region radius is automatically updated by the adaptive technique to improve the algorithm performance.The other one is that a projection scheme is used to ensure the feasibility of all iteratives.Global convergence and local quadratic convergence of our algorithm are established,respectively.The preliminary numerical results show the efficiency of the proposed algorithm.