双参数地基上板弯曲问题的边界积分方程

本文应用广义函数的Fourrier积分变换导出了双参数地基上板弯曲问题的基本解,并将基本解展成一致收敛的级数形式.在此基础上,应用广义Rayleigh-Green公式建立了适用于任意形状、任意边界条件情形的两个边界积分方程,为边界元法在这一问题中的应用提供了理论基础.     

Nonlinear multiple objective optimization: An algorithm and some theory

This paper presents an algorithm and the supporting theory for solving a class of nonlinear multiple criteria optimization problems using Zionts—Wallenius type of interaction. The Zionts—Wallenius method, as extended in this paper, can be used for solving multiple criteria problems with concave objective and (implicit) value functions and convex feasible regions. Modifications of the method to handle nonconvex feasible regions and general nonlinear objective functions are also discussed.This research was supported, in part, by a Faculty Research Development Award and by a Council of 100 Research Grant from Arizona State University (Roy), and by a grant from Y. Jahnsson Foundation, Finland (Wallenius). The research was performed while the second author was a Visiting Professor at Arizona State University.     

Local convergence of quasi-Newton methods for B-differentiable equations

We study local convergence of quasi-Newton methods for solving systems of nonlinear equations defined by B-differentiable functions. We extend the classical linear and superlinear convergence results for general quasi-Newton methods as well as for Broyden's method. We also show how Broyden's method may be applied to nonlinear complementarity problems and illustrate its computational performance on two small examples.     

An RQP algorithm using a differentiable exact penalty function for inequality constrained problems

In this paper we propose a recursive quadratic programming algorithm for nonlinear programming problems with inequality constraints that uses as merit function a differentiable exact penalty function. The algorithm incorporates an automatic adjustment rule for the selection of the penalty parameter and makes use of an Armijo-type line search procedure that avoids the need to evaluate second order derivatives of the problem functions. We prove that the algorithm possesses global and superlinear convergence properties. Numerical results are reported.     

Unconstrained and constrained global optimization of polynomial functions in one variable

In Floudas and Visweswaran (1990), a new global optimization algorithm (GOP) was proposed for solving constrained nonconvex problems involving quadratic and polynomial functions in the objective function and/or constraints. In this paper, the application of this algorithm to the special case of polynomial functions of one variable is discussed. The special nature of polynomial functions enables considerable simplification of the GOP algorithm. The primal problem is shown to reduce to a simple function evaluation, while the relaxed dual problem is equivalent to the simultaneous solution of two linear equations in two variables. In addition, the one-to-one correspondence between the x and y variables in the problem enables the iterative improvement of the bounds used in the relaxed dual problem. The simplified approach is illustrated through a simple example that shows the significant improvement in the underestimating function obtained from the application of the modified algorithm. The application of the algorithm to several unconstrained and constrained polynomial function problems is demonstrated.     

Extending hysteresis operators to spaces of piecewise continuous functions

We consider continuous-time hysteresis operators, defined to be causal and rate independent operators mapping input signals to output signals . We show how a hysteresis operator defined on the set of continuous piecewise monotone functions can be naturally extended to piecewise continuous piecewise monotone functions. We prove that the extension is also a hysteresis operator and that a number of important properties of the original operator are inherited by the extension. Moreover, we define the concept of a discrete-time hysteresis operator and we show that discretizing continuous-time hysteresis operators using standard sampling and hold operations leads to discrete-time hysteresis operators. We apply the concepts and results described above in the context of sampled-data feedback control of linear systems with input hysteresis.     

Boundaries for algebras of holomorphic functions

Let A_u(B_G) be the Banach algebra of all complex valued functions defined on the closed unit ball B_G of a complex Banach space G which are uniformly continuous on B_G and holomorphic in the interior of B_G, endowed with the sup norm. A characterization of the boundaries for A_u(B_G) is given in case G belongs to a class of Banach spaces that includes the pre-dual of a Lorentz sequence space studied by Gowers in Israel J. Math. 69 (1990) 129-151. The non-existence of the Shilov boundary for A_u(B_G) is also proved.     

Stability of a system of Volterra integro-differential equations

Using new and known forms of Lyapunov functionals, this paper proposes new stability criteria for a system of Volterra integro-differential equations.     

复Clifford分析中的超单演函数

该文研究复Clifford分析中的超单演函数,即方程z_n Df(z)+(n-1)Qf′=0的解. 记f(z)=Pf(z)+Qf(z)e_n,f(z)∈C^2(Ω),f(z): Ω → C^{n+1},Ω C^{n+1}，得出超单演函数的几个性质.     

Convergence rates of cascade algorithms

We consider solutions of a refinement equation of the form

where is a finitely supported sequence called the refinement mask. Associated with the mask is a linear operator defined on by . This paper is concerned with the convergence of the cascade algorithm associated with , i.e., the convergence of the sequence in the -norm.

Our main result gives estimates for the convergence rate of the cascade algorithm. Let be the normalized solution of the above refinement equation with the dilation matrix being isotropic. Suppose lies in the Lipschitz space , where 0$"> and . Under appropriate conditions on , the following estimate will be established:

where and is a constant. In particular, we confirm a conjecture of A. Ron on convergence of cascade algorithms.