Preconditioning the Poincaré-Steklov operator by using Green's function
From MaRDI portal
Publication:5691004
DOI10.1090/S0025-5718-97-00799-0zbMath0854.65100OpenAlexW2080576154MaRDI QIDQ5691004
Publication date: 9 January 1997
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-97-00799-0
Green's functionSchur complementdomain decompositionmultigridpreconditionerPoincaré-Steklov operator
Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Iterative numerical methods for linear systems (65F10)
Related Items
\(\mathbf H\)-based \(\mathbf A\)-\(\phi\) approaches of approximating eddy current problem by way of solving different systems inside and outside the conductor, A D-N alternating algorithm for solving 3D exterior Helmholtz problems, Preconditioned iteration for saddle-point systems with bound constraints arising in contact problems, The second-order shape derivative of Kohn-Vogelius-type cost functional using the boundary differentiation approach, Convergence analysis of optimization-based domain decomposition methods for a bonded structure, Error estimates for variational normal derivatives and Dirichlet control problems with energy regularization, Finite Element Error Estimates for Normal Derivatives on Boundary Concentrated Meshes, Multilevel methods for the \(h\)-, \(p\)-, and \(hp\)-versions of the boundary element method
Cites Work
- A Domain Decomposition Algorithm Using a Hierarchical Basis
- An Iterative Method for Elliptic Problems on Regions Partitioned into Substructures
- The Construction of Preconditioners for Elliptic Problems by Substructuring. II
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- The Construction of Preconditioners for Elliptic Problems by Substructuring, IV
- A Domain Decomposition Preconditioner Based on a Change to a Multilevel Nodal Basis
- An Optimal Domain Decomposition Preconditioner for the Finite Element Solution of Linear Elasticity Problems
- Iterative Methods by Space Decomposition and Subspace Correction
- Domain Decomposition Algorithms with Small Overlap
- The Construction of Preconditioners for Elliptic Problems by Substructuring. I
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item