In the theoretical part of this paper, we introduce a simplified proof technique for error bounds and convergence of a variation of E. Kansa’s well-known unsymmetric meshless collocation method. For a numerical implementation of the convergent variation, a previously proposed greedy technique is coupled with linear optimization. This algorithm allows a fully adaptive on-the-fly data-dependent m...

In this paper, we propose an auto-companding technique for the analog behavioral modeling via wavelet collocation method. The companding function is automatically constructed according to the singularities of the input-output function of the circuit block. Such a general-purpose technique can be applied for the automatic modeling of arbitrary building block of arbitrary input-output function. M...

Collocation translation is important for machine translation and many other NLP tasks. Unlike previous methods using bilingual parallel corpora, this paper presents a new method for acquiring collocation translations by making use of monolingual corpora and linguistic knowledge. First, dependency triples are extracted from Chinese and English corpora with dependency parsers. Then, a dependency ...

We present in this paper the convergence properties of Jacobi spectral collocation method when used to approximate the solution of multidimensional nonlinear Volterra integral equation. The solution is sufficiently smooth while the source function and the kernel function are smooth. We choose the Jacobi-Gauss points associated with the multidimensional Jacobi weight function [Formula: see text]...

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

Nonautonomous systems with periodic solutions are encountered frequently in applications. In this paper, we will consider simple systems whose solutions are periodic with a known period. Their transformation under linearized collocation methods is investigated, using a technique called stroboscopic sampling, a discrete version of the well-known Poincaré map. It is shown that there is an inextri...

Periodic Lyapunov differential equations can be used to formulate robust optimal periodic control problems for nonlinear systems. Typically, the added Lyapunov states are discretized in the same manner as the original states. This straightforward technique fails to guarantee conservation of positive-semidefiniteness of the Lyapunov matrix under discretization. This paper describes a discretizat...

Traditionally, context features used in word sense disambiguation are based on collocation statistics and use only minimal syntactic and semantic information. Corpus Pattern Analysis is a technique for producing knowledge-rich context features that capture sense distinctions. It involves (1) identifying sense-carrying context patterns and (2) using the derived context features to discriminate b...

In this paper, a new approach to the numerical solution of VolterraFredholm integral equations by using CAS wavelets in combination with the collocation technique is proposed. First, the unknown function is approximated by using CAS wavelets, then the VolterraFredholm integral equation is reduced to the linear or nonlinear system of equations. Moreover, the convergence theorem for the proposed ...

In this paper, we introduce an approach by using inverse fuzzy transforms based on the fuzzy partition with combination in collocation technique for the numerical solution of Fredholm integral equations of the second kind. The main advantage of this approach is to reduce the problem to the linear system of equations. We present the convergence theorem for this method. Finally, we give two examp...