Results 11 to 20 of about 2,856 (167)
Numerical Range of Moore–Penrose Inverse Matrices
Let A be an n-by-n matrix. The numerical range of A is defined as W ( A ) = { x * A x : x ∈ C n , x * x = 1 } . The Moore–Penrose inverse A + of A is the unique matrix satisfying A A + A = A , A + A A + = A ...
Mao-Ting Chien
doaj +2 more sources
Convexity of the inverse and Moore–Penrose inverse
Based on a re-examination of the convexity results for the inverse of positive definite matrices, and the Moore-Penrose inverse of nonnegative definite matrices, a more general concept of strong convexity is defined which provides additional information on the convexity behaviour and geometry of matrix functions known to be strictly convex.
Nordström, Kenneth, Kenneth Nordström
openaire +3 more sources
The generalized Moore-Penrose inverse
The generalized Moore-Penrose inverse of a matrix over an integral domain with involution is defined. Necessary and sufficient conditions for the existence of this inverse are given. Uniqueness is proven and a formula given which leads toward a ``generalized Cramer's rule'' to find the generalized Moore-Penrose solution.
Manjunatha Prasad, K., Bapat, R.B.
openaire +2 more sources
Moore–Penrose inverse in rings with involution
Let \(R\) be a ring with involution. An element \(a\in R\) is called regular if there exists an element \(b\in R\) such that \(a=aba\). A regular element \(a \in R\) is called Moore-Penrose invertible if there is an element \(a^\dag \in R\) such that \(aa^\dag a=a\), \(a^\dag aa^\dag=a^\dag\), \((aa^\dag)^*=aa^\dag\) and \((a^\dag a)^*=a^\dag a\).
Koliha, J.J. +2 more
openaire +2 more sources
The Moore-Penrose inverse of a retrocirculant
AbstractIn a recent paper Chao [2] has determined the eigenvalues of a matrix of the form A=PC where P is a permutation matrix which commutes with a certain unitary matrix and C is a circulant. Here we determine the Moore-Penrose inverse of such a “retrocirculant” and show that the nonzero eigenvalues of the Moore-Penrose inverse are the reciprocals of
Smith, Ronald L.
openaire +2 more sources
A characterization of the Moore-Penrose inverse
The inverse \(X\) of a square matrix \(A\) may be characterized as the unique matrix for which the two by two block matrix with entries \(\{A,I,I,X\}\) has the same rank as \(A\). This paper gives a generalization for singular and rectangular \(A\) using the Moore-Penrose inverse \(A^ +\).
Fiedler, Miroslav, Markham, Thomas L.
openaire +3 more sources
A note on the convexity of the Moore–Penrose inverse
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kenneth, Nordström, Nordström, Kenneth
openaire +3 more sources
Dykstra's Algorithm and a Representation of the Moore–Penrose Inverse
The convergence of Lardy's series representation of the Moore-Penrose inverse of a closed unbounded linear operator is proved via Dykstra's alternating projection algorithm.
Groetsch, C.W.
openaire +2 more sources
On the covariance of the Moore-Penrose inverse
Let A be an \(n\times n\) matrix and T an invertible matrix of the same order. If A is invertible, then, of course, \((TAT^{-1})^{-1}=TA^{- 1}T^{-1}\) and A is covariant under the general linear group. If A is arbitrary and the inverse is replaced by the Moore-Penrose inverse then A is no longer covariant under the full linear group. Given A the author
Robinson, Donald W.
openaire +3 more sources
Abstract We propose a hierarchical energy management scheme for aggregating Distributed Energy Resources (DERs) for grid flexibility services. To prevent a direct participation of numerous prosumers in the wholesale electricity market, aggregators, as self‐interest agents in our scheme, incentivize prosumers to provide flexibility. We firstly model the
Xiupeng Chen +3 more
wiley +1 more source

