A Petrov-Galerkin method for equal width equation

The equal width equation is solved numerically by Petrov-Galerkin method using linear hat function and quadratic B-spline function as trial and test functions respectively. Product approximation has been used in this method. A linear stability analysis of the scheme is shown to be conditionally stable. Test problems including the single soliton and the interaction of solitons are used to validate the suggested method, which is found to be accurate and efficient. The Maxwellian initial condition pulse and the development of an undular bore are also studied.     

Inverse optimization for linearly constrained convex separable programming problems

In this paper, we study inverse optimization for linearly constrained convex separable programming problems that have wide applications in industrial and managerial areas. For a given feasible point of a convex separable program, the inverse optimization is to determine whether the feasible point can be made optimal by adjusting the parameter values in the problem, and when the answer is positive, find the parameter values that have the smallest adjustments. A sufficient and necessary condition is given for a feasible point to be able to become optimal by adjusting parameter values. Inverse optimization formulations are presented with ℓ₁ and ℓ₂ norms. These inverse optimization problems are either linear programming when ℓ₁ norm is used in the formulation, or convex quadratic separable programming when ℓ₂ norm is used.     

关于二次规划问题分段线性同伦算法的改进

本文利用Ｃｈｏｌｅｓｋｙ分解，Ｇａｕｓｓ消去等技术和定义适当的同伦映射，将关于二次规划问题的分段线性同伦算法加以改进，改进后的算法，对于严格凸二次规划来说，计算效率与Ｇｏｌｄｆａｒｂ－Ｉｄｎａｎｉ的对偶法相当。     

On the choice of the initial value of a quadratic spline in positive interpolation

Any quadratic spline with coinciding interpolating points and breakpoints can be uniquely determined by one initial condition. We examine how to choose the initial value in positive interpolation by using a norm of the spline. Monotone interpolation is also considered. The results are illuminated by numerical examples and by an application.     

A multiplier method with automatic limitation of penalty growth

This paper presents a multiplier method for solving optimization problems with equality and inequality constraints. The method realizes all the good features that were foreseen by R. Fletcher for this type of algorithm in the past, but which suffers from none of the drawbacks of the earlier attempts.Research sponsored by the National Science Foundation (RANN) Grant ENV76-04264 the National Science Foundation Grant ENG73-08214-A01 and the Sweden-American Foundation.     

On splitting of totally singular quadratic forms

In this note we completely study the standard splitting of quasi-Pfister forms and their neighbors, and we include some general results on standard splitting towers of totally singular quadratic forms. The author was supported by the European research network HPRN-CT-2002-00287 “AlgebraicK-Theory, Linear Algebraic Groups and Related Structures”.     

Local convergence of some iterative methods for generalized equations

We study generalized equations of the following form:

(render)

0f(x)+g(x)+F(x),

where f is Fréchet differentiable in a neighborhood of a solution x^* of (*) and g is Fréchet differentiable at x^* and where F is a set-valued map acting in Banach spaces. We prove the existence of a sequence (x_k) satisfying

which is super-linearly convergent to a solution of (*). We also present other versions of this iterative procedure that have superlinear and quadratic convergence, respectively.     

Perturbation approach to elastic constitutive relations of polycrystals

Herein we obtain a formula for the effective elastic stiffness tensor C^eff of an orthorhombic aggregate of cubic crystallites by the perturbation method. The effective elastic stiffness tensor of the polycrystal gives the relationship between volume average stress and volume average strain. Under Voigt's model, Reuss’ model and Man's theory, the elastic constitutive relation accounts for the effect of the orientation distribution function (ODF) up to terms linear in the texture coefficients. However, the formula derived in this paper delineates the effect of crystallographic texture on elastic response and shows quadratic texture dependence. The formula is very simple. We also consider the influence of grain shape to elastic constitutive relations of polycrystals. Some examples are given to compare computational results of the formula with those given by Voigt's model, Reuss's model, the finite element method, and the self-consistent method. In Section 3, we also present an expression of the perturbation displacement field, in which Green's function for an orthorhombic aggregate of cubic crystallites is included.     

Multicategory ψ-Learning and Support Vector Machine: Computational Tools

Many margin-based binary classification techniques such as support vector machine (SVM) and ψ-learning deliver high performance. An earlier article proposed a new multicategory ψ-learning methodology that shows great promise in generalization ability. However,ψ-learning is computationally difficult because it requires handling a nonconvex minimization problem. In this article, we propose two computational tools for multicategory ψ-learning. The first one is based on d.c. algorithms and solved by sequential quadratic programming, while the second one uses the outer approximation method, which yields the global minimizer via sequential concave minimization. Numerical examples show the proposed algorithms perform well.     

The last subconstituent of the Hemmeter graph

We prove that when q is any odd prime power, the distance-2 graph on the set of vertices at maximal distance D from any fixed vertex of the Hemmeter graph Hem_D(q) is isomorphic to the graph Quad_D-1(q) of quadratic forms on .