Superconvergence of the iterated collocation methods for Hammerstein equations

In this paper, we analyse the iterated collocation method for Hammerstein equations with smooth and weakly singular kernels. The paper expands the study which began in [16] concerning the superconvergence of the iterated Galerkin method for Hammerstein equations. We obtain in this paper a similar superconvergence result for the iterated collocation method for Hammerstein equations. We also discuss the discrete collocation method for weakly singular Hammerstein equations. Some discrete collocation methods for Hammerstein equations with smooth kernels were given previously in [3, 18].     

双比例延迟微分方程配置法的可达阶

近几十年来,随着延迟微分方程广泛应用于变最测试、信号传递、机械化工、生命科学及经济管理系统等实际中,人们对此类方程的数值计算要求越来越高．     

A collocation approach for solving linear complex differential equations in rectangular domains

In this paper, a collocation method is presented to find the approximate solution of high‐order linear complex differential equations in rectangular domain. By using collocation points defined in a rectangular domain and the Bessel polynomials, this method transforms the linear complex differential equations into a matrix equation. The matrix equation corresponds to a system of linear equations with the unknown Bessel coefficients. The proposed method gives the analytic solution when the exact solutions are polynomials. Numerical examples are included to demonstrate the validity and applicability of the technique and the comparisons are made with existing results. The results show the efficiency and accuracy of the present work. All of the numerical computations have been performed on a computer using a program written in MATLAB v7.6.0 (R2008a). Copyright © 2012 John Wiley & Sons, Ltd.     

A collocation approach for the numerical solution of certain linear retarded and advanced integrodifferential equations with linear functional arguments

This article presents a Taylor collocation method for the approximate solution of high‐order linear Volterra‐Fredholm integrodifferential equations with linear functional arguments. This method is essentially based on the truncated Taylor series and its matrix representations with collocation points. Some numerical examples, which consist of initial and boundary conditions, are given to show the properties of the technique. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

混合广义Jacobi和Chebyshev谱配置法求解时间分数阶对流扩散方程

研究时间Caputo分数阶对流扩散方程的高效高阶数值方法.对于给定的时间分数阶偏微分方程,在时间和空间方向分别采用基于移位广义Jacobi函数为基底和移位Chebyshev多项式运算矩阵的谱配置法进行数值求解.这样得到的数值解可以很好地逼近一类在时间方向非光滑的方程解.最后利用一些数值例子来说明该数值方法的有效性和准确性.     

二维变系数对流扩散问题的特征配置法

1引言 在多种问题的数值模拟中均涉及抛物型对流扩散方程的数值求解问题.由于配置法 无需计算数值积分，计算简便，收敛阶高等优点，使之在工程技术和计算数学的许多领域 得到广泛的应用，但范围一般局限在一维常系数{1，21和二维常系数问题降，4]，90年代[s] 提出了二维变系数     

On the determination of boundary collocation points for solving some problems for the Laplace operator

Boundary collocation is a method for obtaining approximate solutions of boundary problems for linear partial differential equations, for which complete families of particular solutions are explicitly known. The method contains various decisions which are important for its performance, such as choice of solution subspace, choice of basis for the subspace, and choice of collocation points. Using a model problem, some particular strategies for the determination of collocation points are investigated.     

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.     

B-Spline Collocation Method for Nonlinear Singularly-Perturbed Two-Point Boundary-Value Problems

A B-spline collocation method is presented for nonlinear singularly-perturbed boundary-value problems with mixed boundary conditions. The quasilinearization technique is used to linearize the original nonlinear singular perturbation problem into a sequence of linear singular perturbation problems. The B-spline collocation method on piecewise uniform mesh is derived for the linear case and is used to solve each linear singular perturbation problem obtained through quasilinearization. The fitted mesh technique is employed to generate a piecewise uniform mesh, condensed in the neighborhood of the boundary layers. The convergence analysis is given and the method is shown to have second-order uniform convergence. The stability of the B-spline collocation system is discussed. Numerical experiments are conducted to demonstrate the efficiency of the method.     

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.     

The Legendre Galerkin-Chebyshev collocation method for Burgers-like equations

A Legendre Galerkin–Chebyshev collocation method for Burgers-likeequations is developed. This method is based on the Legendre–Galerkinvariational form, but the nonlinear term and the right-handterm are treated by Chebyshev–Gauss interpolation. Errorestimates of the semi-discrete scheme and the fully discretescheme are given in the L²-norm. Numerical results indicatethat our method is as stable and accurate as the standard Legendrecollocation method, and as efficient and easy to implement asthe standard Chebyshev collocation method.     

Legendre spectral method for the fractional Bratu problem

In this paper, the Legendre spectral collocation method (LSCM) is applied for the solution of the fractional Bratu's equation. It shows the high accuracy and low computational cost of the LSCM compared with some other numerical methods. The fractional Bratu differential equation is transformed into a nonlinear system of algebraic equations for the unknown Legendre coefficients and solved with some spectral collocation methods. Some illustrative examples are also given to show the validity and applicability of this method, and the obtained results are compared with the existing studies to highlight its high efficiency and neglectable error.     

A fast collocation method for the radiosity equation,based on the hierarchical algorithm of Hanrahan and Salzman: the 1d case

In this paper we study a collocation method with piecewise constant trial functions for the solution of the planar radiosity equation. The matrix of the collocation method is approximated by a method which was developed by Hanrahan et al. [9,10]. We prove that the modified collocation method results in a reduction of work while the order of convergence stays the same. Numerical examples demonstrate the theoretical results. AMS subject classification 45B05, 65R20, 65Y20     

Numerical solution of singularly perturbed convection-diffusion problem using parameter uniform B-spline collocation method

This paper is concerned with a numerical scheme to solve a singularly perturbed convection-diffusion problem. The solution of this problem exhibits the boundary layer on the right-hand side of the domain due to the presence of singular perturbation parameter ε. The scheme involves B-spline collocation method and appropriate piecewise-uniform Shishkin mesh. Bounds are established for the derivative of the analytical solution. Moreover, the present method is boundary layer resolving as well as second-order uniformly convergent in the maximum norm. A comprehensive analysis has been given to prove the uniform convergence with respect to singular perturbation parameter. Several numerical examples are also given to demonstrate the efficiency of B-spline collocation method and to validate the theoretical aspects.     

求解Lavrentiev迭代方程的多尺度快速配置算法

考虑了第一类Fredholm积分方程的求解.采用有矩阵压缩策略的多尺度配置方法来离散Lavrentiev迭代方程,在积分算子是弱扇形紧算子时,给出近似解的先验误差估计,并给出了改进的后验参数的选择方法,得到了近似解的收敛率.最后,举例说明算法的有效性.     

瞬态问题稳定性及弥散分析的无网格RKPM配点法研究

介绍了基于强形式的RKPM配点法求解瞬态动力问题的算法,并提出了采用RKPM配点法,配合时间域中心差分求解二阶波动方程的稳定性评价方法,并通过数值算例验证了此方法的正确性．此评价方法可以方便有效地评估出实际计算时的临界时间步长．通过数值算例比较可知,实际算例的计算临界时间步长与本评价方法,所预测的临界时间步长结果非常接近．给出了如何合理地选择RKPM形函数支撑域的建议．最后与径向基函数配点法进行了对比研究．     

Exponentially-fitted methods and their stability functions

We investigate the properties of stability functions of exponentially-fitted Runge–Kutta methods, and we show that it is possible (to some extent) to determine the stability function of a method without actually constructing the method itself. To focus attention, examples are given for the case of one-stage methods. We also make the connection with so-called integrating factor methods and exponential collocation methods. Various approaches are given to construct these methods.     

An efficient cubic B-spline and bicubic B-spline collocation method for numerical solutions of multidimensional nonlinear stochastic quadratic integral equations

This paper aims to develop a novel numerical approach on the basis of B-spline collocation method to approximate the solution of one-dimensional and two-dimensional nonlinear stochastic quadratic integral equations. The proposed approach is based on the hybrid of collocation method, cubic B-spline, and bi-cubic B-spline interpolation and Itô approximation. Using this method, the problem solving turns into a nonlinear system solution of equations that is solved by a suitable numerical method. Also, the convergence analysis of this numerical approach has been discussed. In the end, examples are given to test the accuracy and the implementation of the method. The results are compared with the results obtained by other methods to verify that this method is accurate and efficient.     

Generalized Lagrange Jacobi-Gauss-Lobatto vs Jacobi-Gauss-Lobatto collocation approximations for solving (2 + 1)-dimensional Sine-Gordon equations

The Sine-Gordon (SG) equations are very important in that they can accurately model many essential physical phenomena. In this paper, the Jacobi-Gauss-Lobatto collocation (JGL-C) and Generalized Lagrange Jacobi-Gauss-Lobatto collocation (GLJGL-C) methods are adopted and compared to simulate the (2 + 1)-dimensional nonlinear SG equations. In order to discretize the time variable t, the Crank-Nicolson method is employed. For the space variables, two numerical methods based on the aforementioned collocation methods are applied. Furthermore, error estimation for both methods is provided. The present numerical method is truly effective, free of integration and derivative, and easy to implement. The given examples and the results assert that the GLJGL-C method outperforms the JGL-C method in terms of computation speed. Also, the presented methods are very valid, effective, and reliable.     

三阶微分方程的多区域Legendre-Petrov-Galerkin谱方法

提出三阶微分方程初边值问题的多区域Legendre-Petrov-Galerkin谱方法.对于三阶线性微分方程,证明该方法全离散格式的稳定性,并给出L~2-误差估计.进而将该方法和Legendre配置方法相结合,应用于某些非线性问题.数值算例对单区域和多区域方法的结果进行比较.