Some results about the Equiangular Algorithm
Numerical Analysis
2020-06-30 v1 Numerical Analysis
Abstract
Equiangular Algorithm generates a set of equiangular normalized vectors with given angle {\theta} using a set of linearly independence vectors in a real inner product space, which span the same subspaces. The outcome of EA on column vectors of a matrix A provides a matrix decomposition A = SR, where S is called Equiangular Matrix which has equiangular column vectors. In this paper we discuss some properties of equiangular matrices. The inverse and eigenvalue problems of these matrices are studied. Also we derive some canonical forms of some matrices based on equiangular ones.
Cite
@article{arxiv.1612.09471,
title = {Some results about the Equiangular Algorithm},
author = {Danial Sadeghi and Azim Rivaz},
journal= {arXiv preprint arXiv:1612.09471},
year = {2020}
}
Comments
15 pages, 1 figures. arXiv admin note: substantial text overlap with arXiv:1412.7552