When does two-grid optimality carry over to the V-cycle? - Artem Napov; Yvan Notay (Numer. Linear Algebra Appl., 2010)

Algebraic analysis of aggregation-based multigrid. - Artem Napov; Yvan Notay (Numer. Linear Algebra Appl., 2011)

Smoothing factor, order of prolongation and actual multigrid convergence. - Artem Napov; Yvan Notay (Numerische Mathematik, 2011)

An Algebraic Multigrid Method with Guaranteed Convergence Rate. - Artem Napov; Yvan Notay (SIAM J. Sci. Comput., 2012)

Conditioning Analysis of Incomplete Cholesky Factorizations with Orthogonal Dropping. - Artem Napov (SIAM J. Matrix Anal. Appl., 2013)

Algebraic Multigrid for Moderate Order Finite Elements. - Artem Napov; Yvan Notay (SIAM J. Sci. Comput., 2014)

Special issue on multigrid methods. - Artem Napov; Yvan Notay; Stefan Vandewalle (Comput. Vis. Sci., 2015)

An efficient multi-core implementation of a novel HSS-structured multifrontal solver using randomized sampling. - Pieter Ghysels; Xiaoye S. Li; François-Henry Rouet; Samuel Williams 001; Artem Napov (CoRR, 2015)

A massively parallel solver for discrete Poisson-like problems. - Yvan Notay; Artem Napov (J. Comput. Phys., 2015)

An algebraic multifrontal preconditioner that exploits the low-rank property. - Artem Napov; Xiaoye S. Li (Numer. Linear Algebra Appl., 2016)

An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling. - Pieter Ghysels; Xiaoye S. Li; François-Henry Rouet; Samuel Williams 001; Artem Napov (SIAM J. Sci. Comput., 2016)

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization. - François-Henry Rouet; Xiaoye S. Li; Pieter Ghysels; Artem Napov (ACM Trans. Math. Softw., 2016)

A divide-and-conquer bound for aggregate's quality and algebraic connectivity. - Artem Napov (Discret. Math., 2017)

An Efficient Multigrid Method for Graph Laplacian Systems II: Robust Aggregation. - Artem Napov; Yvan Notay (SIAM J. Sci. Comput., 2017)

A Hybrid a-φ Cell Method for Solving Eddy-Current Problems in 3-D Multiply-Connected Domains. - Federico Moro; Artem Napov; Lorenzo Codecasa (IEEE Access, 2021)

Fast Solution of 3-D Eddy-Current Problems in Multiply Connected Domains by a, v-φ and t-φ Formulations With Multigrid-Based Algorithm for Cohomology Generation. - Federico Moro; Artem Napov; Matti Pellikka; Jasmin Smajic; Lorenzo Codecasa (IEEE Access, 2022)

An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations. - Artem Napov (SIAM J. Sci. Comput., 2023)

Algebraic Multigrid Using a Stencil-CSR Hybrid Format on GPUs. - Siham Boukhris; Artem Napov; Yvan Notay (SIAM J. Sci. Comput., 2023)

Linear-Time Solution of 3D Magnetostatics With Aggregation-Based Algebraic Multigrid Solvers. - Federico Moro; Lorenzo Codecasa; Artem Napov (IEEE Access, 2024)