default search action
Charles Van Loan
Person information
- affiliation: Cornell University, Ithaca, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j11]Charles F. Van Loan, Joseph Vokt:
Approximating Matrices with Multiple Symmetries. SIAM J. Matrix Anal. Appl. 36(3): 974-993 (2015) - 2014
- [i3]Charles Van Loan, Joseph Vokt:
Approximating Matrices with Multiple Symmetries. CoRR abs/1411.6296 (2014) - 2012
- [j10]Stefan Ragnarsson, Charles F. Van Loan:
Block Tensor Unfoldings. SIAM J. Matrix Anal. Appl. 33(1): 149-169 (2012) - 2011
- [i2]Stefan Ragnarsson, Charles F. Van Loan:
Block Tensor Unfoldings. CoRR abs/1101.2005 (2011) - 2010
- [b2]Charles F. Van Loan, K.-Y. Daisy Fan:
Insight Through Computing - A MATLAB Introduction to Computational Science and Engineering. SIAM 2010, ISBN 978-0-89871-691-7, pp. I-XVIII, 1-434 - [j9]Adam N. Elmachtoub, Charles F. Van Loan:
From Random Polygon to Ellipse: An Eigenanalysis. SIAM Rev. 52(1): 151-170 (2010) - [i1]Stefan Ragnarsson, Charles F. Van Loan:
Block tensors and symmetric embeddings. CoRR abs/1010.0707 (2010)
2000 – 2009
- 2008
- [j8]Carla D. Moravitz Martin, Charles F. Van Loan:
A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions. SIAM J. Matrix Anal. Appl. 30(3): 1219-1232 (2008) - 2007
- [p1]Gene H. Golub, Charles F. Van Loan:
An analysis of the total least squares problem. Milestones in Matrix Computation 2007: 213-226 - 2006
- [j7]Carla D. Moravitz Martin, Charles F. Van Loan:
Solving Real Linear Systems with the Complex Schur Decomposition. SIAM J. Matrix Anal. Appl. 29(1): 177-183 (2006) - [j6]Carla D. Moravitz Martin, Charles F. Van Loan:
Shifted Kronecker Product Systems. SIAM J. Matrix Anal. Appl. 29(1): 184-198 (2006) - 2003
- [j5]Cleve B. Moler, Charles Van Loan:
Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later. SIAM Rev. 45(1): 3-49 (2003) - 2002
- [j4]Carla D. Moravitz Martin, Charles F. Van Loan:
Product Triangular Systems with Shift. SIAM J. Matrix Anal. Appl. 24(1): 292-301 (2002) - 2000
- [j3]Daniel S. Bernstein, Charles F. Van Loan:
Rational Matrix Functions and Rank-1 Updates. SIAM J. Matrix Anal. Appl. 22(1): 145-154 (2000)
1990 – 1999
- 1998
- [j2]Bo Kågström, Per Ling, Charles Van Loan:
GEMM-based level 3 BLAS: high-performance model implementations and performance evaluation benchmark. ACM Trans. Math. Softw. 24(3): 268-302 (1998) - [j1]Bo Kågström, Charles Van Loan:
Algorithm 784: GEMM-based level 3 BLAS: portability and optimization issues. ACM Trans. Math. Softw. 24(3): 303-316 (1998) - 1996
- [b1]Gene H. Golub, Charles F. Van Loan:
Matrix Computations, Third Edition. Johns Hopkins University Press 1996, ISBN 978-0-8018-5414-9, pp. I-XXVII, 1-694 - 1993
- [c3]Bo Kågström, Per Ling, Charles Van Loan:
Portable High Performance GEMM-Based Level 3 BLAS. PPSC 1993: 339-346 - 1991
- [c2]Krister Dackland, Erik Elmroth, Bo Kågström, Charles Van Loan:
Design and Evaluation of Parallel Block Algorithms: LU Factorization on an IBM 3090 VF/600J. PP 1991: 3-10
1980 – 1989
- 1985
- [c1]Christian H. Bischof, Charles Van Loan:
The WY representation for products of householder matrices. PP 1985: 2-13
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:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint