Numerical Linear Algebra With Applications

Papers
(The TQCC of Numerical Linear Algebra With Applications is 3. 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-09-01 to 2025-09-01.)
ArticleCitations
Inexact inner–outer Golub–Kahan bidiagonalization method: A relaxation strategy23
Asymptotics for the eigenvalues of Toeplitz matrices with a symbol having a power singularity22
Convergence of the block Lanczos method for the trust‐region subproblem in the hard case19
Issue Information17
Dynamically accelerating the power iteration with momentum17
Stabilized Krylov Subspace Recurrences via Randomized Sketching17
Structure‐Preserving Model Reduction Approach for Structured Index‐2 Descriptor‐Systems16
Rank‐structured approximation of some Cauchy matrices with sublinear complexity14
Hierarchical adaptive low‐rank format with applications to discretized partial differential equations14
Improved TriCG and TriMR Methods for Symmetric Quasi‐Definite Linear Systems14
Optimal polynomial smoothers for multigrid V‐cycles13
A fast and accurate algorithm for solving linear systems associated with a class of negative matrix12
Volume‐based subset selection12
On the efficient preconditioning of the Stokes equations in tight geometries9
Two‐step Ulm–Chebyshev‐like method for inverse singular value problems8
Total positivity and accurate computations with Gram matrices of Said‐Ball bases8
A Bernoulli‐Barycentric Rational Matrix Collocation Method With Preconditioning for a Class of Evolutionary PDEs8
Normalized Newton method to solve generalized tensor eigenvalue problems8
Issue Information8
Sine transform based preconditioning techniques for space fractional diffusion equations8
Numerical algorithm for estimating a conditioned symmetric positive definite matrix under constraints7
A New Matrix Truncation Method for Improving Approximate Factorization Preconditioners7
Randomized low‐rank approximation of parameter‐dependent matrices7
Fast and stable modification of the Gauss–Newton method for low‐rank signal estimation7
A Rational Arnoldi Approach for Sobolev Rational Least Squares Problems6
Dual Perturbation Method for Spectral Solution of Block‐Posed Harmonic Problems6
Accurate bidiagonal decompositions of Cauchy–Vandermonde matrices of any rank6
Adaptive Factored Incomplete Inverse Matrices6
Fast Solution of Sylvester‐Structured Systems for Spatial Source Separation of the Cosmic Microwave Background6
Matrix‐less methods for the spectral approximation of large non‐Hermitian Toeplitz matrices: A concise theoretical analysis and a numerical study5
Fast iterative solver for the optimal control of time‐dependent PDEs with Crank–Nicolson discretization in time5
Conditioning of hybrid variational data assimilation5
CP decomposition for tensors via alternating least squares with QR decomposition5
A unified rational Krylov method for elliptic and parabolic fractional diffusion problems5
5
5
On adapting Nesterov's scheme to accelerate iterative methods for linear problems5
Study and Use of Spectral Symbol Properties for Isogeometric Matrices on Trimmed Geometries5
Estimating and increasing the structural robustness of a network5
Issue Information5
Low‐order preconditioning of the Stokes equations5
Robust Low‐Rank Tensor Recovery Using a Self‐Adaptive Learnable Weighted Tensor Total Variation Method5
Subspace method for multiparameter‐eigenvalue problems based on tensor‐train representations5
Selectable Set Randomized Kaczmarz5
Solution methods to the nearest rotation matrix problem in ℝ3: A comparative survey5
Weighted relaxation for multigrid reduction in time4
Three adaptive hybrid derivative‐free projection methods for constrained monotone nonlinear equations and their applications4
A sampling greedy average regularized Kaczmarz method for tensor recovery4
4
Accelerated schemes of compact difference methods for space‐fractional sine‐Gordon equations with distributed delay4
Multilevel Additive Schwarz Preconditioners for High‐Order Block Implicit Methods for Parabolic Equations4
Lower and upper bounds of condition number for Vandermonde‐wise matrices and method of fundamental solutions using pseudo radial‐lines4
Randomized Orthogonalization Process With Reorthogonalization4
Blockwise acceleration of alternating least squares for canonical tensor decomposition4
Practical alternating least squares for tensor ring decomposition4
Issue Information4
Accurate bidiagonal decomposition of Lagrange–Vandermonde matrices and applications4
Signal and image reconstruction with a double parameter Hager–Zhang‐type conjugate gradient method for system of nonlinear equations4
Nonlinear approximation of functions based on nonnegative least squares solver4
Nonnegative canonical tensor decomposition with linear constraints: nnCANDELINC3
An iterative algorithm for low‐rank tensor completion problem with sparse noise and missing values3
3
Issue Information3
A Semi‐Randomized and Augmented Kaczmarz Method With Simple Random Sampling for Large‐Scale Inconsistent Linear Systems3
Issue Information3
Reverse Quantile‐RK and Its Application to Quantile‐RK3
Error bounds for the approximation of matrix functions with rational Krylov methods3
Low‐rank updates of matrix square roots3
3
Structured Nuclear Norm Matrix Completion: Guaranteeing Exact Recovery via Block‐Column Scaling3
Computing f‐divergences and distances of high‐dimensional probability density functions3
3
Robust tensor recovery via a nonconvex approach with ket augmentation and auto‐weighted strategy3
Accelerating alternating least squares for tensor decomposition by pairwise perturbation3
Memory‐efficient compression of ????ℋ2‐matrices for high‐frequency Helmholtz problems3
Practical sketching‐based randomized tensor ring decomposition3
Issue Information3
Smoothed Moreau‐Yosida Tensor‐Train Approximation of State‐Constrained Optimization Problems Under Uncertainty3
Quasi‐Newton variable preconditioning for nonlinear elasticity systems in 3D3
Flexible subspace iteration with moments for an effective contour integration‐based eigensolver3
0.25221109390259