scientific article; zbMATH DE number 554772
zbMATH Open0797.65035MaRDI QIDQ4288588FDOQ4288588
Authors: Mark Jones, Paul E. Plassmann 
Publication date: 9 October 1994
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1302610
- A Parallel Graph Coloring Heuristic
- scientific article; zbMATH DE number 926693
- A Set of New Mapping and Coloring Heuristics for Distributed-Memory Parallel Processors
- Publication:4730759
- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
- Impact of data distribution on the parallel performance of iterative linear solvers with emphasis on CFD of incompressible flows
- Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
- Aggregation Methods for Solving Sparse Triangular Systems on Multiprocessors
- scientific article; zbMATH DE number 851013
performancesparse matricesiterative methodsparallel algorithmsexperimental resultssuperconductorpreconditioned conjugate gradientssparse linear systemspiezoelectric crystalparallel computersgraph reductionsreorderinglarge-scale applicationsMIMD computersgraph coloring heuristics
Applications of graph theory (05C90) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Iterative numerical methods for linear systems (65F10) Coloring of graphs and hypergraphs (05C15)
Cited In (20)
- A Parallel Graph Coloring Heuristic
- Title not available (Why is that?)
- Fast linear equation solvers in high performance electromagnetic field analysis
- Title not available (Why is that?)
- Efficient VLSI implementation of iterative solutions to sparse linear systems
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
- An efficient variant of gauss-jordan type algorithms for direct and parallel solution of dense linear systems
- Shift-splitting iteration methods for a class of large sparse linear matrix equations
- Title not available (Why is that?)
- Adaptive parameter based matrix splitting iteration method for the large and sparse linear systems
- Design of an iterative solution module for a parallel sparse matrix library (P\_SPARSLIB)
- Iterative methods for solving sparse linear systems with a parallel preconditioner
- Solution of large sparse equation systems by parallel-section method on ES computers
- Parallel frontal solvers for large sparse linear systems
- Title not available (Why is that?)
- Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem
- Parallel multisplitting two-stage iterative methods for large sparse systems of weakly nonlinear equations
- Parallel, iterative solution of sparse linear systems: Models and architectures
- Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems
- A two-step parallel iteration method for large sparse horizontal linear complementarity problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288588)
