SIAM J. Matrix Anal. Appl 2011

15 papers

Top Research Directions

The 10 research directions with SIAM J. Matrix Anal. Appl 2011 papers, ranked by paper count, next to 2010. Share is the fraction of the edition’s papers in the direction.

#Direction20112010Share 2011Share 20102010 rank
1Accelerating Global Sensitivity Analysis for Complex Models106.7%0.0%—
2Amortizing Matrix Operations in Iterative Solvers106.7%0.0%—
3Decomposing Complex Optimization Problems with ADMM106.7%0.0%—
4Factored Space Optimization for Low Rank Matrix Recovery106.7%0.0%—
5Proving Computational Intractability Through Hardness Reductions106.7%0.0%—
6Statistical Estimation of Componentwise Condition Numbers106.7%0.0%—
7Temporal Warm Starting for Iterative Optimization106.7%0.0%—
8The Gap Between Worst-Case and Average-Case Complexity106.7%0.0%—
9The Intractability of Low Rank Matrix Minimization106.7%0.0%—
10Tightening the Approximation Hardness Gap106.7%0.0%—

Download all directions as CSV

Institutions

Institutions credited by SIAM J. Matrix Anal. Appl 2011 papers: a paper credits every institution named in its affiliations, once. 7 institutions share 4 credited papers.

#InstitutionPapersShare20102010 rank
1Carnegie Mellon University 125.0%0—
2Fund for Scientific Research 125.0%0—
3National University of Singapore 125.0%0—
4Simon Fraser University 125.0%16
5UCLouvain 125.0%0—
6University of Hong Kong 125.0%0—
7University of Washington 125.0%0—

Download all institutions as CSV

About this data

Papers. SIAM J. Matrix Anal. Appl 2011 lists 15 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.

Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers. Comparisons with 2010 use shares, since the edition went from 13 to 15 papers.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 4 of 15 papers (26.7%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.

Data. Counts come from Lacuna’s data build of 2026-11-18 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “SIAM J. Matrix Anal. Appl 2011”, https://lacuna.tiptreesystems.com/venue/siam-j-matrix-anal-appl/2011.

Top Authors

AuthorPapers
Serge Gratton3
James Demmel2
Bingsheng He1
Delin Chu1
François Glineur1
Nicolas Gillis1
Pierre-Antoine Absil1
Steven Low1
Takanori Maehara1
Tamara G. Kolda1
Vladimir R Kostic1
Xiaoming Yuan1

Impactful Papers

Papers from SIAM J. Matrix Anal. Appl 2011 that shaped research clusters.

Influential

Papers

Title
A Contribution to the Conditioning of the Total Least-Squares Problem
A Flexible Generalized Conjugate Residual Method with Inner Orthogonalization and Deflated Restarting
Algebraic Signal Processing Theory: Cooley-Tukey-Type Algorithms for Polynomial Transforms Based on Induction
Algorithm for Error-Controlled Simultaneous Block-Diagonalization of Matrices
Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
CALU: A Communication Optimal LU Factorization Algorithm
Characterization of All Solutions for Undersampled Uncorrelated Linear Discriminant Analysis Problems
Eigenvalue Localization Refinements for Matrices Related to Positivity
Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard
Minimizing Communication in Numerical Linear Algebra
Minimizing Condition Number via Convex Programming
Nonnegative Matrix Inequalities and their Application to Nonconvex Power Control Optimization
Range-Space Variants and Inexact Matrix-Vector Products in Krylov Solvers for Linear Systems Arising from Inverse Problems
Shifted Power Method for Computing Tensor Eigenpairs
Solving Large-Scale Least Squares Semidefinite Programming by Alternating Direction Methods