SIAM Journal on Matrix Analysis and Applications

Papers
(The TQCC of SIAM Journal on Matrix Analysis and Applications is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-05-01 to 2025-05-01.)
ArticleCitations
Generalized Matrix Nearness Problems35
Generalized Perron Roots and Solvability of the Absolute Value Equation25
Contour Integration for Eigenvector Nonlinearities21
Efficient Vectors for Block Perturbed Consistent Matrices16
An Analysis of the Rayleigh–Ritz and Refined Rayleigh–Ritz Methods for Regular Nonlinear Eigenvalue Problems16
Diagonal Scalings for the Eigenstructure of Arbitrary Pencils14
Arbitrary Precision Algorithms for Computing the Matrix Cosine and its Fréchet Derivative13
Reorthogonalized Pythagorean Variants of Block Classical Gram–Schmidt13
Revisiting the Matrix Polynomial Greatest Common Divisor11
Computing the Riemannian Logarithm on the Stiefel Manifold: Metrics, Methods, and Performance9
Global Convergence of Hessenberg Shifted QR III: Approximate Ritz Values via Shifted Inverse Iteration9
Sharp Estimation of Convergence Rate for Self-Consistent Field Iteration to Solve Eigenvector-Dependent Nonlinear Eigenvalue Problems9
A Bootstrap Multigrid Eigensolver9
Nesting Approximate Inverses for Improved Preconditioning and Algebraic Multigrid Smoothing9
Analysis of the Truncated Conjugate Gradient Method for Linear Matrix Equations9
Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds9
A Fast Iterative Algorithm for Near-Diagonal Eigenvalue Problems8
Probabilistic Rounding Error Analysis of Householder QR Factorization8
A Riemannian Optimization Method to Compute the Nearest Singular Pencil8
$(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials8
A Newton Method for Solving Locally Definite Multiparameter Eigenvalue Problems by Multi-index7
Singular Value Decomposition of Dual Matrices and its Application to Traveling Wave Identification in the Brain7
Randomized Nyström Preconditioning7
Mixed Precision Recursive Block Diagonalization for Bivariate Functions of Matrices7
Refinement of Hottopixx Method for Nonnegative Matrix Factorization Under Noisy Separability7
New Convergence Analysis of GMRES with Weighted Norms, Preconditioning, and Deflation, Leading to a New Deflation Space7
Extreme Ratio Between Spectral and Frobenius Norms of Nonnegative Tensors6
Efficient Scaling and Squaring Method for the Matrix Exponential6
Solving Singular Generalized Eigenvalue Problems. Part II: Projection and Augmentation6
Root-Max Problems, Hybrid Expansion-Contraction, and Quadratically Convergent Optimization of Passive Systems6
Analyzing the Influence of Agents in Trust Networks: Applying Nonsmooth Eigensensitivity Theory to a Graph Centrality Problem6
Matrix Pencils with Coefficients that have Positive Semidefinite Hermitian Parts6
EPIC: A Provable Accelerated Eigensolver Based on Preconditioning and Implicit Convexity6
Spectral Transformation for the Dense Symmetric Semidefinite Generalized Eigenvalue Problem5
Krylov-Aware Stochastic Trace Estimation5
Decomposition of a Tensor into Multilinear Rank-\({(M_{{r}},N_{{r}},\cdot )}\) Terms5
Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems5
A Sampling Algorithm to Compute the Set of Feasible Solutions for NonNegative Matrix Factorization with an Arbitrary Rank5
On Semidefinite Programming Characterizations of the Numerical Radius and Its Dual Norm5
Analytical Singular Value Decomposition for a Class of Stoichiometry Matrices5
Multidimensional Total Least Squares Problem with Linear Equality Constraints5
Multichannel Frequency Estimation with Constant Amplitude via Convex Structured Low-Rank Approximation4
On the Condition Number of the Shifted Real Ginibre Ensemble4
Block Preconditioners for the Marker-and-Cell Discretization of the Stokes–Darcy Equations4
Five-Precision GMRES-Based Iterative Refinement4
Twice Is Enough for Dangerous Eigenvalues4
Theoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue Problems4
High Curvature Means Low Rank: On the Sectional Curvature of Grassmann and Stiefel Manifolds and the Underlying Matrix Trace Inequalities4
Surrogate-Based Autotuning for Randomized Sketching Algorithms in Regression Problems4
Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems4
Asymptotic Spectral Properties of the Hilbert \(L\) -Matrix3
A Stable Matrix Version of the 2D Fast Multipole Method3
Johnson–Lindenstrauss Embeddings with Kronecker Structure3
Hierarchical Orthogonal Factorization: Sparse Square Matrices3
Measuring Segregation via Analysis on Graphs3
Entrywise Tensor-Train Approximation of Large Tensors via Random Embeddings3
Multilinear Singular Value Decomposition–Based Completion with Fibers Observed in a Single Mode3
Parameterized Interpolation of Passive Systems3
A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization3
Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps3
Linear Asymptotic Convergence of Anderson Acceleration: Fixed-Point Analysis3
Backpropagation through Back Substitution with a Backslash3
Multilevel Tau Preconditioners for Symmetrized Multilevel Toeplitz Systems with Applications to Solving Space Fractional Diffusion Equations3
Stochastic Rounding Implicitly Regularizes Tall-and-Thin Matrices3
A Block Householder–Based Algorithm for the QR Decomposition of Hierarchical Matrices3
Avoiding Discretization Issues for Nonlinear Eigenvalue Problems3
Krylov Subspace Approach to Core Problems within Multilinear Approximation Problems: A Unifying Framework3
Geometric Inexact Newton Method for Generalized Singular Values of Grassmann Matrix Pair2
Probabilistic Rounding Error Analysis of Modified Gram–Schmidt2
A Note on the Randomized Kaczmarz Algorithm for Solving Doubly Noisy Linear Systems2
Eigenstructure Perturbations for a Class of Hamiltonian Matrices and Solutions of Related Riccati Inequalities2
Stable and Efficient Computation of Generalized Polar Decompositions2
GMRES with Randomized Sketching and Deflated Restarting2
Structure-Preserving Doubling Algorithms That Avoid Breakdowns for Algebraic Riccati-Type Matrix Equations2
Reorthogonalized Block Classical Gram–Schmidt Using Two Cholesky-Based TSQR Algorithms2
A Structure Preserving Shift-Invert Infinite Arnoldi Algorithm for a Class of Delay Eigenvalue Problems with Hamiltonian Symmetry2
Global Convergence of Hessenberg Shifted QR II: Finite Arithmetic2
Row or Column Completion of Polynomial Matrices of Given Degree2
Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method2
On Adaptive Stochastic Heavy Ball Momentum for Solving Linear Systems2
A Theory of Quantum Subspace Diagonalization2
Input-Tailored System-Theoretic Model Order Reduction for Quadratic-Bilinear Systems2
Variational Characterization and Rayleigh Quotient Iteration of 2D Eigenvalue Problem with Applications2
Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach2
Assigning Stationary Distributions to Sparse Stochastic Matrices2
Unimodular Completions and Orthogonal Complements of Matrices over Univariate Ore Extensions2
Riemannian Preconditioned Coordinate Descent for Low Multilinear Rank Approximation2
Improved Variants of the Hutch++ Algorithm for Trace Estimation2
A Numerically Stable Communication-Avoiding \({s}\)-Step GMRES Algorithm2
An Efficient Algorithm for Integer Lattice Reduction2
A Measure Concentration Effect for Matrices of High, Higher, and Even Higher Dimension2
Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes2
A Comparison of Mixed Precision Iterative Refinement Approaches for Least-Squares Problems2
An Apocalypse-Free First-Order Low-Rank Optimization Algorithm with at Most One Rank Reduction Attempt per Iteration2
Randomized Block Adaptive Linear System Solvers2
A Complex-Projected Rayleigh Quotient Iteration for Targeting Interior Eigenvalues2
Parametric Kernel Low-Rank Approximations Using Tensor Train Decomposition2
On Best Low Rank Approximation of Positive Definite Tensors2
Guarantees for Existence of a Best Canonical Polyadic Approximation of a Noisy Low-Rank Tensor2
0.16702604293823