نتایج جستجو برای: matrix q th root
تعداد نتایج: 651313 فیلتر نتایج به سال:
In this note, we propose a new construction of cyclotomic p-adic L-functions that are attached to classical modular cuspidal eigenforms. This allows for us cover most known cases date and provides method which is amenable generalizations automorphic forms on arbitrary groups. the setting GL2 over Q, construct L-function in so far uncovered extremal case, arises under unlikely hypothesis p-th He...
For arbitrary equally sized square complex matrices A and Q (Q Hermitian), the paper provides a complete algebraic test for verifying the existence of a Hermitian solution X of the nonstrict Lyapunov inequality A X + XA + Q 0: If existing, we exhibit how to construct a solution. Our approach involves the validation problem for the linear matrix inequality P k j=1 (A j X j B j + B j X j A j) + Q...
T h e p r o to n elast ic electr ic a n d m a g n e tic fo r m factors, G E M a n d G ’b fP ( Q 2 ) , h a v e b e e n s e p a r a te ly m e a s u r e d in th e r a n g e Q ” = 1 .7 5 to 8 .8 3 ( G e V /c)2, m o r e th a n doub l i ng th e Q 3 r a n g e o f p rev ious d a ta . Sca led by th e d ipo le fit, G o ( Q 2 ) , th e resul ts fo r G n lp(Q 2 ) //+ G ~ ( Q 2 ) d ec rease s m o o thly f ro...
We present a formulation of the determination of the impedance between any two nodes in an impedance network. An impedance network is described by its Laplacian matrix L which has generally complex matrix elements. We show that by solving the equation Luα = λα u ∗ α with orthonormal vectors ua, the effective impedance between nodes p and q of the network is Zpq = ∑ α(uαp − uα q)/λα where the su...
k=1 |ak| , in which C = (cj,k) and the parameter p are assumed fixed (p > 1), and the estimate is to hold for all complex sequences a. The lp operator norm of C is then defined as the p-th root of the smallest value of the constant U : ||C||p,p = U 1 p . Hardy’s inequality thus asserts that the Cesáro matrix operator C, given by cj,k = 1/j, k ≤ j and 0 otherwise, is bounded on lp and has norm ≤...
We present a hierarchy of semidefinite programming (SDP) relaxations for solving the concave cost transportation problem (CCTP), which is known to be NP-hard, with p suppliers and q demanders. In particular, we study cases in which the cost function is quadratic or square-root concave. The key idea of our relaxation methods is in the change of variables to CCTPs, and due to this, we can constru...
We analyse q-functional equations arising from tree-like combinatorial structures, which are counted by size, internal path length and certain generalisations thereof. The corresponding counting parameters are labelled by an integer k > 1. We show the existence of a joint limit distribution for these parameters in the limit of infinite size, if the size generating function has a square root as ...
k=1 |ak|, in which C = (cj,k) and the parameter p are assumed fixed (p > 1), and the estimate is to hold for all complex sequences a. The lp operator norm of C is then defined as the p-th root of the smallest value of the constant U : ||C||p,p = U 1 p . Hardy’s inequality thus asserts that the Cesáro matrix operator C, given by cj,k = 1/j, k ≤ j and 0 otherwise, is bounded on lp and has norm ≤ ...
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
We consider the space M of N × N matrices as a reduced quantum plane and discuss its geometry under the action and coaction of finite dimensional quantum groups (a quotient of UqSL(2), q being an N-th root of unity, and its dual). We also introduce a differential calculus for M: a quotient of the Wess Zumino complex. We shall restrict ourselves to the case N odd and often choose the particular ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید