A fractional spline collocation method for the fractional order logistic equation

We construct a collocation method based on the fractional B-splines to solve a nonlinear differential problem that involves fractional derivative, i.e. the fractional order logistic equation. The use of the fractional B-splines allows us to express the fractional derivative of the approximating function in an analytic form. Thus, the fractional collocation method is easy to implement, accurate and efficient. Several numerical tests illustrate the efficiency of the proposed collocation method.We construct a collocation method based on the fractional B-splines to solve a nonlinear differential problem that involves fractional derivative, i.e. the fractional order logistic equation. The use of the fractional B-splines allows us to express the fractional derivative of the approximating function in an analytic form. Thus, the fractional collocation method is easy to implement, accurate and efficient. Several numerical tests illustrate the efficiency of the proposed collocation method

Convergence rate for a Gauss collocation method applied to unconstrained optimal control

A local convergence rate is established for an orthogonal collocation method based on Gauss quadrature applied to an unconstrained optimal control problem. If the continuous problem has a sufficiently smooth solution and the Hamiltonian satisfies a strong convexity condition, then the discrete problem possesses a local minimizer in a neighborhood of the continuous solution, and as the number of collocation points increases, the discrete solution convergences exponentially fast in the sup-norm to the continuous solution. This is the first convergence rate result for an orthogonal collocation method based on global polynomials applied to an optimal control problem

On hphp-Convergence of PSWFs and A New Well-Conditioned Prolate-Collocation Scheme

The first purpose of this paper is to provide a rigorous proof for the nonconvergence of $h$-refinement in $hp$-approximation by the PSWFs, a surprising convergence property that was first observed by Boyd et al [J. Sci. Comput., 2013]. The second purpose is to offer a new basis that leads to spectral-collocation systems with condition numbers independent of $(c,N),$ the intrinsic bandwidth parameter and the number of collocation points. In addition, this work gives insights into the development of effective spectral algorithms using this non-polynomial basis. We in particular highlight that the collocation scheme together with a very practical rule for pairing up $(c,N)$ significantly outperforms the Legendre polynomial-based method (and likewise other Jacobi polynomial-based method) in approximating highly oscillatory bandlimited functions.Comment: 23 pages, 17 figure

Simulations using meshfree methods

In this paper, attempt is made to solve a few problems using the Polynomial Point Collocation Method (PPCM), the Radial Point Collocation Method (RPCM), Smoothed Particle Hydrodynamics (SPH), and the Finite Point Method (FPM). A few observations on the accuracy of these methods are recorded. All the simulations in this paper are three dimensional linear elastostatic simulations, without accounting for body forces.Comment: preprint (draft) + 3 figures, 1 table, 2 appendices, 2 images, 1 MATLAB cod

Some spectral approximation of one-dimensional fourth-order problems

Some spectral type collocation method well suited for the approximation of fourth-order systems are proposed. The model problem is the biharmonic equation, in one and two dimensions when the boundary conditions are periodic in one direction. It is proved that the standard Gauss-Lobatto nodes are not the best choice for the collocation points. Then, a new set of nodes related to some generalized Gauss type quadrature formulas is proposed. Also provided is a complete analysis of these formulas including some new issues about the asymptotic behavior of the weights and we apply these results to the analysis of the collocation method

Adaptive Wavelet Collocation Method for Simulation of Time Dependent Maxwell's Equations

This paper investigates an adaptive wavelet collocation time domain method for the numerical solution of Maxwell's equations. In this method a computational grid is dynamically adapted at each time step by using the wavelet decomposition of the field at that time instant. In the regions where the fields are highly localized, the method assigns more grid points; and in the regions where the fields are sparse, there will be less grid points. On the adapted grid, update schemes with high spatial order and explicit time stepping are formulated. The method has high compression rate, which substantially reduces the computational cost allowing efficient use of computational resources. This adaptive wavelet collocation method is especially suitable for simulation of guided-wave optical devices