Two harmonic extraction based Jacobi--Davidson (JD) type algorithms are proposed to compute a partial generalized singular value decomposition (GSVD) of a large regular matrix pair. They are called cross product-free (CPF) and inverse-free (IF) harmonic JDGSVD algorithms, abbreviated as CPF-HJDGSVD and IF-HJDGSVD, respectively. Compared with the standard extraction based JDGSVD algorithm, the harmonic extraction based algorithms converge more regularly and suit better for computing GSVD components corresponding to interior generalized singular values. Thick-restart CPF-HJDGSVD and IF-HJDGSVD algorithms with some deflation and purgation techniques are developed to compute more than one GSVD components. Numerical experiments confirm the superiority of CPF-HJDGSVD and IF-HJDGSVD to the standard extraction based JDGSVD algorithm.
Local Multilevel Preconditioned Jacobi-Davidson Method for Elliptic Eigenvalue Problems on Adaptive Meshes
School of Mathematical Science, Tongji University(同济大学数学科学学院);Key Laboratory of Intelligent Computing and Applications, Tongji University, Ministry of Education(同济大学教育部智能计算与应用重点实验室)
Adaptive Multilevel Methods for the Maxwell Eigenvalue Problem
School of Mathematical Sciences, Tongji University(同济大学数学科学学院);Key Laboratory of Intelligent Computing and Applications (Tongji University), Ministry of Education(教育部智能计算与应用重点实验室(同济大学))
Conditioning and Singular Value Distribution of Jacobi Weighted Histopolation Matrices
Université de Pau et des Pays de l’Adour (UPPA)(波城与阿杜尔地区大学);University of Calabria(卡拉布里亚大学);University of Insubria(因苏布里亚大学);University of Uppsala(乌普萨拉大学)