a note on computing the generalized inverse a t,s (2) of a matrix a
Clicks: 9
ID: 140939
2002
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
2.4
/100
9 views
5 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #299 of 403 articles by views in structural engineering and mechanics
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 403 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
The generalized inverse A T,S (2) of a matrix A is a {2}-inverse of A with the prescribed range T and null space S. A representation for the generalized inverse
A T,S (2) has been recently developed with the condition
σ (GA| T)⊂(0,∞), where G is a matrix with R(G)=T andN(G)=S. In this note, we remove the above condition. Three types of iterative methods for A T,S (2) are presented if σ(GA|T) is a subset of the open right half-plane and they are extensions of existing computational procedures of A T,S (2), including special cases such as the weighted Moore-Penrose inverse A M,N † and the Drazin inverse AD. Numerical examples are given to illustrate our results.
| Reference Key |
li2002internationala
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Xiezhang Li;Yimin Wei |
| Journal | structural engineering and mechanics |
| Year | 2002 |
| DOI |
10.1155/S0161171202013169
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.