Search results for " computational"
showing 10 items of 661 documents
On Physical Problems that are Slightly More Difficult than QMA
2013
We study the complexity of computational problems from quantum physics. Typically, they are studied using the complexity class QMA (quantum counterpart of NP) but some natural computational problems appear to be slightly harder than QMA. We introduce new complexity classes consisting of problems that are solvable with a small number of queries to a QMA oracle and use these complexity classes to quantify the complexity of several natural computational problems (for example, the complexity of estimating the spectral gap of a Hamiltonian).
Representation and factorization theorems for almost-Lp-spaces
2019
The first and fourth authors gratefully acknowledge the support of Ministerio de Ciencia, Innovacibn y Universidades (Spain), Agencia Estatal de Investigaciones, and FEDER, under projects MTM2014-53009-P (J.M. Calabuig) and MTM2016-77054-C2-1-P (E.A. Sanchez Perez).
The Asynchronous Leontief Model
1992
International audience; The traditional dynamic Leontief model is synchronous: every vertex acts simultaneously. A model with delays of action has been proposed, but it still remains synchronous. In this paper we propose an asynchronous version of the model that allows realistic computations. We fiurnish an algorithm and a program.
Factorization of (q,p)-summing polynomials through Lorentz spaces
2017
[EN] We present a vector valued duality between factorable (q,p)-summing polynomials and (q,p)-summing linear operators on symmetric tensor products of Banach spaces. Several applications are provided. First, we prove a polynomial characterization of cotype of Banach spaces. We also give a variant of Pisier's factorization through Lorentz spaces of factorable (q,p)-summing polynomials from C(K)-spaces. Finally, we show a coincidence result for (q,p)-concave polynomials.(c) 2016 Elsevier Inc. All rights reserved.
P-matrix completions under weak symmetry assumptions
2000
An n-by-n matrix is called a Π-matrix if it is one of (weakly) sign-symmetric, positive, nonnegative P-matrix, (weakly) sign-symmetric, positive, nonnegative P0,1-matrix, or Fischer, or Koteljanskii matrix. In this paper, we are interested in Π-matrix completion problems, that is, when a partial Π-matrix has a Π-matrix completion. Here, we prove that a combinatorially symmetric partial positive P-matrix has a positive P-matrix completion if the graph of its specified entries is an n-cycle. In general, a combinatorially symmetric partial Π-matrix has a Π-matrix completion if the graph of its specified entries is a 1-chordal graph. This condition is also necessary for (weakly) sign-symmetric …
Domination spaces and factorization of linear and multilinear summing operators
2015
[EN] It is well known that not every summability property for multilinear operators leads to a factorization theorem. In this paper we undertake a detailed study of factorization schemes for summing linear and nonlinear operators. Our aim is to integrate under the same theory a wide family of classes of mappings for which a Pietsch type factorization theorem holds. Our construction includes the cases of absolutely p-summing linear operators, (p, sigma)-absolutely continuous linear operators, factorable strongly p-summing multilinear operators, (p(1), ... , p(n))-dominated multilinear operators and dominated (p(1), ... , p(n); sigma)-continuous multilinear operators.
On the Russo-Dye Theorem for positive linear maps
2019
Abstract We revisit a classical result, the Russo-Dye Theorem, stating that every positive linear map attains its norm at the identity.
Property (gab) through localized SVEP
2015
In this article we study the property (gab) for a bounded linear operator T 2 L(X) on a Banach space X which is a stronger variant of Browder's theorem. We shall give several characterizations of property (gab). These characterizations are obtained by using typical tools from local spectral theory. We also show that property (gab) holds for large classes of operators and prove the stability of property (gab) under some commuting perturbations. 2010 Mathematics Subject Classication. Primary 47A10, 47A11; Secondary 47A53, 47A55.
Rank structured approximation method for quasi--periodic elliptic problems
2016
We consider an iteration method for solving an elliptic type boundary value problem $\mathcal{A} u=f$, where a positive definite operator $\mathcal{A}$ is generated by a quasi--periodic structure with rapidly changing coefficients (typical period is characterized by a small parameter $\epsilon$) . The method is based on using a simpler operator $\mathcal{A}_0$ (inversion of $\mathcal{A}_0$ is much simpler than inversion of $\mathcal{A}$), which can be viewed as a preconditioner for $\mathcal{A}$. We prove contraction of the iteration method and establish explicit estimates of the contraction factor $q$. Certainly the value of $q$ depends on the difference between $\mathcal{A}$ and $\mathcal…
Star-polynomial identities: computing the exponential growth of the codimensions
2017
Abstract Can one compute the exponential rate of growth of the ⁎-codimensions of a PI-algebra with involution ⁎ over a field of characteristic zero? It was shown in [2] that any such algebra A has the same ⁎-identities as the Grassmann envelope of a finite dimensional superalgebra with superinvolution B. Here, by exploiting this result we are able to provide an exact estimate of the exponential rate of growth e x p ⁎ ( A ) of any PI-algebra A with involution. It turns out that e x p ⁎ ( A ) is an integer and, in case the base field is algebraically closed, it coincides with the dimension of an admissible subalgebra of maximal dimension of B.