The FEAST eigenvalue algorithm is a subspace iteration algorithm that uses contour integration in the complex plane to obtain the eigenvectors of a matrix for the eigenvalues that are located in any user-defined search interval. By computing small numbers of eigenvalues in specific regions of the complex plane, FEAST is able to naturally parallelize the solution of eigenvalue problems by solvin...

INTRODUCTION Use of electroconvulsive therapy (ECT) is limited by cognitive disturbance. Focal electrically-administered seizure therapy (FEAST) is designed to initiate focal seizures in the prefrontal cortex. To date, no studies have documented the effects of FEAST on regional cerebral blood flow (rCBF). METHODS A 72 year old depressed man underwent three single photon emission computed tomo...

OBJECTIVE Electroconvulsive therapy (ECT) is the most rapid and effective antidepressant treatment but with concerns about cognitive adverse effects. A new form of ECT, focal electrically administered seizure therapy (FEAST), was designed to increase the focality of stimulation and better match stimulus parameters with neurophysiology. We recently reported on the safety and feasibility of FEAST...

Calculating portions of eigenvalues and eigenvectors of matrices or matrix pencils has many applications. An approach to this calculation for Hermitian problems based on a density matrix has been proposed in 2009 and a software package called FEAST has been developed. The density-matrix approach allows FEAST’s implementation to exploit a key strength of modern computer architectures, namely, mu...

The linear FEAST algorithm is a method for solving linear eigenvalue problems. It uses complex contour integration to calculate the eigenvectors whose eigenvalues that are located inside some user-defined region in the complex plane. This makes it possible to parallelize the process of solving eigenvalue problems by simply dividing the complex plane into a collection of disjoint regions and cal...

Calculating portions of eigenvalues and eigenvectors of matrices or matrix pencils has many applications. An approach to this calculation for Hermitian problems based on a density matrix has been proposed in 2009 and a software package called FEAST has been developed. The density-matrix approach allows FEAST’s implementation to exploit a key strength of modern computer architectures, namely, mu...

|As part of its study of the impact of feedback in the global software process on software product evolution, the FEAST/1 project has examined metric data relating to various systems in di erent application areas. High level similarities in the growth trends of the systems studied support the FEAST hypothesis. Inter alia, the results provide evidence compatible with the laws of software evoluti...

The FEAST algorithm [5] is an algorithm aimed at solving generalized eigenvalue problems AX = BXΛ, where A,B are n×n matrices. In [4] we presented a short analysis of FEAST involving this eigenvalue problem. In the present work we focus on the real symmetric eigenvalue problem AX = XΛ, where A = A, XX = I and Λ is a diagonal matrix consisting of real eigenvalues. These eigenvalues are sought in...

We analyze the FEAST method for computing selected eigenvalues and eigenvectors of large sparse matrix pencils. After establishing the close connection between FEAST and the well-known Rayleigh–Ritz method, we identify several critical issues that influence convergence and accuracy of the solver: the choice of the starting vector space, the stopping criterion, how the inner linear systems impac...