Results 31 to 40 of about 103 (100)

A novel interpretation of least squares solution

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 15, Issue 1, Page 41-46, 1992., 1991
We show that the well‐known least squares (LS) solution of an overdetermined system of linear equations is a convex combination of all the non‐trivial solutions weighed by the squares of the corresponding denominator determinants of the Cramer′s rule. This Least Squares Decomposition (LSD) gives an alternate statistical interpretation of least squares,
Jack-Kang Chan
wiley   +1 more source

Bordering method to compute Core-EP inverse

open access: yesSpecial Matrices, 2018
Following the work of Kentaro Nomakuchi[10] and Manjunatha Prasad et.al., [7] which relate various generalized inverses of a given matrix with suitable bordering,we describe the explicit bordering required to obtain core-EP inverse, core-EP generalized ...
Prasad K. Manjunatha, Raj M. David
doaj   +1 more source

EP Elements in Rings and in Semigroups with Involution and in C*-algebras [PDF]

open access: yes, 2015
This work includes a survey of most of the results concerning EP elements in semigroups and rings with involution and in C*-algebras. 2010 Mathematics Subject Classification: Primary 46L05, 46J05, 46H05, 46H30, 47A05, 47A53, 47A60, 15A09, 15A33, 16A28 ...
Karanasios, Sotirios
core   +1 more source

On a new generalized inverse for Hilbert space operators

open access: yes, 2021
Using the Moore-Penrose inverse and the core-EP inverse, we define a new generalized inverse (called the MPCEP inverse) for a Hilbert space operator. Several equivalent conditions for a Hilbert space operator to be the MPCEP inverse are presented.
Chen, Jianlong   +2 more
core  

IDDM YARDIMIYLA TERS MATRİS HESAPLAMA

open access: yes, 2019
Özet: Bu çalışmada, lineer cebirsel denklem sistemlerinin çözümü için (KESKİN &AYDIN 2007) de verilen iteratif boyut indirgeme metodunu (IDDM) kullanarak verilenregüler matrisin tersini bulan bir metod geliştirdik.
ÇIBIKDİKEN, Ali Osman
core   +2 more sources

A matrix approach to compare BLUEs under a linear regression model and its two competing restricted models with applications

open access: yesDemonstratio Mathematica
Suppose that a weakly singular linear regression model M{\mathscr{M}} and its two competing restricted models M1{{\mathscr{M}}}_{1} and M2{{\mathscr{M}}}_{2} are given.
Ren Xingwei
doaj   +1 more source

Full column rank preservers that preserve semipositivity of matrices

open access: yesSpecial Matrices, 2018
Left invertibility preservers on Mm,n(ℝ), m ≥ n, that preserve either semipositivity of matrices or the subset of minimally semipositive matrices are studied. We prove that such maps cannot be degenerate.
Arumugasamy Chandrashekaran   +1 more
doaj   +1 more source

Extensions of pseudo-Perron-Frobenius splitting related to generalized inverse AT,S(2)

open access: yesSpecial Matrices, 2018
We in this paper define the outer-Perron-Frobenius splitting, which is an extension of the pseudo- Perron-Frobenius splitting defined in [A.N. Sushama, K. Premakumari, K.C.
Huang Shaowu   +3 more
doaj   +1 more source

Towards finding equalities involving mixed products of the Moore-Penrose and group inverses by matrix rank methodology

open access: yesDemonstratio Mathematica
Given a square matrix AA, we are able to construct numerous equalities involving reasonable mixed operations of AA and its conjugate transpose A∗{A}^{\ast }, Moore-Penrose inverse A†{A}^{\dagger } and group inverse A#{A}^{\#}. Such kind of equalities can
Tian Yongge
doaj   +1 more source

Invariance property of a five matrix product involving two generalized inverses

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021
Matrix expressions composed by generalized inverses can generally be written as f(A−1, A−2, . . ., A−k), where A1, A2, . . ., Ak are a family of given matrices of appropriate sizes, and (·)− denotes a generalized inverse of matrix.
Jiang Bo, Tian Yongge
doaj   +1 more source

Home - About - Disclaimer - Privacy