Indexing algorithms usually operate in two phases. Initially, they attempt to identify potential candidates for the vectors a * , b * , and c * . In the subsequent phase, these candidates are assembled to form a solution that exhibits a similar structure to the given matrix M ⋆ 0 . A final tuning phase can be employed to refine the solutions.