MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Nikos Pitsianis" – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 5 documents found, showing 1 through 5.
ATOM RSS
  • Some Properties of the Strong Kronecker Product  
  • by Nikos P. Pitsianis
  • …Introduction The strong Kronecker product is considered a powerful matrix multiplication tool for Hadamard and other orthogonal matrices from combinatorial theory [1]. Given two matrices B and C written as n 1 -by-n 2 and n 2 -by-n 3 block matrices respectively, the n 1 -by-n 3 block matrix A is s…
  • Add To MetaCart
  • A Kronecker Compiler for fast transform algorithms  
  • by Nikos P. Pitsianis — 1997 — In 8th SIAM Conf. Parallel Proc. For Sci. Comp
  • …We present a source-to-source compiler that processes matrix formulae in the form of Kronecker product factorizations. The Kronecker product notation allows for simple expressions of algorithms such as Walsh-Hadamard, Haar, Slant, Hartley, and FFTs as well as transpositions and wavelet transforms. T…
  • Cited by 4 (0 self)Add To MetaCart
  • High-performance FFT implementation on the BOPS ManArray parallel DSP  
  • by Nikos P. Pitsianis, Gerald Pechanek — 1999 — In proceedings International Symposium on Optical Science, Engineering, and Instrumentation
  • …We present a high performance implementation of the FFT algorithm on the BOPS ManArray parallel DSP processor. The ManArray we consider for this application consists of an array controller and 2 to 4 fully interconnected processing elements. To expose the parallelism inherent to an FFT algorithm we …
  • Cited by 1 (1 self)Add To MetaCart
  • Approximation with Kronecker Products  
  • by Charles Van Loan, Nikos Pitsianis — 1993 — Linear Algebra for Large Scale and Real Time Applications
  • …Let A be an m-by-n matrix with m = m1m2 and n = n1n2 . We consider the problem of finding B 2 IR m 1 \Thetan 1 and C 2 IR m 2 \Thetan 2 so that k A \Gamma B\Omega C k F is minimized. This problem can be solved by computing the largest singular value and associated singular vectors of a permute…
  • Cited by 17 (1 self)Add To MetaCart
  • Multiple Control Bandwidth Computations in Adaptive-Optics  
  • by Brent L. Ellerbroek, Nikos P. Pitsianis, Charles Van Loan, Robert J. Plemmons — 1996 — Proc. SPIE Symposium on Advanced Signal Processing Alg. Architectures, and Implement. VIII, (these Proceedings
  • …A study is made of a non--smooth matrix optimization problem arising in adaptive-- optics, which involves the optimal real--time control of a very fast--acting deformable mirror designed to compensate for atmospheric turbulence and other image degradation factors, such as wind--induced telescope vib…
  • Cited by 1 (1 self)Add To MetaCart
Help! Showing 1 through 5.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB