Results 51 to 60 of about 992,721 (210)
Moore–Penrose inverse in rings with involution
Linear Algebra and its Applications, 2007 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 +1 more source
Moore–Penrose inverse of set inclusion matrices
, 2000 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.
core +1 more source
A Note About Measures, Jacobians and Moore–Penrose Inverse
, 2020 Some general problems of Jacobian computations in non-full rank matrices are revised in this work. We prove that the Jacobian of the Moore Penrose inverse derived via matrix differential calculus is incorrect.
Caro-Lopera F.J., Díaz-García J.A.
core +1 more source
Spectral analysis of large reflexive generalized inverse and Moore-Penrose inverse matrices [PDF]
, 2020 A reflexive generalized inverse and the Moore-Penrose inverse are often confused in statistical literature but in fact they have completely different behaviour in case the population covariance matrix is not a multiple of identity.
Parolya, Nestor +3 more
core +1 more source
High‐Order Sliding‐Mode control for MIMO Systems
International Journal of Robust and Nonlinear Control, EarlyView.ABSTRACT This paper extends Lyapunov‐based homogeneous high‐order sliding‐mode control to a class of uncertain non‐square multi‐input multi‐output (MIMO) nonlinear systems with a well‐defined vector relative degree. The considered systems admit a normal‐form representation with an uncertain but full‐row‐rank input‐gain matrix.
Jaime A. Moreno, Angel Mercado‐Uribe
wiley +1 more source
On the mean and dispersion of the Moore-Penrose generalized inverse of a Wishart matrix [PDF]
, 2020 The Moore-Penrose inverse of a singular Wishart matrix is studied. When the scale matrix equals the identity matrix the mean and dispersion matrices of the Moore-Penrose inverse are known. When the scale matrix has an arbitrary structure no exact results
Imori, Shinpei, Von Rosen, Dietrich
core +3 more sources
International Journal of Robust and Nonlinear Control, EarlyView.ABSTRACT Safety‐critical control remains a major challenge for four‐wheel independently steered and driven (4ISD) mobile robots, where high‐accuracy path tracking and obstacle avoidance must be achieved under over‐actuated steering–driving coordination, tire–ground friction limits, and wheel‐torque constraints.
Ruitong Liu, Kenji Hashimoto
wiley +1 more source
INVERS MOORE PENROSE PADA RING DAN SIFAT-SIFATNYA [PDF]
, 2018 Moore-Penrose Inverse introduced on the set of matrix. All of singular matrix’s elements have Moore-Penrose Inverse. However because set of matrix on real number is a ring so Moore-Penrose Inverse can be generalized on ring. Moore-Penrose Inverse of ∈ is
Fairist Astara, Adam
core +1 more source
Tensor‐Based Reduction of Linear Parameter‐Varying State‐Space Models
International Journal of Robust and Nonlinear Control, EarlyView.ABSTRACT The linear parameter‐varying (LPV) framework is a powerful tool for controlling nonlinear (NL) and complex systems, but the conversion of NL models into LPV forms often results in high‐dimensional and overly conservative LPV models. To be able to apply control strategies, there is often a need for model reduction in order to reduce ...
Bogoljub Terzin +4 more
wiley +1 more source
Computing Moore–Penrose Inverses with Polynomials in Matrices
The American Mathematical Monthly, 2021 This article proposes a method for computing the Moore–Penrose inverse of a complex matrix using polynomials in matrices. Such a method is valid for all matrices and does not involve spectral calculation, which could be infeasible when the size of the matrix is large.
openaire +2 more sources