since the invention of generalized polynomial chaos in 2002, uncertainty quantification has impacted many engineering fields. however, almost all existing generalized polynomial chaos methods have a strong assumption: the uncertain parameters are mutually independent or gaussian correlated. this assumption rarely holds in many realistic applications, and it has been a long-standing challenge for both theorists and practitioners. in this talk, i will presented two algorithms for handling this task. the first one is stochastic collocation algorithm, and the second one is sparse optimization approach. we provide some rigorous proofs for the complexity and error bound of our proposed method. numerical experiments on synthetic, electronic and photonic integrated circuit examples show the nearly exponential convergence rate and excellent efficiency of our proposed approaches. this is a joint work with prof. zheng zhang from uc santa barbara.