some generalizations and modifications of iterative methods for solving large sparse symmetric indefinite linear systems
Clicks: 116
ID: 232516
2014
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
30.0
/100
116 views
30 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #187 of 631 articles by views in science and technology of advanced materials
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 631 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
We discuss a variety of iterative methods that are based on the Arnoldi process for solving large sparse symmetric indefinite linear systems. We describe the SYMMLQ and SYMMQR methods, as well as generalizations and modifications of them. Then, we cover the Lanczos/MSYMMLQ and Lanczos/MSYMMQR methods, which arise from a double linear system. We present pseudocodes for these algorithms.
| Reference Key |
li2014abstractsome
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Yu-Chien Li;Jen-Yuan Chen;David R. Kincaid |
| Journal | science and technology of advanced materials |
| Year | 2014 |
| DOI |
10.1155/2014/237808
|
| 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.