Lingpipe has a semi-open license, and a Java implementation of incremental SVD. The original incremental SVD code is open: http://www.timelydevelopment.com/demos/NetflixPrize.aspx

BTW, SVD is not scalable. I define scalable algorithms to have time and space complexity O(n log(n)) or less. SVD is generally O(n*n)+, requiring matrix multiplication. You'll have to shard your computations in order to scale indefinitely.