𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalisation of the Kahane algorithm for scalar products of λ-matrices

✍ Scribed by J.S.R. Chisholm

Book ID
107744739
Publisher
Elsevier Science
Year
1972
Tongue
English
Weight
206 KB
Volume
4
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of Algorithms for Orthogonalizi
Analysis of Algorithms for Orthogonalizing Products of Unitary Matrices
✍ Roy Mathias 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 995 KB

We consider the problem of computing u k = Qk uk-1 (where U0 is given) in finite precision (CM = machine precision) where U0 and the Qi are known to be unitary. The problem is that fik, the computed product may not be unitary, so one applies an O(n2) orthogonalizing step after each multiplication to

Efficient algorithms for deciding the ty
Efficient algorithms for deciding the type of growth of products of integer matrices
✍ Raphaël M. Jungers; Vladimir Protasov; Vincent D. Blondel 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 257 KB

For a given finite set of matrices with nonnegative integer entries we study the growth with t of We show how to determine in polynomial time whether this growth is bounded, polynomial, or exponential, and we characterize all possible behaviors.

On the Coefficient Problem: a Version of
On the Coefficient Problem: a Version of the Kahane–Katznelson–De Leeuw Theorem for Spaces of Matrices
✍ Françoise Lust-Piquard 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 430 KB

It is known that, for every (a n ) # l 2 (Z) there exists a function F # C(T) such that |a n | |F (n)| for every n # Z. We prove a noncommutative version: for every matrix A=(a ij ) such that sup i &(a ij ) j & l 2 and sup j &(a ij ) i & l 2 are finite, there exists a matrix (b ij ) defining a bound