3k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR60 papers
- Kootenay Association for Science & TechnologyCA40 papers
- Chinese Academy of SciencesCN33 papers
- Texas A&M UniversityUS32 papers
- RWTH Aachen UniversityDE30 papers
- King Fahd University of Petroleum and MineralsSA29 papers
- TU WienAT25 papers
- National University of SingaporeSG24 papers
- The University of Texas at AustinUS24 papers
- University of OxfordGB23 papers
- Georgia Institute of TechnologyUS22 papers
- Aix-Marseille UniversitéFR20 papers
14 papers · 2 filters
A direct solver with reutilization of previously-computed LU factorizations for h-adaptive finite element grids with point singularities
Maciej Paszynski, Victor Calo, David Pardo
This paper describes a direct solver algorithm for a sequence of finite element meshes that are h-refined towards one or several point singularities. For such a sequence of grids,…
Numerical simulation of cylindrical solitary waves in periodic media
Manuel Quezada de Luna David I. Ketcheson
We study the behavior of nonlinear waves in a two-dimensional medium with density and stress relation that vary periodically in space. Efficient approximate Riemann solvers are dev…
An FMM Based on Dual Tree Traversal for Many-core Architectures
Rio Yokota
The present work attempts to integrate the independent efforts in the fast N-body community to create the fastest N-body library for many-core and heterogenous architectures. Focus…
Fractional order differentiation by integration with Jacobi polynomials
Da-Yan Liu, Olivier Gibaru, Wilfrid Perruquetti +1
The differentiation by integration method with Jacobi polynomials was originally introduced by Mboup, Join and Fliess. This paper generalizes this method from the integer order to…
A Combined Preconditioning Strategy for Nonsymmetric Systems
Blanca Ayuso de Dios, Andrew T. Barker, Panayot S. Vassilevski
We present and analyze a class of nonsymmetric preconditioners within a normal (weighted least-squares) matrix form for use in GMRES to solve nonsymmetric matrix problems that typi…
A low memory, highly concurrent multigrid algorithm
Mark F. Adams
We examine what is an efficient and scalable nonlinear solver, with low work and memory complexity, for many classes of discretized partial differential equations (PDEs) - matrix-f…
Optimized explicit Runge-Kutta schemes for the spectral difference method applied to wave propagation problems
M. Parsani, D. I. Ketcheson, W. Deconinck
Explicit Runge-Kutta schemes with large stable step sizes are developed for integration of high order spectral difference spatial discretization on quadrilateral grids. The new sch…
Strong stability preserving explicit Runge-Kutta methods of maximal effective order
Yiannis Hadjimichael, Colin B. Macdonald, David I. Ketcheson +1
We apply the concept of effective order to strong stability preserving (SSP) explicit Runge-Kutta methods. Relative to classical Runge-Kutta methods, methods with an effective orde…
The cost of continuity: performance of iterative solvers on isogeometric finite elements
Nathan Collier, Lisandro Dalcin, David Pardo +1
In this paper we study how the use of a more continuous set of basis functions affects the cost of solving systems of linear equations resulting from a discretized Galerkin weak fo…
Monte Carlo Euler approximations of HJM term structure financial models
Thomas Björk, Anders Szepessy, Raul Tempone +1
We present Monte Carlo-Euler methods for a weak approximation problem related to the Heath-Jarrow-Morton (HJM) term structure model, based on \Ito stochastic differential equations…
Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements
Nathan Collier, David Pardo, Maciej Paszynski +1
The multi-frontal direct solver is the state-of-the-art algorithm for the direct solution of sparse linear systems. This paper provides computational complexity and memory usage es…
Data-Driven Execution of Fast Multipole Methods
Hatem Ltaief, Rio Yokota
Fast multipole methods have O(N) complexity, are compute bound, and require very little synchronization, which makes them a favorable algorithm on next-generation supercomputers. T…
Automatically Stable Discontinuous Petrov-Galerkin Methods for Stationary Transport Problems: Quasi-Optimal Test Space Norm
Antti H. Niemi, Nathaniel O. Collier, Victor M. Calo
We investigate the application of the discontinuous Petrov-Galerkin (DPG) finite element framework to stationary convection-diffusion problems. In particular, we demonstrate how th…
Optimal stability polynomials for numerical integration of initial value problems
David I. Ketcheson, Aron J. Ahmadia
We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial diffe…