default search action
Will Pazner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Guosheng Fu, Stanley J. Osher, Will Pazner, Wuchen Li
:
Generalized optimal transport and mean field control problems for reaction-diffusion systems with high-order finite element computation. J. Comput. Phys. 508: 112994 (2024) - [j16]Will Pazner
Matrix-Free High-Performance Saddle-Point Solvers for High-Order Problems in \(\boldsymbol{H}(\operatorname{\textbf{div}})\). SIAM J. Sci. Comput. 46(3): 179- (2024) - [i21]Guosheng Fu, Hangjie Ji, Will Pazner, Wuchen Li:
Mean field control of droplet dynamics with high order finite element computations. CoRR abs/2402.05923 (2024) - [i20]Julian Andrej
High-performance finite elements with MFEM. CoRR abs/2402.15940 (2024) - 2023
- [j15]Will Pazner
End-to-end GPU acceleration of low-order-refined preconditioning for high-order finite element discretizations. Int. J. High Perform. Comput. Appl. 37(5): 578-599 (2023) - [j14]Samuel S. Olivier
A family of independent Variable Eddington Factor methods with efficient preconditioned iterative solvers. J. Comput. Phys. 473: 111747 (2023) - [j13]Will Pazner
Low-Order Preconditioning for the High-Order Finite Element de Rham Complex. SIAM J. Sci. Comput. 45(2): 675- (2023) - [i19]Will Pazner, Tzanio V. Kolev, Panayot S. Vassilevski:
Matrix-free GPU-accelerated saddle-point solvers for high-order problems in H(div). CoRR abs/2304.12387 (2023) - [i18]Guosheng Fu, Stanley J. Osher, Will Pazner, Wuchen Li:
Generalized optimal transport and mean field control problems for reaction-diffusion systems with high-order finite element computation. CoRR abs/2306.06287 (2023) - 2022
- [j12]Tzanio V. Kolev
Conservative and Accurate Solution Transfer Between High-Order and Low-Order Refined Finite Element Spaces. SIAM J. Sci. Comput. 44(1): 1- (2022) - [j11]Ben S. Southworth
Fast Solution of Fully Implicit Runge-Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part I: the Linear Setting. SIAM J. Sci. Comput. 44(1): 416- (2022) - [j10]Ben S. Southworth
Fast Solution of Fully Implicit Runge-Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part II: Nonlinearities and DAEs. SIAM J. Sci. Comput. 44(2): 636- (2022) - [d4]Jed Brown
libCEED: Efficient Extensible Discretization. Zenodo, 2022 - [i17]Andrés M. Rueda-Ramírez, Will Pazner, Gregor J. Gassner:
Subcell limiting strategies for discontinuous Galerkin spectral element methods. CoRR abs/2202.00576 (2022) - [i16]Milan Holec, Ben Zhu, Ilon Joseph, Christopher J. Vogl, Ben S. Southworth, Alejandro Campos, Andris M. Dimits, Will E. Pazner:
Arbitrary Order Energy and Enstrophy Conserving Finite Element Methods for 2D Incompressible Fluid Dynamics and Drift-Reduced Magnetohydrodynamics. CoRR abs/2202.13022 (2022) - [i15]Will Pazner, Tzanio V. Kolev, Clark R. Dohrmann:
Low-order preconditioning for the high-order finite element de Rham complex. CoRR abs/2203.02465 (2022) - [i14]Will Pazner, Tzanio V. Kolev, Jean-Sylvain Camier:
End-to-end GPU acceleration of low-order-refined preconditioning for high-order finite element discretizations. CoRR abs/2210.12253 (2022) - 2021
- [j9]Robert W. Anderson
MFEM: A modular finite element methods library. Comput. Math. Appl. 81: 42-74 (2021) - [j8]Tzanio V. Kolev
Efficient exascale discretizations: High-order finite element methods. Int. J. High Perform. Comput. Appl. 35(6): 527-552 (2021) - [j7]Will Pazner
A short note on the accuracy of the discontinuous Galerkin method with reentrant faces. J. Comput. Phys. 443: 110448 (2021) - [j6]Jed Brown
libCEED: Fast algebra for high-order element-based discretizations. J. Open Source Softw. 6(63): 2945 (2021) - [d3]Jed Brown
CEED/libCEED: v0.9.0. Zenodo, 2021 - [d2]Jed Brown
libCEED: Efficient Extensible Discretization. Zenodo, 2021 - [d1]Jed Brown
libCEED: Efficient Extensible Discretization. Zenodo, 2021 - [i13]Ben S. Southworth, Oliver A. Krzysik, Will Pazner, Hans De Sterck:
Fast parallel solution of fully implicit Runge-Kutta and discontinuous Galerkin in time for numerical PDEs, Part I: the linear setting. CoRR abs/2101.00512 (2021) - [i12]Ben S. Southworth, Oliver A. Krzysik, Will Pazner:
Fast parallel solution of fully implicit Runge-Kutta and discontinuous Galerkin in time for numerical PDEs, Part II: nonlinearities and DAEs. CoRR abs/2101.01776 (2021) - [i11]Stefanie Günther, Will Pazner, Dongping Qi:
Spline parameterization of neural network controls for deep learning. CoRR abs/2103.00301 (2021) - [i10]Tzanio V. Kolev, Will Pazner:
Conservative and accurate solution transfer between high-order and low-order refined finite element spaces. CoRR abs/2103.05283 (2021) - [i9]Will Pazner, Terry S. Haut:
A short note on the accuracy of the discontinuous Galerkin method with reentrant faces. CoRR abs/2104.08339 (2021) - [i8]Tzanio V. Kolev, Paul F. Fischer, Misun Min, Jack J. Dongarra, Jed Brown, Veselin Dobrev, Tim Warburton, Stanimire Tomov, Mark S. Shephard, Ahmad Abdelfattah, Valeria Barra, Natalie Beams, Jean-Sylvain Camier, Noel Chalmers, Yohann Dudouit, Ali Karakus, Ian Karlin, Stefan Kerkemeier, Yu-Hsiang Lan, David S. Medina, Elia Merzari, Aleksandr Obabko, Will Pazner, Thilina Rathnayake, Cameron W. Smith, Lukas Spies, Kasia Swirydowicz, Jeremy L. Thompson, Ananias Tomboulides, Vladimir Z. Tomov:
Efficient Exascale Discretizations: High-Order Finite Element Methods. CoRR abs/2109.04996 (2021) - [i7]Samuel S. Olivier, Will Pazner, Terry S. Haut, Ben C. Yee:
A Family of Independent Variable Eddington Factor Methods with Efficient Linear Solvers. CoRR abs/2111.12255 (2021) - 2020
- [j5]Daniel Zhengyu Huang
High-order partitioned spectral deferred correction solvers for multiphysics problems. J. Comput. Phys. 412: 109441 (2020) - [j4]Will Pazner
Efficient Low-Order Refined Preconditioners for High-Order Matrix-Free Continuous and Discontinuous Galerkin Methods. SIAM J. Sci. Comput. 42(5): A3055-A3083 (2020) - [i6]Will Pazner:
Sparse invariant domain preserving discontinuous Galerkin methods with subcell convex limiting. CoRR abs/2004.08503 (2020) - [i5]Will Pazner, Tzanio V. Kolev:
Uniform subspace correction preconditioners for discontinuous Galerkin methods with hp-refinement. CoRR abs/2009.01287 (2020)
2010 – 2019
- 2019
- [j3]Will Pazner
Analysis and Entropy Stability of the Line-Based Discontinuous Galerkin Method. J. Sci. Comput. 80(1): 376-402 (2019) - [i4]Will Pazner:
Efficient low-order refined preconditioners for high-order matrix-free continuous and discontinuous Galerkin methods. CoRR abs/1908.07071 (2019) - [i3]Daniel Zhengyu Huang, Will Pazner, Per-Olof Persson, Matthew J. Zahr:
High-order partitioned spectral deferred correction solvers for multiphysics problems. CoRR abs/1909.01977 (2019) - [i2]Michael Franco, Jean-Sylvain Camier, Julian Andrej, Will Pazner:
High-order matrix-free incompressible flow solvers with GPU acceleration and low-order refined preconditioners. CoRR abs/1910.03032 (2019) - [i1]Robert W. Anderson, Julian Andrej, Andrew T. Barker, Jamie A. Bramwell, Jean-Sylvain Camier, Jakub Cervený, Veselin Dobrev, Yohann Dudouit, Aaron Fisher, Tzanio V. Kolev, Will Pazner, Mark Stowell, Vladimir Z. Tomov, Johann Dahm, David S. Medina, Stefano Zampini
MFEM: a modular finite element methods library. CoRR abs/1911.09220 (2019) - 2018
- [j2]Will Pazner
Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods. J. Comput. Phys. 354: 344-369 (2018) - 2017
- [j1]Will Pazner
Stage-parallel fully implicit Runge-Kutta solvers for discontinuous Galerkin fluid simulations. J. Comput. Phys. 335: 700-717 (2017)
Coauthor Index
aka: Jean-Sylvain Camier
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-10-31 20:12 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: