相关论文: Multigrid solvers for isogeometric discretizations…
Inspired by multigrid methods for linear systems of equations, multilevel optimization methods have been proposed to solve structured optimization problems. Multilevel methods make more assumptions regarding the structure of the…
We present a new multigrid method called neural multigrid which is based on joining multigrid ideas with concepts from neural nets. The main idea is to use the Greenbaum criterion as a cost functional for the neural net. The algorithm is…
We present an isogeometric collocation method for solving the biharmonic equation over planar bilinearly parameterized multi-patch domains. The developed approach is based on the use of the globally $C^4$-smooth isogeometric spline space…
We design and analyze an iterative two-grid algorithm for the finite element discretizations of strongly nonlinear elliptic boundary value problems in this paper. We propose an iterative two-grid algorithm, in which a nonlinear problem is…
Finding fast yet accurate numerical solutions to the Helmholtz equation remains a challenging task. The pollution error (i.e. the discrepancy between the numerical and analytical wave number k) requires the mesh resolution to be kept fine…
In this paper we construct and analyse a level-dependent coarsegrid correction scheme for indefinite Helmholtz problems. This adapted multigrid method is capable of solving the Helmholtz equation on the finest grid using a series of…
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…
It is well known that multigrid methods are optimally efficient for solution of elliptic equations (O(N)), which means that effort is proportional to the number of points at which the solution is evaluated). Thus this is an ideal method to…
Multigrid is one of the most efficient methods for solving large-scale linear systems that arise from discretized partial differential equations. As a foundation for multigrid analysis, two-grid theory plays an important role in motivating…
The multigrid algorithm is a multilevel approach to accelerate the numerical solution of discretized differential equations in physical problems involving long-range interactions. Multiresolution analysis of wavelet theory provides an…
In a recent work, we analyzed a weighted-residual error estimator for isogeometric boundary element methods in 2D and proposed an adaptive algorithm which steers the local mesh-refinement of the underlying partition as well as the…
In this paper, a novel multigrid method based on Newton iteration is proposed to solve nonlinear eigenvalue problems. Instead of handling the eigenvalue $\lambda$ and eigenfunction $u$ separately, we treat the eigenpair $(\lambda, u)$ as…
A novel and efficient approach which is based on the framework of isogeometric analysis for elliptic homogenization problems is proposed. These problems possess highly oscillating coefficients leading to extremely high computational…
This paper is to introduce a type of full multigrid method for the nonlinear eigenvalue problem. The main idea is to transform the solution of nonlinear eigenvalue problem into a series of solutions of the corresponding linear boundary…
A multigrid method is proposed for solving nonlinear eigenvalue problems by the finite element method. With this new scheme, solving nonlinear eigenvalue problem is decomposed to a series of solutions of linear boundary value problems on…
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…
Multilevel techniques are efficient approaches for solving the large linear systems that arise from discretized partial differential equations and other problems. While geometric multigrid requires detailed knowledge about the underlying…
We develop a basic convergence analysis for an adaptive $\textsf{C}^0\textsf{IPG}$ method for the Biharmonic problem, which provides convergence without rates for all practically relevant marking strategies and all penalty parameters…
Two-grid theory plays a fundamental role in the design and analysis of multigrid methods. This paper is devoted to a new convergence analysis of two-grid methods for singular and symmetric positive semidefinite systems. Specifically, we…
This paper studies the Craig variant of the Golub-Kahan bidiagonalization algorithm as an iterative solver for linear systems with saddle point structure. Such symmetric indefinite systems in 2x2 block form arise in many applications, but…