积分算子方程的连续型配置方法

1．引言由于对积分算子方程来说，配置法比Galerkin法具计算量小的优点（少算一重积分），故配置法更受人们重视．但已有的文献几乎都是将配置空间取作非连续的分片多项式样条空间，以得到某种超收敛结果（如［1，2］）．这种方法存在下列不足：（a）光滑核Volterra积分方程与光滑核Fredholm积分方程具完全不同的收敛性质［1］，且需用不同的方法获得其加速收敛结果（比较［31与［4］），尽管Volterra积分方程在理论上被看作是Fredholm积分方程的特殊情形；（b）光滑核Volterra积分方程的配置解不具任何超收敛性，其迭代配置解也只在结点…     

解第一类边界积分方程的高精度机械求积法与外推

０．引言使用单层位势理论把Ｄｉｒｉｃｈｌｅｔ问题：转化为具有对数核的边界积分方程：这里Г假设为简单光滑闭曲线．熟知,若Г的容度Ｃｒ≠１,（０．２）有唯一解存在［１］．借助参数变换这里的数值解法有Ｇａｌｅｒｋｉｎ法［２］,配置法［３］,和谱方法~［４］,这些方法有一个共同缺点就是矩阵元素的生成要计算反常积分,由于离散方程的系数矩阵是满阵,使矩阵生成的工作量很庞大,甚至超过了解方程组的工作量．显然,如能找到适当求积公式离散（０．２）,则可节省大量计算．使用求积公式法解（０．２）的文献不多,［５］中提…     

Clifforrd分析中广义双正则函数的(线性)非线性边值问题

本文研究Ｃｌｉｆｏｒｄ分析中广义双正则函数的一个非线性边值问题：Ａ（ｔ１，ｔ２）Ｗ＋＋（ｔ１，ｔ２）＋Ｂ（ｔ１，ｔ２）Ｗ＋－（ｔ１，ｔ２）＋Ｃ（ｔ１，ｔ２）Ｗ－＋（ｔ１，ｔ２）＋Ｄ（ｔ１，ｔ２）Ｗ－－（ｔ１，ｔ２）＝ｇ（ｔ１，ｔ２）ｆｔ１，ｔ２，Ｗ＋＋（ｔ１，ｔ２），Ｗ＋－（ｔ１，ｔ２），Ｗ－＋（ｔ１，ｔ２），Ｗ－－（ｔ１，ｔ２）［］．先讨论解的积分表示式，再研究几个奇异算子，最后用Ｓｃｈａｕｄｅｒ不动点原理（压缩映射定理）证明了解的存在性（唯一性）．目前还没有见到其它国内外学者研究广义双正则函数的非线性边值问题．本文推广了Ｆ．Ｂｒａｃｋｓ，Ｗ．Ｐｉｎｃｋｅｔ［１０］，ＬｅＨｕａｎｇ Ｓｏｎ［１１］，Ｒ．Ｐ．ＧｉｌｂｅｒｔａｎｄＪ．Ｌ．Ｂｕｃｈｎａｎ［１５］和黄沙［１３］的工作     

铁磁链方程的Fourier谱方法和拟谱方法

在铁磁链方程运动研究中，各项同性Heisellberg链的所谓Landau－Lifshitz方程L‘1为其中旋密度Z＝（。，t），w）”和h＝（0，0，h（t））”为三维向量函数，。X”表示三维向量的叉积．这种方程组还常在凝聚态介质物理的问题中出现，有不少文章是关于Landau－Lifshitz方程组的孤立于解，孤立波的相互作用以及无穷守恒律等的研究［‘－‘］，［5，6，7］研究了具有小扩散项旋方程组解的存在性及隐式差分格式．在［7］中给出的结果，证明了铁磁连方程解的存在性与唯一性，作者在［8］中考察了旋方程组（2）的周期初值问题的显式差分解，并…     

关于奇异方程解的研究

本文用克莱姆法则，给出奇异方程ＡＸ＝ｂ［Ｉｎｄ（Ａ）＝ｋ，ｂ∈Ｒ（Ａｋ）］的唯一解，且如果Ａ是非奇异，可归纳到通常的克莱姆法则     

解非线性方程的二阶敛速指数迭代法

1．gi言文［1，2］中利用ODE方法［'］给出解非线性方程在卜6I内的根x"的两个非线性迭代法其中'w由文［2］中（5）式确定．令h-1方法（2）具有M阶敛速，方法（3）是线性收敛的．它们是李雅普诺夫渐近稳定性和文［4］中Lambert提出的解Stiff方程的非线性方法相结合的结果．Lllbll't在每个小区间【Ln，Ln＋1］上用一个有理函数月O一句（I十利来逼近微分方程的解z二"I，＊。）；＊。Ek；q，使得对I＿，J。）一J＿，"乙十；，J。）＝。＿＋i，l'（Ln，10）一人，而tim0（7；00）一0"．那么我们能否在每个小区间【Ln，Ln＋1］上用一个指…     

多滞量积分方程基于高阶插值的分步配置方法

1．引言考虑多滞量Volterra积分方程其中常数假定已知函数R在定义域内连续，以保证方程（1.1）存在唯一解形如（1．1）的Volterra延滞积分方程常出现在物理问题和生物模型中［2］．由于“滞量”的影响，对其作理论分析和数值研究均比“古典”的Volterra积分方程更为困难．近来人们对Volterra延滞积分方程的数值求解越来越感兴趣[3，4]，但目前的工作基本上只限于单滞量的情形：并采用所谓的“约束”网格（即要求步长人整除一，且假定T是，的整数倍（否则，应在更大的区间上求解），以保证数值解在结点集上具有理想的收敛率．显然，这些限…     

连续同伦方法的点估计判据

本文证明了，当S·Smale［1］的点估计判据a（z0，f）＝||Df（z0）-1·f（z0）||sup||Df－1（z0）·时，求Banach空间解析映照f零点的连续同伦H（t，z）≡f（z）＋（t－1）f（z0）＝0有定义于［0，1］上的解z（t），且对t∈［0，1］，Hz（t，z（t））－1存在，进而F（Z（1））＝0，可以用连续同伦方法求得f的零点．     

关于非线性奇异积分微分方程解的延拓

在该文中．研究下面的带柯西核的非线性奇异积分微分方程的解这里Γ是简单的李雅普诺夫闭路，u（t）是应当确定的未知函数U（t）=｛u（t），u'（t）.........u（n）（t）｝,uj0是某些实数或复数．（1）型的非线性奇异积分微分方程用插入法或拓扑法在[1]－[5]的论文中已被研究．在[6]．[7]的论文中方程（1）的解用李雅鲁诺夫的分析方法来研究．     

解高维广义对称正则长波方程的Fourier谱方法

１引言对称正则长波方程（ＳＲＬＷＥ）是正则化长波方程（ＲＬＷＥ）的一种对称叙述［１］用于描述弱非线性作用下空间变换的离子声波传播．［１］得到了方程组（１．１）的双曲正割平方孤立波解、四个不变量和数值结果、明显地,从（１．１）中消去ρ,得到一类正则长波方程（ＲＬＷＥ）代替（１．２）中第三项、第四项对ｔ的导数为对ｘ的导数,得到Ｂｏｕｓｓｉｎｅｓｑ方程．［２］对一类广义对称正则长波方程组提出了谱方法,证明了古典光滑解的存在性和唯一性,建立了近似解的收敛性和误差估计。［３］研究了高维对称正则长波方程整体…     

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.     

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.     

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.     

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.     

On the stability of meshless symmetric collocation for boundary value problems

In this paper, we study the stability of symmetric collocation methods for boundary value problems using certain positive definite kernels. We derive lower bounds on the smallest eigenvalue of the associated collocation matrix in terms of the separation distance. Comparing these bounds to the well-known error estimates shows that another trade-off appears, which is significantly worse than the one known from classical interpolation. Finally, we show how this new trade-off can be overcome as well as how the collocation matrix can be stabilized by smoothing. AMS subject classification (2000)  65N12, 65N15, 65N35     

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).     

Perturbed collocation and symplectic RKN methods

It is known that many Runge-Kutta-Nyström methods can be derived by collocation. In this paper we prove that the onlys-stage symplectic Runge-Kutta-Nyström method that can be obtained by ordinary collocation is of order 2s and implicit. We also extend the idea of perturbed collocation to Runge-Kutta-Nyström methods and derive symplectic Runge-Kutta-Nyström methods using this technique. We have obtained symplectic implicits-stage Runge-Kutta-Nyström methods of order 2s?1 and 2s?2.     

Perturbed collocation and symplectic RKN methods

It is known that many Runge-Kutta-Nystr?m methods can be derived by collocation. In this paper we prove that the onlys-stage symplectic Runge-Kutta-Nystr?m method that can be obtained by ordinary collocation is of order 2s and implicit. We also extend the idea of perturbed collocation to Runge-Kutta-Nystr?m methods and derive symplectic Runge-Kutta-Nystr?m methods using this technique. We have obtained symplectic implicits-stage Runge-Kutta-Nystr?m methods of order 2s−1 and 2s−2.     

Stability of collocation methods for delay differential equations with vanishing delays

We analyze the asymptotic stability of collocation solutions in spaces of globally continuous piecewise polynomials on uniform meshes for linear delay differential equations with vanishing proportional delay qt (0<q<1) (pantograph DDEs). It is shown that if the collocation points are such that the analogous collocation solution for ODEs is A-stable, then this asymptotic behaviour is inherited by the collocation solution for the pantograph DDE.     

A quadrature-based approach to improving the collocation method

Summary The collocation method is a popular method for the approximate solution of boundary integral equations, but typically does not achieve the high order of convergence reached by the Galerkin method in appropriate negative norms. In this paper a quadrature-based method for improving upon the collocation method is proposed, and developed in detail for a particular case. That case involves operators with even symbol (such as the logarithmic potential) operating on 1-periodic functions; a smooth-spline trial space of odd degree, with constant mesh spacingh=1/n; and a quadrature rule with 2n points (where ann-point quadrature rule would be equivalent to the collocation method). In this setting it is shown that a special quadrature rule (which depends on the degree of the splines and the order of the operator) can yield a maximum order of convergence two powers ofh higher than the collocation method.