Three algorithms of Gram Schmidt type are given that produce orthogonal decompositions of finite d-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses d(3)/3 + O(d(2)) products i...
详细信息
Three algorithms of Gram Schmidt type are given that produce orthogonal decompositions of finite d-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses d(3)/3 + O(d(2)) products in Delta. Next, that algorithm is adapted in two new directions. One is a nearly optimal sequential algorithm whose complexity matches the complexity of matrix multiplication. The other is a parallelalgorithm. (C) 2013 Elsevier Inc. All Tights reserved.
暂无评论