1 citations · 1 across the 1 of their papers we have counts for
3 papers
Randomized algorithms for rounding in the Tensor-Train format
Hussam Al Daas, Grey Ballard, Paul Cazeaux +5
The Tensor-Train (TT) format is a highly compact low-rank representation for high-dimensional tensors. TT is particularly useful when representing approximations to the solutions o…
A rational approximation method for the nonlinear eigenvalue problem
Yousef Saad, Mohamed El-Guide, Agnieszka Międlar
This paper presents a method for computing eigenvalues and eigenvectors for some types of nonlinear eigenvalue problems. The main idea is to approximate the functions involved in t…
FEAST Eigensolver for Nonlinear Eigenvalue Problems
Brendan Gavin, Agnieszka Międlar, Eric Polizzi
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…