Výsledky vyhľadávania - computational complexity and matrix polynomial

Linear Precoding of Data and Artificial Noise in Secure Massive MIMO Systems Autor Jun Zhu, Schober, Robert, Bhargava, Vijay K.

“…In this paper, we consider secure downlink transmission in a multicell massive multiple-input multiple-output (MIMO) system where the numbers of base station…”
Získať plný text

Polynomial computational complexity of matrix elements of finite-rank-generated single-particle operators in products of finite bosonic states Autor Ivanov, Dmitri A.

“…It is known that computing the permanent of the matrix 1+A, where A is a finite-rank matrix, requires a number of operations polynomial in the matrix size…”
Získať plný text

On the complexity of inverting integer and polynomial matrices Autor Storjohann, Arne

“… . A variation of the algorithm is presented for polynomial matrices that computes the inverse of a nonsingular n…”
Získať plný text

Polynomial computational complexity of matrix elements of finite-rank-generated single-particle operators in products of finite bosonic states Autor Ivanov, Dmitri A

“…It is known that computing the permanent of the matrix \(1+A\), where \(A\) is a finite-rank matrix, requires a number of operations polynomial in the matrix size…”
Získať plný text

On Rigid Matrices and U-Polynomials Autor Alon, Noga, Cohen, Gil

“…We introduce a class of polynomials, which we call U - polynomials , and show that the problem of explicitly constructing a rigid matrix can be reduced to the problem of explicitly constructing…”
Získať plný text

Complementarity and the unitarity of the black hole S-matrix Autor Kim, Isaac H., Preskill, John

“… Within this model, we study properties of the black hole S -matrix, which are in principle accessible to observers who stay outside the black hole…”
Získať plný text

Sum-of-squares chordal decomposition of polynomial matrix inequalities Autor Zheng, Yang, Fantuzzi, Giovanni

“…We prove decomposition theorems for sparse positive (semi)definite polynomial matrices that can be viewed as sparsity-exploiting versions of the Hilbert…”
Získať plný text

Polynomial Expansion-Based MMSE Channel Estimation and Precoding for Massive MIMO-GFDM Systems Autor Wang, Yanpeng, Fortier, Paul

“… Polynomial expansion is used to approximately compute the matrix inverses in the conventional MMSE estimation and precoding, consequently reducing the cubic computational complexity to square order…”
Získať plný text

Polynomial Expansion-Based MMSE Channel Estimation for Massive MIMO-GFDM Systems Autor Wang, Yanpeng, Fortier, Paul

“… Polynomial expansion is used to approximately compute the matrix inverse in conventional MMSE estimation, consequently reducing the cubic computational complexity to square order…”
Získať plný text

The Complexity of the Greedoid Tutte Polynomial Autor Knapp, Christopher, Noble, Steven

“… We establish the computational complexity of evaluating each of these polynomials at each fixed rational point $(x,y…”
Získať plný text

Fast-Time Stability of Temporal Boolean Networks Autor Li, Bowen, Lu, Jianquan, Zhong, Jie, Liu, Yang

“… Moreover, incidence matrices are used to obtain several sufficient conditions, which reduce the computational complexity from <inline-formula> <tex-math notation="LaTeX…”
Získať plný text

A Non-Self-Referential Characterization of the Gram–Schmidt Process via Computational Induction Autor Chen, Ray-Ming

“…The Gram–Schmidt process (GSP) plays an important role in algebra. It provides a theoretical and practical approach for generating an orthonormal basis, QR decomposition, unitary matrices, etc…”
Získať plný text

High-order matrix-free incompressible flow solvers with GPU acceleration and low-order refined preconditioners Autor Franco, Michael, Camier, Jean-Sylvain, Andrej, Julian, Pazner, Will

“… For high polynomial degrees, assembling the matrix for the linear systems resulting from the finite element discretization can be prohibitively expensive, both in terms of computational complexity and memory…”
Získať plný text

Complexity of constructing Dixon resultant matrix Autor Qin, Xiaolin, Wu, Dingxiong, Tang, Lin, Ji, Zhenyi

“… An existing extended recurrence formula can construct the Dixon resultant matrix fast. In this paper, we present a detailed analysis of the computational complexity of the recurrence formula for the general…”
Získať plný text

Bernstein-Bézier weight-adjusted discontinuous Galerkin methods for wave propagation in heterogeneous media Autor Guo, Kaihang, Chan, Jesse

“…•Representation of the Bernstein polynomial projection matrix in terms of sparse matrices.•Computational complexity is reduced from O(N2d) to O(Nd+1) in d dimensions…”
Získať plný text

Sum factorization for fast integration of DPG matrices on prismatic elements Autor Badger, Jacob, Henneking, Stefan, Demkowicz, Leszek

“…] for the assembly of DPG matrices on hexahedral elements that reduced the computational…”
Získať plný text

Low Complexity Polynomial Expansion Detector With Deterministic Equivalents of the Moments of Channel Gram Matrix for Massive MIMO Uplink Autor Lu, An-An, Gao, Xiqi, Zheng, Yahong Rosa, Xiao, Chengshan

“…We consider a low complexity polynomial expansion (PE) detector in a massive multiple-input multiple-output (MIMO) uplink channel…”
Získať plný text

Sparse Polynomial Zonotopes: A Novel Set Representation for Reachability Analysis Autor Kochdumper, Niklas, Althoff, Matthias

“… Operations like Minkowski sum, quadratic mapping, and reduction of the representation size can be computed with polynomial complexity w.r.t…”
Získať plný text

Enclosure for the polynomial eigenvalue problems of complex Hermitian interval matrices and their appearances in dynamical phenomenon having bounded uncertainty: Enclosure for the polynomial eigenvalue Autor Maiti, Suman, Chakraverty, Snehashish

“… Here, the polynomial function has the complex Hermitian interval matrix coefficients…”
Získať plný text

Direct algorithm for the solution of two-sided obstacle problems with M-matrix Autor Jiang, Ying-Jun, Zeng, Jin-Ping

“…‐matrix is presented. The algorithm has the polynomial bounded computational complexity O(n3…”
Získať plný text