For the unitary ensembles of N × N Hermitian matrices associated with a weight function w there is a kernel, expressible in terms of the polynomials orthogonal with respect to the weight function, which plays an important role. For the orthogonal and symplectic ensembles of Hermitian matrices there are 2 × 2 matrix kernels, usually constructed using skew-orthogonal polynomials, which play an an...

in this study, flow characteristics through symmetric stenosis artery are investigated. the shape of eccentricity for stenotic flows is limited by circular-cross sections and plaques are usually assumed as to be oriented concentrically. thegoverningequationsaretheusualnavier-stokesequationsandare numericallysolved by using finite volumemethod in arbitrary orthogonal curvilinear coordinates. in ad...

A perfect sequence has the optimal periodic autocorrelation function where all out-of-phase values are zero, and an orthogonal set has orthogonality that the periodic correlation function for any pair of distinct sequences in the set takes zero at the zero shift. The real-valued perfect sequences of period N = 2 are derived from a real-valued Huffman sequence of length 2 + 1 with ν ≥ n whose ou...

In this paper we study a new probability associated with any given belief function b, i.e. the orthogonal projection π[b] of b onto the probability simplex P. We provide an interpretation of π[b] in terms of a redistribution process in which the mass of each focal element is equally distributed among its subsets, establishing an interesting analogy with the pignistic transformation. We prove th...

Abstract Orthogonal polynomials in two variables on cubic curves are considered. For an integral with respect to appropriate weight function defined a curve, explicit basis of orthogonal is constructed terms families one variable. We show that these can be used approximate functions and square root singularities, demonstrate their usage for solving differential equations singular solutions.

We propose an approach to constructing a new type of design, a sliced space-filling design, intended for computer experiments with qualitative and quantitative factors. The approach starts with constructing a Latin hypercube design based on a special orthogonal array for the quantitative factors and then partitions the design into groups corresponding to different level combinations of the qual...

A simple orthogonal array OA(q2n−1, q2n−2, q, 2) is constructed by using the action of a large subgroup of PGL(n + 1, q2) on a set of non degenerate Hermitian varieties in PG(n, q2).

A well-performing set of radial basis functions (RBFs) can emerge from genetic competition among individual RBFs. Genetic selection of the individual RBFs is based on credit sharing which localizes competition within orthogonal niches. These orthogonal niches are derived using singular value decomposition and are used to apportion credit for the overall performance of the RBF network among indi...

Orthogonal designs are fundamental mathematical notions used in the construction of space time block codes for wireless transmissions. Designs have two important parameters, the rate and the decoding delay; the main problem of the theory is to construct designs maximizing the rate and minimizing the decoding delay. All known constructions of CODs are inductive or algorithmic. In this paper, we ...

In this paper we describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. aane (wavelet) frames. We propose a modiication to the Matching Pursuit algorithm of Mallat and Zhang (1992) that maintains full backward orthogonality of the residual (error) at every step and thereby lea...