Kövari and Pommerenke [19], and Elliott [8], have shown that the truncated Faber series gives a polynomial approximation which (for practical values of the degree of the polynomial) is very close to ...

Structured low-rank approximation (SLRA) is a mathematical framework that seeks to approximate a given data matrix by another matrix of lower rank while preserving intrinsic structural properties.

Abstract: In this paper, an existing numerical algorithm for high-accurate computation of exact Carson formulas based on piecewise linear approximation is improved. Carson formulas are used for ...

Floating-point arithmetic is a cornerstone of modern computational science, providing an efficient means to approximate real numbers within a finite precision framework. Its ubiquity across scientific ...

Abstract: This paper studies the problem of Nash equilibrium approximation in large-scale heterogeneous (static) mean-field games under communication and computation constraints. A deterministic ...