Solving unsymmetric sparse systems of linear equations with PARDISO

By Olaf Schenk, Klaus Gärtner. Future generations computer systems, 2002

1,616 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/207c7306f2707ea4010c40ddf3d5aa102756b750

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Computer Networks and Communications

In Hardware and Architecture

Citations in the corpus

Steady bubble rise and deformation in Newtonian and viscoplastic fluids and conditions for bubble entrapment (2008, methodology): “The Jacobian matrix that results after each Newton iteration is stored in Compressed Sparse Row (CSR) format and the linearized system is solved by Gaussian elimination using PARDISO, a robust, direct, sparsematrix solver, Schenk & Gärtner (2004, 2006).”
Floquet–Bloch decomposition for the computation of dispersion of two-dimensional periodic, damped mechanical systems ☆ (2011, neutral): “The ARPACK routines must perform several matrix-vector multiplications Cv , which are accomplished here by solving the linear system Ax = Bv using the PARDISO solver developed by Schenk and Gärtner (2004).”
Topology optimization of a pseudo 3D thermofluid heat sink model (2018, positive): “The parallel sparse direct solver PARDISO [43] that is available in COMSOL is used to solve the system of discretized ﬁnite element equations and segregated solver steps are used for the ﬂuid problem, thermal problem, and ﬁlter PDE.”
Electrokinetic locomotion due to reaction-induced charge auto-electrophoresis (2010, methodology): “In particular, we implement the pardiso linear system solver developed by Schenk & Gärtner (2004, 2006).”
RAPter (2015, methodology): “We also used [Rusu and Cousins 2011; Schenk and Gärtner 2004] in our implementation.”
Simultaneous FETI and block FETI: Robust domain decomposition with multiple search directions (2015, methodology): “For instance, for a finite element sparse matrix of dimension 200 000 on a 12-core Intel Nehalem processor, Santa Clara, California, US, the time for a single forward–backward substitution on a single core is 0:7 s with the Intel Pardiso [55] solver, whereas the time for 12 simultaneous forward–back”
A three-dimensional cohesive-frictional grain-boundary micromechanical model for intergranular degradation and failure in polycrystalline materials (2013, background): “org/; [114, 115]), which is included in the Intel R ⃝ Math Kernel Library.”
Efficient simulation of multi‐body contact problems on complex geometries: A flexible decomposition approach using constrained minimization (2009, methodology): “Even though the local shape of master and slave side and, especially, of the actual contact zone varies, the methods from Section 4 yield a discrete solution of the multi-body contact problem with smooth contact stresses and optimal convergence.”