Search results for "Diagonal matrix"
showing 9 items of 19 documents
Matrix algebras with degenerate traces and trace identities
2022
In this paper we study matrix algebras with a degenerate trace in the framework of the theory of polynomial identities. The first part is devoted to the study of the algebra $D_n$ of $n \times n$ diagonal matrices. We prove that, in case of a degenerate trace, all its trace identities follow by the commutativity law and by pure trace identities. Moreover we relate the trace identities of $D_{n+1}$ endowed with a degenerate trace, to those of $D_n$ with the corresponding trace. This allows us to determine the generators of the trace T-ideal of $D_3$. In the second part we study commutative subalgebras of $M_k(F)$, denoted by $C_k$ of the type $F + J$ that can be endowed with the so-called st…
Trace identities and almost polynomial growth
2021
In this paper we study algebras with trace and their trace polynomial identities over a field of characteristic 0. We consider two commutative matrix algebras: $D_2$, the algebra of $2\times 2$ diagonal matrices and $C_2$, the algebra of $2 \times 2$ matrices generated by $e_{11}+e_{22}$ and $e_{12}$. We describe all possible traces on these algebras and we study the corresponding trace codimensions. Moreover we characterize the varieties with trace of polynomial growth generated by a finite dimensional algebra. As a consequence, we see that the growth of a variety with trace is either polynomial or exponential.
Qualitative analysis of matrix splitting methods
2001
Abstract Qualitative properties of matrix splitting methods for linear systems with tridiagonal and block tridiagonal Stieltjes-Toeplitz matrices are studied. Two particular splittings, the so-called symmetric tridiagonal splittings and the bidiagonal splittings, are considered, and conditions for qualitative properties like nonnegativity and shape preservation are shown for them. Special attention is paid to their close relation to the well-known splitting techniques like regular and weak regular splitting methods. Extensions to block tridiagonal matrices are given, and their relation to algebraic representations of domain decomposition methods is discussed. The paper is concluded with ill…
Trace Identities on Diagonal Matrix Algebras
2020
Let Dn be the algebra of n × n diagonal matrices. On such an algebra it is possible to define very many trace functions. The purpose of this paper is to present several results concerning trace identities satisfied by this kind of algebras.
Unicity of biproportion
1994
International audience; The biproportion of S on margins of M is called the intern composition law, K: (S,M) -> X = K(S,M) / X = A S B. A and B are diagonal matrices, algorithmically computed, providing the respect of margins of M. Biproportion is an empirical concept. In this paper, the author shows that any algorithm used to compute a biproportion leads to the me result. Then the concept is unique and no longer empirical. Some special properties are also indicated.
Tridiagonality, supersymmetry and non self-adjoint Hamiltonians
2019
In this paper we consider some aspects of tridiagonal, non self-adjoint, Hamiltonians and of their supersymmetric counterparts. In particular, the problem of factorization is discussed, and it is shown how the analysis of the eigenstates of these Hamiltonians produce interesting recursion formulas giving rise to biorthogonal families of vectors. Some examples are proposed, and a connection with bi-squeezed states is analyzed.
On essential spectra of operator-matrices and their Feshbach maps
2004
Abstract A connection between the essential spectrum of certain operator-matrices and essential spectra of the corresponding “Feshbach maps” is discussed and applied to some concrete rational operator-valued functions.
Fast Poisson solvers for graphics processing units
2013
Two block cyclic reduction linear system solvers are considered and implemented using the OpenCL framework. The topics of interest include a simplified scalar cyclic reduction tridiagonal system solver and the impact of increasing the radix-number of the algorithm. Both implementations are tested for the Poisson problem in two and three dimensions, using a Nvidia GTX 580 series GPU and double precision floating-point arithmetic. The numerical results indicate up to 6-fold speed increase in the case of the two-dimensional problems and up to 3- fold speed increase in the case of the three-dimensional problems when compared to equivalent CPU implementations run on a Intel Core i7 quad-core CPU…
IMEX schemes for pricing options under jump–diffusion models
2014
We propose families of IMEX time discretization schemes for the partial integro-differential equation derived for the pricing of options under a jump-diffusion process. The schemes include the families of IMEX-midpoint, IMEX-CNAB and IMEX-BDF2 schemes. Each family is defined by a convex combination parameter [email protected]?[0,1], which divides the zeroth-order term due to the jumps between the implicit and explicit parts in the time discretization. These IMEX schemes lead to tridiagonal systems, which can be solved extremely efficiently. The schemes are studied through Fourier stability analysis and numerical experiments. It is found that, under suitable assumptions and time step restric…