English
Related papers

Related papers: On the sum of superoptimal singular values

200 papers

Let $(s_n)_{n\ge 0}$ denote an indeterminate Hamburger moment sequence and let $\mathcal H=\{s_{m+n}\}$ be the corresponding positive definite Hankel matrix. We consider the question if there exists an infinite symmetric matrix $\mathcal…

Classical Analysis and ODEs · Mathematics 2018-10-09 Christian Berg , Ryszard Szwarc

We compute the exact Fourier dimension of the set of $\Psi$-well-approximable $m \times n$ matrices (and the set of $\Psi$-well-approximable numbers) in the homogeneous and inhomogeneous cases for any approximation function $\Psi$…

Number Theory · Mathematics 2024-03-29 Thomas Cai , Kyle Hambrook

We review the closed-forms of the partial Fourier sums associated with $HP_k(n)$ and create an asymptotic expression for $HP(n)$ as a way to obtain formulae for the full Fourier series (if $b$ is such that $|b|<1$, we get a surprising…

Number Theory · Mathematics 2021-04-02 Jose Risomar Sousa

Let f be a polinomial with coefficients in a finite field F. Let $\Psi : F \to C^{\ast}$ be a non-trivial additive character. In this paper we give bounds for the exponential sums $\sum_{x\in F^n} \Psi (Tr_{F/F_p} (f(x)))$ in some cases…

alg-geom · Mathematics 2008-02-03 Ricardo Garcia Lopez

Given a matrix $A$ and $k\geq 0$, we study the problem of finding the $k\times k$ submatrix of $A$ with the maximum determinant in absolute value. This problem is motivated by the question of computing the determinant-based lower bound of…

Data Structures and Algorithms · Computer Science 2021-09-16 Nima Anari , Thuy-Duong Vuong

In this paper, we establish the following perturbation result concerning the singular values of a matrix: Let $A,B \in \mathbb{R}^{m\times n}$ be given matrices, and let $f:\mathbb{R}_+\rightarrow\mathbb{R}_+$ be a concave function…

Optimization and Control · Mathematics 2014-06-30 Man-Chung Yue , Anthony Man-Cho So

The objective of the matrix selection problem is to select a submatrix $A_{S}\in \mathbb{R}^{n\times k}$ from $A\in \mathbb{R}^{n\times m}$ such that its minimum singular value is maximized. In this paper, we employ the interlacing…

Functional Analysis · Mathematics 2025-08-15 Zhiqiang Xu

For any real number $p > 0$, we nearly completely characterize the space complexity of estimating $\|A\|_p^p = \sum_{i=1}^n \sigma_i^p$ for $n \times n$ matrices $A$ in which each row and each column has $O(1)$ non-zero entries and whose…

Data Structures and Algorithms · Computer Science 2017-03-21 Yi Li , David P. Woodruff

In this paper we consider an extremal problem in geometry. Let $\lambda$ be a real number and $A$, $B$ and $C$ be arbitrary points on the unit circle $\Gamma$. We give full characterization of the extremal behavior of the function…

Metric Geometry · Mathematics 2012-09-03 Nikolai Nikolov , Rafael Rafailov

Understanding the singular value spectrum of a matrix $A \in \mathbb{R}^{n \times n}$ is a fundamental task in countless applications. In matrix multiplication time, it is possible to perform a full SVD and directly compute the singular…

Data Structures and Algorithms · Computer Science 2019-01-04 Cameron Musco , Praneeth Netrapalli , Aaron Sidford , Shashanka Ubaru , David P. Woodruff

Matrices with displacement structure such as Pick, Vandermonde, and Hankel matrices appear in a diverse range of applications. In this paper, we use an extremal problem involving rational functions to derive explicit bounds on the singular…

Numerical Analysis · Mathematics 2016-10-03 Bernhard Beckermann , Alex Townsend

We introduce the method of path-sums which is a tool for exactly evaluating a function of a discrete matrix with possibly non-commuting entries, based on the closed-form resummation of infinite families of terms in the corresponding Taylor…

Quantum Algebra · Mathematics 2013-05-27 P. -L. Giscard , S. J. Thwaite , D. Jaksch

This paper studies an optimization problem on the sum of traces of matrix quadratic forms in $m$ semi-orthogonal matrices, which can be considered as a generalization of the synchronization of rotations. While the problem is nonconvex, the…

Optimization and Control · Mathematics 2021-10-13 Joong-Ho Won , Teng Zhang , Hua Zhou

We show that any $m\times m$ matrix $M$ with integer entries and $\det M =\Delta \neq 0$ can be equipped by a finite digit set $\mathcal{D}\subset\mathbb{Z}^m$ such that any integer $m$-dimensional vector belongs to the set $$ {\rm…

Number Theory · Mathematics 2021-03-04 Edita Pelantová , Tomáš Vávra

Given a matrix-valued function $\mathcal{F}(\lambda)=\sum_{i=1}^d f_i(\lambda) A_i$, with complex matrices $A_i$ and $f_i(\lambda)$ entire functions for $i=1,\ldots,d$, we discuss a method for the numerical approximation of the distance to…

Numerical Analysis · Mathematics 2025-04-11 Miryam Gnazzo , Nicola Guglielmi

The extremal theory of forbidden 0-1 matrices studies the asymptotic growth of the function $\mathrm{Ex}(P,n)$, which is the maximum weight of a matrix $A\in\{0,1\}^{n\times n}$ whose submatrices avoid a fixed pattern $P\in\{0,1\}^{k\times…

Combinatorics · Mathematics 2023-07-06 Seth Pettie , Gábor Tardos

We propose a novel parallel numerical algorithm for calculating the smallest eigenvalues of highly ill-conditioned matrices. It is based on the {\it LDLT} decomposition and involves finding a $k \times k$ sub-matrix of the inverse of the…

Numerical Analysis · Mathematics 2018-10-04 Yang Chen , Jakub Sikorowski , Mengkun Zhu

Singular values of a data in a matrix form provide insights on the structure of the data, the effective dimensionality, and the choice of hyper-parameters on higher-level data analysis tools. However, in many practical applications such as…

Machine Learning · Statistics 2017-03-21 Ashish Khetan , Sewoong Oh

In this paper, we study the behavior of the singular values of Hankel operators on weighted Bergman spaces $A^2_{\omega _\varphi}$, where $\omega _\varphi= e^{-\varphi}$ and $\varphi$ is a subharmonic function. We consider compact Hankel…

Classical Analysis and ODEs · Mathematics 2021-02-04 M. Bourass , O. El-Fallah , I. Marrhich , H. Naqos

We consider linear matrix inequalities (LMIs) $A = A_0 + x_1 A_1 + ... + x_n A_n \succeq 0$ with the $A_i$'s being $m \times m$ symmetric matrices, with entries in a ring $\mathcal{R}$. When $\mathcal{R} = \mathbb{R}$, the feasibility…

Symbolic Computation · Computer Science 2025-08-28 Simone Naldi , Mohab Safey El Din , Adrien Taylor , Weijia Wang