Results 301 to 310 of about 2,195,689 (342)
In Chapters 8 and 9, the stability of polynomial families $$ P\left( {s,Q} \right)\; = \;\left\{ {p\left( {s,q} \right)\;|\;q\; \in \;Q} \right\}$$ (1) with p(s, q) = ao(4) + ai(4)s +… + an(q)sn and q, E [4,; 4:], i = 1, 2,…, € was investigated. The primary interest was necessary and sufficient conditions for stability.
Reinhold Steinhauser+4 more
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Spectral Radius and Radius of Convergence
The American Mathematical Monthly, 1974(1974). Spectral Radius and Radius of Convergence. The American Mathematical Monthly: Vol. 81, No. 6, pp. 625-627.
openaire +2 more sources
Packing radius, covering radius, and dual distance
IEEE Transactions on Information Theory, 1995Recently, A. Tietäväinen derived an upper bound on the covering radius of codes as a function of the dual distance. This was generalized to the minimum distance, and to \(Q\)-polynomial association schemes by Levenshtein and Fazakas. Both proofs use a linear programming approach.
openaire +2 more sources