Prefer a chat interface with context about you and your work?
Data‐driven linear complexity low‐rank approximation of general kernel matrices: A geometric approach
Summary A general, rectangular kernel matrix may be defined as where is a kernel function and where and are two sets of points. In this paper, we seek a low‐rank approximation to a kernel matrix where the sets of points and are large and are arbitrarily distributed, such as away …