I am working with a matrix of the following form:
$$ A =\begin{pmatrix} a_{11} & Q & \ldots & Q\\ a_{21} & Q & \ldots & Q\\ \vdots & \vdots & \ddots & \vdots\\ a_{n1} & Q &\ldots & Q \end{pmatrix} $$
where the $a_{ij}$ elements are real and predetermined, the $Q$'s are placeholders and not necessarily equal to one another, and $A$ is square of size $n$x$n$. I am looking to find values for all $Q$'s such that $A$ is unitary. To do this I have attempted to set up a system of nonlinear equations of the form $AA^\dagger=I$ which yields a system of $n^2-n$ unknown $Q$'s, but only $n^2/2 +n/2$ equations after removing any duplicate equations. Therefore, for $n=2$ the system is over-determined and for $n>3$ the system is under-determined.
My question is, is there a method in which I can solve for $Q$'s to force $A$ to be unitary given these constraints for any size n?