Results 51 to 60 of about 543,835 (181)
Lossy Compression using Adaptive Polynomial Image Encoding
Advances in Electrical and Computer Engineering, 2021 In this paper, an efficient lossy compression approach using adaptive-block polynomial curve-fitting encoding is proposed. The main idea of polynomial curve fitting is to reduce the number of data elements in an image block to a few coefficients.
OTHMAN, S. +3 more
doaj +1 more source
Polynomial computation of Hankel singular values [PDF]
, 1992 A revised and improved version of a polynomial algorithm is presented. It was published by N.J. Young (1990) for the computation of the singular values and vectors of the Hankel operator defined by a linear time-invariant system with a rotational ...
Kwakernaak, Huibert
core +1 more source
Integral closure of rings of integer-valued polynomials on algebras
, 2014 Let $D$ be an integrally closed domain with quotient field $K$. Let $A$ be a torsion-free $D$-algebra that is finitely generated as a $D$-module. For every $a$ in $A$ we consider its minimal polynomial $\mu_a(X)\in D[X]$, i.e.
G. Peruginelli +10 more
core +1 more source
Kronecker product of matrices and solutions of Sylvestertype matrix polynomial equations
Математичні СтудіїWe investigate the solutions of the Sylvester-type matrix polynomial equation $$A(\lambda)X(\lambda)+Y(\lambda)B(\lambda)=C(\lambda),$$ where\ $A(\lambda),$ \ $ B(\lambda),$\ and \ $C(\lambda)$ are the polynomial matrices with elements in a ring of ...
N. S. Dzhaliuk, V. M. Petrychkovych
doaj +1 more source
ON CAUCHY-TYPE BOUNDS FOR THE EIGENVALUES OF A SPECIAL CLASS OF MATRIX POLYNOMIALS
Ural Mathematical Journal, 2023 Let \(\mathbb{C}^{m\times m}\) be the set of all \(m\times m\) matrices whose entries are in \(\mathbb{C},\) the set of complex numbers. Then \(P(z):=\sum\limits_{j=0}^nA_jz^j,\) \(A_j\in \mathbb{C}^{m\times m},\) \(0\leq j\leq n\) is called a matrix ...
Zahid Bashir Monga, Wali Mohammad Shah
doaj +1 more source
On Polynomial and Polynomial Matrix Interpolation [PDF]
, 2002 The classical algorithms for computations with polynomials and polynomial matrices use elementary operations with their coefficients. The relative accuracy of such algorithms is relatively small and for polynomials of higher order and polynomial matrices of higher dimension the executing time grows very quickly.
Petr Hušek, Renata Pytelková
openaire +1 more source
The q-Laguerre matrix polynomials [PDF]
SpringerPlus, 2016 The Laguerre polynomials have been extended to Laguerre matrix polynomials by means of studying certain second-order matrix differential equation. In this paper, certain second-order matrix q-difference equation is investigated and solved. Its solution gives a generalized of the q-Laguerre polynomials in matrix variable.
openaire +2 more sources
Autocorrelation of Random Matrix Polynomials [PDF]
Communications in Mathematical Physics, 2003 We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in three equivalent forms: as a determinant sum (and hence in terms of symmetric polynomials), as a combinatorial sum,
Conrey, JB +4 more
openaire +4 more sources
Matrix polynomials: Factorization via bisolvents
Linear Algebra and its Applications, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cohen, Nir, Pereira, Edgar
openaire +1 more source
The Dynamics of 1D Quantum Spin Systems Can Be Approximated Efficiently
, 2005 In this Letter we show that an arbitrarily good approximation to the propagator e^{itH} for a 1D lattice of n quantum spins with hamiltonian H may be obtained with polynomial computational resources in n and the error \epsilon, and exponential resources ...
M. A. Nielsen, Tobias J. Osborne
core +1 more source