![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Axel Ruhe
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2004
- [j6]Katarina Blom, Axel Ruhe:
A Krylov Subspace Method for Information Retrieval. SIAM J. Matrix Anal. Appl. 26(2): 566-582 (2004) - 2002
- [j5]Jesse L. Barlow, Michael W. Berry, Axel Ruhe, Hongyuan Zha:
Preface. Comput. Stat. Data Anal. 41(1): 1-2 (2002) - 1998
- [j4]Axel Ruhe:
Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils. SIAM J. Sci. Comput. 19(5): 1535-1551 (1998) - 1990
- [j3]Jacques Huitfeldt, Axel Ruhe:
A New Algorithm for Numerical Path Following Applied to an Example from Hydrodynamical Flow. SIAM J. Sci. Comput. 11(6): 1181-1192 (1990) - 1980
- [j2]Bo Kågström, Axel Ruhe:
An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix. ACM Trans. Math. Softw. 6(3): 398-419 (1980) - [j1]Bo Kågström, Axel Ruhe:
Algorithm 560: JNF, An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix [F2]. ACM Trans. Math. Softw. 6(3): 437-443 (1980)
Conference and Workshop Papers
- 2004
- [c2]Axel Ruhe:
Rational Krylov for Large Nonlinear Eigenproblems. PARA 2004: 357-363 - 1998
- [c1]Axel Ruhe, Daniel Skoogh:
Rational Krylov Algorithms for Eigenvalue Computation and Model Reduction. PARA 1998: 491-502
Parts in Books or Collections
- 2000
- [p4]Ming Gu, Axel Ruhe, Richard B. Lehoucq, Danny C. Sorensen, Roland W. Freund, Gerard L. G. Sleijpen, Henk A. van der Vorst, Zhaojun Bai, Ruipeng Li:
Hermitian Eigenvalue Problems. Templates for the Solution of Algebraic Eigenvalue Problems 2000: 45-107 - [p3]Ming Gu, Axel Ruhe, Gerard L. G. Sleijpen, Henk A. van der Vorst, Zhaojun Bai, Ruipeng Li:
Generalized Hermitian Eigenvalue Problems. Templates for the Solution of Algebraic Eigenvalue Problems 2000: 109-133 - [p2]Gerard L. G. Sleijpen, Henk A. van der Vorst, Axel Ruhe, Zhaojun Bai, T. Ericsson, T. Kowalski, Bo Kågström, Ruipeng Li:
Generalized Non-Hermitian Eigenvalue Problems. Templates for the Solution of Algebraic Eigenvalue Problems 2000: 233-279 - 1995
- [p1]Zhaojun Bai, David Day, James Demmel, Jack J. Dongarra, Ming Gu, Axel Ruhe, Henk A. van der Vorst:
Templates for Linear Algebra Problems. Computer Science Today 1995: 115-140
Editorship
- 2000
- [e1]Zhaojun Bai, James Demmel, Jack J. Dongarra, Axel Ruhe, Henk A. van der Vorst:
Templates for the Solution of Algebraic Eigenvalue Problems. Software, environments, tools 11, SIAM 2000, ISBN 978-0-89871-471-5 [contents]
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-10 01:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint