English
Related papers

Related papers: Complexity of Linear Operators

200 papers

Representations of quantum superalgebras provide a natural framework in which to model supersymmetric quantum systems. Each quantum superalgebra, belonging to the class of quasi-triangular Hopf superalgebras, contains a universal R-matrix…

Quantum Algebra · Mathematics 2016-09-07 K. A. Dancer , M. D. Gould , J. Links

Many systems are presented using theory of nonlinear operators. A quadratic stochastic operator (QSO) is perceived as a nonlinear operator. It has a wide range of applications in various disciplines, such as mathematics, biology, and other…

Dynamical Systems · Mathematics 2018-07-31 Hamza Abd El-Qader , Ahmad Termimi Ab Ghani , Izzat Qaralleh

We say a zero-one matrix $A$ avoids another zero-one matrix $P$ if no submatrix of $A$ can be transformed to $P$ by changing some ones to zeros. A fundamental problem is to study the extremal function $ex(n,P)$, the maximum number of…

Discrete Mathematics · Computer Science 2017-04-19 P. A. CrowdMath

We give two algorithms for output-sparse matrix multiplication (OSMM), the problem of multiplying two $n \times n$ matrices $A, B$ when their product $AB$ is promised to have at most $O(n^{\delta})$ many non-zero entries for a given value…

Data Structures and Algorithms · Computer Science 2025-08-15 Huck Bennett , Karthik Gajulapalli , Alexander Golovnev , Evelyn Warton

In analogy to a characterisation of operator matrices generating $C_0$-semigroups due to R. Nagel (\cite{[Na89]}), we give conditions on its entries in order that a $2\times 2$ operator matrix generates a cosine operator function. We apply…

Functional Analysis · Mathematics 2019-06-04 Delio Mugnolo

Researchers have identified complex matrices $A$ such that a bounded linear operator $B$ acting on a Hilbert space will admit a dilation of the form $A \otimes I$ whenever the numerical range inclusion relation $W(B) \subseteq W(A)$ holds.…

Functional Analysis · Mathematics 2019-11-05 Chi-Kwong Li , Yiu-Tung Poon

The efficient implementation of matrix arithmetic operations underpins the speedups of many quantum algorithms. We develop a suite of methods to perform matrix arithmetics -- with the result encoded in the off-diagonal blocks of a…

Quantum Physics · Physics 2026-01-23 Christopher Kang , Yuan Su

Let A(x) be a holomorphic family of bounded self-adjoint operators on a separable Hilbert space H and let A(x)_n be the orthogonal compressions of A(x) to the span of first n elements of an orthonormal basis of H. The problem considered…

Functional Analysis · Mathematics 2022-07-08 V. B. Kiran Kumar , M. N. N. Namboodiri , S. Serra-Capizzano

Let $\mathrm{R}$ be a real closed field and $\mathrm{C}$ the algebraic closure of $\mathrm{R}$. We give an algorithm for computing a semi-algebraic basis for the first homology group, $\mathrm{H}_1(S,\mathbb{F})$, with coefficients in a…

Algebraic Geometry · Mathematics 2021-07-20 Saugata Basu , Sarah Percival

In this paper, we investigate the power of nearly purely operational techniques in the study of umbral calculus. We present a concise reconstruction of the theory based on a systematic use of linear operators, with particular attention to…

Combinatorics · Mathematics 2025-12-05 Kei Beauduin

In numerical linear algebra, considerable effort has been devoted to obtaining faster algorithms for linear systems whose underlying matrices exhibit structural properties. A prominent success story is the method of generalized nested…

Data Structures and Algorithms · Computer Science 2023-10-26 Sally Dong , Gramoz Goranci , Lawrence Li , Sushant Sachdeva , Guanghao Ye

The best method for computing the adjoint matrix of an order $n$ matrix in an arbitrary commutative ring requires $O(n^{\beta+1/3}\log n \log \log n)$ operations, provided the complexity of the algorithm for multiplying two matrices is…

Symbolic Computation · Computer Science 2017-11-28 Alkiviadis Akritas , Gennadi Malaschonok

We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Thomas Cluzeau

Let $A$ be a positive bounded linear operator acting on a complex Hilbert space $\big(\mathcal{H}, \langle \cdot\mid \cdot\rangle \big)$. Let $\omega_A(T)$ and ${\|T\|}_A$ denote the $A$-numerical radius and the $A$-operator seminorm of an…

Functional Analysis · Mathematics 2020-04-20 Kais Feki

Let $A(x)=A\_0+x\_1A\_1+...+x\_nA\_n$ be a linear matrix, or pencil, generated by given symmetric matrices $A\_0,A\_1,...,A\_n$ of size $m$ with rational entries. The set of real vectors x such that the pencil is positive semidefinite is a…

Optimization and Control · Mathematics 2016-09-20 Didier Henrion , Simone Naldi , Mohab Safey El Din

We give an algorithm for reversion of formal power series, based on an efficient way to implement the Lagrange inversion formula. Our algorithm requires $O(n^{1/2}(M(n) + MM(n^{1/2})))$ operations where $M(n)$ and $MM(n)$ are the costs of…

Symbolic Computation · Computer Science 2013-12-03 Fredrik Johansson

In this paper we obtain necessary and sufficient conditions for a linear bounded operator in a Hilbert space $H$ to have a three-diagonal complex symmetric matrix with non-zero elements on the first sub-diagonal in an orthonormal basis in…

Functional Analysis · Mathematics 2011-02-17 Sergey M. Zagorodnyuk

Let $A$ be a positive operator on a complex Hilbert space $\mathcal{H}.$ We present inequalities concerning upper and lower bounds for $A$-numerical radius of operators, which improve on and generalize the existing ones, studied recently in…

Functional Analysis · Mathematics 2024-08-13 Pintu Bhunia , Kallol Paul , Raj Kumar Nayak

Let $A$ be a, not necessarily closed, linear relation in a Hilbert space $\sH$ with a multivalued part $\mul A$. An operator $B$ in $\sH$ with $\ran B\perp\mul A^{**}$ is said to be an operator part of $A$ when $A=B \hplus (\{0\}\times \mul…

Functional Analysis · Mathematics 2009-07-01 S. Hassi , H. S. V. de Snoo , F. H. Szafraniec

We consider the problem of reconstructing a rank-$k$ $n \times n$ matrix $M$ from a sampling of its entries. Under a certain incoherence assumption on $M$ and for the case when both the rank and the condition number of $M$ are bounded, it…

Machine Learning · Statistics 2017-08-23 David Gamarnik , Quan Li , Hongyi Zhang
‹ Prev 1 4 5 6 7 8 10 Next ›