the purpose of this study is to present an approximate numerical method for solving high order linear fredholm-volterra integro-differential equations in terms of rational chebyshev functions under the mixed conditions. the method is based on the approximation by the truncated rational chebyshev series. finally, the effectiveness of the method is illustrated in several numerical examples. the p...

in this paper, we propose a new method for solving the stochastic advection-diffusion equation of ito type. in this work, we use a compact finite difference approximation for discretizing spatial derivatives of the mentioned equation and semi-implicit milstein scheme for the resulting linear stochastic system of differential equation. the main purpose of this paper is the stability investigatio...

In this paper, we propose an optimized method for nonlinear function approximation based on multiplierless piecewise linear computation (ML-PLAC), which call OML-PLAC. OML-PLAC finds the minimum number of segments with predefined fractional bit width input/output, maximum shift-and-add operations, user-defined widths intermediate data, and absolute error (MAE). addition, minimizes actual MAE as...

In this paper, a new and efficient approach is applied for numerical approximation of the linear differential equations with variable coeffcients based on operational matrices with respect to Hermite polynomials. Explicit formulae which express the Hermite expansion coeffcients for the moments of derivatives of any differentiable function in terms of the original expansion coefficients of the f...

The approximation operators provided by classical Approximation Theory use exclusively as underlying algebraic structure the linear structure of the reals. Also they are all linear operators. We address in the present paper the following problems: Need all the approximation operators be linear? Is the linear structure the only one which allows us to construct particular approximation operators?...

We present a linear programming-based method for finding “gadgets,” i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A key step in this method is a simple observation which limits the search space to a finite one. Using this new method we present a number of new, computer-constructed gadgets for several different reductions. This method ...

Parametric surfaces in various representations, such as Bézier-and B-spline-tensorproduct patches, triangular patches etc., play an important role in CAGD-applications. Connecting patches with different degree of continuity and trimming surfaces are well-known techniques to construct a variety of shapes like ship hulls, car bodies, etc. For finite element analysis, stereolithography, rendering ...

Abstract. This paper focuses on total least squares (TLS) problems AX ≈ B with multiple right-hand sides. Existence and uniqueness of a TLS solution for such problems was analyzed in the paper [I. Hnětynková, M. Plešinger, D. M. Sima, Z. Strakoš, and S. Van Huffel (2011)]. For TLS problems with single right-hand sides the paper [C. C. Paige and Z. Strakoš (2006)] showed how a necessary and suff...

Let be a strictly positive monotonically decreasing function deened on the set of positive integers. Given real numbers and , consider the solubility of the following two inequalities jq + pj < (q); (1) jq + p + j < (q) (2) for integers p and q. The rst problem is said to be homogeneous and the second inho-mogeneous (see 2]). The well known theorem of Khintchine 2, 4] asserts that for almost al...