On the tensor rank of the multiplication in the finite fields

First, we prove the existence of certain types of non-special divisors of degree g−1 in the algebraic function fields of genus g defined over Fq. Then, it enables us to obtain upper bounds of the tensor rank of the multiplication in any extension of quadratic finite fields Fq by using Shimura and modular curves defined over Fq. From the preceding results, we obtain upper bounds of the tensor rank of the multiplication in any extension of certain non-quadratic finite fields Fq, notably in the case of F₂. These upper bounds attain the best asymptotic upper bounds of Shparlinski-Tsfasman-Vladut [I.E. Shparlinski, M.A. Tsfasman, S.G. Vladut, Curves with many points and multiplication in finite fields, in: Lecture Notes in Math., vol. 1518, Springer-Verlag, Berlin, 1992, pp. 145-169].     

On the associativity and commutativity of multiplication of infinite matrices

Unlike the case of finite matrices, the product of two infinite matrices may not exist in general. Moreover, for infinite matrices A, B, C the product A(BC) may exist whereas (AB)C may not and, if it exists, A(BC) may not be equal to (AB)C. In this paper some significant instances of associativity and commutativity of products of infinite matrices are presented and some of their useful consequences are derived.     

An extended duality theorem and multiplication of several matrices

Motivated by a construction of highly expanding simple Cayley graphs of dihedral groups derived from-or induced by-highly expanding Cayley digraphs fo cyclic groups presented by F. R. K. chung, constructions of simple Cayley graphs on a semidirect product of groups and Cayley digraphs of one of its factors are suggested. In case of the non-normal factor being the cyclic group of order 2. a condition is given to derive spectral bounds of the Cayley graph of the product from those of the Cayley graph of the normal factor.     

Approximate computation of the permeability tensor of a periodic porous medium

The permeability tensor K of an infinite periodic porous medium, obtained using the homogenization theory, is considered. The solutions of an optimal control problem for the Dirichlet or Neumann equation are used to obtain optimal upper bounds for K. The test functions used for the estimations are simpler than those obtained by other authors. Some possibilities are given to obtain also lower bounds.     

On the properties of a new tensor product of matrices

Previously, the author introduced a new tensor product of matrices according to which the matrix of the discrete Walsh-Paley transform can be represented as a power of the second-order discrete Walsh transform matrix H with respect to this product. This power is an analogue of the representation of the Sylvester-Hadamard matrix in the form of a Kronecker power of H. The properties of the new tensor product of matrices are examined and compared with those of the Kronecker product. An algebraic structure with the matrix H used as a generator element and with these two tensor products of matrices is constructed and analyzed. It is shown that the new tensor product operation proposed can be treated as a convenient mathematical language for describing the foundations of discrete Fourier analysis.     

On elementary divisors of the tensor product of two matrices

Let F be a field of arbitrary characteristic, and assume A and B are square matrices, over F, each having a single elementary divisor with associated eigenvalue in F. We express the multiplicities of the elementary divisors of A ? B and A ? I + I ? B in terms of the ranks, over F, of appropriate matrices.     

Approximate decoupling of multivariate polynomials using weighted tensor decomposition

Many scientific and engineering disciplines use multivariate polynomials. Decomposing a multivariate polynomial vector function into a sandwiched structure of univariate polynomials surrounded by linear transformations can provide useful insight into the function while reducing the number of parameters. Such a decoupled representation can be realized with techniques based on tensor decomposition methods, but these techniques have only been studied in the exact case. Generalizing the existing techniques to the noisy case is an important next step for the decoupling problem. For this extension, we have considered a weight factor during the tensor decomposition process, leading to an alternating weighted least squares scheme. In addition, we applied the proposed weighted decoupling algorithm in the area of system identification, and we observed smaller model errors with the weighted decoupling algorithm than those with the unweighted decoupling algorithm.     

On the choice of a multiplication algorithm for polynomials and polynomial matrices

We investigate multiplication algorithms for dense and sparse polynomials and polynomial matrices over different numerical domains and obtain expressions for the complexity of multiplication of polynomials and polynomial matrices understood as the expectation of the number of arithmetic operations. These expressions for a set of parameters of practical interest are tabulated. The results of experiments with the corresponding programs are presented. Bibliography: 8 titles.     

Approximate inverses of multidiagonal matrices and application to the block PCG method

A fast method to compute high-order approximate inverses based on truncated elimination is constructed for multidiagonal matrices of diagonal dominance. Together with the block preconditioned conjugate gradient method, it can be used for the numerical solution of elliptic partial differential equations and related problems. Through numerical experiments it is shown that the method is robust and efficient.     

Approximate eigensolution of Laplacian matrices for locally modified graph products

Laplacian matrices and their spectrum are of great importance in algebraic graph theory. There exist efficient formulations for eigensolutions of the Laplacian matrices associated with a special class of graphs called product graphs. In this paper, the problem of determining a few approximate smallest eigenvalues and eigenvectors of large scale product graphs modified through the addition or deletion of some nodes and/or members, is investigated. The eigenproblem associated with a modified graph model is reduced using the set of master eigenvectors and linear approximated slave eigenvectors from the original model. Implicitly restarted Lanczos method is employed to obtain the required eigenpairs of the reduced problem. Examples of large scale models are included to demonstrate the efficiency of the proposed method compared to the direct application of the IRL method.     

Approximate eigensolution of Laplacian matrices for locally modified graph products

Laplacian matrices and their spectrum are of great importance in algebraic graph theory. There exist efficient formulations for eigensolutions of the Laplacian matrices associated with a special class of graphs called product graphs. In this paper, the problem of determining a few approximate smallest eigenvalues and eigenvectors of large scale product graphs modified through the addition or deletion of some nodes and/or members, is investigated. The eigenproblem associated with a modified graph model is reduced using the set of master eigenvectors and linear approximated slave eigenvectors from the original model. Implicitly restarted Lanczos method is employed to obtain the required eigenpairs of the reduced problem. Examples of large scale models are included to demonstrate the efficiency of the proposed method compared to the direct application of the IRL method.     

A note on linear preservers of certain ranks of tensor products of matrices

In this note, we give a simple proof as well as an extension of a very recent result of B. Zheng, J. Xu and A. Fosner concerning linear maps between vector spaces of complex square matrices that preserve the rank of tensor products of matrices by using a structure theorem of R. Westwick on linear maps between tensor product spaces that preserve non-zero decomposable elements.