Solving a Class of Brouwer Fixed-point Problems via a Modified Aggregate Constraint Homotopy Method

In this paper, we provide an aggregate function homotopy interior point method to solve a class of Brouwer fixed-point problems. Compared with the homotopy method （proposed by Yu and Lin, Appl. Math. Comput., 74（1996）, 65）, the main adavantages of this method are as foUows： on the one hand, it can solve the Brouwer fixed-point problems in a broader class of nonconvex subsets Ω in R^n （in this paper, we let Ω={x∈ R^n ： gi（x） ≤0, i= 1,... , m}）; on the other hand, it can also deal with the subsets Ω with larger amount of constraints more effectively.     

求解Brouwer不动点问题的改进同伦方法

In this paper,we modify the homotopy method(proposed by Yu and Lin,Appl.Math.Comput.,74(1996),65)and hence make the modified method be able to solve Brouwer fixed-point problems in a broader class of nonconvex subsets in R~n.In addition,a simple example is given to show the effectiveness of the modified method.     

The quasi-reversibility method to solve the Cauchy problems for parabolic equations

In this paper, on the one hand, we take the conventional quasi-reversibility method to obtain the error estimates of approximate solutions of the Cauchy problems for parabolic equations in a sub-domain of QT with strong restrictions to the measured boundary data. On the other hand, weakening the conditions on the measured data, then combining the duality method in optimization with the quasi-reversibility method, we solve the Cauchy problems for parabolic equations in the presence of noisy data. Using this method, we can get the proper regularization parameter ε that we need in the quasi-reversibility method and obtain the convergence rate of approximate solutions as the noise of amplitude δ tends to zero.     

A PROJECTION-TYPE METHOD FOR SOLVING VARIOUS WEBER PROBLEMS

This paper investigates various Weber problems including unconstrained Weber problems and constrained Weber problems under l1, l2 and l∞-norms. First with a transformation technique various Weber problems are turned into a class of monotone linear variational inequalities. By exploiting the favorable structure of these variational inequalities, we present a new projection-type method for them. Compared with some other projection-type methods which can solve monotone linear variational inequality, this new projection-type method is simple in numerical implementations and more efficient for solving this class of problems; Compared with some popular methods for solving unconstrained Weber problem and constrained Weber problem, a singularity would not happen in this new method and it is more reliable by using this new method to solve various Weber problems.     

A Continuation Method for Solving Fixed Point Problems in Unbounded Convex Sets

In this paper, an unbounded condition is presented, under which we are able to utilize the interior point homotopy method to solve the Brouwer fixed point problem on unbounded sets. Two numerical examples in R3 are presented to illustrate the results in this paper.     

The existence of harmonic maps from Finsler manifolds to Riemannian manifolds

In this paper,we consider the existence of harmonic maps from a Finsler man-ifold and study the characterisation of harmonic maps,in the spirit of lshihara.Using heatequation method we show that any map from a compact Finsler manifold M to a com-pact Riemannian manifold with non-positive sectional curvature can be deformed into aharmonic map which has minimum energy in its homotopy class.     

无记忆非拟 Newton 算法的导出和全局收敛性

In this paper, a new class of memoryless non-quasi-Newton method for solving unconstrained optimization problems is proposed, and the global convergence of this method with inexact line search is proved. Furthermore, we propose a hybrid method that mixes both the memoryless non-quasi-Newton method and the memoryless Perry-Shanno quasi-Newton method. The global convergence of this hybrid memoryless method is proved under mild assumptions. The initial results show that these new methods are efficient for the given test problems. Especially the memoryless non-quasi-Newton method requires little storage and computation, so it is able to efficiently solve large scale optimization problems.     

穿孔区域中双曲-抛物方程均匀化问题的一个注记

In this paper, we study a class of hyperbolic-parabolic problems in periodically perforated domains with a homogeneous Neumann condition on the boundary of holes. We focus on the homogenization of these equations, which generalizes those achieved by BensoussanLions-Papanicolau and Migorski. The proof is based on the periodic unfolding method in perforated domains.     

Several applications of the theory of random conjugate spaces to measurability problems

The central purpose of this paper is to illustrate that combining the recently developed theory of random conjugate spaces and the deep theory of Banach spaces can, indeed, solve some difficult measurability problems which occur in the recent study of the Lebesgue (or more general, Orlicz)-Bochner function spaces as well as in a slightly different way in the study of the random functional analysis but for which the measurable selection theorems currently available are not applicable. It is important that this paper provides a new method of studying a large class of the measurability problems, namely first converting the measurability problems to the abstract existence problems in the random metric theory and then combining the random metric theory and the relative theory of classical spaces so that the measurability problems can be eventually solved. The new method is based on the deep development of the random metric theory as well as on the subtle combination of the random metric theory with classical space theory.     

SCHWARZ ALTERNATING METHOD AND MULTIGRID METHOD

In this paper we propose and establish the convergence of several asynchronous parallel algorithms which are defined by combining the Schwarz alternating method with the multigrid method in two ways. In the first we divide the original problem into p related subproblems, then the multigrid method is used to solve these subproblems iteratively. In the second approach we regard the Schwarz iterative method as the smoothing step of multigrid method. All algorithms proposed in this paper can be used on an MIMD computer.     

Determining a Rotation of a Tetrahedron from a Projection

The following problem, arising from medical imaging, is addressed: Suppose that T is a known tetrahedron in ?³ with centroid at the origin. Also known is the orthogonal projection U of the vertices of the image ?T of T under an unknown rotation ? about the origin. Under what circumstances can ? be determined from T and U?     

Symmetry-based solution of a model for a combination of a risky investment and a riskless investment

Benth and Karlsen [F.E. Benth, K.H. Karlsen, A note on Merton's portfolio selection problem for the Schwartz mean-reversion model, Stoch. Anal. Appl. 23 (2005) 687-704] treated a problem of the optimisation of the selection of a portfolio based upon the Schwartz mean-reversion model. The resulting Hamilton-Jacobi-Bellman equation in 1+2 dimensions is quite nonlinear. The solution obtained by Benth and Karlsen was very ingenious. We provide a solution of the problem based on the application of the Lie theory of continuous groups to the partial differential equation and its associated boundary and terminal conditions.     

On a mapping of a projective space into a sphere

We obtain an exact estimate for the minimum multiplicity of a continuous finite-to-one mapping of a projective space into a sphere for all dimensions. For finite-to-one mappings of a projective space into a Euclidean space, we obtain an exact estimate for this multiplicity for n = 2, 3. For n ≥ 4, we prove that this estimate does not exceed 4. Several open questions are formulated.     

Approaching a vertex in a shrinking domain under a nonlinear flow

We consider here the homogeneous Dirichlet problem for the equation , in a noncylindrical domain in space-time given by . By means of matched asymptotic expansion techniques we describe the asymptotics of the maximal solution approaching the vertex x=0, t=T, in the three different cases p>1/2, p=1/2(vertex regular), p<1/2 (vertex irregular).     

Calculating a function of a matrix with a real spectrum

Let T be a square matrix with a real spectrum, and let f be an analytic function. The problem of the approximate calculation of f(T) is discussed. Applying the Schur triangular decomposition and the reordering, one can assume that T is triangular and its diagonal entries t_ii are arranged in increasing order. To avoid calculations using the differences t_ii ? t_jj with close (including equal) t_ii and t_jj, it is proposed to represent T in a block form and calculate the two main block diagonals using interpolating polynomials. The rest of the f(T) entries can be calculated using the Parlett recurrence algorithm. It is also proposed to perform some scalar operations (such as the building of interpolating polynomials) with an enlarged number of significant decimal digits.

     

Folding a surface to a polygon

A concept of folding for compact connected surfaces, involving the partition of the surface into combinatorially identical n-sided topological polygons, is defined. The existence of such foldings for given n and given surfaces is explored, with definitive results for the sphere and the torus. We obtain necessary conditions for the existence of such foldings in all other cases.Supported by Kuwait University Grant SM 043.