Results 31 to 40 of about 985,681 (229)
Convergence of Rump's method for computing the Moore-Penrose inverse [PDF]
summary:We extend Rump's verified method (S. Oishi, K. Tanabe, T. Ogita, S. M. Rump (2007)) for computing the inverse of extremely ill-conditioned square matrices to computing the Moore-Penrose inverse of extremely ill-conditioned rectangular matrices ...
Chen, Yunkun, Wei, Yimin, Shi, Xinghua
core +1 more source
The generalized Moore-Penrose inverse [PDF]
We define the generalized Moore-Penrose inverse and give necessary and sufficient conditions for its existence over an integral domain. We also prove its uniqueness and give a formula for it which leads us towards a “generalized Cramer's rule” to find ...
Manjunatha Prasad, K. +4 more
core +1 more source
On the mean and variance of the estimated tangency portfolio weights for small samples
In this paper, a sample estimator of the tangency portfolio (TP) weights is considered. The focus is on the situation where the number of observations is smaller than the number of assets in the portfolio and the returns are i.i.d.
Gustav Alfelt, Stepan Mazur
doaj +1 more source
Moore–Penrose inverse of set inclusion matrices [PDF]
Given integers s,k and v, let Wsk be the vs×vk 0–1 matrix, the rows and the columns of which are indexed by the s-subsets and the k-subsets of a v-set respectively, and where the entry in row S and column U is 1 if S⊂U and 0 otherwise.
R.B. Bapat, Bapat, R. B., Bapat, R.B.
core +1 more source
The dual index and dual core generalized inverse
In this article, we introduce the dual index and dual core generalized inverse (DCGI). By applying rank equation, generalized inverse, and matrix decomposition, we give several characterizations of the dual index when it is equal to 1. We realize that if
Wang Hongxing, Gao Ju
doaj +1 more source
Line digraphs and the Moore-Penrose inverse [PDF]
Various characterizations of line digraphs and of Boolean matrices possessing a Moore-Penrose inverse are used to show that a square Boolean matrix has a Moore-Penrose inverse if and only if it is the adjacency matrix of a line digraph.
Per A. Smeds, Smeds, Per A.
core +1 more source
Effective partitioning method for computing weighted Moore–Penrose inverse [PDF]
We introduce a method and an algorithm for computing the weighted Moore–Penrose inverse of multiple-variable polynomial matrix and the related algorithm which is appropriated for sparse polynomial matrices.
Petković, Marko D. +2 more
core +1 more source
When does the Moore-Penrose inverse flip? [PDF]
In this paper, we give necessary and sufficient conditions for the matrix $\mxl{cc}a&0\\b&d\mxr$, over a *-regular ring, to have a Moore-Penrose inverse of four different types, corresponding to the four cases where the zero element can stand.
Patrício, Pedro +3 more
core +1 more source
Moore-Penrose inverse of some linear maps on infinite-dimensional vector spaces [PDF]
[EN]The aim of this work is to characterize linear maps of infinite-dimensional inner product spaces where the Moore-Penrose inverse exists. This MP inverse generalizes the well-known Moore-Penrose inverse of a matrix A ∈ Mat _{n×m} (C).
Pablos Romo, Fernando +1 more
core +3 more sources
The Moore-Penrose inverse of a retrocirculant [PDF]
In 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.
Smith, Ronald L.
core +1 more source

