相关论文: Uniform convergence of V-cycle multigrid algorithm…

In the past decades, multigrid methods for linear systems having multilevel Toeplitz coefficient matrices with scalar entries have been largely studied. On the other hand, only few papers have investigated the case of block entries, where…

We present novel improvements in the context of symbol-based multigrid procedures for solving large block structured linear systems. We study the application of an aggregation-based grid transfer operator that transforms the symbol of a…

The nonlocal problems have been used to model very different applied scientific phenomena, which involve the fractional Laplacian when one looks at the L\'{e}vy processes and stochastic interfaces. This paper deals with the nonlocal…

In this paper we analyse the convergence properties of V-cycle multigrid algorithms for the numerical solution of the linear system of equations arising from discontinuous Galerkin discretization of second-order elliptic partial…

Algebraic multigrid (AMG) is one of the most efficient iterative methods for solving large sparse system of equations. However, how to build/check restriction and prolongation operators in practical of AMG methods for nonsymmetric {\em…

In this article a theoretical framework for the Galerkin finite element approximation to the time-dependent Riesz tempered fractional problem is provided without the fractional regularity assumption. Because the time-dependent problems…

We consider a multi-block separable convex optimization problem with the linear constraints, where the objective function is the sum of m individual convex functions without overlapping variables. The linearized version of the generalized…

It is known that the solution of a conservative steady-state two-sided fractional diffusion problem can exhibit singularities near the boundaries. As consequence of this, and due to the conservative nature of the problem, we adopt a finite…

By applying the linearly implicit conservative difference scheme proposed in [D.-L. Wang, A.-G. Xiao, W. Yang. J. Comput. Phys. 2014;272:670-681], the system of repulsive space fractional coupled nonlinear Schr\"odinger equations leads to a…

We introduce a linear-time algorithm for computing the Frobenius normal form (FNF) of symmetric Toeplitz matrices by utilizing their inherent structural properties through a graph-theoretic approach. Previous results of the authors…

In this paper, we provide explicit formulas for the exact inverses of the symmetric tridiagonal near-Toeplitz matrices characterized by weak diagonal dominance in the Toeplitz part. Furthermore, these findings extend to scenarios where the…

In the literature, there exist several studies on symbol-based multigrid methods for the solution of linear systems having structured coefficient matrices. In particular, the convergence analysis for such methods has been obtained in an…

We develop a new meshfree geometric multilevel (MGM) method for solving linear systems that arise from discretizing elliptic PDEs on surfaces represented by point clouds. The method uses a Poisson disk sampling-type technique for coarsening…

This paper presents two universal algorithms for generalized Bellman equations with symmetric Toeplitz matrix. The algorithms are semiring extensions of two well-known methods solving Toeplitz systems in the ordinary linear algebra.

We propose a robust, adaptive coarse-grid correction scheme for matrix-free geometric multigrid targeting PDEs with strongly varying coefficients. The method combines uniform geometric coarsening of the underlying grid with heterogeneous…

In the present work, we consider weakly-singular integral equations arising from linear second-order strongly-elliptic PDE systems with constant coefficients, including, e.g., linear elasticity. We introduce a general framework for optimal…

We develop continuous time Markov chain (CTMC) approximation of one-dimensional diffusions with a lower sticky boundary. Approximate solutions to the action of the Feynman-Kac operator associated with a sticky diffusion and first passage…

Starting from the spectral analysis of g-circulant matrices, we consider a new multigrid method for circulant and Toeplitz matrices with given generating function. We assume that the size n of the coefficient matrix is divisible by g \geq 2…

The Local Fourier analysis (LFA) is a classic tool to prove convergence theorems for multigrid methods (MGMs). In particular, we are interested in optimality that is a convergence speed independent of the size of the involved matrices. For…

We develop and analyze the Generalized Multiplicative Gradient (GMG) method for solving a class of convex optimization problems over symmetric cones, where the objective function does not have Lipschitz gradient over the feasible region.…