Two aspects of the Kronecker product are studied. First, we start with the Kronecker product
approximation problem. Given a matrix A and a factorization of its dimensions, we find …

The Kronecker product has a rich and very pleasing algebra that supports a wide range of
fast, elegant, and practical algorithms. Several trends in scientific computing suggest that …

We consider the numerical approximation of f (A) bf (A) b where b ∈ R^ N b∈ RN
and\mathcal AA is the sum of Kronecker products, that is A= M_2 ⊗ I+ I ⊗ M_1 ∈ R^ N * NA …

A new approximation tool such as sums of Kronecker products is recently found to provide a
superb compression property on a series of numerical examples of quite a general nature …

The discrete Hartley transforms (DHT) of types I--IV and the related matrix algebras are
discussed. We prove that any of these DHTs of length N=2^t can be factorized by means of a …

Let A be an m-by-n matrix with m= m1m2 and n= n1n2. We consider the problem of finding
(mathematical formula omitted) so that (mathematical formula omitted) is minimized. This …

Let A be an m-by-n matrix with m= m 1 m 2 and n= n 1 n 2. We consider the problem of
finding B ∈ R^ m_1 * n_1\; and\; C\; ∈ R^ m_2 * n_2\; so\; that\;||\; AB ⊗ C\;||\; _F is …

The goal of this work is the presentation of some new formats which are useful for the
approximation of (large and dense) matrices related to certain classes of functions and …

Classical orthogonal polynomials and the related associated functions are real classics in
approximation theory. They share a rich history of research that has uncovered their many …

1. Introduction and summary. A matrix C* is obtained from the Kro-necker product CA (R) B
of two square matrices A and B by deletion of certain rows and colurans of C. Whether or not …