English
Related papers

Related papers: Approximating Multi-Dimensional and Multiband Sign…

200 papers

It is well-known that tensor decompositions show separations, that is, that constraints on local terms (such as positivity) may entail an arbitrarily high cost in their representation. Here we show that many of these separations disappear…

Optimization and Control · Mathematics 2021-09-03 Gemma De las Cuevas , Andreas Klingler , Tim Netzer

We consider a quite general problem concerning a linear free oscillation of a discrete mass-spring-damper system. This discrete sub-system is embedded into a one-dimensional continuum medium described by the linear telegraph equation. In a…

Classical Physics · Physics 2024-11-15 Serge N. Gavrilov , Ilya O. Poroshin , Ekaterina V. Shishkina , Yulia A. Mochalova

As parallel computing trends towards the exascale, scientific data produced by high-fidelity simulations are growing increasingly massive. For instance, a simulation on a three-dimensional spatial grid with 512 points per dimension that…

Numerical Analysis · Computer Science 2017-01-05 Woody Austin , Grey Ballard , Tamara G. Kolda

We define a proportionally dense subgraph (PDS) as an induced subgraph of a graph with the property that each vertex in the PDS is adjacent to proportionally as many vertices in the subgraph as in the graph. We prove that the problem of…

Computational Complexity · Computer Science 2020-06-11 Cristina Bazgan , Janka Chlebíková , Clément Dallard , Thomas Pontoizeau

Other than vector representations, the direct objects of human cognition are generally high-order tensors, such as 2D images and 3D textures. From this fact, two interesting questions naturally arise: How does the human brain represent…

Machine Learning · Computer Science 2013-06-13 Guoqiang Zhong , Mohamed Cheriet

We study the problem of representing all distances between $n$ points in $\mathbb R^d$, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for…

Computational Geometry · Computer Science 2021-10-08 Piotr Indyk , Tal Wagner

In this paper we propose an efficient method to compress a high dimensional function into a tensor ring format, based on alternating least-squares (ALS). Since the function has size exponential in $d$ where $d$ is the number of dimensions,…

Numerical Analysis · Mathematics 2019-06-28 Yuehaw Khoo , Jianfeng Lu , Lexing Ying

We study the optimal design problems where the goal is to choose a set of linear measurements to obtain the most accurate estimate of an unknown vector in $d$ dimensions. We study the $A$-optimal design variant where the objective is to…

Data Structures and Algorithms · Computer Science 2018-07-18 Aleksandar Nikolov , Mohit Singh , Uthaipon Tao Tantipongpipat

Compressed sensing is a processing method that significantly reduces the number of measurements needed to accurately resolve signals in many fields of science and engineering. We develop a two-dimensional (2D) variant of compressed sensing…

Quantum Physics · Physics 2012-07-17 J. N. Sanders , S. Mostame , S. K. Saikin , X. Andrade , J. R. Widom , A. H. Marcus , A. Aspuru-Guzik

We establish sharp well-posedness and approximation estimates for variational saddle point systems at the continuous level. The main results of this note have been known to be true only in the finite dimensional case. Known spectral results…

Numerical Analysis · Mathematics 2014-11-04 Constantin Bacuta

We study the electronic transport in quasiperiodic separable tight-binding models in one, two, and three dimensions. First, we investigate a one-dimensional quasiperiodic chain, in which the atoms are coupled by weak and strong bonds…

Disordered Systems and Neural Networks · Physics 2013-01-03 Stefanie Thiem , Michael Schreiber

Compressive sensing is a sensing protocol that facilitates reconstruction of large signals from relatively few measurements by exploiting known structures of signals of interest, typically manifested as signal sparsity. Compressive…

Quantum Physics · Physics 2022-08-10 Kyle Sherbert , Naveed Naimipour , Haleh Safavi , Harry Shaw , Mojtaba Soltanalian

We analyze low rank tensor completion (TC) using noisy measurements of a subset of the tensor. Assuming a rank-$r$, order-$d$, $N \times N \times \cdots \times N$ tensor where $r=O(1)$, the best sampling complexity that was achieved is…

Machine Learning · Computer Science 2017-11-15 Navid Ghadermarzy , Yaniv Plan , Özgür Yılmaz

We study the compressed sensing reconstruction problem for a broad class of random, band-diagonal sensing matrices. This construction is inspired by the idea of spatial coupling in coding theory. As demonstrated heuristically and…

Information Theory · Computer Science 2015-03-19 David L. Donoho , Adel Javanmard , Andrea Montanari

Conventional sampling and interpolation commonly rely on discrete measurements. In this paper, we develop a theoretical framework for extrapolation of signals in higher dimensions from knowledge of the continuous waveform on bounded…

Signal Processing · Electrical Eng. & Systems 2020-08-04 Cornelius Frankenbach , Pablo Martínez-Nuevo , Martin Møller , Walter Kellermann

In this article, we consider parabolic equations on a bounded open connected subset $\Omega$ of $\R^n$. We model and investigate the problem of optimal shape and location of the observation domain having a prescribed measure. This problem…

Optimization and Control · Mathematics 2015-06-19 Yannick Privat , Emmanuel Trélat , Enrique Zuazua

Motivated by the recent interest in approximate message passing (AMP) for matrix-valued linear observations with superposition of \emph{multiple statistically asymmetric signal sources}, we introduce a multi-source AMP framework in which…

Information Theory · Computer Science 2025-01-22 Burak Çakmak , Giuseppe Caire

Topologically protected waves in the linearly polarized Maxwell's equations with gyrotropic, magneto-optic media were studied a decade ago both computationally and experimentally. This paper develops a robust tight-binding model for this…

Optics · Physics 2020-02-19 Mark J. Ablowitz , Justin T. Cole

This paper is concerned with the approximation of tensors using tree-based tensor formats, which are tensor networks whose graphs are dimension partition trees. We consider Hilbert tensor spaces of multivariate functions defined on a…

Numerical Analysis · Mathematics 2019-09-11 Anthony Nouy

We construct an asymptotic approximation to the solution of a transmission problem for a body containing a region occupied by many small inclusions. The cluster of inclusions is characterised by two small parameters that determine the…

Analysis of PDEs · Mathematics 2016-07-22 Michael Nieves