共查询到20条相似文献,搜索用时 158 毫秒
1.
Generalizing the result in Lemma of Baksalary and Baksalary [J.K. Baksalary, O.M. Baksalary, Commutativity of projectors, Linear Algebra Appl. 341 (2002) 129-142], Baksalary et al. [J.K. Baksalary, O.M. Baksalary, T. Szulc, Linear Algebra Appl. 354 (2002) 35-39] have shown that if P1 and P2 are orthogonal projectors, then, in all nontrivial situations, a product of any length having P1 and P2 as its factors occurring alternately is equal to another such product if and only if P1 and P2 commute, in which case all products involving P1 and P2 reduce to the orthogonal projector P1P2 (= P2P1). In the present paper, further generalizations of this property are established. They consist in replacing a product of the type specified above, appearing on the left-hand side (say) of the equality under considerations, by an affine combination of two or three such products. Comments on the problem when the number of components in a combination exceeds three are also given. 相似文献
2.
Particular formulae for the Moore-Penrose inverse of a columnwise partitioned matrix 总被引:1,自引:0,他引:1
An essential part of Cegielski’s [Obtuse cones and Gram matrices with non-negative inverse, Linear Algebra Appl. 335 (2001) 167-181] considerations of some properties of Gram matrices with nonnegative inverses, which are pointed out to be crucial in constructing obtuse cones, consists in developing some particular formulae for the Moore-Penrose inverse of a columnwise partitioned matrix A = (A1 : A2) under the assumption that it is of full column rank. In the present paper, these results are generalized and extended. The generalization consists in weakening the assumption mentioned above to the requirement that the ranges of A1 and A2 are disjoint, while the extension consists in introducing the conditions referring to the class of all generalized inverses of A. 相似文献
3.
In their paper [Y. Tian, G.P.H. Styan, Rank equalities for idempotent and involutory matrices. Linear Algebra Appl. 335 (2001) 101-117], Tian and Styan established several rank equalities involving a pair of idempotent matrices P and Q. Subsequently, these results are reinvestigated from the point of view of the following question: provided that idempotent P, Q are Hermitian, which relationships given in the aforementioned paper remain valid when ranks are replaced with column spaces? Simultaneously, some related results are established, which shed additional light on the links between subspaces attributed to various functions of a pair of orthogonal projectors. 相似文献
4.
Baksalary and Baksalary [J.K. Baksalary, O.M. Baksalary, Nonsingularity of linear combinations of idempotent matrices, Linear Algebra Appl. 388 (2004) 25-29] proved that the nonsingularity of P1 + P2, where P1 and P2 are idempotent matrices, is equivalent to the nonsingularity of any linear combinations c1P1 + c2P2, where c1, c2 ≠ 0 and c1 + c2 ≠ 0. In the present note this result is strengthened by showing that the nullity and rank of c1P1 + c2P2 are constant. Furthermore, a simple proof of the rank formula of Groß and Trenkler [J. Groß, G. Trenkler, Nonsingularity of the difference of two oblique projectors, SIAM J. Matrix Anal. Appl. 21 (1999) 390-395] is obtained. 相似文献
5.
Let F be a field with ∣F∣ > 2 and Tn(F) be the set of all n × n upper triangular matrices, where n ? 2. Let k ? 2 be a given integer. A k-tuple of matrices A1, …, Ak ∈ Tn(F) is called rank reverse permutable if rank(A1 A2 ? Ak) = rank(Ak Ak−1 ? A1). We characterize the linear maps on Tn(F) that strongly preserve the set of rank reverse permutable matrix k-tuples. 相似文献
6.
For a given matrix A, a matrix P such that PA = A is said to be a local identity, and such that P2A = PA is said to be a local idempotent. In the paper, some simple properties of such operators are presented. Their relation to the best linear unbiased estimation in the general Gauss-Markov model is also demonstrated. 相似文献
7.
8.
Polynomials in two variables, evaluated at A and with A being a square complex matrix and being its transform belonging to the set {A=, A†, A∗}, in which A=, A†, and A∗ denote, respectively, any reflexive generalized inverse, the Moore-Penrose inverse, and the conjugate transpose of A, are considered. An essential role, in characterizing when such polynomials are satisfied by two matrices linked as above, is played by the condition that the column space of A is the column space of . The results given unify a number of prior, isolated results. 相似文献
9.
Idempotency of linear combinations of three idempotent matrices, two of which are commuting 总被引:1,自引:0,他引:1
The considerations of the present paper were inspired by Baksalary [O.M. Baksalary, Idempotency of linear combinations of three idempotent matrices, two of which are disjoint, Linear Algebra Appl. 388 (2004) 67-78] who characterized all situations in which a linear combination P=c1P1+c2P2+c3P3, with ci, i=1,2,3, being nonzero complex scalars and Pi, i=1,2,3, being nonzero complex idempotent matrices such that two of them, P1 and P2 say, are disjoint, i.e., satisfy condition P1P2=0=P2P1, is an idempotent matrix. In the present paper, by utilizing different formalism than the one used by Baksalary, the results given in the above mentioned paper are generalized by weakening the assumption expressing the disjointness of P1 and P2 to the commutativity condition P1P2=P2P1. 相似文献
10.
A particular version of the singular value decomposition is exploited for an extensive analysis of two orthogonal projectors, namely FF† and F†F, determined by a complex square matrix F and its Moore-Penrose inverse F†. Various functions of the projectors are considered from the point of view of their nonsingularity, idempotency, nilpotency, or their relation to the known classes of matrices, such as EP, bi-EP, GP, DR, or SR. This part of the paper was inspired by Benítez and Rako?evi? [J. Benítez, V. Rako?evi?, Matrices A such that AA† − A†A are nonsingular, Appl. Math. Comput. 217 (2010) 3493-3503]. Further characteristics of FF† and F†F, with a particular attention paid on the results dealing with column and null spaces of the functions and their eigenvalues, are derived as well. Besides establishing selected exemplary results dealing with FF† and F†F, the paper develops a general approach whose applicability extends far beyond the characteristics provided therein. 相似文献
11.
Michal Aharon Michael Elad Alfred M. Bruckstein 《Linear algebra and its applications》2006,416(1):48-67
A full-rank under-determined linear system of equations Ax = b has in general infinitely many possible solutions. In recent years there is a growing interest in the sparsest solution of this equation—the one with the fewest non-zero entries, measured by ∥x∥0. Such solutions find applications in signal and image processing, where the topic is typically referred to as “sparse representation”. Considering the columns of A as atoms of a dictionary, it is assumed that a given signal b is a linear composition of few such atoms. Recent work established that if the desired solution x is sparse enough, uniqueness of such a result is guaranteed. Also, pursuit algorithms, approximation solvers for the above problem, are guaranteed to succeed in finding this solution.Armed with these recent results, the problem can be reversed, and formed as an implied matrix factorization problem: Given a set of vectors {bi}, known to emerge from such sparse constructions, Axi = bi, with sufficiently sparse representations xi, we seek the matrix A. In this paper we present both theoretical and algorithmic studies of this problem. We establish the uniqueness of the dictionary A, depending on the quantity and nature of the set {bi}, and the sparsity of {xi}. We also describe a recently developed algorithm, the K-SVD, that practically find the matrix A, in a manner similar to the K-Means algorithm. Finally, we demonstrate this algorithm on several stylized applications in image processing. 相似文献
12.
Oleg Gleizer 《Advances in Mathematics》2003,178(2):311-374
In this paper we construct three infinite series and two extra triples (E8 and ) of complex matrices B, C, and A=B+C of special spectral types associated to Simpson's classification in Amer. Math. Soc. Proc. 1 (1992) 157 and Magyar et al. classification in Adv. Math. 141 (1999) 97. This enables us to construct Fuchsian systems of differential equations which generalize the hypergeometric equation of Gauss-Riemann. In a sense, they are the closest relatives of the famous equation, because their triples of spectral flags have finitely many orbits for the diagonal action of the general linear group in the space of solutions. In all the cases except for E8, we also explicitly construct scalar products such that A, B, and C are self-adjoint with respect to them. In the context of Fuchsian systems, these scalar products become monodromy invariant complex symmetric bilinear forms in the spaces of solutions.When the eigenvalues of A, B, and C are real, the matrices and the scalar products become real as well. We find inequalities on the eigenvalues of A, B, and C which make the scalar products positive-definite.As proved by Klyachko, spectra of three hermitian (or real symmetric) matrices B, C, and A=B+C form a polyhedral convex cone in the space of triple spectra. He also gave a recursive algorithm to generate inequalities describing the cone. The inequalities we obtain describe non-recursively some faces of the Klyachko cone. 相似文献
13.
Given complex-valued matrices A, B and C of appropriate dimensions, this paper investigates certain invariance properties of the product AXC with respect to the choice of X, where X is a generalized inverse of B. Different types of generalized inverses are taken into account. The purpose of the paper is three-fold: First, to review known results scattered in the literature, second, to demonstrate the connection between invariance properties and the concept of extremal ranks of matrices, and third, to add new results related to the topic. 相似文献
14.
We study a new mixed finite element of lowest order for general quadrilateral grids which gives optimal order error in the H(div)-norm. This new element is designed so that the H(div)-projection Πh satisfies ∇ · Πh = Phdiv. A rigorous optimal order error estimate is carried out by proving a modified version of the Bramble-Hilbert lemma for vector variables. We show that a local H(div)-projection reproducing certain polynomials suffices to yield an optimal L2-error estimate for the velocity and hence our approach also provides an improved error estimate for original Raviart-Thomas element of lowest order. Numerical experiments are presented to verify our theory. 相似文献
15.
Let A be an n×n matrix with eigenvalues λ1,λ2,…,λn, and let m be an integer satisfying rank(A)?m?n. If A is real, the best possible lower bound for its spectral radius in terms of m, trA and trA2 is obtained. If A is any complex matrix, two lower bounds for are compared, and furthermore a new lower bound for the spectral radius is given only in terms of trA,trA2,‖A‖,‖A∗A-AA∗‖,n and m. 相似文献
16.
S.W. Drury 《Linear algebra and its applications》2007,422(1):318-325
We establish the following case of the Determinantal Conjecture of Marcus [M. Marcus, Derivations, Plücker relations and the numerical range, Indiana Univ. Math. J. 22 (1973) 1137-1149] and de Oliveira [G.N. de Oliveira, Research problem: Normal matrices, Linear and Multilinear Algebra 12 (1982) 153-154]. Let A and B be unitary n × n matrices with prescribed eigenvalues a1, … , an and b1, … , bn, respectively. Then for any scalars t and s
17.
18.
This paper develops a gradient based and a least squares based iterative algorithms for solving matrix equation AXB + CXTD = F. The basic idea is to decompose the matrix equation (system) under consideration into two subsystems by applying the hierarchical identification principle and to derive the iterative algorithms by extending the iterative methods for solving Ax = b and AXB = F. The analysis shows that when the matrix equation has a unique solution (under the sense of least squares), the iterative solution converges to the exact solution for any initial values. A numerical example verifies the proposed theorems. 相似文献
19.
Let A be a d × d expansive matrix with ∣detA∣ = 2. This paper addresses Parseval frame wavelets (PFWs) in the setting of reducing subspaces of L2(Rd). We prove that all semi-orthogonal PFWs (semi-orthogonal MRA PFWs) are precisely the ones with their dimension functions being non-negative integer-valued (0 or 1). We also characterize all MRA PFWs. Some examples are provided. 相似文献
20.
Hong You 《Linear algebra and its applications》2007,426(1):238-254
Let Mn be the space of all n × n complex matrices, and let Γn be the subset of Mn consisting of all n × n k-potent matrices. We denote by Ψn the set of all maps on Mn satisfying A − λB ∈ Γn if and only if ?(A) − λ?(B) ∈ Γn for every A,B ∈ Mn and λ ∈ C. It was shown that ? ∈ Ψn if and only if there exist an invertible matrix P ∈ Mn and c ∈ C with ck−1 = 1 such that either ?(A) = cPAP−1 for every A ∈ Mn, or ?(A) = cPATP−1 for every A ∈ Mn. 相似文献