Results 21 to 30 of about 629 (50)
EXPLICIT MINIMUM POLYNOMIAL, EIGENVECTOR, AND INVERSE FORMULA FOR NONSYMMETRIC ARROWHEAD MATRIX
, 2016 In this paper, we treat the eigenvalue problem for a nonsymmetric arrowhead matrix which is the general form of a symmetric arrowhead matrix. The purpose of this paper is to present explicit formula of determinant, inverse, minimum polynomial, and ...
W. Wanicharpichat
semanticscholar +1 more source
Permanents, determinants, and generalized complementary basic matrices
, 2014 This paper answers the questions posed in the article “A note on permanents and generalized complementary basic matrices”, Linear Algebra Appl. 436 (2012), by M. Fiedler and F. Hall.
M. Fiedler +2 more
semanticscholar +1 more source
On the convergence of Aluthge sequence
, 2007 For 0 < λ < 1 , the λ -Aluthge sequence {Δλ (X)}m∈N converges if the nonzero eigenvalues of X ∈ Cn×n have distinct moduli, where Δλ (X) := PλUP1−λ if X = UP is a polar decomposition of X . Mathematics subject classification (2000): 15A23, 15A45.
Huajun Huang, T. Tam
semanticscholar +1 more source
Coordinate indexing: On the use of Eulerian and Lagrangian Laplace stretches
Applications in Engineering Science, 2021 Eulerian and Lagrangian measures for Laplace stretch are established, along with a strategy to ensure that these measures are indifferent to observer.
Sandipan Paul +2 more
doaj
Rank reduction and bordered inversion
, 2001 We clarify the connection between the rank reduction algorithm and the bordered inversion method and their related sequences. Mathematical Subject Classification: 15A09, 15A21, 15A23, 65F30, 65F99.
A. Galántai
semanticscholar +1 more source
Square Roots of Real 3 × 3 Matrices vs. Quartic Polynomials with Real Zeros
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2017 There is an interesting analogy between the description of the real square roots of 3×3 matrices and the zeros of the (depressed) real quartic polynomials.
Anghel Nicolae
doaj +1 more source
Asymptotic behavior of Gelfand-Naimark decomposition
, 2009 Let X = LσU be the Gelfand-Naimark decomposition of X ∈ GLn(C) , where L is unit lower triangular, σ is a permutation matrix, and U is upper triangular. Call u(X) := diagU the u -component of X .
Huajun Huang
semanticscholar +1 more source
The semigroup generated by the similarity class of a singular matrix
, 2011 Let A be a singular matrix of M_n(K), where K is an arbitrary field. Using canonical forms, we give a new proof that the sub-semigroup of (M_n(K),x) generated by the similarity class of A is the set of matrices of M_n(K) with a rank lesser than or equal ...
Pazzis, Clément de Seguins
core +1 more source
A note on Iwasawa-type decomposition
, 2010 We study the Iwasawa-type decomposition of an open subset of SL(n,C) as SU(p,q)AN. We show that the dressing action of SU(p,q) is globally defined on the space of admissible elements in AN.
Foth, Philip
core +2 more sources
Componentwise perturbation bounds for the LU, LDU and LDT -T decompositions
, 2000 We improve a componentwise perturbation bound of Sun for the LU factorization and derive a new perturbation bound for the LDU factorization. The latter bound also improves a result of Sun given for the LDL factorization.
A. Galántai
semanticscholar +1 more source