The performance analysis of high rate space–time trellis-coded modulation (HR-STTCM) using the Gauss–Chebyshev quadrature technique is presented. HR-STTCM is an example of space– time codes that combine the idea used in trellis coded modulation (TCM) design that is signal set expansion and set partitioning into its construction. HR-STTCM construction is based on the concatenation of an outer TC...

Given a directed graph G = (N,A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacity vector û for the arc set A such that a given feasible flow x̂ is optimal with respect to the modified capacities. Among all capacity vectors û satisfying this condition, we would like to find one with minimum ‖û− u‖ value....

Chebyshev polynomials are utilized to obtain solutions of a set of pth order linear differential equations with periodic coefficients. For this purpose, the operational matrix of differentiation associated with the shifted Chebyshev polynomials of the first kind is derived. Utilizing the properties of this matrix, the solution of a system of differential equations can be found by solving a set ...

In this paper, a numerical method for solving the Fredholm and Volterra integral equations is presented. The method is based upon the second Chebyshev wavelet approximation. The properties of the second Chebyshev wavelet are first presented and then operational matrix of integration of the second Chebyshev wavelets basis and product operation matrix of it are derived. The second Chebyshev wavel...

in this study, the problem of determining an optimal trajectory of a nonlinear injection into orbit problem with minimum time was investigated. the method was based on orthogonal polynomial approximation. this method consists of reducing the optimal control problem to a system of algebraic equations by expanding the state and control vector as chebyshev or legendre polynomials with undetermined...

A new computational scheme using Chebyshev polynomials is proposed for the numerical solution of parametrically excited nonlinear systems. The state vector and the periodic coefficients are expanded in Chebyshev polynomials and an integral equation suitable for a Picard-type iteration is formulated. A Chebyshev collocation is applied to the integral with the nonlinearities reducing the problem ...

Recently we introduced a new framework to describe some point sets used for multivariate integration and approximation [3], which we called Chebyshev lattices. The associated integration rules are equal weight rules, with corrections for the points on the boundary. In this text we detail the development of exhaustive search algorithms for good Chebyshev lattices where the cost of the rules, i.e...

If the solution of an integral equation can be expanded in the form of a Chebyshev series, the equation can be transformed into an infinite set of algebraic equations in which the unknowns are the coefficients of the Chebyshev series. The algebraic equations are solved by standard iterative procedures, in which it is not necessary to determine beforehand how many coefficients are significant. T...

Bratu's problem, which is the nonlinear eigenvalue equation Au + 2 exp(u)= 0 with u = 0 on the walls of the unit square and 2 as the eigenvalue, is used to develop several themes on applications of Chebyshev pseudospectral methods. The first is the importance of symmett:v: because of invariance under the C 4 rotation group and parity in both x and y, one can slash the size of the basis set by a...