@article {116,
	title = {Effective solution of a linear system with Chebyshev coefficients},
	journal = {Integral Transforms and Special Functions},
	volume = {20},
	year = {2009},
	pages = {619-628},
	publisher = {Taylor \& Francis},
	abstract = {<p>This paper presents an efficient algorithm for a special triangular  linear system with Chebyshev coefficients. We present two methods of  derivations, the first is based on formulae where the nth power of x is  solved as the sum of Chebyshev polynomials and modified for a linear  system. The second deduction is more complex and is based on the  Gauss-Banachiewicz decomposition for orthogonal polynomials and the  theory of hypergeometric functions which are well known in the context  of orthogonal polynomials. The proposed procedure involves O(nm)  operations only, where n is matrix size of the triangular linear system L  and m is number of the nonzero elements of vector b. Memory  requirements are O(m), and no recursion formula is needed. The linear  system is closely related to the optimal pulse-wide modulation problem.</p>},
	keywords = {hypergeometric functions, linear system, optimal PWM problem, orthogonal Chebyshev polynomials},
	issn = {1065-2469 },
	doi = {10.1080/10652460902727938},
	url = {http://dx.doi.org/10.1080/10652460902727938},
	author = {Petr Kujan and Martin Hrom{\v c}{\'\i}k and Michael {\v S}ebek}
}