G恰当有效点集和G恰当有效解集的连通性

与多目标规划问题的G恰当有效解相应，引进了集合的G恰当有效点的概念，并互研究了G恰当有效点集和G恰当有效解集的连通性．利用所得的结果，还获得多目标规划问题的Pareto有效解集是连通的一个新的结论。     

Efficient SIMD solution of multiple systems of stiff IVPs

The parallel solution of multiple systems of initial-value problems (IVPs) in ordinary differential equations is challenging because the amount of computation involved in solving a given IVP is generally not well correlated with that of solving another. In this paper, we describe how to efficiently solve multiple systems of stiff IVPs in parallel within a single-instruction, multiple-data (SIMD) implementation on the Cell Broadband Engine (CBE) of the RODAS solver for stiff IVPs. We solve two systems of stiff IVPs simultaneously on each of the eight synergistic processing elements per CBE chip for a total of 16 systems of IVPs. We demonstrate a speedup of 1.89 (a parallel efficiency of over 94%) over the corresponding serial code on a realistic example involving the operation of a chemical reactor. The techniques described apply to other multi-core processors besides the CBE and can be expected to increase in importance as computer architectures evolve to feature larger word sizes.     

On the optimal robust solution of IVPs with noisy information

We investigate the optimal solution of systems of initial-value problems with smooth right-hand side functions f from a Hölder class \(F^{r,\varrho }_{\text {reg}}\), where r ≥ 0 is the number of continuous derivatives of f, and ? ∈ (0, 1] is the Hölder exponent of rth partial derivatives. We consider algorithms that use n evaluations of f, the ith evaluation being corrupted by a noise δ_i of deterministic or random nature. For δ ≥ 0, in the deterministic case the noise δ_i is a bounded vector, ∥δ_i∥≤δ. In the random case, it is a vector-valued random variable bounded in average, (E(∥δ_i∥^q))^1/q ≤ δ, q ∈ [1, + ∞). We point out an algorithm whose L_p error (p ∈ [0, + ∞]) is O(n ^{? (r + ?)} + δ), independently of the noise distribution. We observe that the level n ^{? (r + ?)} + δ cannot be improved in a class of information evaluations and algorithms. For ε > 0, and a certain model of δ-dependent cost, we establish optimal values of n(ε) and δ(ε) that should be used in order to get the error at most ε with minimal cost.     

Adaptive mesh selection asymptotically guarantees a prescribed local error for systems of initial value problems

We study potential advantages of adaptive mesh point selection for the solution of systems of initial value problems. For an optimal order discretization method, we propose an algorithm for successive selection of the mesh points, which only requires evaluations of the right-hand side function. The selection (asymptotically) guarantees that the maximum local error of the method does not exceed a prescribed level. The usage of the algorithm is not restricted to the chosen method; it can also be applied with any method from a general class. We provide a rigorous analysis of the cost of the proposed algorithm. It is shown that the cost is almost minimal, up to absolute constants, among all mesh selection algorithms. For illustration, we specify the advantage of the adaptive mesh over the uniform one. Efficiency of the adaptive algorithm results from automatic adjustment of the successive mesh points to the local behavior of the solution. Some numerical results illustrating theoretical findings are reported.     

Adaptive mesh generation for curved domains

This paper considers the technologies needed to support the creation of adaptively constructed meshes for general curved three-dimensional domains and outlines one set of solutions for providing them. A brief review of an effective way to integrate mesh generation/adaptation with CAD geometries is given. A set of procedures that support general h-adaptive refinement based on a mesh metric field is given. This is followed by examples that demonstrate the ability of the procedures to adaptively construct anisotropic meshes for flow problems. A procedure for the generation of strongly graded, curved meshes as needed for effective hp-adaptive simulations is also given.     

On the Solution of Discontinuous IVPs by Adaptive Runge–Kutta Codes

In this paper an automatic technique for handling discontinuous IVPs when they are solved by means of adaptive Runge–Kutta codes is proposed. This technique detects, accurately locates and passes the discontinuities in the solution of IVPs by using the information generated by the code along the numerical integration together with a continuous interpolant of the discrete solution. A remarkable feature is that it does not require additional information on the location of the discontinuities. Some numerical experiments are presented to illustrate the reliability and efficiency of the proposed algorithms.     

A new eight-order symmetric two-step multiderivative method for the numerical solution of second-order IVPs with oscillating solutions

In this paper, we introduce a class of new two-step multiderivative methods for the numerical solution of second-order initial value problems. We generate a two-step, symmetric, multiderivative method of order 8. We also perform a periodicity analysis. In addition, we determine their periodicity regions. Finally, we compare the new methods to the corresponding classical ones and other known methods from the literature, where we show the high efficiency of the new methods.     

An integral-interpolation iterative method for the solution of scalar equations

We study the use of integral information on a functionf in the iterative process for the solution of a nonlinear scalar equationf(x)=0.It is shown that for the information onf given by:

An interior point method in function space for the efficient solution of state constrained optimal control problems

We propose and analyze an interior point path-following method in function space for state constrained optimal control. Our emphasis is on proving convergence in function space and on constructing a practical path-following algorithm. In particular, the introduction of a pointwise damping step leads to a very efficient method, as verified by numerical experiments.     

A new mesh selection strategy for ODEs

In this paper a new mesh selection strategy, based on the conditioning properties of continuous problems, is presented. It turns out to be particularly efficient when approximating solutions of BVPs. The numerical methods used to test the reliability of the strategy are symmetric Linear Multistep Formulae (LMF) used as Boundary Value Methods (BVMs) since they provide a wide choice of methods of arbitrary high order and have similar stability properties to each other. In particular, we shall consider a subclass of such methods, called Top Order Methods (TOMs) (Amodio, 1996; Brugnano and Trigiante, 1995, 1996), to carry out the numerical results on some singular perturbation test problems.     

The role of conditioning in mesh selection algorithms for first order systems of linear two point boundary value problems

Codes for the numerical solution of two-point boundary value problems can now handle quite general problems in a fairly routine and reliable manner. When faced with particularly challenging equations, such as singular perturbation problems, the most efficient codes use a highly non-uniform grid in order to resolve the non-smooth parts of the solution trajectory. This grid is usually constructed using either a pointwise local error estimate defined at the grid points or else by using a local residual control. Similar error estimates are used to decide whether or not to accept a solution. Such an approach is very effective in general providing that the problem to be solved is well conditioned. However, if the problem is ill conditioned then such grid refinement algorithms may be inefficient because many iterations may be required to reach a suitable mesh on which to compute the solution. Even worse, for ill conditioned problems an inaccurate solution may be accepted even though the local error estimates may be perfectly satisfactory in that they are less than a prescribed tolerance. The primary reason for this is, of course, that for ill conditioned problems a small local error at each grid point may not produce a correspondingly small global error in the solution. In view of this it could be argued that, when solving a two-point boundary value problem in cases where we have no idea of its conditioning, we should provide an estimate of the condition number of the problem as well as the numerical solution. In this paper we consider some algorithms for estimating the condition number of boundary value problems and show how this estimate can be used in the grid refinement algorithm.     

Modified equation based mesh adaptation algorithm for evolutionary scalar partial differential equations

It is well known that on uniform mesh classical higher order schemes for evolutionary problems yield an oscillatory approximation of the solution containing discontinuity or boundary layers. In this article, an entirely new approach for constructing locally adaptive mesh is given to compute nonoscillatory solution by representative “second” order schemes. This is done using modified equation analysis and a notion of data dependent stability of schemes to identify the solution regions for local mesh adaptation. The proposed algorithm is applied on scalar problems to compute the solution with discontinuity or boundary layer. Presented numerical results show underlying second order schemes approximate discontinuities and boundary layers without spurious oscillations.     

Adaptive mesh method for topology optimization of fluid flow

In order to solve the topology optimization problems of fluid flow and obtain higher resolution of the interface with a minimum of additional expense, an automatic local adaptive mesh refinement method is proposed. The optimization problem is solved by a simple but robust optimality criteria (OC) algorithm. A material distribution information based adaptive mesh method is adopted during the optimization process. The optimization procedure is provided and verified with several benchmark examples.     

A new third order exponentially fitted discretization for the solution of non-linear two point boundary value problems on a graded mesh

This paper puts forward a novel graded mesh implicit scheme resting upon full step discretization of order three for computation of non-linear two point boundary value problems. The suggested method is compact and employs three nodal points for the unknown function $u(x)$ in spatial axis. We have also performed error analysis of the cited method. The given method was tried (implemented) upon multiple problems in Cartesian and Polar coordinates with extremely favorable outcomes. This method, though meant for scalar equations, was further extended to compute the vector equations of two point nonlinear boundary value problems. To check the validity of the proposed scheme, we applied it to multiple problems and obtained supporting numerical computations.     

On the implementation of ESIRK methods for stiff IVPs

The effective order singly-implicit methods (ESIRK) are designed for solving stiff IVPs. These generalizations of SIRK methods are shown to have some computational advantages over the classical SIRK methods by moving the abscissae inside the integration interval [6]. In this paper, we consider some of the important computational aspects associated with these methods. We show that the ESIRK methods can be implemented efficiently by the comparsion with the standard stiff solvers RADAU5 and LSODE.     

Exponentially fitted one-step methods for the numerical solution of the scalar Riccati equation

Using stability analysis and information from the constant coefficient problem, we motivate an explicit exponentially fitted one-step method to approximate the solution of a scalar Riccati equation ϵy′ = c(x)y² + d(x)y + e(x), 0 < x ⩽ x, y(0) = y₀, where ϵ > 0 is a small parameter and the coefficients c, d and e are assumed to be real valued and continuous. An explicit Euler-type scheme is presented which, when applied to the numerical integration of the continuous problem, give solutions satisfying a uniform (in ϵ) error estimate with order one (where suitable restrictions are imposed on the coefficients c, d and e together with the choice of y(0)). Using a counterexample, we show that, for a particular class of problems, the solutions of the fitted scheme do not converge uniformly (in ϵ) to the corresponding solutions of the continuous problems. Numerical results are presented which compare the fitted scheme with a number of implicit schemes when applied to the numerical integration of some sample problems.     

Numerical solution of the scalar double-well problem allowing microstructure

The direct numerical solution of a non-convex variational problem () typically faces the difficulty of the finite element approximation of rapid oscillations. Although the oscillatory discrete minimisers are properly related to corresponding Young measures and describe real physical phenomena, they are costly and difficult to compute. In this work, we treat the scalar double-well problem by numerical solution of the relaxed problem () leading to a (degenerate) convex minimisation problem. The problem () has a minimiser and a related stress field which is known to coincide with the stress field obtained by solving () in a generalised sense involving Young measures. If is a finite element solution, is the related discrete stress field. We prove a priori and a posteriori estimates for in and weaker weighted estimates for . The a posteriori estimate indicates an adaptive scheme for automatic mesh refinements as illustrated in numerical experiments.

     

Anisotropic mesh adaptation for numerical solution of boundary value problems

We present an efficient mesh adaptation algorithm that can be successfully applied to numerical solutions of a wide range of 2D problems of physics and engineering described by partial differential equations. We are interested in the numerical solution of a general boundary value problem discretized on triangular grids. We formulate a necessary condition for properties of the triangulation on which the discretization error is below the prescribed tolerance and control this necessary condition by the interpolation error. For a sufficiently smooth function, we recall the strategy how to construct the mesh on which the interpolation error is below the prescribed tolerance. Solving the boundary value problem we apply this strategy to the smoothed approximate solution. The novelty of the method lies in the smoothing procedure that, followed by the anisotropic mesh adaptation (AMA) algorithm, leads to the significant improvement of numerical results. We apply AMA to the numerical solution of an elliptic equation where the exact solution is known and demonstrate practical aspects of the adaptation procedure: how to control the ratio between the longest and the shortest edge of the triangulation and how to control the transition of the coarsest part of the mesh to the finest one if the two length scales of all the triangles are clearly different. An example of the use of AMA for the physically relevant numerical simulation of a geometrically challenging industrial problem (inviscid transonic flow around NACA0012 profile) is presented. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2004.