ÃÖ±Ù µ¿¿µ»ó
¼öÇа­¿¬È¸
Ưº°°­¿¬
´ëÁß°­¿¬
ÀÔÇÐÀü Ưº°°­Á (°¡)
Àι®»çȸ°è¸¦ À§ÇÑ ¼öÇÐ
¼öÇÐ ¹× ¿¬½À 1
±âÃʼöÇÐ
°øÇмöÇÐ


How to solve linear systems in practice

¹ÎÁ¶È« (ÀÌÈ­¿©´ë ¼öÇаú)
2012. 04. 26.

There are basically two approaches for solving linear systems: one is to exactly solve the linear sytem such as Gaussian-elimination. The other approximates the solution in the Krylov spaces; Conjugate-gradient and General minimum residual method are typical examples. For sparse and large-scaled, like 10000x10000, matrices, the latter is much more efficient.
Those basic subjects will be briefly reviewed including incomplete LU-preconditioning, and a recent research of parallel ILU-PCG algorithm will be introduced.