共查询到20条相似文献,搜索用时 453 毫秒
1.
次正定Hermite矩阵次Schur补的性质 总被引:6,自引:3,他引:3
本文研究了次正定Hermite矩阵次Schur补的偏序,并利用这些偏序,得到了次正定Hermite矩阵的一些行列式不等式. 相似文献
2.
郑建青 《纯粹数学与应用数学》2014,(1):45-52
利用复矩阵的Schur补和次正定性,研究了次正定复矩阵的次Schur补的一些性质,得到了次正定复矩阵次Schur补的几个行列式不等式,将相关文献的相应结果由次正定次Hermite矩阵推广到次正定复矩阵. 相似文献
3.
<正> 本文从次Hermite矩阵着手作进一步的讨论,得出一系列类似于Hermite矩阵的性质。定理1 A是m阶次Hermite矩阵,B是n阶次Hermite矩阵,则A×B是mm阶次Hermite矩阵。 相似文献
4.
次Hermite矩阵的对角化及次Hermite矩阵的应用 总被引:1,自引:0,他引:1
循环矩阵在理论及实际问题上都得到了广泛的应用,而循环矩阵是一类典型的次对称矩阵,此外Hadamare 矩阵中也涉及到了次对称矩阵,本文将对次对称矩阵进一步的推广,定义了次Hermite 矩阵及次正定的次Hermite 矩阵.并且讨论它们的对角化方法,得出了类以于Hermite 矩阵的一些结论,最后作为应用,讨论了次Hermite 矩阵的算子范数及F—范数的理论值。关键词次Hermite 矩阵次特征值及次特征向量次正定的次Hermite 矩阵. 相似文献
5.
6.
拟酉矩阵与拟Hermite矩阵 总被引:12,自引:0,他引:12
利用次Hermite矩阵给出了拟酉矩阵与(反)拟Hermite矩阵的概念,研究了它们的基础本性质及其之间的关系,将各类酉矩阵与Hermite矩阵一了起来。 相似文献
7.
广义酉矩阵与广义Hermite矩阵 总被引:22,自引:3,他引:19
给出了广义酉矩阵与广义(斜)Hermite矩阵的概念,研究了它们的性质及其与酉阵、共轭辛阵、Hermite阵、Hamilton及广义逆矩阵之间的联系;取得了许多新的结果;推广了酉矩阵、Hermite阵与斜Hermite阵间的相应结果,特别将正交阵的广义Cayley分解推广到了广义酉矩阵上;将各类酉矩阵、Hermite矩阵及广义逆矩阵统一了起来. 相似文献
8.
9.
Hermite正定对称矩阵迹的一些结果(英文) 总被引:1,自引:0,他引:1
本文研究了一类Hermite正定矩阵迹的不等式问题.利用文献[2-6]中的结果以及放缩法,获得了Hermite正定矩阵迹的极值定理、杨氏不等式和贝努利不等式,并且将许多初等不等式推广到Hermite正定矩阵迹的情形. 相似文献
10.
11.
Richard W. Cottle 《Linear algebra and its applications》1974,8(3):189-211
This expository paper describes the ways in which a matrix theoretic construct called the Schur complement arises. Properties of the Schur complement are shown to have use in computing inertias of matrices, covariance matrices of conditional distributions, and other information of interest. 相似文献
12.
We firstly consider the block dominant degree for I-(II-)block strictly diagonally dominant matrix and their Schur complements, showing that the block dominant degree for the Schur complement of an I-(II-)block strictly diagonally dominant matrix is greater than that of the original grand block matrix. Then, as application, we present some disc theorems and some bounds for the eigenvalues of the Schur complement by the elements of the original matrix. Further, by means of matrix partition and the Schur complement of block matrix, based on the derived disc theorems, we give a kind of iteration called the Schur-based iteration, which can solve large scale linear systems though reducing the order by the Schur complement and the numerical example illustrates that the iteration can compute out the results faster. 相似文献
13.
In this paper we discuss some instances where dense matrix techniques can be utilized within a sparse simplex linear programming solver. The main emphasis is on the use of the Schur complement matrix as a part of the basis matrix representation. This approach enables to represent the basis matrix as an easily invertible sparse matrix and one or more dense Schur complement matrices. We describe our variant of this method which uses updating of the QR factorization of the Schur complement matrix. We also discuss some implementation issues of the LP software package which is based on this approach. 相似文献
14.
In this article, two facts related to the generalized Schur complement are studied. The first one is to find necessary and sufficient conditions to characterize when the group inverse of a partitioned matrix can be expressed in the Schur form. The other one is to develop a formula for any power of the generalized Schur complement of an idempotent partitioned matrix and then to characterize when this generalized Schur complement is a (k+1)-potent matrix. In addition, some spectral theory related to this complement is analyzed. 相似文献
15.
Fuzhen Zhang 《Linear and Multilinear Algebra》2004,52(5):367-373
This article presents a matrix identity on the Schur complement along with various applications. In particular, it gives a simple and transparent proof for the Crabtree-Haynsworth quotient formula for the Schur complement. Although its proof is straightforward, the identity yields a number of important results that appear to be unrelated. 相似文献
16.
Fuzhen Zhang 《Linear and Multilinear Algebra》2013,61(5):367-373
This article presents a matrix identity on the Schur complement along with various applications. In particular, it gives a simple and transparent proof for the Crabtree–Haynsworth quotient formula for the Schur complement. Although its proof is straightforward, the identity yields a number of important results that appear to be unrelated. 相似文献
17.
It is known that the Schur complements of doubly diagonally dominant matrices are doubly diagonally dominant. In this paper, we obtain an estimate for the doubly diagonally dominant degree on the Schur complement of strictly doubly diagonally dominant matrices. Then, as an application we obtain that the eigenvalues of the Schur complements are located in the Brauer Ovals of Cassini of the original matrices under certain conditions. As another application, we obtain an upper bound for the infinity norm on the inverse on the Schur complement of strictly doubly diagonally dominant matrices. Further, based on the derived results, we give a kind of iteration called the Schur-based iteration, which can solve large scale linear systems though reducing the order by the Schur complement and can compute out the results faster. 相似文献
18.
First, a generalization of the Schur determinantal formula is given. Using properties of quasidirect sums of matrices, a new characterization of the Schur complement is proved. 相似文献
19.
We present a non-overlapping spatial domain decomposition method for the solution of linear–quadratic parabolic optimal control problems. The spatial domain is decomposed into non-overlapping subdomains. The original parabolic optimal control problem is decomposed into smaller problems posed on space–time cylinder subdomains with auxiliary state and adjoint variables imposed as Dirichlet boundary conditions on the space–time interface boundary. The subdomain problems are coupled through Robin transmission conditions. This leads to a Schur complement equation in which the unknowns are the auxiliary state adjoint variables on the space-time interface boundary. The Schur complement operator is the sum of space–time subdomain Schur complement operators. The application of these subdomain Schur complement operators is equivalent to the solution of an subdomain parabolic optimal control problem. The subdomain Schur complement operators are shown to be invertible and the application of their inverses is equivalent to the solution of a related subdomain parabolic optimal control problem. We introduce a new family of Neumann–Neumann type preconditioners for the Schur complement system including several different coarse grid corrections. We compare the numerical performance of our preconditioners with an alternative approach recently introduced by Benamou. 相似文献
20.
Jun Zhang 《Journal of Applied Mathematics and Computing》2001,8(2):213-234
We introduce a class of multilevel recursive incomplete LU preconditioning techniques (RILUM) for solving general sparse matrices. This technique is based on a recursive two by two block incomplete LU factorization on the coefficient matrix. The coarse level system is constructed as an (approximate) Schur complement. A dynamic preconditioner is obtained by solving the Schur complement matrix approximately. The novelty of the proposed techniques is to solve the Schur complement matrix by a preconditioned Krylov subspace method. Such a reduction process is repeated to yield a multilevel recursive preconditioner. 相似文献