The sparse grid stochastic collocation method is a new method for solving partial differential equations with random coefficients. However, when the probability space has high dimensionality, the number of points required for accurate collocation solutions can be large, and it may be costly to construct the solution. We show that this process can be made more efficient by combining collocation ...

Collocation is known as one of the most problematic areas in learning a second language and it seems that if one has tendency to improve his or her communication ability in another language, the elaboration of collocation using competence is among the most important issues. This study investigated the role of implicit input enhancement in teaching grammatical collocations for Iranian EFL learne...

We introduce a method for learning to find the representative syntax-based context of a given collocation/phrase. In our approach, grammatical patterns are extracted for query terms aimed at accelerating lexicographers’ and language learners’ navigation through the word usage and learning process. The method involves automatically lemmatizing, part-of-speech tagging and shallowly parsing the se...

Nowadays, spaceborne Synthetic Aperture Radar (SAR) has become a powerful tool for providing significant wave height. Traditionally, validation of SAR derived ocean wave height has been carried out against buoy measurements or model outputs, which only yield a inter-comparison, but not an ‘absolute’ validation. In this study, the triple collocation error model has been introduced in the validat...

We study the convergence behavior of collocation schemes applied to approximate solutions of BVPs in linear index 1 DAEs which exhibit a critical point at the left boundary. Such a critical point of the DAE causes a singularity within the inherent ODE system. We focus our attention on the case when the inherent ODE system is singular with a singularity of the first kind, apply polynomial colloc...

This work introduces the weighted radial basis collocation method for boundary value problems. We first show that the employment of least-squares functional with quadrature rules constitutes an approximation of the direct collocation method. Standard radial basis collocation method, however, yields a larger solution error near boundaries. The residuals in the least-squares functional associated...

Term Extraction, a key data preparation step in Text Mining, extracts the terms, i.e. relevant collocation of words, attached to specific concepts (e.g. genetic-algorithms and decisiontrees are terms associated to the concept “Machine Learning” ). In this paper, the task of extracting interesting collocations is achieved through a supervised learning algorithm, exploiting a few collocations man...

Collocations in the sense of idiosyncratic binary lexical co-occurrences are one of the biggest challenges for any language learner. Even advanced learners make collocation mistakes in that they literally translate collocation elements from their native tongue, create new words as collocation elements, choose a wrong subcategorization for one of the elements, etc. Therefore, automatic collocati...

We rigorously study a novel type of trigonometric Fourier collocation methods for solving multi-frequency oscillatory second-order ordinary differential equations (ODEs) q′′(t) + Mq(t) = f(q(t)) with a principal frequency matrix M ∈ Rd×d. If M is symmetric and positive semi-definite and f(q) = −∇U(q) for a smooth function U(q), then this is a multi-frequency oscillatory Hamiltonian system with ...

A collocation-Galerkin method is defined for Poisson's equation on the unit 2 square, using tensor products of continuous piecewise polynomials. Optimal L and Hq orders of convergence are established. This procedure requires fewer quadratures than the corresponding Galerkin procedure. Introduction. The collocation-Galerkin method was first introduced by Diaz [2], [3] for the two-point boundary ...