Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.     

用三个关系式与Mathematica软件求第二类自然数幂和公式

首先介绍三个第二类自然数幂和关系式并对其中的两式给出证明,接着利用这些关系式与数学软件M athem atica4.0,给出求解第二类自然数幂和公式的若干机械计算方法.     

An implicit method for linear ill‐posed problems with perturbed operators

An implicit iterative method is applied to solving linear ill‐posed problems with perturbed operators. It is proved that the optimal convergence rate can be obtained after choosing suitable number of iterations. A generalized Morozov's discrepancy principle is proposed for the problems, and then the optimal convergence rate can also be obtained by an a posteriori strategy. The convergence results show that the algorithm is a robust regularization method. Copyright © 2006 John Wiley & Sons, Ltd.     

High order generalized upwind schemes and numerical solution of singular perturbation problems

High even order generalizations of the traditional upwind method are introduced to solve second order ODE-BVPs without recasting the problem as a first order system. Both theoretical analysis and numerical comparison with central difference schemes of the same order show that these new methods may avoid typical oscillations and achieve high accuracy. Singular perturbation problems are taken into account to emphasize the main features of the proposed methods. AMS subject classification (2000)  65L10, 65L12, 65L50     

A new approach based on the surrogating method in the project time compression problems

This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous and non-increasing time-cost curve. The kind of this model is Mixed Integer Linear Program (MILP) with zero-one variables, and the Benders' decomposition procedure for analyzing this model has been developed. Then this paper proposes a new approach based on the surrogating method for solving these problems. In addition, the required computer programs have been prepared by the author to execute the algorithm. An illustrative example solved by the new algorithm, and two methods are compared by several numerical examples. Computational experience with these data shows the superiority of the new approach.     

JACOBI PSEUDOSPECTRAL METHOD FOR FOURTH ORDER PROBLEMS

In this paper, we investigate Jacobi pseudospectral method for fourth order problems. We establish some basic results on the Jacobi-Gauss-type interpolations in non-uniformly weighted Sobolev spaces, which serve as important tools in analysis of numerical quadratures, and numerical methods of differential and integral equations. Then we propose Jacobi pseudospectral schemes for several singular problems and multiple-dimensional problems of fourth order. Numerical results demonstrate the spectral accuracy of these schemes, and coincide well with theoretical analysis.     

On the solution of Maxwell's equations in polygonal domains

This paper is concerned with the structure of the singular and regular parts of the solution of time‐harmonic Maxwell's equations in polygonal plane domains and their effective numerical treatment. The asymptotic behaviour of the solution near corner points of the domain is studied by means of discrete Fourier transformation and it is proved that the solution of the boundary value problem does not belong locally to H² when the boundary of the domain has non‐acute angles. A splitting of the solution into a regular part belonging to the space H², and an explicitly described singular part is presented. For the numerical treatment of the boundary value problem, we propose a finite element discretization which combines local mesh grading and the singular field methods and derive a priori error estimates that show optimal convergence as known for the classical finite element method for problems with regular solutions. Copyright © 2006 John Wiley & Sons, Ltd.     

微分算子扰动问题的值域研究

本文研究作用在C2周期函数空间上的微分算子u→u″ g(u) ,其中g(u)为连续有界函数.我们将证明上述微分算子的值域限制在周期函数空间的“超曲面”中.     

A Bayesian analysis for the seismic data on Taiwan

A Bayesian approach is used to analyze the seismic events with magnitudes at least 4.7 on Taiwan. Following the idea proposed by Ogata (1988,Journal of the American Statistical Association,83, 9–27), an epidemic model for the process of occurrence times given the observed magnitude values is considered, incorporated with gamma prior distributions for the parameters in the model, while the hyper-parameters of the prior are essentially determined by the seismic data in an earlier period. Bayesian inference is made on the conditional intensity function via Markov chain Monte Carlo method. The results yield acceptable accuracies in predicting large earthquake events within short time periods.     

Viscosity solutions of fully nonlinear parabolic systems

In this paper, we discuss the viscosity solutions of the weakly coupled systems of fully nonlinear second-order degenerate parabolic equations and their Cauchy-Dirichlet problem. We prove the existence, uniqueness and continuity of viscosity solution by combining Perron's method with the technique of coupled solutions. The results here generalize those in Proc. London Math. Soc. 63 (1991) 212-240 and Comm. Partial Differential Equations 16 (1991) 1095-1128.