GENERIC APPROXIMATE SPARSE INVERSE MATRIX TECHNIQUES

DOI10.1142/S0219876213500849zbMath1359.65042MaRDI QIDQ2971954

George A. Gravvanis, Christos K. Filelis-Papadopoulos

Publication date: 7 April 2017

Published in: International Journal of Computational Methods (Search for Journal in Brave)

zbMATH Keywords

sparse linear systemsincomplete factorizationconjugate gradient type methodsapproximate inverse sparsity patternsgeneric approximate inverse matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Preconditioners for iterative methods (65F08)

Related Items (4)

Parallel \(N\)-body simulation based on the PM and P3M methods using multigrid schemes in conjunction with generic approximate sparse inverses ⋮ Parallel Schur Complement Techniques Based on Multiprojection Methods ⋮ A Class of Symmetric Factored Approximate Inverses and Hybrid Two-Level Solver ⋮ Distributed algebraic tearing and interconnecting techniques

Uses Software

• BiCGstab
• GenASPI

Cites Work

• Unnamed Item
• Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors
• High performance inverse preconditioning
• Explicit preconditioned iterative methods for solving large unsymmetric finite element systems
• The rate of convergence of explicit approximate inverse preconditioning
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Factorized Sparse Approximate Inverse Preconditionings I. Theory
• Parallel Preconditioning with Sparse Approximate Inverses
• A Multigrid Tutorial, Second Edition
• A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
• Iterative Solution Methods
• The Use of Pre-conditioning in Iterative Methods for Solving Linear Equations with Symmetric Positive Definite Matrices

This page was built for publication: GENERIC APPROXIMATE SPARSE INVERSE MATRIX TECHNIQUES