The class of quasiseparable matrices is defined by the property that any submatrix entirely below or above the main diagonal has small rank, namely below a bound called the order of quasiseparability. These matrices arise naturally in solving PDE’s for particle interaction with the Fast Multi-pole Method (FMM), or computing generalized eigenvalues. From these application fields, structured repr...

in this paper, two new hamilton operators are defined and the algebra of dual split quaternions isdeveloped using these operators. it is shown that finite screw motions in minkowski 3-space can be expressedby dual-number ( 3×3 ) matrices in dual lorentzian space. moreover, by means of hamilton operators, screwmotion is obtained in 3-dimensional minkowski space 3r1

A new and relatively simple version of the quaternion calculus is offered which is especially suitable for applications in molecular symmetry and structure. After introducing the real quaternion algebra and its classical matrix representation in the group SO(4) the relations with vectors in 3-space and the connection with the rotation group SO(3) through automorphism properties of the algebra a...

An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit applications of a particular estimate of this sort to several counting problems in number theory: counting integral points and units of bounded height over ...

We introduce a generalization of the affine moment invariants for color textures recognition using Quaternion Algebra and present results of experiments on a challenging dataset. The advantage of the proposed method is that it can process color image directly, without losing color information. It is shown that the QAMIs can be obtained from the usual AMIs. Experiments show that color texture de...

Linear Algebra and Matrix Theory provide one of the most important tools–sometimes the only tool–in Combinatorics and Graph Theory. Even though the ideas used in applications of linear algebra to combinatorics may be very simple, the results obtained can be very strong and surprising. A famous instance is the GrahamPollak theorem which asserts that if the complete graph of order n is partitione...

A class ξ of algebras of symmetric n × n matrices, related to Toeplitz-plus-Hankel structures and including the well-known algebra H diagonalized by the Hartley transform, is investigated. The algebras of ξ are then exploited in a general displacement decomposition of an arbitrary n× n matrix A. Any algebra of ξ is a 1-space, i.e., it is spanned by n matrices having as first rows the vectors of...

A split quaternion learning algorithm for the training of nonlinear finite impulse response adaptive filters for the processing of three- and four-dimensional signals is proposed. The derivation takes into account the non-commutativity of the quaternion product, an aspect neglected in the derivation of the existing learning algorithms. It is shown that the additional information taken into acco...