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

Method for Automatic Collocation Extraction from Ukrainian Corpora

The article deals with the methods for automatic collocation extraction from Ukrainian corpora. The task of collocation extraction is considered in terms of a corpus-oriented approach [1], based on statistical measures. The term «collocation» is defined as a non-random combination of two words that go together regularly

Stochastic collocation on unstructured multivariate meshes

Collocation has become a standard tool for approximation of parameterized systems in the uncertainty quantification (UQ) community. Techniques for least-squares regularization, compressive sampling recovery, and interpolatory reconstruction are becoming standard tools used in a variety of applications. Selection of a collocation mesh is frequently a challenge, but methods that construct geometrically "unstructured" collocation meshes have shown great potential due to attractive theoretical properties and direct, simple generation and implementation. We investigate properties of these meshes, presenting stability and accuracy results that can be used as guides for generating stochastic collocation grids in multiple dimensions.Comment: 29 pages, 6 figure

Convergence of spectral methods for hyperbolic initial-boundary value systems

A convergence proof for spectral approximations is presented for hyperbolic systems with initial and boundary conditions. The Chebyshev collocation is treated in detail, but the final result is readily applicable to other spectral methods, such as Legendre collocation or tau-methods

Towards a collocation writing assistant for learners of Spanish

This paper describes the process followed in creating a tool aimed at helping learners produce collocations in Spanish. First we present the Diccionario de colocaciones del español (DiCE), an online collocation dictionary, which represents the first stage of this process. The following section focuses on the potential user of a collocation learning tool: we examine the usability problems DiCE presents in this respect, and explore the actual learner needs through a learner corpus study of collocation errors. Next, we review how collocation production problems of English language learners can be solved using a variety of electronic tools devised for that language. Finally, taking all the above into account, we present a new tool aimed at assisting learners of Spanish in writing texts, with particular attention being paid to the use of collocations in this language

Blow-up behavior of collocation solutions to Hammerstein-type volterra integral equations

We analyze the blow-up behavior of one-parameter collocation solutions for Hammerstein-type Volterra integral equations (VIEs) whose solutions may blow up in finite time. To approximate such solutions (and the corresponding blow-up time), we will introduce an adaptive stepsize strategy that guarantees the existence of collocation solutions whose blow-up behavior is the same as the one for the exact solution. Based on the local convergence of the collocation methods for VIEs, we present the convergence analysis for the numerical blow-up time. Numerical experiments illustrate the analysis

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