Algorithm 9 Initialization of a path α on between q0, q1 ∈ . | ||
| 1: | Let α(0) = q0. Let k be the number of steps along the discretized path. | |
| 2: | f = q1 − 〈q1, q0〉q0, | |
| 3: | for all τ = 1 to k do | |
| 4: |
|
|
| 5: | Project
into using Algorithm 1. |
|
| 6: | end for | |
Algorithm 9 Initialization of a path α on between q0, q1 ∈ . | ||
| 1: | Let α(0) = q0. Let k be the number of steps along the discretized path. | |
| 2: | f = q1 − 〈q1, q0〉q0, | |
| 3: | for all τ = 1 to k do | |
| 4: |
|
|
| 5: | Project
into using Algorithm 1. |
|
| 6: | end for | |