DeepAI AI Chat
Log In Sign Up

Constrained Optimisation of Rational Functions for Accelerating Subspace Iteration

by   Konrad Kollnig, et al.

Earlier this decade, the so-called FEAST algorithm was released for computing the eigenvalues of a matrix in a given interval. Previously, rational filter functions have been examined as a parameter of FEAST. In this thesis, we expand on existing work with the following contributions: (i) Obtaining well-performing rational filter functions via standard minimisation algorithms, (ii) Obtaining constrained rational filter functions efficiently, and (iii) Improving existing rational filter functions algorithmically. Using our new rational filter functions, FEAST requires up to one quarter fewer iterations on average compared to state-of-art rational filter functions.


Twice is enough for dangerous eigenvalues

We analyze the stability of a class of eigensolvers that target interior...

Bounds on the eigenvalues of matrix rational functions

Upper and lower bounds on absolute values of the eigenvalues of a matrix...

Fast randomized non-Hermitian eigensolver based on rational filtering and matrix partitioning

This paper describes a set of rational filtering algorithms to compute a...

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

Rational filter functions can be used to improve convergence of contour-...

Bicubic partially blended rational quartic surface

This paper investigates some univariate and bivariate constrained interp...

Designing a physically-feasible colour filter to make a camera more colorimetric

Previously, a method has been developed to find the best colour filter f...

On the Existence of Telescopers for Rational Functions in Three Variables

Zeilberger's method of creative telescoping is crucial for the computer-...