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-03-01 to 2024-03-01.)
ArticleCitations
Robust tensor completion using transformed tensor singular value decomposition80
A novel direct method based on the Lucas multiwavelet functions for variable‐order fractional reaction‐diffusion and subdiffusion equations17
The tensor Golub–Kahan–Tikhonov method applied to the solution of ill‐posed problems with a t‐product structure15
Nesterov acceleration of alternating least squares for canonical tensor decomposition: Momentum step size selection and restart mechanisms15
Low synchronization Gram–Schmidt and generalized minimal residual algorithms14
A local Fourier analysis of additive Vanka relaxation for the Stokes equations14
A derivative‐free scaling memoryless Broyden–Fletcher–Goldfarb–Shanno method for solving a system of monotone nonlinear equations14
Further results on the Drazin inverse of even‐order tensors13
Non‐Hermitian perturbations of Hermitian matrix‐sequences and applications to the spectral analysis of the numerical approximation of partial differential equations13
Modulus‐based synchronous multisplitting methods for solving horizontal linear complementarity problems on parallel computers12
Accelerated derivative‐free method for nonlinear monotone equations with an application12
Optimizing multigrid reduction‐in‐time and Parareal coarse‐grid operators for linear advection11
Quantum Fourier transform revisited10
Computation of generalized inverses of tensors via t‐product10
Decompositions of third‐order tensors: HOSVD, T‐SVD, and Beyond9
Multigrid methods for block‐Toeplitz linear systems: convergence analysis and applications9
Comparison between algebraic and matrix‐free geometric multigrid for a Stokes problem on adaptive meshes with variable viscosity9
Numerical subspace algorithms for solving the tensor equations involving Einstein product9
Computing low‐rank approximations of the Fréchet derivative of a matrix function using Krylov subspace methods9
Randomized algorithms for generalized singular value decomposition with application to sensitivity analysis9
Fast randomized tensor singular value thresholding for low‐rank tensor optimization9
Low‐rank tensor completion with sparse regularization in a transformed domain8
An extension of fast iterative shrinkage‐thresholding algorithm to Riemannian optimization for sparse principal component analysis8
Preconditioned tensor splitting AOR iterative methods for ℋ‐tensor equations8
A new preconditioning approach for an interior point‐proximal method of multipliers for linear and convex quadratic programming8
Condition numbers for the truncated total least squares problem and their estimations6
Greedy Motzkin–Kaczmarz methods for solving linear systems6
On inexact alternating direction implicit iteration for continuous Sylvester equations6
Convergence of the fixed‐point iteration for multilinear PageRank6
Preconditioners for fractional diffusion equations based on the spectral symbol6
A gradient‐type iterative method for impulse noise removal6
All‐at‐once solution of linear wave equations5
Three adaptive hybrid derivative‐free projection methods for constrained monotone nonlinear equations and their applications5
On “Optimal” h‐independent convergence of Parareal and multigrid‐reduction‐in‐time using Runge‐Kutta time integration5
Semi‐active ℋ∞ damping optimization by adaptive interpolation5
Gradient based iterative methods for solving symmetric tensor equations5
Mixed precision s‐step Lanczos and conjugate gradient algorithms5
On the block Lanczos and block Golub–Kahan reduction methods applied to discrete ill‐posed problems5
Minimizing convex quadratics with variable precision conjugate gradients5
Accurate bidiagonal decomposition of collocation matrices of weighted ϕ‐transformed systems5
Efficient Krylov subspace methods for uncertainty quantification in large Bayesian linear inverse problems5
GPBi‐CGstab(L): A Lanczos‐type product method unifying Bi‐CGstab(L) and GPBi‐CG5
HILUCSI: Simple, robust, and fast multilevel ILU for large‐scale saddle‐point problems from PDEs4
The Sherman–Morrison–Woodbury formula for generalized linear matrix equations and applications4
Effectiveness and robustness revisited for a preconditioning technique based on structured incomplete factorization4
Computing eigenvalues of quasi‐rational Bernstein–Vandermonde matrices to high relative accuracy4
A randomized generalized low rank approximations of matrices algorithm for high dimensionality reduction and image compression4
Numerical study in stochastic homogenization for elliptic partial differential equations: Convergence rate in the size of representative volume elements4
A Rayleigh quotient‐gradient neural network method for computing ?‐eigenpairs of general tensors4
Summation pollution of principal component analysis and an improved algorithm for location sensitive data4
Block low‐rank single precision coarse grid solvers for extreme scale multigrid methods4
Accelerating alternating least squares for tensor decomposition by pairwise perturbation4
Bounds on the spectra of Schur complements of large H‐TFETI‐DP clusters for 2D Laplacian4
Solution methods to the nearest rotation matrix problem in ℝ3: A comparative survey4
Nonoverlapping block smoothers for the Stokes equations4
Fast iterative solver for the optimal control of time‐dependent PDEs with Crank–Nicolson discretization in time4
Low Tucker rank tensor completion using a symmetric block coordinate descent method4
A greedy algorithm for computing eigenvalues of a symmetric matrix with localized eigenvectors4
Computing the matrix geometric mean: Riemannian versus Euclidean conditioning, implementation techniques, and a Riemannian BFGS method4
Estimating posterior quantity of interest expectations in a multilevel scalable framework4
Estimating and increasing the structural robustness of a network4
New bounds on the condition number of the Hessian of the preconditioned variational data assimilation problem3
A hybrid gradient method for strictly convex quadratic programming3
Two‐sided guaranteed bounds to individual eigenvalues of preconditioned finite element and finite difference problems3
Hierarchical adaptive low‐rank format with applications to discretized partial differential equations3
Least squares regression principal component analysis: A supervised dimensionality reduction method3
Incomplete inverse matrices3
ODE‐based double‐preconditioning for solving linear systems Aαx=b and f(A)x=b3
Multilevel space‐time multiplicative Schwarz preconditioner for parabolic equations3
Factorization of completely positive matrices using iterative projected gradient steps3
Smoothed aggregation for difficult stretched mesh and coefficient variation problems3
Structure preserving quaternion full orthogonalization method with applications3
Semiconvergence analysis of the randomized row iterative method and its extended variants3
Algebraic multigrid for systems of elliptic boundary‐value problems3
A conforming auxiliary space preconditioner for the mass conserving stress‐yielding method3
Multilevel graph embedding3
The Lawson‐Hanson algorithm with deviation maximization: Finite convergence and sparse recovery3
NURBS in isogeometric discretization methods: A spectral analysis3
A method for computing the Perron root for primitive matrices3
0.038684129714966