منابع مشابه
Polynomial Residue Systems via Unitary Transforms
A polynomial, A(z), can be represented by a polynomial residue system and, given enough independent residues, the polynomial can be reconstituted from its residues by the Chinese remainder theorem (CRT). A special case occurs when the discrete Fourier transform and its inverse realise the residue evaluations and CRT respectively, in which case the residue system is realised by the action of a m...
متن کاملSVD compression, unitary transforms, and computational complexity
The search for fast unitary transforms and the need for data compression in linear systems are complementary issues. Compression requires the definition of a threshold dependent on the condition number, which is invariant over the unitary group. With respect tot this threshold it is shown that the SVD is the optimal tool. Considerations in connection with the Kronecker product and direct sum of...
متن کاملA unification of unitary similarity transforms to compressed representations
A new framework for transforming arbitrary matrices to compressed representations is presented. The framework provides a generic way of transforming a matrix via unitary similarity transformations to e.g. Hessenberg, Hessenberg-like and combinations of both. The new algorithms are deduced, based on the QR-factorization of the original matrix. Based on manipulations with Givens transformations, ...
متن کاملQuantum computing and a unified approach to fast unitary transforms
A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum algorithms. We present a divide-and-conquer approach to the design of various quantum algorithms. The class of algorithm includes many transforms which are well-k...
متن کاملComparison of various discrete transforms
This will not include the fast algorithms, separability, recursivity, orthogonality and fast algorithms (complexity of implementation). These topics are described elsewhere in detail. The focus is on their various properties. We will consider the random vector x is generated by I-order Markov process. Correlation matrix xx R is where ( ) 0 1 1 , , , T N x x x x − = , ( 0 1 1 , , , N x x x − are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 2003
ISSN: 0305-4470
DOI: 10.1088/0305-4470/36/9/310