Generate a 3x3 orthogonal matrix using the Gram-Schmidt algorithm.

GramSchmidt(v1, v2, v3, order = 1:3)

## Arguments

v1, v2, v3

Three length 3 vectors (taken as row vectors).

order

The precedence order for the vectors; see Details.

## Details

This function orthogonalizes the matrix rbind(v1, v2, v3) using the Gram-Schmidt algorithm. It can handle rank 2 matrices (returning a rank 3 matrix). If the original is rank 1, it is likely to fail.

The order vector determines the precedence of the original vectors. For example, if it is c(i, j, k), then row i will be unchanged (other than normalization); row j will normally be transformed within the span of rows i and j. Row k will be transformed orthogonally to the span of the others.

## Value

A 3x3 matrix whose rows are the orthogonalization of the original row vectors.

Duncan Murdoch

## Examples

# Proceed through the rows in order
print(A <- matrix(rnorm(9), 3, 3))
#>            [,1]       [,2]       [,3]
#> [1,] -0.7675072 0.02932423 -0.4581905
#> [2,] -0.9370045 0.13137202 -0.5040818
#> [3,] -0.9458435 0.89874777  1.4760650
GramSchmidt(A[1, ], A[2, ], A[3, ])
#>          [,1]        [,2]       [,3]
#> v1 -0.8581712  0.03278824 -0.5123155
#> v2 -0.2011299  0.89670260  0.3942984
#> v3 -0.4723230 -0.44141746  0.7629296

# Keep the middle row unchanged
print(A <- matrix(c(rnorm(2), 0, 1, 0, 0, rnorm(3)), 3, 3, byrow = TRUE))
#>            [,1]         [,2]     [,3]
#> [1,] -0.8523692  1.714212026 0.000000
#> [2,]  1.0000000  0.000000000 0.000000
#> [3,] -0.3705273 -0.004369989 1.883426
GramSchmidt(A[1, ], A[2, ], A[3, ], order = c(2, 1, 3))
#>    [,1] [,2] [,3]
#> v2    0    1    0
#> v1    1    0    0
#> v3    0    0    1