Minimax separation of the Cauchy kernel

09/15/2019
by   Jonathan E. Moussa, et al.
0

We prove and apply an optimal low-rank approximation of the Cauchy kernel over separated real domains. A skeleton decomposition is the minimum over real-valued functions of the maximum relative pointwise error. We establish a numerically stable form for the decomposition and demonstrate an example for which it is arbitrarily more accurate than singular value decompositions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/29/2022

Generalized matrix nearness problems

We show that the global minimum solution of ‖ A - BXC ‖ can be found in ...
research
12/12/2019

Fast non-convex low-rank matrix decomposition for separation of potential field data using minimal memory

A fast non-convex low-rank matrix decomposition method for potential fie...
research
10/10/2016

Low-Rank Dynamic Mode Decomposition: Optimal Solution in Polynomial-Time

This work studies the linear approximation of high-dimensional dynamical...
research
03/08/2022

Low-rank approximation of continuous functions in Sobolev spaces with dominating mixed smoothness

Let Ω_i⊂ℝ^n_i, i=1,…,m, be given domains. In this article, we study the ...
research
01/17/2023

Randomized GCUR decompositions

By exploiting the random sampling techniques, this paper derives an effi...
research
11/15/2022

Stable rank-adaptive Dynamically Orthogonal Runge-Kutta schemes

We develop two new sets of stable, rank-adaptive Dynamically Orthogonal ...
research
04/27/2021

Learning Fair Canonical Polyadical Decompositions using a Kernel Independence Criterion

This work proposes to learn fair low-rank tensor decompositions by regul...

Please sign up or login with your details

Forgot password? Click here to reset