Structural optimization design for large mirror

The system design must be started from the concept with low cost and high performance. In this point, the topological shape of the structure is very important in the view of the structural rigidities and light-weight design.In this paper, the optimization methodology is presented in the design stage of the large optical mirror. We obtain the optimal layout through the topology optimization and then design the details through the size or shape optimization for structural rigidity.     

Asymptotic Correction of More Sturm–Liouville Eigenvalue Estimates

The asymptotic correction technique of Paine, de Hoog and Anderssen can dramatically improve the accuracy of finite difference or finite element eigenvalues at negligible extra cost if closed form expressions are available for the errors in a simpler related problem. This paper gives closed form expressions for the errors in the eigenvalues of certain Sturm–Liouville problems obtained by various methods, thereby increasing the range of problems for which asymptotic correction can achieve maximum efficiency. It also investigates implementation of the method for more general problems.     

Cold compaction of ceramic powder: Computational analysis of the effect of pressing method and die shape

This paper deals with a computational analysis of the influence of the pressing method and part geometry on the final density distribution in the cold compaction process of ceramic alumina powders. The analysis is based on the explicit finite-element model proposed and validated in a previous study. The mechanical behavior of the processing material is described using a multisurface elastoplastic model, the modified Drucker-Prager/Cap model Published in Prikladnaya Mekhanika, Vol. 43, No. 10, pp. 129–134, October 2007.     

Existence and boundary behavior for singular nonlinear differential equations with arbitrary boundary conditions

Existence theory is developed for the equation ?(u)=F(u), where ? is a formally self-adjoint singular second-order differential expression and F is nonlinear. The problem is treated in a Hilbert space and we do not require the operators induced by ? to have completely continuous resolvents. Nonlinear boundary conditions are allowed. Also, F is assumed to be weakly continuous and monotone at one point. Boundary behavior of functions associated with the domains of definitions of the operators associated with ? in the singular case is investigated. A special class of self-adjoint operators associated with ? is obtained.     

A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces

In this paper, we introduce two iterative schemes by the general iterative method for finding a common element of the set of an equilibrium problem and the set of fixed points of a nonexpansive mapping in a Hilbert space. Then, we prove two strong convergence theorems for nonexpansive mappings to solve a unique solution of the variational inequality which is the optimality condition for the minimization problem. These results extended and improved the corresponding results of Marino and Xu [G. Marino, H.K. Xu, A general iterative method for nonexpansive mapping in Hilbert spaces, J. Math. Anal. Appl. 318 (2006) 43-52], S. Takahashi and W. Takahashi [S. Takahashi, W. Takahashi, Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces, J. Math. Anal. Appl. 331 (1) (2007) 506-515], and many others.     

Lower-dimensional linear complementarity problem approaches to the solution of a bi-obstacle problem

A globally convergent Broyden-like method for solving a bi-obstacle problem is proposed based on its equivalent lower-dimensional linear complementarity problem. A suitable line search technique is introduced here. The global and superlinear convergence of the method is verified under appropriate assumptions.     

A second order numerical scheme for the solution of the one-dimensional Boussinesq equation

A predictor–corrector (P-C) scheme is applied successfully to a nonlinear method arising from the use of rational approximants to the matrix-exponential term in a three-time level recurrence relation. The resulting nonlinear finite-difference scheme, which is analyzed for local truncation error and stability, is solved using a P-C scheme, in which the predictor and the corrector are explicit schemes of order 2. This scheme is accelerated by using a modification (MPC) in which the already evaluated values are used for the corrector. The behaviour of the P-C/MPC schemes is tested numerically on the Boussinesq equation already known from the bibliography free of boundary conditions. The numerical results are derived for both the bad and the good Boussinesq equation and conclusions from the relevant known results are derived.      

An alternative approach for non-linear optimal control problems based on the method of moments

We propose an alternative method for computing effectively the solution of non-linear, fixed-terminal-time, optimal control problems when they are given in Lagrange, Bolza or Mayer forms. This method works well when the nonlinearities in the control variable can be expressed as polynomials. The essential of this proposal is the transformation of a non-linear, non-convex optimal control problem into an equivalent optimal control problem with linear and convex structure. The method is based on global optimization of polynomials by the method of moments. With this method we can determine either the existence or lacking of minimizers. In addition, we can calculate generalized solutions when the original problem lacks of minimizers. We also present the numerical schemes to solve several examples arising in science and technology.     

A new alternating‐direction finite element method for hyperbolic equation

A modified backward difference time discretization is presented for Galerkin approximations for nonlinear hyperbolic equation in two space variables. This procedure uses a local approximation of the coefficients based on patches of finite elements with these procedures, a multidimensional problem can be solved as a series of one‐dimensional problems. Optimal order H₀¹ and L² error estimates are derived. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Discrete global descent method for discrete global optimization and nonlinear integer programming

A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function. The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer variables and up to 1.38 × 10¹⁰⁴ feasible points have demonstrated the applicability and efficiency of the proposed method.