Solving a linear equation with a moderatly sparse 1000000*1000000 symmetric matrix

109 Views Asked by At

I've got a linear equation $A_{n*n}\cdot x=1_n$, where $n=1000000$ and $A$ is symmetric with approx $1000$ nonzero entries in each column and row. What would be the best numerically stable algorithm to handle linear equations of that size?