Interior Eigensolver for Sparse Hermitian Definite Matrices Based on Zolotarev's Functions

01/31/2017
by   Yingzhou Li, et al.
0

This paper proposes an efficient method for computing selected generalized eigenpairs of a sparse Hermitian definite matrix pencil (A, B). Based on Zolotarev's best rational function approximations of the signum function and conformal mapping techniques, we construct the best rational function approximation of a rectangular function supported on an arbitrary interval. This new best rational function approximation is applied to construct spectrum filters of (A, B). Combining fast direct solvers and the shift-invariant GMRES, a hybrid fast algorithm is proposed to apply spectral filters efficiently. Compared to the state-of-the-art algorithm FEAST, the proposed rational function approximation is proved to be optimal among a larger function class, and the numerical implementation of the proposed method is also faster. The efficiency and stability of the proposed method are demonstrated by numerical examples from computational chemistry.

READ FULL TEXT
research
02/23/2022

Low-memory Krylov subspace methods for optimal rational matrix function approximation

We describe a Lanczos-based algorithm for approximating the product of a...
research
09/21/2019

A fast Gauss transform in one dimension using sum-of-exponentials approximations

We present a fast Gauss transform in one dimension using nearly optimal ...
research
03/31/2020

The global extended-rational Arnoldi method for matrix function approximation

The numerical computation of matrix functions such as f(A)V, where A is ...
research
08/04/2021

An estimate of approximation of an analytic function of a matrix by a rational function

Let A be a square complex matrix; z_1, ..., z_N∈ℂ be arbitrary (possibly...
research
01/13/2020

Rational spectral filters with optimal convergence rate

In recent years, contour-based eigensolvers have emerged as a standard a...
research
03/08/2023

A comparison of rational and neural network based approximations

Rational and neural network based approximations are efficient tools in ...
research
11/17/2020

Solving Symmetric and Positive Definite Second-Order Cone Linear Complementarity Problem by A Rational Krylov Subspace Method

The second-order cone linear complementarity problem (SOCLCP) is a gener...

Please sign up or login with your details

Forgot password? Click here to reset