Lin, Chih-JenChih-JenLinSaigal, RomeshRomeshSaigal2009-05-062018-07-052009-05-062018-07-05200000063835http://ntur.lib.ntu.edu.tw//handle/246246/155208https://www.scopus.com/inward/record.uri?eid=2-s2.0-0042185149&doi=10.1023%2fA%3a1022323931043&partnerID=40&md5=b312fde6be6d74c1c86ddaaaa866110eIn this paper, we study the use of an incomplete Cholesky factorization (ICF) as a preconditioner for solving dense symmetric positive definite linear systems. This method is suitable for situations where matrices cannot be explicitly stored but each column can be easily computed. Analysis and implementation of this preconditioner are discussed. We test the proposed ICF on randomly generated systems and large matrices from two practical applications: semidefinite programming and support vector machines. Numerical comparison with the diagonal preconditioner is also presented.application/pdf338091 bytesapplication/pdfen-USjournal article2-s2.0-0042185149WOS:000089256000008http://ntur.lib.ntu.edu.tw/bitstream/246246/155208/1/04.pdf