default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArtem Napov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Federico Moro
, Lorenzo Codecasa, Artem Napov:
Linear-Time Solution of 3D Magnetostatics With Aggregation-Based Algebraic Multigrid Solvers. IEEE Access 12: 151693-151709 (2024)- 2023
- [j17]Artem Napov:
An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations. SIAM J. Sci. Comput. 45(2): 729- (2023) - [j16]Siham Boukhris, Artem Napov, Yvan Notay:
Algebraic Multigrid Using a Stencil-CSR Hybrid Format on GPUs. SIAM J. Sci. Comput. 45(3): 154-178 (2023) - 2022
- [j15]Federico Moro, Artem Napov, Matti Pellikka, Jasmin Smajic, Lorenzo Codecasa:
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. IEEE Access 10: 112416-112432 (2022) - 2021
- [j14]Federico Moro, Artem Napov, Lorenzo Codecasa:
A Hybrid a-φ Cell Method for Solving Eddy-Current Problems in 3-D Multiply-Connected Domains. IEEE Access 9: 158247-158260 (2021)
2010 – 2019
- 2017
- [j13]Artem Napov:
A divide-and-conquer bound for aggregate's quality and algebraic connectivity. Discret. Math. 340(10): 2355-2365 (2017) - [j12]Artem Napov, Yvan Notay:
An Efficient Multigrid Method for Graph Laplacian Systems II: Robust Aggregation. SIAM J. Sci. Comput. 39(5) (2017) - 2016
- [j11]Artem Napov, Xiaoye S. Li:
An algebraic multifrontal preconditioner that exploits the low-rank property. Numer. Linear Algebra Appl. 23(1): 61-82 (2016) - [j10]Pieter Ghysels, Xiaoye S. Li, François-Henry Rouet, Samuel Williams, Artem Napov:
An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling. SIAM J. Sci. Comput. 38(5) (2016) - [j9]François-Henry Rouet, Xiaoye S. Li, Pieter Ghysels, Artem Napov:
A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization. ACM Trans. Math. Softw. 42(4): 27:1-27:35 (2016) - 2015
- [j8]Artem Napov, Yvan Notay, Stefan Vandewalle:
Special issue on multigrid methods. Comput. Vis. Sci. 17(3): 109 (2015) - [j7]Yvan Notay, Artem Napov:
A massively parallel solver for discrete Poisson-like problems. J. Comput. Phys. 281: 237-250 (2015) - [i2]Pieter Ghysels, Xiaoye S. Li, François-Henry Rouet, Samuel Williams, Artem Napov:
An efficient multi-core implementation of a novel HSS-structured multifrontal solver using randomized sampling. CoRR abs/1502.07405 (2015) - [i1]François-Henry Rouet, Xiaoye S. Li, Pieter Ghysels, Artem Napov:
A distributed-memory package for dense Hierarchically Semi-Separable matrix computations using randomization. CoRR abs/1503.05464 (2015) - 2014
- [j6]Artem Napov, Yvan Notay:
Algebraic Multigrid for Moderate Order Finite Elements. SIAM J. Sci. Comput. 36(4) (2014) - 2013
- [j5]Artem Napov:
Conditioning Analysis of Incomplete Cholesky Factorizations with Orthogonal Dropping. SIAM J. Matrix Anal. Appl. 34(3): 1148-1173 (2013) - 2012
- [j4]Artem Napov, Yvan Notay:
An Algebraic Multigrid Method with Guaranteed Convergence Rate. SIAM J. Sci. Comput. 34(2) (2012) - 2011
- [j3]Artem Napov, Yvan Notay:
Algebraic analysis of aggregation-based multigrid. Numer. Linear Algebra Appl. 18(3): 539-564 (2011) - [j2]Artem Napov, Yvan Notay:
Smoothing factor, order of prolongation and actual multigrid convergence. Numerische Mathematik 118(3): 457-483 (2011) - 2010
- [j1]Artem Napov, Yvan Notay:
When does two-grid optimality carry over to the V-cycle? Numer. Linear Algebra Appl. 17(2-3): 273-290 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
