Results 1 to 10 of about 5,109,809 (289)
The lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices. [PDF]
J Inequal Appl, 2017 The paper mainly discusses the lower bounds for the rank of matrices and sufficient conditions for nonsingular matrices. We first present a new estimation for ∑ i = 1 n | λ i | 2 $\sum_{i=1}^{n} \vert \lambda_{i} \vert ^{2}$ ( λ i $\lambda_{i}$ is an ...
Wang D, Zhang X.
europepmc +2 more sources
Lower bounds for the low-rank matrix approximation. [PDF]
J Inequal Appl, 2017 Low-rank matrix recovery is an active topic drawing the attention of many researchers. It addresses the problem of approximating the observed data matrix by an unknown low-rank matrix. Suppose that A is a low-rank matrix approximation of D, where D and A
Li J, Liu Z, Li G.
europepmc +2 more sources
Upper and lower bounds for the Bregman divergence. [PDF]
J Inequal Appl, 2019 In this paper we study upper and lower bounds on the Bregman divergence ΔFξ(y,x):=F(y)−F(x)−〈ξ,y−x〉 $\Delta_{\mathcal {F}}^{\xi }(y,x):=\mathcal {F}(y)-\mathcal {F}(x)- \langle \xi , y-x \rangle$ for some convex functional F $\mathcal {F}$ on a normed ...
Sprung B.
europepmc +2 more sources
Lower Bounds for Nonrelativistic Atomic Energies. [PDF]
ACS Phys Chem Au, 2022 Ireland RT +5 more
europepmc +2 more sources
Lower Bounds on Paraclique Density. [PDF]
Discrete Appl Math, 2016 The scientific literature teems with clique-centric clustering strategies. In this paper we analyze one such method, the paraclique algorithm. Paraclique has found practical utility in a variety of application domains, and has been successfully employed to reduce the effects of noise.
Hagan RD, Langston MA, Wang K.
europepmc +4 more sources
Lower Bounds on Stabilizer Rank [PDF]
Quantum, 2022 The $\textit{stabilizer rank}$ of a quantum state $\psi$ is the minimal $r$ such that $\left| \psi \right \rangle = \sum_{j=1}^r c_j \left|\varphi_j \right\rangle$ for $c_j \in \mathbb{C}$ and stabilizer states $\varphi_j$.
Shir Peleg, Amir Shpilka, Ben Lee Volk
doaj +1 more source
Decorous lower bounds for minimum linear arrangement [PDF]
, 2011 Minimum Linear Arrangement is a classical basic combinatorial optimization problem from the 1960s, which turns out to be extremely challenging in practice.
Salazar, J J, Caprara, A, Letchford, A N
core +5 more sources
Some New Bounds for Mathieu's Series [PDF]
, 2007 In the paper, an upper bound and two lower bounds for Mathieu’s series are established, which refine to a certain extent a sharp double inequality obtained by Alzer-Brenner-Ruehr in 1998.
Qi, Feng, Hoorfar, Abdolhossein
core +7 more sources
Lower bounds for blow up time of the p-Laplacian equation with damping term [PDF]
Mathematica Moravica, 2021 In this work deals with the p-Laplacian wave equation with damping terms in a bounded domain. Under suitable conditions, we obtain a lower bounds for the blow up time.
Dınç Yavuz +2 more
doaj +1 more source
A parameterized lower bounding method for the open capacitated arc routing problem
EURO Journal on Computational Optimization, 2023 Consider an undirected graph with demands scattered over the edges and a homogeneous fleet of vehicles to service the demands. In the open capacitated arc routing problem (OCARP) the objective is to find a set of routes that collectively service all ...
Rafael Kendy Arakaki +1 more
doaj +1 more source