In this paper a multistage iterative method for solving the symmetric positive definite linear systems is established and the convergence of the method is proved. A numerical example is given to illustrate the effectiveness of our method. The method is especially suitable for parallel computation, and can be viewed as a extension of the classical iterative method or as a preconditioner for the conjugate gradien...
We present an idea for computing complex square roots of matrices using only real arithmetic.
A series of steel fibre reinforced self-consolidating concrete (SFRSCC) beams have been tested to investigate the influence of steel fibres and the combined effect of fibres and stirrups on the deflection and cracking, ultimate loads and failure pattern. The experiment indicates that the shear strength increases clearly with the increasing of fibre content. The combination of steel fibres and stirrups demonstra...
For the problem of which Jordan forms are possible for n × n complex matrices A, B and C, when A = BC, geometric multiplicity restrictions are given for the eigenvalues of the three matrices. Together with the obvious determinantal condition on the eigenvalues, these necessary conditions are shown to be sufficient for the problem when n < 4, but not for n ≥ 4. Some basic observations about the problem are given...
The contribution in this paper is two-folded. First, a complete characterization is given of the square roots of a real nonsingular skew-Hamiltonian matrix W. Using the known fact that every real skew-Hamiltonian matrix has infinitely many real Hamiltonian square roots, such square roots are described. Second, a structure-exploiting method is proposed for computing square roots of W, skew-Hamiltonian and Hamilt...
It is known that a nonsingular, nonscalar, n-by-n complex matrix A may be factored as A = BC, in which the spectra of B and C are arbitrary, subject to det(A) = det(B)det(C). It has been shown that when two matrices have eigenvalues of high geometric multiplicity, this restricts the possible Jordan structure of the third. We demonstrate a previously unknown restriction on the Jordan structures of B and C. Furth...
We propose an algorithm for solving the inverse eigenvalue problem for real symmetric block Toeplitz matrices with symmetric Toeplitz blocks. It is based upon an algorithm which has been used before by others to solve the inverse eigenvalue problem for general real symmetric matrices and also for Toeplitz matrices. First we expose the structure of the eigenvectors of the so-called generalized centrosymmetric ma...
Given are tight upper and lower bounds for the minimum rank among all matrices with a prescribed zero-nonzero pattern. The upper bound is based upon solving for a matrix with a given null space and, with optimal choices, produces the correct minimum rank. It leads to simple, but often accurate, bounds based upon overt statistics of the pattern. The lower bound is also conceptually simple. Often, the lower and a...
We consider a key case in the fundamental and substantial prob- lem of the possible Jordan canonical forms of A;B;C \in Mn(F) when C = AB. If A \in M2k(F) (respectively B;C \in M2k(F) ) is diagonalizable with two distinct eigenvalues a1; a2 (respectively b1; b2, and c1; c2), each with multiplicity k, and when C = AB, all possibilities for a1; a2; b1; b2; c1; c2 are characterized. The possibilities are much more...
In this paper we concern the reconstruction of an hermitian Toeplitz matrices with prescribed eigenpairs. Based on the fact that every centrohermitian matrix can be re- duced to a real matrix by a simple similarity transformation, we rst consider the eigenstructure of hermitian Toeplitz matrices and then discuss a related reconstruction problem. We show that the di- mension of the subspace of hermitian Toeplit...
Financiadores do RCAAP | |||||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |