Krylov Subspace Methods in Application to WCDMA Network Optimization

Krylov subspace methods, which include, e.g. CG, CGS, Bi-CG, QMR or GMRES, are commonly applied as linear solvers for sparse large-scale linear least squares problems. In the paper, we discuss the usefulness of such methods to the optimization of WCDMA networks. We compare the selected methods with respect to their convergence properties and computational complexity, using a typical uplink model for a WCDMA network. The comparison shows that GMRES is the most suitable method for our task.