Gram-Schmidt Process Complexity - Quant Trader Interview Question
Difficulty: Medium
Category: Linear Algebra & Machine Learning
Practice quant interview questions from top firms including Jane Street, Citadel, Two Sigma, DE Shaw, and other leading quantitative finance companies.
Topics: linear-algebra, gram-schmidt, orthogonalization, computational-complexity
Problem Description
You are developing a high-frequency trading algorithm that relies on rapidly orthogonalizing a set of feature vectors. The Gram-Schmidt process is a candidate method. Given a set of $n$ linearly independent vectors in $R^m$, describe the Gram-Schmidt process for orthogonalizing this set of vectors. What is the computational complexity of the Gram-Schmidt process for $n$ vectors in $R^m$?
Practice this medium trader interview question on MyntBit - the all-in-one quant learning platform with 200+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.