Isospectral flows on a class of finite-dimensional Jacobi matrices
, 2012 We present a new matrix-valued isospectral ordinary differential equation that asymptotically block-diagonalizes $n\times n$ zero-diagonal Jacobi matrices employed as its initial condition. This o.d.e.\ features a right-hand side with a nested commutator
Chatterjee, Debasish +3 more
core +2 more sources
On the Properties of the Power Systems Nodal Admittance Matrix
, 2017 This letter provides conditions determining the rank of the nodal admittance matrix, and arbitrary block partitions of it, for connected AC power networks with complex admittances.
Kettner, Andreas Martin, Paolone, Mario
core +1 more source
Very Large-Scale Singular Value Decomposition Using Tensor Train Networks [PDF]
, 2014 We propose new algorithms for singular value decomposition (SVD) of very large-scale matrices based on a low-rank tensor approximation technique called the tensor train (TT) format. The proposed algorithms can compute several dominant singular values and
Cichocki, Andrzej, Lee, Namgil
core +1 more source
Block ILU factorization preconditioners for a block-tridiagonal H-matrix
Linear Algebra and its Applications, 2000 The authors propose three new block incomplete LU (BILU) factorizations for a block-tridiagonal \(H\)-matrix readily parallelizable. The construction of BILU factors is based on the element-wise LU \(\text{ILU}(k)\) factorization (incomplete LU factorization of level \(k\) of fill-in) of diagonal blocks, \(B_i=L_iU_i-R_i\).
Kim, Sang Wook, Yun, Jae Heon
openaire +2 more sources
Cross-social-network user alignment research based on multi-dimensional user features
Systems Science & Control EngineeringAccurately aligning the same users on different flat social networks to merge user information and create more nuanced user profiles is critical. However, the current research in this area faces challenges related to low efficiency and inadequate ...
Tao Zhao +4 more
doaj +1 more source
Deep Subspace Clustering with Block Diagonal Constraint
Applied Sciences, 2020 The deep subspace clustering method, which adopts deep neural networks to learn a representation matrix for subspace clustering, has shown good performance.
Jing Liu, Yanfeng Sun, Yongli Hu
doaj +1 more source
Supercurrent Interactions in Noncommutative Yang-Mills and IIB Matrix Model [PDF]
, 2000 It is known that noncommutative Yang-Mills is equivalent to IIB matrix model with a noncommutative background, which is interpreted as a twisted reduced model.
Ambjorn +32 more
core +5 more sources
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
Polyphase networks, block digital filtering, LPTV systems, and alias-free QMF banks: a unified approach based on pseudocirculants [PDF]
, 1988 The relationship between block digital filtering and quadrature mirror filter (QMF) banks is explored. Necessary and sufficient conditions for alias cancellation in QMF banks are expressed in terms of an associated matrix, derived from the polyphase ...
Mitra, Sanjit K., Vaidyanathan, P. P.
core +1 more source
A preconditioned fast collocation method for a linear bond-based peridynamic model
Advances in Difference Equations, 2020 We develop a fast collocation method for a static bond-based peridynamic model. Based on the analysis of the structure of the stiffness matrix, a fast matrix-vector multiplication technique was found, which can be used in the Krylov subspace iteration ...
Xuhao Zhang +3 more
doaj +1 more source