Distributed algebraic tearing and interconnecting techniques
From MaRDI portal
Publication:2334804
DOI10.1007/S11075-018-0628-6OpenAlexW2903165867WikidataQ128879101 ScholiaQ128879101MaRDI QIDQ2334804FDOQ2334804
Authors: N. A. Tselepidis, Christos K. Filelis-Papadopoulos, George A. Gravvanis 
Publication date: 8 November 2019
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-018-0628-6
Cites Work
- \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner
- FETI-DP: A dual-prime unified FETI method. I: A faster alternative to the two-level FETI method
- The University of Florida sparse matrix collection
- SchurRAS: A Restricted Version of the Overlapping Schur Complement Preconditioner
- Direct Methods for Sparse Linear Systems
- Preconditioning techniques for large linear systems: A survey
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Title not available (Why is that?)
- An Approximate Minimum Degree Ordering Algorithm
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Title not available (Why is that?)
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Title not available (Why is that?)
- Balancing domain decomposition
- A method of finite element tearing and interconnecting and its parallel solution algorithm
- Basic Linear Algebra Subprograms for Fortran Usage
- Parallel Preconditioning with Sparse Approximate Inverses
- Iterative Solution Methods
- Highly scalable parallel domain decomposition methods with an application to biomechanics
- A domain-decomposing parallel sparse linear system solver
- Title not available (Why is that?)
- Domain decomposition methods for the numerical solution of partial differential equations
- Iterative Krylov Methods for Large Linear Systems
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- A Preconditioner for Substructuring Based on Constrained Energy Minimization
- Title not available (Why is that?)
- Computing the block triangular form of a sparse matrix
- Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors
- A comparative study of sparse approximate inverse preconditioners
- \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers
- A tearing-based hybrid parallel sparse linear system solver
- Generic approximate sparse inverse matrix techniques
- Schur complement-based domain decomposition preconditioners with low-rank corrections.
- Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
- Sparse approximations of the Schur complement for parallel algebraic hybrid solvers in 3D
Cited In (1)
Uses Software
This page was built for publication: Distributed algebraic tearing and interconnecting techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334804)
