Optimal algorithms of Gram-Schmidt type

Details Optimal algorithms of Gram-Schmidt type Optimal algorithms of Gram-Schmidt type

2009-10-02

arxiv.org/abs/0910.0435v2

Mathematics

Numerical Analysis

7 pages

Scientific paper

Three algorithms of Gram-Schmidt type are given that produce an orthogonal decomposition of finite $d$-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses $d^3/3+O(d^2)$ ring operations with very simple implementation. Next, that algorithm is adapted in two new directions. One is an optimal sequential algorithm whose complexity matches the complexity of matrix multiplication. The other is a parallel NC algorithm with similar complexity.

Affiliated with

Also associated with

No associations

Rating

Optimal algorithms of Gram-Schmidt type does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal algorithms of Gram-Schmidt type, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal algorithms of Gram-Schmidt type will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26585