Non-Linear Least-Squares Optimization of Rational Filters for the Solution of Interior Eigenvalue Problems

Rational filter functions improve convergence of contour-based eigensolvers, a popular algorithm family for the solution of the interior eigenvalue problem. We present an optimization method of these rational filters in the Least-Squares sense. Our filters out-perform existing filters on a large and representative problem set, which we show on the example of FEAST. We provide a framework for (non-convex) weighted Least-Squares optimization of rational filter functions. To this end we discuss: (1) a formulation of the optimization problem that exploits symmetries of the filter function in the Hermitian case, (2) gradient descent and Levenberg-Marquardt solvers that exploit the symmetries, (3) a method to choose the starting position of the optimization that reliably produces good results, (4) constrained optimization that produces filter functions with desirable properties, e.g., poles of the rational filter function with large imaginary parts which benefit convergence of Krylov based solvers for the arising linear system solves.

[2]  Tetsuya Sakurai,et al.  CONTOUR INTEGRAL EIGENSOLVER FOR NON-HERMITIAN SYSTEMS: A RAYLEIGH-RITZ-TYPE APPROACH , 2010 .

[3]  Kenneth Levenberg.  A METHOD FOR THE SOLUTION OF CERTAIN NON – LINEAR PROBLEMS IN LEAST SQUARES , 1944 .

[4]  Edoardo Di Napoli,et al.  Efficient estimation of eigenvalue counts in an interval , 2013, Numer. Linear Algebra Appl..

[5]  Tetsuya Sakurai,et al.  Block Krylov-type complex moment-based eigensolvers for solving generalized eigenvalue problems , 2017, Numerical Algorithms.

[6]  Yousef Saad,et al.  Computing Partial Spectra with Least-Squares Rational Filters , 2016, SIAM J. Sci. Comput..

[7]  Ping Tak Peter Tang,et al.  Zolotarev Quadrature Rules and Load Balancing for the FEAST Eigensolver , 2014, SIAM J. Sci. Comput..

[8]  Stefan Güttel,et al.  Parallelization of the Rational Arnoldi Algorithm , 2017, SIAM J. Sci. Comput..

[9]  S. Güttel.  Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection , 2013 .

[10]  T. Sakurai,et al.  A projection method for generalized eigenvalue problems using numerical integration , 2003 .

[11]  Timothy A. Davis,et al.  The university of Florida sparse matrix collection , 2011, TOMS.

[12]  Kaj Madsen,et al.  Methods for Non-Linear Least Squares Problems , 1999 .

[13]  Eric Polizzi,et al.  A Density Matrix-based Algorithm for Solving Eigenvalue Problems , 2009, ArXiv.

[14]  Marc Van Barel,et al.  Designing rational filter functions for solving eigenvalue problems by contour integration , 2015 .

[15]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[16]  Tetsuya Sakurai,et al.  A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method , 2008, J. Comput. Appl. Math..

[17]  Tetsuya Sakurai,et al.  Relationships among contour integral-based methods for solving generalized eigenvalue problems , 2016 .

[18]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[19]  D. Marquardt.  An Algorithm for Least-Squares Estimation of Nonlinear Parameters , 1963 .

[20]  Axel Ruhe.  Rational Krylov sequence methods for eigenvalue computation , 1984 .

[21]  Wolf-Jurgen Beyn,et al.  An integral method for solving nonlinear eigenvalue problems , 2010, 1003.1580.

[22]  Lloyd N. Trefethen,et al.  Computing Eigenvalues of Real Symmetric Matrices with Rational Filters in Real Arithmetic , 2015, SIAM J. Sci. Comput..

[23]  Ping Tak Peter Tang,et al.  FEAST As A Subspace Iteration Eigensolver Accelerated By Approximate Spectral Projection , 2013, SIAM J. Matrix Anal. Appl..