The FEAST method for solving large sparse eigenproblems is equivalent to subspace iteration with an approximate spectral projector and implicit orthogonalization. This relation allows to characterize the convergence of this method in terms of the error of a certain rational approximant to an indicator function. We propose improved rational approximants leading to FEAST variants with faster conv...

Archaeologists often interpret the physical evidence for large-scale consumption of food and beverages as the remains of feasts that successfully enhanced personal reputations, consolidated power, or ensured community solidarity. However, ethnographic accounts illustrate the potential for “feast failure”: people may or may not contribute, may or may not come to the feast, may or may not be sati...

A detailed new upgrade of the FEAST eigensolver targeting non-Hermitian eigenvalue problems is presented and thoroughly discussed. It aims at broadening the class of eigenproblems that can be addressed within the framework of the FEAST algorithm. The algorithm is ideally suited for computing selected interior eigenvalues and their associated right/left bi-orthogonal eigenvectors, located within...

After years of study of software evolution processes, most recently through the FEAST projects, it appears that now there is a sufficient body of knowledge that can serve as basis for the development of an axiomatic theory of software evolution. Such body is represented by, for example, patterns and behavioural invariants observed in attributes of industrially evolved systems. This paper discus...

0

SUMMARY This paper deals with the basic principles of the new FEM software package FEAST. Based on an initial discussion of available software tools with respect to their application area, i.e., Education, Research or (industrial) Application, it illustrates the speciic demands for such PDE software which is aimed to solve 'real life' problems. For the FEAST software, which is principally desig...