We consider an approximation scheme using Haar wavelets for solving a class of infinite horizon optimal control problems (OCP's) of nonlinear interconnected large-scale dynamic systems. A computational method based on Haar wavelets in the time-domain is proposed for solving the optimal control problem. Haar wavelets integral operational matrix and direct collocation method are utilized to find ...

In this article, a numerical method based on  improvement of block-pulse functions (IBPFs) is discussed for solving the system of linear Volterra and Fredholm integral equations. By using IBPFs and their operational matrix of integration, such systems can be reduced to a linear system of algebraic equations. An efficient error estimation and associated theorems for the proposed method are also ...

In this article we have developed third order exact finite difference method for the numerical solution of third order boundary value problems. We constructed our numerical technique without change in structure of the coefficient matrix of the second-order method in cite{Pand}. We have discussed convergence of the proposed method. Numerical experiments on model test problems approves the simply...

the purpose of the present study is to introduce the sequence space[{l_p}(e,delta) = left{ x = (x_n)_{n = 1}^infty : sum_{n = 1}^infty left| sum_{j in {e_n}} x_j - sum_{j in e_{n + 1}} x_jright| ^p < infty right},]where $e=(e_n)$ is a partition of finite subsets of the positive integers and $pge 1$. the topological properties and inclusion relations of this space are studied. moreover, the prob...

let $rin textbf{c}^{mtimes m}$ and $sin textbf{c}^{ntimes n}$ be nontrivial involution matrices; i.e., $r=r^{-1}neq pm~i$ and $s=s^{-1}neq pm~i$. an $mtimes n$ complex matrix $a$ is said to be an $(r, s)$-symmetric ($(r, s)$-skew symmetric) matrix if $ras =a$ ($ ras =-a$). the $(r, s)$-symmetric and $(r, s)$-skew symmetric matrices have a number of special properties and widely used in engi...

An efficient, accurate and reliable approximation of a matrix by one of lower rank is a fundamental task in numerical linear algebra and signal processing applications. In this paper, we introduce a new matrix decomposition approach termed Subspace-Orbit Randomized singular value decomposition (SORSVD), which makes use of random sampling techniques to give an approximation to a low-rank matrix....

A parallel algorithm for solving a series of matrix equations with a constant tridiagonal matrix and different right-hand sides is proposed and studied. The process of solving the problem is represented in two steps. The first preliminary step is fixing some rows of the inverse matrix of SLAEs. The second step consists in calculating solutions for all right-hand sides. For reducing the communic...

The paper describes research and development of a software system for plywood mill operation planning. Various tasks related to planning of plywood operation can be successfully solved with the use of specialized software. The paper describes solution of the problem of calculating monthly production plans, which requires the use of advanced mathematical models and optimization algorithms. There...

We evaluate and compare the storage efficiency of different sparse matrix storage formats as index structure for text collection and their corresponding sparse matrixvector multiplication algorithm to perform query processing in information retrieval (IR) application. We show the results of our implementations for several sparse matrix algorithms such as Coordinate Storage (COO), Compressed Spa...

Collaborative filtering (CF) recommenders are subject to numerous shortcomings such as centralized processing, vulnerability to shilling attacks, and most important of all privacy. To overcome these obstacles, researchers proposed for utilization of interpersonal trust between users, to alleviate many of these crucial shortcomings. Till now, attention has been mainly paid to strong points about...