An almost linear time algorithm for generalized matrix searching

A matrix <italic>P</italic> is called a symmetric orthogonal if <italic>P</italic> = <italic>P</italic>^{<italic>T</italic>} = <italic>P</italic>⁻¹. A matrix <italic>X</italic> is said to be a generalised bisymmetric with respect to <italic>P</italic> if <...

Starting from the Strassen method for rapid matrix multiplication and inversion as well as from the recursive Cholesky factorization algorithm, we introduced a completely block recursive algorithm for generalized Cholesky factorization of a given ...

To reduce the costs of computing matrix-vector product Ax related to a centrosymmetric matrix A as compared to the case of an arbitrary matrix A, two algorithms were proposed recently, one was designed by Melman [A. Melman, Symmetric centrosymmetric ...