default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIsak Jonsson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[c10]Per Andersson, Robert Granat, Isak Jonsson, Bo Kågström:
Parallel Algorithms for Triangular Periodic Sylvester-Type Matrix Equations. Euro-Par 2008: 780-789- 2006
- [c9]Robert Granat, Isak Jonsson, Bo Kågström:
Recursive Blocked Algorithms for Solving Periodic Triangular Sylvester-Type Matrix Equations. PARA 2006: 531-539 - 2004
- [j4]Erik Elmroth, Fred G. Gustavson, Isak Jonsson, Bo Kågström:
Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software. SIAM Rev. 46(1): 3-45 (2004) - [c8]Robert Granat, Isak Jonsson, Bo Kågström:
Combining Explicit, Recursive Blocking for Solving Triangular Sylvester-Type Matrix Equations on Distributed Memory Platforms. Euro-Par 2004: 742-750 - 2003
- [c7]Isak Jonsson, Bo Kågström:
RECSY - A High Performance Library for Sylvester-Type Matrix Equations. Euro-Par 2003: 810-819 - 2002
- [j3]Isak Jonsson, Bo Kågström:
Recursive blocked algorithms for solving triangular systems - Part I: one-sided and coupled Sylvester-type matrix equations. ACM Trans. Math. Softw. 28(4): 392-415 (2002) - [j2]Isak Jonsson, Bo Kågström:
Recursive blocked algorithms for solving triangular systems - Part II: two-sided and generalized Sylvester and Lyapunov matrix equations. ACM Trans. Math. Softw. 28(4): 416-435 (2002) - [c6]Isak Jonsson, Bo Kågström:
Parallel Two-Sided Sylvester-Type Matrix Equation Solvers for SMP Systems Using Recursive Blocking. PARA 2002: 297-306 - 2000
- [j1]Fred G. Gustavson, Isak Jonsson:
Minimal-storage high-performance Cholesky factorization via blocking and recursion. IBM J. Res. Dev. 44(6): 823-850 (2000) - [c5]Isak Jonsson, Bo Kågström:
Parallel Triangular Sylvester-Type Matrix Equation Solvers for SMP Systems Using Recursive Blocking. PARA 2000: 64-73 - [c4]Fred G. Gustavson, Isak Jonsson:
High Performance Cholesky Factorization via Blocking and Recursion That Uses Minimal Storage. PARA 2000: 82-91
1990 – 1999
- 1999
- [c3]Fred G. Gustavson, Isak Jonsson, Bo Kågström, Per Ling:
Towards Peak Performance on Hierarchical SMP Memory Architectures - New Recursive Blocked Data Formats and BLAS. PP 1999 - 1998
- [c2]Fred G. Gustavson, André Henriksson, Isak Jonsson, Bo Kågström, Per Ling:
Recursive Blocked Data Formats and BLAS's for Dense Linear Algebra Algorithms. PARA 1998: 195-206 - [c1]Fred G. Gustavson, André Henriksson, Isak Jonsson, Bo Kågström, Per Ling:
Superscalar GEMM-based Level 3 BLAS - The On-going Evolution of a Portable and High-Performance Library. PARA 1998: 207-215
Coauthor Index
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-07-04 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
