Let's say we have such a system structure of equations:
a(1,1)x(1) +a(2,1)x(2)....+a(n,1)x(n)=b(1)
a(1,2)x(1) +a(1,2)x(2)....+a(n,2)x(n)=b(2)
.
.
.
a(1,m)x(1) + a(2,m)x(2)...+a(n,m)x(n)=b(m)
where n,m are positive integers and A[1->n,1->m],B[1->m] are params.
Is there a fast way to determinate the unknown array X[1->n] ?
Yes, this is a system of linear equations. You can solve this by solving the matrix equation $$\mathbf{Ax} = \mathbf{b}, $$
where $\mathbf{A}$ is an $n\times m$ matrix (or array), and $\mathbf{x}$ and $\mathbf{b}$ are vectors.
Depending on the structure of $\mathbf{A}$ you may solve this efficiently using particular factorization methods such as LU, LDL, or Cholesky-factorization. In general you could just use Gaussian Elimination.