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 2020-11-01 to 2024-11-01.)
ArticleCitations
The tensor Golub–Kahan–Tikhonov method applied to the solution of ill‐posed problems with a t‐product structure19
A novel direct method based on the Lucas multiwavelet functions for variable‐order fractional reaction‐diffusion and subdiffusion equations19
Optimizing multigrid reduction‐in‐time and Parareal coarse‐grid operators for linear advection17
A derivative‐free scaling memoryless Broyden–Fletcher–Goldfarb–Shanno method for solving a system of monotone nonlinear equations16
Structure preserving quaternion full orthogonalization method with applications14
Accelerated derivative‐free method for nonlinear monotone equations with an application13
Randomized algorithms for generalized singular value decomposition with application to sensitivity analysis13
An extension of fast iterative shrinkage‐thresholding algorithm to Riemannian optimization for sparse principal component analysis12
Comparison between algebraic and matrix‐free geometric multigrid for a Stokes problem on adaptive meshes with variable viscosity12
Preconditioners for fractional diffusion equations based on the spectral symbol12
Three adaptive hybrid derivative‐free projection methods for constrained monotone nonlinear equations and their applications11
Fast randomized tensor singular value thresholding for low‐rank tensor optimization11
Computing low‐rank approximations of the Fréchet derivative of a matrix function using Krylov subspace methods11
Numerical subspace algorithms for solving the tensor equations involving Einstein product11
Computation of generalized inverses of tensors via t‐product11
Greedy Motzkin–Kaczmarz methods for solving linear systems10
Multigrid methods for block‐Toeplitz linear systems: convergence analysis and applications10
Low Tucker rank tensor completion using a symmetric block coordinate descent method9
Gradient based iterative methods for solving symmetric tensor equations8
Convergence of the fixed‐point iteration for multilinear PageRank8
Low‐rank tensor completion with sparse regularization in a transformed domain8
A new preconditioning approach for an interior point‐proximal method of multipliers for linear and convex quadratic programming8
Mixed precisions‐step Lanczos and conjugate gradient algorithms8
Condition numbers for the truncated total least squares problem and their estimations7
The Lawson‐Hanson algorithm with deviation maximization: Finite convergence and sparse recovery7
A two‐step matrix splitting iteration paradigm based on one single splitting for solving systems of linear equations7
On the block Lanczos and block Golub–Kahan reduction methods applied to discrete ill‐posed problems7
New bounds on the condition number of the Hessian of the preconditioned variational data assimilation problem6
All‐at‐once solution of linear wave equations6
Sketch‐and‐project methods for tensor linear systems6
Summation pollution of principal component analysis and an improved algorithm for location sensitive data5
Block low‐rank single precision coarse grid solvers for extreme scale multigrid methods5
Hierarchical adaptive low‐rank format with applications to discretized partial differential equations5
Incomplete inverse matrices5
A class of improved conjugate gradient methods for nonconvex unconstrained optimization5
Estimating and increasing the structural robustness of a network5
A gradient‐type iterative method for impulse noise removal5
Two‐sided guaranteed bounds to individual eigenvalues of preconditioned finite element and finite difference problems5
A class of block alternating splitting implicit iteration methods for double saddle point linear systems4
CP decomposition for tensors via alternating least squares with QR decomposition4
HILUCSI: Simple, robust, and fast multilevel ILU for large‐scale saddle‐point problems from PDEs4
Multilevel space‐time multiplicative Schwarz preconditioner for parabolic equations4
A hybrid gradient method for strictly convex quadratic programming4
On the matrices in B‐spline collocation methods for Riesz fractional equations and their spectral properties4
Computing eigenvalues of quasi‐rational Bernstein–Vandermonde matrices to high relative accuracy4
Solution methods to the nearest rotation matrix problem in ℝ3: A comparative survey4
Fast iterative solver for the optimal control of time‐dependent PDEs with Crank–Nicolson discretization in time4
A Rayleigh quotient‐gradient neural network method for computing ?‐eigenpairs of general tensors4
The Sherman–Morrison–Woodbury formula for generalized linear matrix equations and applications4
A conforming auxiliary space preconditioner for the mass conserving stress‐yielding method4
Toward efficient polynomial preconditioning for GMRES4
Factorization of completely positive matrices using iterative projected gradient steps4
Anderson accelerated fixed‐point iteration for multilinear PageRank4
Nonoverlapping block smoothers for the Stokes equations4
Accelerating block coordinate descent for nonnegative tensor factorization4
Low‐order preconditioning of the Stokes equations4
Matrix‐free preconditioning for high‐orderH(curl) discretizations4
Accelerating alternating least squares for tensor decomposition by pairwise perturbation4
Anderson acceleration of the modulus‐based matrix splitting algorithms for horizontal nonlinear complementarity systems4
Estimating posterior quantity of interest expectations in a multilevel scalable framework4
A fast spectral divide‐and‐conquer method for banded matrices3
A family of inertial‐based derivative‐free projection methods with a correction step for constrained nonlinear equations and their applications3
Preconditioners for robust optimal control problems under uncertainty3
Accurate and efficient computations with Wronskian matrices of Bernstein and related bases3
Least squares regression principal component analysis: A supervised dimensionality reduction method3
Analysis of optimal preconditioners for CutFEM3
Practical sketching‐based randomized tensor ring decomposition3
Smoothed aggregation for difficult stretched mesh and coefficient variation problems3
Numerical methods for rectangular multiparameter eigenvalue problems, with applications to finding optimal ARMA and LTI models3
ODE‐based double‐preconditioning for solving linear systems Aαx=b and f(A)x=b3
A tensor bidiagonalization method for higher‐order singular value decomposition with applications3
A continuation method for computing the multilinear PageRank3
0.039853096008301