Distributed algebraic tearing and interconnecting techniques
type: Item
instance of: scholarly article
title: Distributed algebraic tearing and interconnecting techniques
author: N. A. Tselepidis
author: Christos K. Filelis-Papadopoulos
author: George A. Gravvanis
published in: Numerical Algorithms
publication date: 2019-11-08T00:00:00Z
Mathematics Subject Classification ID: 65-XX
zbMATH DE Number: 7128067
zbMATH Keywords: algebraic tearing and interconnecting
zbMATH Keywords: domain decomposition
zbMATH Keywords: hybrid parallel preconditioned Bi-CGSTAB
describes a project that uses: BoomerAMG
describes a project that uses: PSPIKE+
describes a project that uses: CSparse
describes a project that uses: SparseMatrix
describes a project that uses: SchurRAS
describes a project that uses: GenASPI
describes a project that uses: PSPIKE
describes a project that uses: LAPACK
describes a project that uses: PARDISO
describes a project that uses: SPIKE
describes a project that uses: MPI
MaRDI profile type: MaRDI publication profile
full work available at URL: s11075-018-0628-6
OpenAlex ID: W2903165867
cites work: An Approximate Minimum Degree Ordering Algorithm
cites work: Iterative Solution Methods
cites work: Preconditioning techniques for large linear systems: A survey
cites work: A comparative study of sparse approximate inverse preconditioners
cites work: Direct Methods for Sparse Linear Systems
cites work: The university of Florida sparse matrix collection
cites work: A Preconditioner for Substructuring Based on Constrained Energy Minimization
cites work: FETI-DP: A dual-prime unified FETI method. I: A faster alternative to the two-level FETI method
cites work: A method of finite element tearing and interconnecting and its parallel solution algorithm
cites work: GENERIC APPROXIMATE SPARSE INVERSE MATRIX TECHNIQUES
cites work: Sparse Approximations of the Schur Complement for Parallel Algebraic Hybrid Solvers in 3D
cites work: Q4917542
cites work: Parallel Preconditioning with Sparse Approximate Inverses
cites work: \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner
cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
cites work: Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
cites work: Highly scalable parallel domain decomposition methods with an application to biomechanics
cites work: Basic Linear Algebra Subprograms for Fortran Usage
cites work: Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
cites work: Schur complement-based domain decomposition preconditioners with low-rank corrections
cites work: SchurRAS: A Restricted Version of the Overlapping Schur Complement Preconditioner
cites work: Balancing domain decomposition
cites work: A domain-decomposing parallel sparse linear system solver
cites work: Domain decomposition methods for the numerical solution of partial differential equations
cites work: A tearing-based hybrid parallel sparse linear system solver
cites work: Computing the block triangular form of a sparse matrix
cites work: Q4414854
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors
cites work: Q4737758
cites work: Q4716273
cites work: Q4825126
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
cites work: Iterative Krylov Methods for Large Linear Systems
cites work: \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers
Wikidata QID: Q128879101
DOI: 10.1007/S11075-018-0628-6
description: scientific article; zbMATH DE number 7128067