Iterative solution of spatial network models by subspace decomposition
From MaRDI portal
conjugate gradientnetwork modelpreconditioneriterative methodalgebraic connectivitysubspace decompositionisoparametric dimension
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Connectivity (05C40) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Abstract: We present and analyze a preconditioned conjugate gradient method (PCG) for solving spatial network problems. Primarily, we consider diffusion and structural mechanics simulations for fiber based materials, but the methodology can be applied to a wide range of models, fulfilling a set of abstract assumptions. The proposed method builds on a classical subspace decomposition into a coarse subspace, realized as the restriction of a finite element space to the nodes of the spatial network, and localized subspaces with support on mesh stars. The main contribution of this work is the convergence analysis of the proposed method. The analysis translates results from finite element theory, including interpolation bounds, to the spatial network setting. A convergence rate of the PCG algorithm, only depending on global bounds of the operator and homogeneity, connectivity and locality constants of the network, is established. The theoretical results are confirmed by several numerical experiments.
Recommendations
- Numerical homogenization of spatial network models
- Super-localization of spatial network models
- Mathematical Programming and Electrical Network Analysis II: Computational Linear Algebra through Network analysis
- Iterative Methods by Space Decomposition and Subspace Correction
- Preconditioned iterative methods on sparse subspaces
Cites work
- scientific article; zbMATH DE number 2133152 (Why is no real title available?)
- scientific article; zbMATH DE number 3574872 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 949303 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A posteriori error estimates for multilevel methods for graph Laplacians
- A review of algebraic multigrid
- AMGe based on element agglomeration
- Algebraic multigrid methods
- Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs
- An algebraic multigrid method with guaranteed convergence rate
- An analysis of a class of variational multiscale methods based on subspace decomposition
- An efficient multigrid method for graph Laplacian systems
- Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations
- Computation of eigenvalues by numerical upscaling
- Domain decomposition for multiscale PDEs
- Edge isoperimetric inequalities for product graphs
- Eigenvalues of Graphs and Sobolev Inequalities
- Fast numerical upscaling of heat equation for fibrous materials
- Higher eigenvalues and isoperimetric inequalities on Riemannian manifolds and graphs
- Iterative Methods by Space Decomposition and Subspace Correction
- Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- Multilevel methods for elliptic problems with highly varying coefficients on nonaligned coarse grids
- Numerical Homogenization of Elliptic Multiscale Problems by Subspace Decomposition
- Numerical homogenization by localized orthogonal decomposition
- Numerical upscaling of discrete network models
- The Mathematical Theory of Finite Element Methods
Cited in
(7)- Well-posedness and finite element approximation of mixed dimensional partial differential equations
- Super-localization of spatial network models
- Iterative method for large-scale Timoshenko beam models assessed on commercial-grade paperboard
- Arbitrary order approximations at constant cost for Timoshenko beam network models
- Generalized multiscale finite element method for discrete network (graph) models
- Computational multiscale methods. Abstracts from the workshop held April 27 -- May 2, 2025
- Numerical homogenization of spatial network models
This page was built for publication: Iterative solution of spatial network models by subspace decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076243)
