Optimizing correlation between sets of variables is an important task in many areas of applications. The stationary points where the optimal correlation occurs are exactly the solutions to the multivariate eigenvalue problem (MEP). For decades, the Horst algorithm which later was recognized as an aggregated Jacobi-type power method has been regarded as an effective numerical scheme for tackling...

We consider a connected threshold graph G with A, S as its adjacency matrix and Seidel respectively. In this paper several spectral properties of are analysed. compute the characteristic polynomial determinant S. A formula for multiplicity eigenvalues $$\pm 1$$ characterisation graphs at most five distinct derived. Finally it is shown that two non isomorphic may be cospectral

When n is even, orthogonal spreads in an orthogonal vector space of type O-(2n 2,2) are used to construct line-sets of size (2nm1 + 1)2”-’ in W2”~’ all of whose angles are 90” or cos -1(2-(“-2)/2). These line-sets are then used to obtain quatemionic Kerdock Codes. These constructions are based on ideas used by Calderbank, Cameron, Kantor, and Seidel in real and complex spaces.

We consider the Seidel complementation on ($P_5, \bar{P_5}, Bull)$-free graphs

We consider the number of different ways to divide a rectangle containing n noncorectilinear points into smaller rectangles by n non-intersecting axis-parallel segments, such that every point is on a segment. Using a novel counting technique of Santos and Seidel [12], we show an upper bound of O(20/n) on this number.

Fluid simulation has been an active research field in computer graphics for the last 30 years. Stam’s stable fluids method, among others, is used for solving equations that govern fluids. This method solves a sparse linear system during the diffusion and move steps, using either relaxation methods (Jacobi, Gauss-Seidel, etc), Conjugate Gradient (and its variants), or others (not subject of stud...