SIAM J. Matrix Anal. Appl 2004

5 papers

Top Research Directions

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

#Direction20042003Share 2004Share 20032003 rank
1High-Dimensional Optimization via One-Dimensional Reduction1020.0%0.0%—
2The Spectral Gap Bottleneck in Subspace Estimation1120.0%14.3%3

Download all directions as CSV

Institutions

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

#InstitutionPapersShare20032003 rank
103yrm5c26 150.0%0—
2Australian National University 150.0%0—
3Florida State University 150.0%0—
4UCLouvain 150.0%0—
5University of California System 150.0%0—
6University of Liège 150.0%0—

Download all institutions as CSV

About this data

Papers. SIAM J. Matrix Anal. Appl 2004 lists 5 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 2003 use shares, since the edition went from 7 to 5 papers.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 2 of 5 papers (40.0%) 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 2004”, https://lacuna.tiptreesystems.com/venue/siam-j-matrix-anal-appl/2004.

Top Authors

AuthorPapers
Serge Gratton2
Hongyuan Zha1
Jerome Malick1
Pierre-Antoine Absil1

Papers

Title
A Dual Approach to Semidefinite Least-Squares Problems
A Rank-k Update Procedure for Reorthogonalizing the Orthogonal Factor from Modified Gram-Schmidt
A Rank-Update Procedure for Reorthogonalizing the Orthogonal Factor from Modified Gram-Schmidt
Cubically Convergent Iterations for Invariant Subspace Computation
Low-Rank Approximations with Sparse Factors II: Penalized Methods with Discrete Newton-Like Iterations