English
Related papers

Related papers: Partial Reuse AMG Setup Cost Amortization Strategy…

200 papers

Algebraic multigrid (AMG) is often an effective solver for symmetric positive definite (SPD) linear systems resulting from the discretization of general elliptic PDEs, or the spatial discretization of parabolic PDEs. However, convergence…

Numerical Analysis · Mathematics 2019-09-10 Thomas A. Manteuffel , Steffen Munzenmaier , John Ruge , Ben S. Southworth

In this study we construct a time-space finite element (FE) scheme and furnish cost-efficient approximations for one-dimensional multi-term time fractional advection diffusion equations on a bounded domain $\Omega$. Firstly, a fully…

Numerical Analysis · Mathematics 2017-08-08 Xiaoqiang Yue , Yehong Xu , Shi Shu , Menghuan Liu , Weiping Bu

The performance of finite element solvers on modern computer architectures is typically memory bound for sufficiently large problems. The main cause for this is that loading matrix elements from RAM into CPU cache is significantly slower…

Numerical Analysis · Mathematics 2019-05-01 Denis Davydov , Jean-Paul Pelteret , Daniel Arndt , Paul Steinmann

This paper introduces bootstrap multigrid methods for solving eigenvalue problems arising from the discretization of partial differential equations. Inspired by the full bootstrap algebraic multigrid (BAMG) setup algorithm that includes an…

Numerical Analysis · Mathematics 2023-01-11 James Brannick , Shuhao Cao

Gradient descent is an important class of iterative algorithms for minimizing convex functions. Classically, gradient descent has been a sequential and synchronous process. Distributed and asynchronous variants of gradient descent have been…

Optimization and Control · Mathematics 2014-12-02 Yun Kuen Cheung , Richard Cole

Preconditioning is at the core of modern many-fermion Monte Carlo algorithms, such as Hybrid Monte Carlo, where the repeated solution of a linear problem involving an ill-conditioned matrix is needed. We report on a performance comparison…

High Energy Physics - Lattice · Physics 2010-08-24 Timour Ten , Joaquín E. Drut , Timo A. Lähde

In this paper we develop a new technique, called \textit{state redistribution}, that allows the use of explicit time stepping when approximating solutions to hyperbolic conservation laws on embedded boundary grids. State redistribution is a…

Numerical Analysis · Mathematics 2021-02-03 Marsha Berger , Andrew Giuliani

Iterative majorize-minimize (MM) (also called optimization transfer) algorithms solve challenging numerical optimization problems by solving a series of "easier" optimization problems that are constructed to guarantee monotonic descent of…

Computation · Statistics 2015-10-23 Madison G. McGaffin , Jeffrey A. Fessler

Obtainable computational efficiency is evaluated when using an Adaptive Mesh Refinement (AMR) strategy in time accurate simulations governed by sets of conservation laws. For a variety of 1D, 2D, and 3D hydro- and magnetohydrodynamic…

Astrophysics · Physics 2009-11-10 R. Keppens , M. Nool , G. Toth , J. P. Goedbloed

Algebraic multigrid (AMG) is known to be an effective solver for many sparse symmetric positive definite (SPD) linear systems. For SPD systems, the convergence theory of AMG is well-understood in terms of the $A$-norm, but in a nonsymmetric…

Numerical Analysis · Mathematics 2025-01-14 Ahsan Ali , James Brannick , Karsten Kahl , Oliver A. Krzysik , Jacob B. Schroder , Ben S. Southworth

When numerically solving partial differential equations, for a given problem and operating condition, adaptive mesh refinement (AMR) has proven its efficiency to automatically build a discretization achieving a prescribed accuracy at low…

Efficient structural reanalysis for high-rank modification plays an important role in engineering computations which require repeated evaluations of structural responses, such as structural optimization and probabilistic analysis. To…

Computational Engineering, Finance, and Science · Computer Science 2025-05-20 Wenxiong Li , Suiyin Chen , Huan Huang

Algebraic Multigrid (AMG) is one of the most used iterative algorithms for solving large sparse linear equations $Ax=b$. In AMG, the coarse grid is a key component that affects the efficiency of the algorithm, the construction of which…

Numerical Analysis · Mathematics 2023-08-17 Haifeng Zou , Xiaowen Xu , Chen-Song Zhang , Zeyao Mo

In structurally constrained molecular optimization, state-of-the-art methods restart an expensive oracle-driven search from scratch for every new input structure, scaling poorly to settings with many starting structures or expensive…

A novel approach is presented to recover an image degraded by atmospheric turbulence. Given a sequence of frames affected by turbulence, we construct a variational model to characterize the static image. The optimization problem is solved…

Computer Vision and Pattern Recognition · Computer Science 2024-11-05 Yu Mao , Jerome Gilles

Across infrastructure domains, physical damage caused by storms and other weather events often requires costly and time-sensitive repairs to restore services as quickly as possible. While recent studies have used agent-based models to…

Multiagent Systems · Computer Science 2022-08-09 Anakin Dey , Melkior Ornik

Algebraic multigrid (AMG) solvers and preconditioners are some of the fastest numerical methods to solve linear systems, particularly in a parallel environment, scaling to hundreds of thousands of cores. Most AMG methods and theory assume a…

Numerical Analysis · Mathematics 2019-03-04 Ben S. Southworth , Thomas A. Manteuffel , John Ruge

Multiphase flows are an important class of fluid flow and their study facilitates the development of diverse applications in industrial, natural, and biomedical systems. We consider a model that uses a continuum description of both phases…

Fluid Dynamics · Physics 2025-08-04 Bindi M. Nagda , Aaron Barrett , Boyce E. Griffith , Aaron L. Fogelson , Jian Du

The use of multigrid and related preconditioners with the finite element method is often limited by the difficulty of applying the algorithm effectively to a problem, especially when the domain has a complex shape or adaptive refinement. We…

Numerical Analysis · Computer Science 2015-03-19 Peter R. Brune , Matthew G. Knepley , L. Ridgway Scott

The reduction of computational costs in the numerical solution of nonstationary problems is achieved through splitting schemes. In this case, solving a set of less computationally complex problems provides the transition to a new level in…

Numerical Analysis · Mathematics 2022-10-26 Petr N. Vabishchevich