|
|
|
Mohammad W. Alomari and Christophe Chesneau
In this work, some new inequalities for the numerical radius of block n-by-n matrices are presented. As an application, the bounding of zeros of polynomials using the Frobenius companion matrix partitioned by the Cartesian decomposition method is proved....
ver más
|
|
|
|
|
|
|
Mitja ?trakl, Matja? Hriber?ek, Jana Wedel, Paul Steinmann and Jure Ravnik
In this paper, forces and torques on solid, non-spherical, orthotropic particles in Stokes flow are investigated by using a numerical approach on the basis of the Boundary Element Method. Different flow patterns around a particle are considered, taking i...
ver más
|
|
|
|
|
|
|
Tiffany Fan, David I. Shuman, Shashanka Ubaru and Yousef Saad
We propose and investigate two new methods to approximate ??(??)??
f
(
A
)
b
for large, sparse, Hermitian matrices ??
A
. Computations of this form play an important role in numerous signal processing and machine learning tasks. The main idea behind bot...
ver más
|
|
|
|
|
|
|
Hristo N. Djidjev, Georg Hahn, Susan M. Mniszewski, Christian F. A. Negre and Anders M. N. Niklasson
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several advanced algorithm...
ver más
|
|
|
|
|
|
|
Kunal Banerjee,Evangelos Georganas,Dhiraj D. Kalamkar,Barukh Ziv,Eden Segal,Cristina Anderson,Alexander Heinecke
Pág. 64 - 85
Recurrent neural network (RNN) models have been found to be well suited for processing temporal data. In this work, we present an optimized implementation of vanilla RNN cell and its two popular variants: LSTM and GRU for Intel Xeon architecture. Typical...
ver más
|
|
|
|
|
|
|
????????? ???????? ?????
Pág. 5 - 14
The subject matter of the study is the encryption of information in cloud data computation and storage. Cloud technologies enable reducing the cost of IT infrastructure significantly and responding to changes in computing needs flexibly. In this case, th...
ver más
|
|
|
|
|
|
|
Hua Zhou, Jiao Feng, Peng Li and Jingming Xia
The codewords of a low-density parity-check (LDPC) convolutional code (LDPC-CC) are characterised into structured and non-structured. The number of the structured codewords is dominated by the size of the polynomial syndrome former matrix ????(??)
H
T
(
...
ver más
|
|
|
|
|
|
|
Lyonell Boulton; Peter Lancaster; Panayiotis Psarrakos
Pág. 313 - 334
|
|
|
|
|
|
|
|
E. Defez, A. Hervás, L. Jódar and A. Law
Pág. Pages 117-
|
|
|
|