Several Properties of p-w-hyponormal Operators

In this paper, let T be a bounded linear operator on a complex Hilbert H. We give and prove that every p-w-hyponormal operator has Bishop's property(β) and spectral properties; Quasi-similar p-w-hyponormal operators have equal spectra and equal essential spectra. Finally, for p-w-hyponormal operators, we give a kind of proof of its normality by use of properties of partial isometry.

A New System of Variational Inclusions with （H,η）-accretive Operators in Banach Spaces

In this paper, we first introduce a new class of generalized accretive operators named （H,η）-accretive in Banach space. By studying the properties of （H,η）-accretive, we extend the concept of resolvent operators associated with m-accretive operators to the new （H,η）-accretive operators. In terms of the new resolvent operator technique, we prove the existence and uniqueness of solutions for this new system of variational inclusions. We also construct a new algorithm for approximating the solution of this system and discuss the convergence of the sequence of iterates generated by the algorithm.

Tree-Shaped Timber Structural System

This paper lbcuses on the main characteristics of a tree-shaped timber structural system or simply tree-shaped. One of them is the complexity of its steel connections, responsible for the joint of bar elements, compounding a complex structural system, which requires the application of the CYPECAD software version 2007 to solve the calculations problems. Its efficiency was confirmed by a variety of laboratory tests carried out with the whole structure. The tree-shaped is a timber structure that can be used in a large number of destinations, including residences, malls, sheds, hangars, etc.. Originally, it was conceived based on the well-known masterpiece ＂Sagrada Familia＂, whose author was Architect Antoni Gaudi I Cornet （1852-1926） in Barcelona/Spain. It was designed at the end of 19th century and its construction is still not finished. Gaudi inverted the logical order of the gothic concepts, i.e., light weights below and heavy weights above. Based on this concept, he always had in mind the figure of a tree in nature. The tree-shaped follows the same idea, using timber pieces connected by steel plates. Theoretical and numerical analyses have shown its efficiency and lightness for use in timber structures.

A New Regularizing Algorithm for Solving the First Kind of Fredholm Integral Equations

Singular value system is applied to construct a new class of improved regularizing methods for solving the first kind of Fredholm integral equations with noisy data. By a priori choosing regularizing parameters, optimal convergence order of the regularized solution is obtained. And with aids of MATLAB software, numerical results are presented which roughly coincide with the theoretical analysis.

Three Nonnegative Solutions of Three-Point Boundary Value Problem for Second-Order Impulsive Differential Equations

The paper studies the existence of three nonnegative solutions to a type of three- point boundary value problem for second-order impulsive differential equations,and obtains the sufficient conditions for existence of three nonnegative solutions by means of the Leggett- Williams's fixed point theorem.

Singular Nonlinear Boundary Value Problems Arising in the Boundary Layer Behind Expansion Wave

A class of singular nonlinear boundary value problems arising in the boundary layer behind expansion wave are studied.Sufficient conditions for the existence and uniqueness of positive solutions to the problems are established by utilizing the monotonic approaching tech- nique.And a theoretical estimate formula for skin friction coefficient is presented.The numerical solution is presented by using the shoot method.The reliability and efficiency of the theoretical prediction are verified by numerical results.

On k-Positive Satisfiability Problem

An algorithm for solving the satisfiability problem is presented. It isproceed that this algorithm solves 2-SAT and Horn-SAT in linear time and k-positiveSAT (in which every clause contains at most k positive literals) ill time O(F.),where F is the length of input F, n is the number of atoms occurring in F, and k isthe greatest real number satisfying the equation x = 2-. Compared with previousresults, this nontrivial upper bound on time complexity could only be obtained fork-SAT, which is a subproblem of k-positive SAT.

On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure

In this paper,we propose a derivative-free trust region algorithm for constrained minimization problems with separable structure,where derivatives of the objective function are not available and cannot be directly approximated.At each iteration,we construct a quadratic interpolation model of the objective function around the current iterate.The new iterates are generated by minimizing the augmented Lagrangian function of this model over the trust region.The filter technique is used to ensure the feasibility and optimality of the iterative sequence.Global convergence of the proposed algorithm is proved under some suitable assumptions.

Parallel computing study for the large-scale generalized eigenvalue problems in modal analysis

In this paper we study the algorithms and their parallel implementation for solving large-scale generalized eigenvalue problems in modal analysis.Three predominant subspace algorithms,i.e.,Krylov-Schur method,implicitly restarted Arnoldi method and Jacobi-Davidson method,are modified with some complementary techniques to make them suitable for modal analysis.Detailed descriptions of the three algorithms are given.Based on these algorithms,a parallel solution procedure is established via the PANDA framework and its associated eigensolvers.Using the solution procedure on a machine equipped with up to 4800processors,the parallel performance of the three predominant methods is evaluated via numerical experiments with typical engineering structures,where the maximum testing scale attains twenty million degrees of freedom.The speedup curves for different cases are obtained and compared.The results show that the three methods are good for modal analysis in the scale of ten million degrees of freedom with a favorable parallel scalability.

A PROXIMAL POINT ALGORITHM FOR A SYSTEM OF GENERALIZED MIXED VARIATIONAL INEQUALITIES

This paper introduces and considers a new system of generalized mixed variational inequal- ities in a Hilbert space, which includes many new and known systems of variational inequalities and generalized variational inequalities as special cases. By using the two concepts of η-subdifferential and η-proximal mappings of a proper function, the authors try to demonstrate that the system of generalized mixed variational inequalities is equivalence with a fixed point problem. By applying the equivalence, a new and innovative η-proximal point algorithm for finding approximate solutions of the system of generalized mixed variational inequalities will be suggested and analyzed. The authors also study the convergence analysis of the new iterative method under much weaker conditions. The results can be viewed as a refinement and improvement of the previously known results for variational inequalities.