We develop a generalization of Nesterov’s accelerated gradient descent method which is designed to deal with orthogonality constraints.To demonstrate the effectiveness of our method,we perform numerical experiments w...
The authors are grateful to Prof. Zhaojun Bai in University of Cali- fornia, Davis, and Prof. Carlos J. Garcia-Cervera in University of California, Santa Barbara for their helpful discussions. The authors are grateful to the editor and the referees for their valuable comments, which improves the quality of the paper greatly. Weiguo Gao is supported by the National Natural Science Foundation of China under grants 91330202, Special Funds for Major State Basic Research Projects of China (2015CB858560003), and Shanghai Science and Technology Development Funds 13dz2260200 and 13511504300. Qun Gu acknowledges the financial support from China Scholarship Council (No. 2011610055).
We discuss the inexact two-grid methods for solving eigenvalue problems, including both partial differential and integral equations. Instead of solving the linear system exactly in both traditional two-grid and accele...
Acknowledgments. This work was supported by the National Natural Science Foundation of China(l1271174). The authors are very much indebted to the referees for providing very valuable suggestions and comments, which greatly improved the original manuscript of this paper. The authors would also like to thank Dr. Zeng-Qi Wang for helping on forming the MATLAB data of the matrices.
Optimization problems with partial differential equations as constraints arise widely in many areas of science and engineering, in particular in problems of the design. The solution of such class of PDE-constrained op...
The work of this author was supported in part by NSFC (project 19771073);Special Funds for Major State Basic Research Projects of China (project G19990328); Zhejiang Provincial Natural Science Foundation of China;Foundation for University Key Te
It is well-known that if we have an approximate eigenvalue A of a normal matrix A of order n, a good approximation to the corresponding eigenvector u can be computed by one inverse iteration provided the position, say...
National Natural Science Foundation of China;Jiangsu Province Natural Science Foundation;Jiangsu Province "333 Engineering
A preconditioned iterative method for computing a few eigenpairs of large sparse symmetric matrices is presented in this paper. The proposed method which combines the preconditioning techniques with the efficiency of ...
the China State Key Project for Basic Researches;the National Natural Science Foundation of China;The Research Fund for th
The Ritz vectors obtained by Arnoldi's method may not be good approxima- tions and even may not converge even if the corresponding Ritz values do. In order to improve the quality of Ritz vectors and enhance the effic...