‎for any group $g$‎, ‎we define an equivalence relation $thicksim$ as below‎: ‎[forall g‎, ‎h in g gthicksim h longleftrightarrow |g|=|h|]‎ ‎the set of sizes of equivalence classes with respect to this relation is called the same-order type of $g$ and denote by $alpha{(g)}$‎. ‎in this paper‎, ‎we give a partial answer to a conjecture raised by shen‎. ‎in fact‎, ‎we show that if $g$ is a nilpote...

For nonselfadjoint elliptic boundary value problem which are preconditioned by a sub-structuring method, i.e., nonoverlapping domain decomposition, we introduce and study the concept of subspace orthogonalization. In subspace orthogonalization variants of Krylov methods the computation of inner products and vector updates, and the storage of basis elements is restricted to a (presumably small) ...

let ? be an open connected subset of the complex plane c and let t be a bounded linear operator on a hilbert space h. for ? in ? let e the orthogonal projection onto the null-space of t-?i . we discuss the necessary and sufficient conditions for the map ?? to b e continuous on ?. a generalized gram- schmidt process is also given.

—— This paper describes an evaluation of Inhibition/Enhancement (In/En) network for robust automatic speech recognition (ASR). In distinctive phonetic features (DPFs) based speech recognition using neural network, In/En network is needed to discriminate whether the DPFs dynamic patterns of trajectories are convex or concave. The network is used to achieve categorical DPFs movement by enhancing ...

Introduction: Wind speed probability at a site has to be modeled for evaluating the energy generation potential of a wind farm. Analytical computation of wind turbine capacity factor at the planning stage of a wind farm is very crucial. Thus, the comparison of Weibull parameters estimation methods and computation of wind turbine capacity factor are the focus of this paper. Case description: Sod...

Previously, we have discussed a recursive solution to the vector normal equation utilizing the recursive Cholesky and Modified Gram-Schmidt Orthogonalization (MGSO) algorithms. Previously, we have also discussed a blind adaptive approach for detection and extraction of signals of interest in the presence of noise and interference without relying on preamble or training sequences. The heart of t...

Over any field F every square matrix A can be factored into the product of two symmetric matrices as A = S1 ·S2 with Si = S i ∈ F and either factor can be chosen nonsingular, as was discovered by Frobenius in 1910. Frobenius’ symmetric matrix factorization has been lying almost dormant for a century. The first successful method for computing matrix symmetrizers, i.e., symmetric matrices S such ...