共查询到20条相似文献,搜索用时 234 毫秒
1.
2.
3.
A min-max theorem for complex symmetric matrices 总被引:1,自引:0,他引:1
Jeffrey Danciger 《Linear algebra and its applications》2006,412(1):22-29
We optimize the form Re xtTx to obtain the singular values of a complex symmetric matrix T. We prove that for ,
4.
Preservers of spectral radius, numerical radius, or spectral norm of the sum on nonnegative matrices
Chi-Kwong Li 《Linear algebra and its applications》2009,430(7):1739-1398
Let be the set of entrywise nonnegative n×n matrices. Denote by r(A) the spectral radius (Perron root) of . Characterization is obtained for maps such that r(f(A)+f(B))=r(A+B) for all . In particular, it is shown that such a map has the form
5.
The aim of this paper is to establish the convergence of the block iteration methods such as the block successively accelerated over-relaxation method (BAOR) and the symmetric block successively accelerated over-relaxation method (BSAOR): Let be a weak block H-matrix to partition π, then for ,
6.
Aljoša Peperko 《Linear algebra and its applications》2008,428(10):2312-2318
Let Ψ be a bounded set of n×n non-negative matrices. Recently, the max algebra version μ(Ψ) of the generalized spectral radius of Ψ was introduced. We show that
7.
Aljoša Peperko 《Linear algebra and its applications》2011,435(4):902-907
Given a bounded set Ψ of n×n non-negative matrices, let ρ(Ψ) and μ(Ψ) denote the generalized spectral radius of Ψ and its max version, respectively. We show that
8.
Let (P,?,∧) be a locally finite meet semilattice. Let
9.
10.
We find lower bounds on the difference between the spectral radius λ1 and the average degree of an irregular graph G of order n and size e. In particular, we show that, if n ? 4, then
11.
Dongmei Zhu 《Linear algebra and its applications》2010,432(11):2764-2772
In this paper, we obtain the following upper bound for the largest Laplacian graph eigenvalue λ(G):
12.
This paper is concerned with solving linear system (In+BL?B2B1)x=b arising from the Green’s function calculation in the quantum Monte Carlo simulation of interacting electrons. The order of the system and integer L are adjustable. Also adjustable is the conditioning of the coefficient matrix to give rise an extreme ill-conditioned system. Two numerical methods based on the QR decomposition with column pivoting and the singular value decomposition, respectively, are studied in this paper. It is proved that the computed solution by each of the methods is weakly backward stable in the sense that the computed is close to the exact solution of a nearby linear system
13.
The higher Randi? index Rt(G) of a simple graph G is defined as
14.
The purpose of this paper is to discuss the estimation of eigenvalues and the smallest singular value of matrices. Firstly, we prove that all the eigenvalues of arbitrarily complex matrix are located in one closed disk around of radius
15.
Marek Niezgoda 《Linear algebra and its applications》2010,433(1):136-640
Let a,b>0 and let Z∈Mn(R) such that Z lies into the operator ball of diameter [aI,bI]. Then for all positive definite A∈Mn(R),
16.
17.
Let V be a vector space over a field or skew field F, and let U be its subspace. We study the canonical form problem for bilinear or sesquilinear forms
18.
Koenraad M.R. Audenaert 《Linear algebra and its applications》2006,413(1):155-176
Let A be a positive semidefinite matrix, block partitioned as
19.
For any given n-by-n matrix A, a specific circulant preconditioner tF(A) introduced by Tyrtyshnikov [E. Tyrtyshnikov, Optimal and super-optimal circulant preconditioners, SIAM J. Matrix Anal. Appl. 13 (1992) 459-473] is defined to be the solution of
20.
M.I. Gil’ 《Linear algebra and its applications》2008,428(4):814-823
The paper deals with an entire matrix-valued function of a complex argument (an entire matrix pencil) f of order ρ(f)<∞. Identities for the following sums of the characteristic values of f are established: