Related papers: A note on the Sassenfeld criterion and its relatio…
A solution is given to a conjecture proposed by Y. Wigderson and A. Wigderson concerning a "Heisenberg-like" uncertainty principle. This is an old article already published in 2022.
We propose a general proximal algorithm for the inversion of ill-conditioned matrices. This algorithm is based on a variational characterization of pseudo-inverses. We show that a particular instance of it (with constant regularization…
A spectrahedron is the positivity region of a linear matrix pencil and thus the feasible set of a semidefinite program. We propose and study a hierarchy of sufficient semidefinite conditions to certify the containment of a spectrahedron in…
Solving sparse linear systems from discretized PDEs is challenging. Direct solvers have in many cases quadratic complexity (depending on geometry), while iterative solvers require problem dependent preconditioners to be robust and…
We present simple, user-friendly bounds for the expected operator norm of a random kernel matrix under general conditions on the kernel function $k(\cdot,\cdot)$. Our approach uses decoupling results for U-statistics and the non-commutative…
In this paper, we study the truncated matrix moment problem in one variable through recursive matrix extensions. \ We give necessary and sufficient conditions for a recursive matrix extension of finite data to be a matrix moment sequence in…
We introduce a weak form of the realignment separability criterion which is particularly suited to detect continuous-variable entanglement and is physically implementable (it requires linear optics transformations and homodyne detection).…
Adhesive categories provide an abstract framework for the algebraic approach to rewriting theory, where many general results can be recast and uniformly proved. However, checking that a model satisfies the adhesivity properties is sometimes…
The author was encouraged to write this review by numerous enquiries from researchers all over the world, who needed a ready-to-use algorithm for the inversion of confluent Vandermonde matrices which works in quadratic time for any values…
In this paper new criteria are established for the existence of positive radial solutions of a semilinear elliptic system depending on the gradient. These criteria are determined by some relationships between the upper and lower bounds on…
Hadamard ideals were introduced in 2006 as a set of nonlinear polynomial equations whose zeros are uniquely related to Hadamard matrices with one or two circulant cores of a given order. Based on this idea, the cocyclic Hadamard test enable…
We present two globally convergent Levenberg-Marquardt methods for finding zeros of H\"{o}lder metrically subregular mappings that may have non-isolated zeros. The first method unifies the Levenberg- Marquardt direction and an Armijo-type…
The purpose of this study is to show how to get a necessary criterion for prime numbers with the help of special matrices. My special interest lies in the empirical research of these matrices and their patterns, structures and symmetries.…
The idea of this review article is to discuss in a unified way the orthogonality of all positive definite polynomial solutions of the $q$-hypergeometric difference equation on the $q$-linear lattice by means of a qualitative analysis of the…
A new similarity measure for two sets of S-parameters is proposed. It is constructed with the modified Hausdorff distance applied to S-parameter points in 3D space with real, imaginary and normalized frequency axes. New S-parameters…
We explore a scaled spectral preconditioner for the efficient solution of sequences of symmetric and positive-definite linear systems. We design the scaled preconditioner not only as an approximation of the inverse of the linear system but…
We reframe linear dimensionality reduction as a problem of Bayesian inference on matrix manifolds. This natural paradigm extends the Bayesian framework to dimensionality reduction tasks in higher dimensions with simpler models at greater…
We consider the matrix completion problem where the aim is to esti-mate a large data matrix for which only a relatively small random subset of its entries is observed. Quite popular approaches to matrix completion problem are iterative…
In this paper we obtain a Liouville type theorem to the semilinear subcritical elliptic equation on H-type groups. The semilinear subcritical elliptic equation studied in this paper is a generalization of a classical semilinear subcritical…
In the manuscript, we present a practical way to find the matching priors proposed by Welch & Peers (1963) and Peers (1965). We investigate the use of saddlepoint approximations combined with matching priors and obtain p-values of the test…