广义Chebyshev－Vandermonde方程组的快速算法与求逆公式

广义Ｃｈｅｂｙｓｈｅｖ－Ｖａｎｄｅｒｍｏｎｄｅ方程组的快速算法与求逆公式成礼智（国防科技大学）ＩＮＥＲＳＩＯＮＦＯＲＭＵＬＡＡＮＤＦＡＳＴＳＯＬＵＴＩＯＮＦＯＲＧＥＮＥＲＡＬＣＨＥＢＹＳＨＥＶ－ＶＡＮＤＥＲＭＯＮＤＥＥＱＵＡＴＩＯＮＳ￥ＣｈｅｎｇＬｉ...     

POSITIVE SOLUTIONS AND BIFURCATION OF FULLY NONLINEAR ELLIPTIC EQUATIONS INVOLVING SUPER－CRITICAL SOBOLEV EXPONENTS

ＰＯＳＩＴＩＶＥＳＯＬＵＴＩＯＮＳＡＮＤＢＩＦＵＲＣＡＴＩＯＮＯＦＦＵＬＬＹＮＯＮＬＩＮＥＡＲＥＬＬＩＰＴＩＣＥＱＵＡＴＩＯＮＳＩＮＶＯＬＶＩＮＧＳＵＰＥＲ－ＣＲＩＴＩＣＡＬＳＯＢＯＬＥＶＥＸＰＯＮＥＮＴＳ￥ＱＵＣＨＡＮＧＺＨＥＮＧ（屈长征）（Ｉｎｓ...     

BOUNDEDNESS OF THE SOLUTIONS OF CERTAIN FOURTH-ORDER VECTOR DIFFERENTIAL EQUATIONS

ＢＯＵＮＤＥＤＮＥＳＳＯＦＴＨＥＳＯＬＵＴＩＯＮＳＯＦＣＥＲＴＡＩＮＦＯＵＲＴＨ－ＯＲＤＥＲＶＥＣＴＯＲＤＩＦＦＥＲＥＮＴＩＡＬＥＱＵＡＴＩＯＮＳＢＯＵＮＤＥＤＮＥＳＳＯＦＴＨＥＳＯＬＵＴＩＯＮＳＯＦＣＥＲＴＡＩＮＦＯＵＲＴＨ－ＯＲＤＥＲＶＥＣＴＯＲ...     

广义Chebyshev－Vandermonde方程组的快速算法与求逆公式

广义Ｃｈｅｂｙｓｈｅｖ－Ｖａｎｄｅｒｍｏｎｄｅ方程组的快速算法与求逆公式成礼智（国防科技大学）ＩＮＥＲＳＩＯＮＦＯＲＭＵＬＡＡＮＤＦＡＳＴＳＯＬＵＴＩＯＮＦＯＲＧＥＮＥＲＡＬＣＨＥＢＹＳＨＥＶ－ＶＡＮＤＥＲＭＯＮＤＥＥＱＵＡＴＩＯＮＳ￥ＣｈｅｎｇＬｉ...     

Volterra积－微分方程配置解的外推

Ｖｏｌｔｅｒｒａ积－微分方程配置解的外推胡齐芽（湘潭大学数学系）ＥＸＴＲＡＰＯＬＡＴＩＯＮＦＯＲＣＯＬＬＯＣＡＴＩＯＮＳＯＬＵＴＩＯＮＳＯＦＶＯＬＴＥＲＲＡＩＮＴＥＧＲＯ－ＤＩＦＦＥＲＥＮＴＩＡＬＥＱＵＡＴＩＯＮＳ￥ＨｕＱｉ－ｙａ（Ｄｅｐｏｒｔｍｅｎ...     

A PHRAGMEN－LINDELOF ALTERNATIVE FOR A CLASS OF SECOND ORDER QUASILINEAR EQUATIONS IN R~3

ＡＰＨＲＡＧＭＥＮ－ＬＩＮＤＥＬＯＦＡＬＴＥＲＮＡＴＩＶＥＦＯＲＡＣＬＡＳＳＯＦＳＥＣＯＮＤＯＲＤＥＲＱＵＡＳＩＬＩＮＥＡＲＥＱＵＡＴＩＯＮＳＩＮＲ￣３￥ＬｉｎＣｈａｎｇｈａｏ（林长好）（Ｄｅｐｔ．ｏｆＭａｔｈ．，ＳｏｕｔｈＣｈｉｎａＮｏｒｍａｌＵｎ...     

A CLASS OF SINGULAR PERTURBATIONS FOR SECOND ORDER QUASI－LINEAR BOUNDARY VALUE PROBLEMS ON INFINITE INTERVAL

ＡＣＬＡＳＳＯＦＳＩＮＧＵＬＡＲＰＥＲＴＵＲＢＡＴＩＯＮＳＦＯＲＳＥＣＯＮＤＯＲＤＥＲＱＵＡＳＩ－ＬＩＮＥＡＲＢＯＵＮＤＡＲＹＶＡＬＵＥＰＲＯＢＬＥＭＳＯＮＩＮＦＩＮＩＴＥＩＮＴＥＲＶＡＬＺＨＡＯＷＥＩＬＩ（赵为礼）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈ...     

ON GLOBAL SOLUTION FOR A CLASS OF SYSTEMS OF MULTI－DIMENSIONAL GENERALIZED ZAKHAROV TYPE EQUATION

ＯＮＧＬＯＢＡＬＳＯＬＵＴＩＯＮＦＯＲＡＣＬＡＳＳＯＦＳＹＳＴＥＭＳＯＦＭＵＬＴＩ－ＤＩＭＥＮＳＩＯＮＡＬＧＥＮＥＲＡＬＩＺＥＤＺＡＫＨＡＲＯＶＴＹＰＥＥＱＵＡＴＩＯＮＧＵＯＢＯＬＩＮＧ（郭柏灵）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄａｎｄＣｏｍｐｕ...     

EXISTENCE AND UNIQUENESS OF SOLUTIONS FOR NONLINEAR BOUNDARY VALUE PROBLEMS OF VOLTERRA－HAMMERSTEIN TYPE INTEGRODIFFERENTIAL EQUATION

ＥＸＩＳＴＥＮＣＥＡＮＤＵＮＩＱＵＥＮＥＳＳＯＦＳＯＬＵＴＩＯＮＳＦＯＲＮＯＮＬＩＮＥＡＲＢＯＵＮＤＡＲＹＶＡＬＵＥＰＲＯＢＬＥＭＳＯＦＶＯＬＴＥＲＲＡ－ＨＡＭＭＥＲＳＴＥＩＮＴＹＰＥＩＮＴＥＧＲＯＤＩＦＦＥＲＥＮＴＩＡＬＥＱＵＡＴＩＯＮ￥ＷａｎｇＧ...     

WAVEFORM RELAXATION METHODS AND ACCURACY INCREASE

ＷＡＶＥＦＯＲＭ　ＲＥＬＡＸＡＴＩＯＮ　ＭＥＴＨＯＤＳ　ＡＮＤ　ＡＣＣＵＲＡＣＹ　ＩＮＣＲＥＡＳＥＷＡＶＥＦＯＲＭＲＥＬＡＸＡＴＩＯＮＭＥＴＨＯＤＳＡＮＤＡＣＣＵＲＡＣＹＩＮＣＲＥＡＳＥ￥ＳｏｎｇＹｏｎｇｚｈｏｎｇ（ＮａｎｊｉｎｇＮｏｒｍａｌＵｎｉｖ...     

Local error estimation for multistep collocation methods

Multistep collocation methods for initial value problems in ordinary differential equations are known to be a subclass of multistep Runge-Kutta methods and a generalisation of the well-known class of one-step collocation methods as well as of the one-leg methods of Dahlquist. In this paper we derive an error estimation method of embedded type for multistep collocation methods based on perturbed multistep collocation methods. This parallels and generalizes the results for one-step collocation methods by Nørsett and Wanner. Simple numerical experiments show that this error estimator agrees well with a theoretical error estimate which is a generalisation of an error estimate first derived by Dahlquist for one-leg methods.     

Symplectic Collocation Schemes for Hamiltonian Systems

The symplectic collocation schemes, which are based on the framework established by Feng Kang [1], are proposed for numerical solution of Hamiltonian systems. The sufficient and necessary conditions for various collocation schemes to be symplectic are obtained. Some examples of symplectic collocation schemes are also given.     

Indirect methods of collocation: Trefftz‐Herrera collocation

A nonstandard collocation method (TH‐collocation) is presented, where collocation is used to construct specialized weighting functions instead of the solution itself, as it is usual, so that in this sense it is an indirect method. TH‐collocation is shown to be as accurate as standard collocation, but computationally far more efficient. The present article is the first of a series devoted to explore thoroughly collocation methods. The following classification of collocation methods is introduced: direct‐nonoverlapping; indirect‐nonoverlapping; direct‐overlapping; and indirect‐overlapping. Most of the effort reported in the literature has gone to direct‐nonoverlapping methods. The procedure presented in this article falls into the indirect‐nonoverlapping category and it is based on Trefftz‐Herrera formulation. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 709–738, 1999     

Superconvergence of collocation methods for a class of weakly singular Volterra integral equations

We discuss the application of spline collocation methods to a certain class of weakly singular Volterra integral equations. It will be shown that, by a special choice of the collocation parameters, superconvergence properties can be obtained if the exact solution satisfies certain conditions. This is in contrast with the theory of collocation methods for Abel type equations. Several numerical examples are given which illustrate the theoretical results.     

The discrete collocation method for nonlinear integral equations

The collocation method for solving linear and nonlinear integralequations results in many integrals which must be evaluatednumerically. In this paper, we give a general framework fordiscrete collocation methods, in which all integrals are replacedby numerical integrals. In some cases, the collocation methodleads to solutions which are superconvergent at the collocationnode points. We consider generalizations of these results, toobtain similar results for discrete collocation solutions. Lastly,we consider a variant due to Kumar and Sloan for the collocationsolution of Hammerstein integral equations.     

An Adaptive Greedy Algorithm for Solving Large RBF Collocation Problems

The solution of operator equations with radial basis functions by collocation in scattered points leads to large linear systems which often are nonsparse and ill-conditioned. But one can try to use only a subset of the data for the actual collocation, leaving the rest of the data points for error checking. This amounts to finding sparse approximate solutions of general linear systems arising from collocation. This contribution proposes an adaptive greedy method with proven (but slow) linear convergence to the full solution of the collocation equations. The collocation matrix need not be stored, and the progress of the method can be controlled by a variety of parameters. Some numerical examples are given.     

Analysis of a moving collocation method for one-dimensional partial differential equations

A moving collocation method has been shown to be very efficient for the adaptive solution of second- and fourth-order time-dependent partial differential equations and forms the basis for the two robust codes MOVCOL and MOVCOL4.In this paper,the relations between the method and the traditional collocation and finite volume methods are investigated.It is shown that the moving collocation method inherits desirable properties of both methods: the ease of implementation and high-order convergence of the traditional collocation method and the mass conservation of the finite volume method.Convergence of the method in the maximum norm is proven for general linear two-point boundary value problems.Numerical results are given to demonstrate the convergence order of the method.     

Regularized collocation method for Fredholm integral equations of the first kind

In this paper we consider a collocation method for solving Fredholm integral equations of the first kind, which is known to be an ill-posed problem. An “unregularized” use of this method can give reliable results in the case when the rate at which smallest singular values of the collocation matrices decrease is known a priori. In this case the number of collocation points plays the role of a regularization parameter. If the a priori information mentioned above is not available, then a combination of collocation with Tikhonov regularization can be the method of choice. We analyze such regularized collocation in a rather general setting, when a solution smoothness is given as a source condition with an operator monotone index function. This setting covers all types of smoothness studied so far in the theory of Tikhonov regularization. One more issue discussed in this paper is an a posteriori choice of the regularization parameter, which allows us to reach an optimal order of accuracy for deterministic noise model without any knowledge of solution smoothness.     

Hammerstein型弱奇异积分方程的β-多项式配置方法

1．引言对VOlterra弱奇异积分方程和积一微分方程之配置方法已有不少文章讨论［1－6］．由于其解在左端点处的非光滑性[3]并要得到m-1次多项式配置解的最优收敛率。，需采用所谓的等级网格．早期M作［1,2］是将等级指数r取为1，a表征核（t—s）ak（t，8）的奇异程度），但...     

On the Divergence of Collocation Solutions in Smooth Piecewise Polynomial Spaces for Volterra Integral Equations

In this paper we present a characterization of those smooth piecewise polynomial collocation spaces that lead to divergent collocation solutions for Volterra integral equations of the second kind. The key to these results is an equivalence result between such collocation solutions and collocation solutions in slightly smoother spaces for initial-value problems for ordinary differential equations. For the latter problems Mülthei (1979/1980) established a complete divergence (and convergence) theory. Our analysis can be extended to furnish divergence results for smooth collocation solutions to Volterra integral equations of the first kind. AMS subject classification (2000) 65R20, 65L20, 65L60.Received May 2004. Accepted September 2004. Communicated by Tom Lyche.Hermann Brunner: This research was supported by the Natural Sciences and Engineering Research Council of Canada (NSERC).