This paper presents hourglass matrix, a dense square matrix which is obtained from Quadrant Interlocking Factorization (QIF) of nonsingular matrix. We discuss the condition to generate its nonzero entries and formulate its total number of zero and nonzero entries. Furthermore, the determinant of even and odd order of the matrix as well as the eigenvalue of the odd order of the matrix are examined. In all, we give some deductions to differentiate between hourglass matrix and classical Z-matrix.
REFERENCES
1.
C.
Demeure
, IEEE T. Acoust. Speech
37
, 1601
–1603
(1989
).2.
G.
Heinig
and K.
Rost
. “Fast “split” algorithms for Toeplitz and Toeplitz-plus-Hankel matrices with arbitrary rank profile
” in Proceedings of the International Conference on Mathematics and its Applications (ICMA 2004)
, pp 285
–312
.3.
D.
Evans
and M.
Hatzopoulos
, Inter. Jour. Comput. Math.
7
, 227
–238
(1979
).4.
5.
G.
Heinig
and K.
Rost
, Linear Algebra Appl.
435
, 1
–59
(2011
).6.
D.
Evans
and M.
Barulli
, Parallel Comput.
24
, 777
–795
(1998
).7.
8.
9.
J.
Bylina
and B.
Bylina
. “Parallelizing nested loops on the Intel Xeon Phi on the example of the dense WZ factorization
” in Federated Conference on Computer Science and Information Systems (FedCSIS IEEE 2016)
, PP.655
–664
.10.
T.
Tanahashi
and Y.
Oki
, JSME Inter. Jour. Series B.
39
, 28
–35
(1996
).11.
L.
Li
, Y.
Peng
, and D.
Li
, Finite Elem. Anal. Des.
47
, 511
–518
(2011
).12.
C.
McGann
, P.
Arduino
, and P.
Mackenzie-Helnwein
, Acta Geotech.
7
, 297
–311
(2012
).13.
M.
Warburton
and S.
Maddock
, Comput. Animat. Virt. W.
26
, 55
–68
(2015
).14.
A.
Mills
, S.
Day
, and S.
Parkes
, Mechanics of the sandglass.
European Jour. Phys.
17
, 97
–109
(1996
).15.
M.
Levin
and D.
Evans
, The inversion of matrices by the double-bordering algorithm on MIMD computers.
Parallel comput.
17
, 591
–602
(1991
).16.
B.
Bylina
and J.
Bylina
, Annals of Computer Science and Information Systems
. 5
, 629
–639
(2015
).17.
18.
G.
Heinig
and K.
Rost
, Theor. Comput. Sci.
315
, 453
–468
(2004
).
This content is only available via PDF.
© 2018 Author(s).
2018
Author(s)
You do not currently have access to this content.
