This publication is an exercise which extends to two variables the Christoffel’s construction of orthogonal polynomials for potentials of one variable with external sources. We generalize the construction to biorthogonal polynomials. We also introduce generalized Schur polynomials as a set of orthogonal, symmetric, non homogeneous polynomials of several variables, attached to Young tableaux.

There is a famous construction of orthogonal arrays by R.C. Bose (1947). The construction uses linear transformations over a finite field. We generalize this to use non-linear transformation instead of linear and a subset of vector space as their domains. We show here constructions of orthogonal and balanced arrays which are generated by a set of quadratic function.

In this paper, a relationship is established between orthogonal mappings of a group and difference sets for construction of orthogonal arrays. A difference set D(lO,lO,5) has been constructed and is given as an illustration. Use of difference sets for construction of orthogona:l Latin squares and error correcting codes is discussed.

\Identiication of non-linear optput-aane systems using an orthogonal least-squares algorithm," 43 as k increases. Hence, as the number of iterations increases beyond the number of coherent structures, the set grows more and more singular. For the orthogonal pursuit, on the other hand, we have

In this paper, among the other things, we prove the existence and uniqueness theorem of fixed point for mappings on a generalized orthogonal metric space. As a consequence of this, we obtain the existence and uniqueness of fixed point of Cauchy problem for the first order differential equation.

this work focuses on the correction of both the coecient and the right hand side matrices of the inconsistent matrix equations $ax = b$ and $xc = d$ with orthogonal constraint. by optimal correction approach, a general representation of the orthogonal solution is obtained. this method is tested on two examples to show that the optimal correction is eective and highly accurate.

Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a postprocessing technique, called refinement, which improves aesthetic qualities of a drawing such as area, bends, crossings, and total edge length. Refinement is separate from layout and works by analyzing and then fin...

SUMMARY In this paper, a new large spreading code set with a uniform low cross-correlation is proposed. The proposed code set is capable of (1) increasing the number of assigned user (capacity) in a multicarrier code division multiple access (MC-CDMA) system and (2) reducing the peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing (OFDM) system. In this paper, we ...