in the present article, a numerical method is proposed for the numerical solution of thekdv equation by using a new approach by combining cubic b-spline functions. in this paper we convert the kdv equation to system of two equations. the method is shown to be unconditionally stable using von-neumann technique. to test accuracy the error norms2l, ∞l are computed. three invariants of motion are p...

‎in this paper we introduce a numerical approach that solves optimal control problems (ocps)‎‎using collocation methods‎. ‎this approach is based upon b-spline functions‎.‎the derivative matrices between any two families of b-spline functions are utilized to‎‎reduce the solution of ocps to the solution of nonlinear optimization problems‎.‎numerical experiments confirm our theoretical findings‎.

we develope a numerical method based on b-spline collocation method to solve linear klein-gordon equation. the proposed scheme is unconditionally stable. the results of numerical experiments have been compared with the exact solution to show the efficiency of the method computationally. easy and economical implementation is the strength of this approach.

the numerical methods are of great importance for approximating the solutions of nonlinear ordinary or partial differential equations, especially when the nonlinear differential equation under consideration faces difficulties in obtaining its exact solution. in this latter case, we usually resort to one of the efficient numerical methods. in this paper, the chebyshev collocation method is sugge...

and Applied Analysis 3 2. Preliminaries Let w α,β x 1 − x α 1 x β be a weight function in the usual sense for α, β > −1. The set of Jacobi polynomials {P α,β k x } k 0 forms a complete L 2 w α,β −1, 1 -orthogonal system, and ∥ ∥ ∥P α,β k ∥ ∥ ∥ 2 w α,β h α,β k 2 β 1Γ k α 1 Γ ( k β 1 ) ( 2k α β 1 ) Γ k 1 Γ ( k α β 1 ) . 2.1 Here, L2 w α,β −1, 1 is a weighted space defined by L2 w α,β −1, 1 {v : v...

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

Abstract. A local convergence rate is established for an orthogonal collocation method based on Radau 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...

‎in this paper‎, ‎an approach based on statistical spline model (ssm) and collocation method is proposed to solve volterra-fredholm integral equations‎. ‎the set of collocation nodes is chosen so that the points yield minimal error in the nodal polynomials‎. ‎under some standard assumptions‎, ‎we establish the convergence property of this approach‎. ‎numerical results on some problems are given...

This paper focuses on the use of advanced techniques of text analysis as support for collocation extraction. A hybrid system is presented that combines statistical methods and multilingual parsing for detecting accurate collocational information from English, French, Spanish and Italian corpora. The advantage of relying on full parsing over using a traditional window method (which ignores the s...