Efficient Parallel Sparse Triangular Solution Using Selective Inversion

No abstract is available for this paper.

• Publication year

  1998

• Venue

  Parallel Processing Letters

• Publication date

  1998-03-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1142/S0129626498000067
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• No references are available for this paper.

• Unified Communication Optimization Strategies for Sparse Triangular Solver on CPU and GPU Clusters

  2023cites this paper
• Leveraging One-Sided Communication for Sparse Triangular Solvers

  2020cites this paper
• A communication-avoiding 3D sparse triangular solver

  2019cites this paper
• Highly scalable distributed-memory sparse triangular solution algorithms

  2018cites this paper
• Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations

  2016cites this paper
• A survey of direct methods for sparse linear systems

  2016cites this paper
• Structure-adaptive parallel solution of sparse triangular linear systems

  2014cites this paper
• Sweeping preconditioners for elastic wave propagation with spectral element methods

  2014cites this paper
• The method of polarized traces for the 2D Helmholtz equation

  2014cites this paper
• Fast parallel solution of heterogeneous 3D time-harmonic wave equations

  2012cites this paper
• A parallel sweeping preconditioner for frequency-domain seismic wave propagation

  2012cites this paper
• A Parallel Sweeping Preconditioner for Heterogeneous 3D Helmholtz Equations

  2012cites this paper
• Adapting Sparse Triangular Solution to GPUs

  2012cites this paper
• A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations

  2011cites this paper
• FPGA-based Electrical Impedance Tomography

  2011influential citation
• A Hybrid Parallel Preconditioner Using Incomplete Cholesky Factorization and Sparse Approximate Inversion

  2007cites this paper
• A study into the feasibility of using two parallel sparse direct solvers for the Helmholtz equation on Linux clusters

  2006cites this paper
• On the performance of SPAI and ADI-like preconditioners for core collapse supernova simulations in one spatial dimension

  2006cites this paper
• Parallel Hybrid Sparse Solvers Through Flexible Incomplete Cholesky Preconditioning

  2004cites this paper
• SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems

  2003cites this paper
• A latency tolerant hybrid sparse solver using incomplete Cholesky factorization

  2003cites this paper
• An O(n log n) solution algorithm for spectral element methods

  2003cites this paper
• A New Data-Mapping Scheme for Latency-Tolerant Distributed Sparse Triangular Solution

  2002cites this paper
• Automatic Performance Tuning and Analysis of Sparse Triangular Solve

  2002cites this paper
• Scalable Sparse Matrix Techniques for Modeling Crack Growth

  2002influential citation
• Salinas: A Scalable Software for High-Performance Structural and Solid Mechanics Simulations

  2002cites this paper
• Large-Scale Normal Coordinate Analysis on Distributed Memory Parallel Systems

  2002influential citation
• Towards a Scalable Hybrid Sparse Solver

  2000cites this paper
• The Impact of High Performance Computing in the Solution of Linear Systems: Trends and Problems

  2000cites this paper
• Making Sparse Gaussian Elimination Scalable by Static Pivoting

  1998cites this paper
• Sparse numerical linear algebra: Direct methods and preconditioning

  1996cites this paper