Skip header Section
Skip Bibliometrics Section
Direct methods for sparse matricesNovember 1986
- Authors:
- Iain S Duff,
- Albert M Erisman,
- John K Reid
Abstract
No abstract available.
Cited By
- Giunti B, Houry G and Kerber M Average Complexity of Matrix Reduction for Clique Filtrations Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation, (187-196)
- Amestoy P, Buttari A, L'Excellent J and Mary T (2019). Performance and Scalability of the Block Low-Rank Multifrontal Factorization on Multicore Architectures, ACM Transactions on Mathematical Software, 45:1, (1-26), Online publication date: 28-Mar-2019.
- Pearson J and Gondzio J (2017). Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization, Numerische Mathematik, 137:4, (959-999), Online publication date: 1-Dec-2017.
- Baharev A, Domes F and Neumaier A (2017). A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations, Numerical Algorithms, 76:1, (163-189), Online publication date: 1-Sep-2017.
- Gal R, Kermany E, Saleh B, Ziv A, Behm M and Hickerson B Template Aware Coverage Proceedings of the 54th Annual Design Automation Conference 2017, (1-6)
- Cerdán J, Marín J and Mas J (2017). A two-level ILU preconditioner for electromagnetic applications, Journal of Computational and Applied Mathematics, 309:C, (371-382), Online publication date: 1-Jan-2017.
- Gottlieb L and Neylon T (2016). Matrix Sparsification and the Sparse Null Space Problem, Algorithmica, 76:2, (426-444), Online publication date: 1-Oct-2016.
- Liu W, Li A, Hogg J, Duff I and Vinter B A Synchronization-Free Algorithm for Parallel Sparse Triangular Solves Proceedings of the 22nd International Conference on Euro-Par 2016: Parallel Processing - Volume 9833, (617-630)
- Fortes M, Raydan M and Sajo-Castelli A (2016). Inverse-free recursive multiresolution algorithms for a data approximation problem, Computers & Mathematics with Applications, 72:4, (1177-1187), Online publication date: 1-Aug-2016.
- Schröder C and Taslaman L (2016). Backward error analysis of the shift-and-invert Arnoldi algorithm, Numerische Mathematik, 133:4, (819-843), Online publication date: 1-Aug-2016.
- Wang H, Liu W, Hou K and Feng W Parallel Transposition of Sparse Data Structures Proceedings of the 2016 International Conference on Supercomputing, (1-13)
- Rostami M and Bcker H (2015). Interactively Exploring the Connection between Bidirectional Compression and Star Bicoloring, Procedia Computer Science, 51:C, (1917-1926), Online publication date: 1-Sep-2015.
- Lebedev S, Akhmedzhanov D, Kozinov E, Meyerov I, Pirova A and Sysoyev A Dynamic Parallelization Strategies for Multifrontal Sparse Cholesky Factorization Proceedings of the 13th International Conference on Parallel Computing Technologies - Volume 9251, (68-79)
- Soeanu A, Debbabi M, Alhadidi D, Makkawi M, Allouche M, Bélanger M and Léchevin N (2015). Transportation risk analysis using probabilistic model checking, Expert Systems with Applications: An International Journal, 42:9, (4410-4421), Online publication date: 1-Jun-2015.
- Pryce J, Nedialkov N and Tan G (2015). DAESA—A Matlab Tool for Structural Analysis of Differential-Algebraic Equations, ACM Transactions on Mathematical Software, 41:2, (1-20), Online publication date: 4-Feb-2015.
- Perarnau G and Serra O (2014). On the tree-depth of random graphs, Discrete Applied Mathematics, 168, (119-126), Online publication date: 1-May-2014.
- Sundaram N, Turmukhametova A, Satish N, Mostak T, Indyk P, Madden S and Dubey P (2013). Streaming similarity search over one billion tweets using parallel locality-sensitive hashing, Proceedings of the VLDB Endowment, 6:14, (1930-1941), Online publication date: 1-Sep-2013.
- Hossain S and Steihaug T (2013). Sparse matrix computations with application to solve system of nonlinear equations, WIREs Computational Statistics, 5:5, (372-386), Online publication date: 1-Sep-2013.
- Deveci M, Kaya K, Uçar B and Çatalyürek Ü GPU accelerated maximum cardinality matching algorithms for bipartite graphs Proceedings of the 19th international conference on Parallel Processing, (850-861)
- Helfenstein R and Koko J (2012). Parallel preconditioned conjugate gradient algorithm on GPU, Journal of Computational and Applied Mathematics, 236:15, (3584-3590), Online publication date: 1-Sep-2012.
- Duff I, Kaya K and Uçcar B (2012). Design, implementation, and analysis of maximum transversal algorithms, ACM Transactions on Mathematical Software, 38:2, (1-31), Online publication date: 1-Dec-2011.
- Georgiev K and Zlatev Z (2011). Implementation of sparse matrix algorithms in an advection-diffusion-chemistry module, Journal of Computational and Applied Mathematics, 236:3, (342-353), Online publication date: 1-Sep-2011.
- Uriarte F, Hebner R and Gattozzi A Accelerating the simulation of shipboard power systems Proceedings of the 2011 Grand Challenges on Modeling and Simulation Conference, (22-29)
- Lin L, Yang C, Meza J, Lu J, Ying L and E W (2011). SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix, ACM Transactions on Mathematical Software, 37:4, (1-19), Online publication date: 1-Feb-2011.
- Michelini P (2010). Direct multi-grid methods for linear systems with harmonic aliasing patterns, IEEE Transactions on Signal Processing, 58:10, (5091-5105), Online publication date: 1-Oct-2010.
- Patwary M, Bisseling R and Manne F Parallel greedy graph matching using an edge partitioning approach Proceedings of the fourth international workshop on High-level parallel programming and applications, (45-54)
- Gottlieb L and Neylon T Matrix sparsification and the sparse null space problem Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques, (205-218)
- Emiris I, Pan V and Tsigaridas E Algebraic and numerical algorithms Algorithms and theory of computation handbook, (17-17)
- Fünfzig C, Michelucci D and Foufou S Nonlinear systems solver in floating-point arithmetic using LP reduction 2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling, (123-134)
- Trinitis C, Küstner T, Weidendorfer J and Smajic J Sparse Matrix Operations on Multi-core Architectures Proceedings of the 10th International Conference on Parallel Computing Technologies, (41-48)
- Buluç A, Fineman J, Frigo M, Gilbert J and Leiserson C Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, (233-244)
- Vömel C and Slemons J (2009). Twisted factorization of a banded matrix, BIT, 49:2, (433-447), Online publication date: 1-Jun-2009.
- Bai Z, Duff I and Yin J (2009). Numerical study on incomplete orthogonal factorization preconditioners, Journal of Computational and Applied Mathematics, 226:1, (22-41), Online publication date: 1-Apr-2009.
- Chen Y, Davis T, Hager W and Rajamanickam S (2008). Algorithm 887, ACM Transactions on Mathematical Software, 35:3, (1-14), Online publication date: 1-Oct-2008.
- Sala M, Stanley K and Heroux M (2008). On the design of interfaces to sparse direct solvers, ACM Transactions on Mathematical Software, 34:2, (1-22), Online publication date: 1-Mar-2008.
- Uçar B Heuristics for a matrix symmetrization problem Proceedings of the 7th international conference on Parallel processing and applied mathematics, (718-727)
- Pan V, Murphy B, Rosholt R and Tabanjeh M The schur aggregation for solving linear systems of equations Proceedings of the 2007 international workshop on Symbolic-numeric computation, (142-151)
- Gould N, Scott J and Hu Y (2007). A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations, ACM Transactions on Mathematical Software, 33:2, (10-es), Online publication date: 1-Jun-2007.
- Hitz M (2007). ECCAD 2007 poster abstracts, ACM Communications in Computer Algebra, 41:1-2, (12-24), Online publication date: 1-Mar-2007.
- Andrade D, Fraguela B and Doallo R Cache behavior modelling for codes involving banded matrices Proceedings of the 19th international conference on Languages and compilers for parallel computing, (205-219)
- Usman A, Luján M, Freeman L and Gurd J Performance evaluation of storage formats for sparse matrices in fortran Proceedings of the Second international conference on High Performance Computing and Communications, (160-169)
- Szeliski R Locally adapted hierarchical basis preconditioning ACM SIGGRAPH 2006 Papers, (1135-1143)
- Szeliski R (2006). Locally adapted hierarchical basis preconditioning, ACM Transactions on Graphics, 25:3, (1135-1143), Online publication date: 1-Jul-2006.
- Amestoy P, Guermouche A, L'Excellent J and Pralet S (2006). Hybrid scheduling for the parallel solution of linear systems, Parallel Computing, 32:2, (136-156), Online publication date: 1-Feb-2006.
- Moloney D, Geraghty D, McSweeney C and McElroy C Streaming sparse matrix compression/decompression Proceedings of the First international conference on High Performance Embedded Architectures and Compilers, (116-129)
- Garz E and García I (2005). Approaches Based on Permutations for Partitioning Sparse Matrices on Multiprocessors, The Journal of Supercomputing, 34:1, (41-61), Online publication date: 1-Oct-2005.
- Gondzio J and Grothey A Direct solution of linear systems of size 109 arising in optimization with interior point methods Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics, (513-525)
- O'Leary D (2005). Solving Sparse Linear Systems, Computing in Science and Engineering, 7:5, (62-70), Online publication date: 1-Sep-2005.
- Shen K Parallel sparse LU factorization on second-class message passing platforms Proceedings of the 19th annual international conference on Supercomputing, (351-360)
- Zlatev Z Parallel treatment of general sparse matrices Proceedings of the 5th international conference on Large-Scale Scientific Computing, (53-64)
- McMahan H and Gordon G Fast exact planning in Markov decision processes Proceedings of the Fifteenth International Conference on International Conference on Automated Planning and Scheduling, (151-160)
- Verkaik J and Lin H (2005). A class of novel parallel algorithms for the solution of tridiagonal systems, Parallel Computing, 31:6, (563-587), Online publication date: 1-Jun-2005.
- Luján M, Usman A, Hardie P, Freeman T and Gurd J Storage formats for sparse matrices in java Proceedings of the 5th international conference on Computational Science - Volume Part I, (364-371)
- D'Azevedo E, Fahey M and Mills R Vectorized sparse matrix multiply for compressed row storage format Proceedings of the 5th international conference on Computational Science - Volume Part I, (99-106)
- Denis C, Boufflet J and Breitkopf P A Load Balancing Method for a Parallel Application Based on a Domain Decomposition Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
- Yang B and Chen J All in the XL family Proceedings of the 7th international conference on Information Security and Cryptology, (67-86)
- Gould N and Scott J (2004). A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations, ACM Transactions on Mathematical Software, 30:3, (300-325), Online publication date: 1-Sep-2004.
- Wiley D, Bertram M and Hamann B (2004). On a Construction of a Hierarchy of Best Linear Spline Approximations Using a Finite Element Approach, IEEE Transactions on Visualization and Computer Graphics, 10:5, (548-563), Online publication date: 1-Sep-2004.
- Bergamaschi L, Gondzio J and Zilli G (2004). Preconditioning Indefinite Systems in Interior Point Methods for Optimization, Computational Optimization and Applications, 28:2, (149-171), Online publication date: 1-Jul-2004.
- Ballarin C and Kauers M (2004). Solving parametric linear systems, ACM SIGSAM Bulletin, 38:2, (33-46), Online publication date: 1-Jun-2004.
- Gould N and Toint P (2004). Preprocessing for quadratic programming, Mathematical Programming: Series A and B, 100:1, (95-132), Online publication date: 1-May-2004.
- Lin H (2004). Graph transformation and designing parallel sparse matrix algorithms beyond data dependence analysis, Scientific Programming, 12:2, (91-100), Online publication date: 1-Apr-2004.
- Rotkin V and Toledo S (2004). The design and implementation of a new out-of-core sparse cholesky factorization method, ACM Transactions on Mathematical Software, 30:1, (19-46), Online publication date: 1-Mar-2004.
- Sun X and Zhang W (2004). A Parallel Two-Level Hybrid Method for Tridiagonal Systems and Its Application to Fast Poisson Solvers, IEEE Transactions on Parallel and Distributed Systems, 15:2, (97-106), Online publication date: 1-Feb-2004.
- Cox I and Miller M (2004). Facilitating watermark insertion by preprocessing media, EURASIP Journal on Advances in Signal Processing, 2004, (2081-2092), Online publication date: 1-Jan-2004.
- Amestoy P, Duff I, Pralet S and Vömel C (2003). Adapting a parallel sparse direct solver to architectures with clusters of SMPs, Parallel Computing, 29:11-12, (1645-1668), Online publication date: 1-Nov-2003.
- Bianco M A high-performance UL factorization for the frontal method Proceedings of the 2003 international conference on Computational science and its applications: PartI, (893-902)
- Bhowmick S, McInnes L, Norris B and Raghavan P The role of multi-method linear solvers in PDE-based simulations Proceedings of the 2003 international conference on Computational science and its applications: PartI, (828-839)
- Wilkinson J and Moler C Matrix computations Encyclopedia of Computer Science, (1103-1109)
- Teranishi K, Raghavan P and Ng E A new data-mapping scheme for latency-tolerant distributed sparse triangular solution Proceedings of the 2002 ACM/IEEE conference on Supercomputing, (1-11)
- De Kloe J, Van Der Steen A, Öksüzoğlu H and Dijkstra H (2002). A Fully Implicit Parallel Ocean Model Using MUMPS, The Journal of Supercomputing, 23:2, (167-183), Online publication date: 1-Sep-2002.
- Lu F and Schuurmans D Monte Carlo matrix inversion policy evaluation Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence, (386-393)
- Geisler J and Taylor V (2002). Performance Coupling, Journal of Parallel and Distributed Computing, 62:8, (1227-1247), Online publication date: 1-Aug-2002.
- Sun X and Zhang W A Parallel Two-Level Hybrid Method for Diagonal Dominant Tridiagonal Systems Proceedings of the 16th International Parallel and Distributed Processing Symposium
- Sergaki E, Stavrakakis G and Pouliezos A (2002). Optimal Robot Speed Trajectory by Minimization of the Actuator Motor Electromechanical Losses, Journal of Intelligent and Robotic Systems, 33:2, (187-207), Online publication date: 1-Feb-2002.
- Zlatev Z Massive data set issues in air pollution modelling Handbook of massive data sets, (1169-1220)
- Phillips J and Silveira L Simulation approaches for strongly coupled interconnect systems Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, (430-437)
- Chakravarty M and Keller G (2001). Functional array fusion, ACM SIGPLAN Notices, 36:10, (205-216), Online publication date: 1-Oct-2001.
- Chakravarty M and Keller G Functional array fusion Proceedings of the sixth ACM SIGPLAN international conference on Functional programming, (205-216)
- Ostromsky T, Owczarz W and Zlatev Z Computational challenges in large-scale air pollution modelling Proceedings of the 15th international conference on Supercomputing, (407-418)
- Owczarx W and Zlatev Z Running a large air pollution model on an IBM SMP computer Practical parallel computing, (57-77)
- Bandera G, Ujaldón M and Zapata E (2000). Compile and Run-Time Support for the Parallelization of Sparse Matrix Updating Algorithms, The Journal of Supercomputing, 17:3, (263-276), Online publication date: 1-Nov-2000.
- Luján M, Freeman T and Gurd J (2000). OoLALA, ACM SIGPLAN Notices, 35:10, (229-252), Online publication date: 1-Oct-2000.
- Luján M, Freeman T and Gurd J OoLALA Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (229-252)
- Gülpinar N, Gutin G, Mitra G and Maros I (2000). Detecting Embedded Networks in LP Using GUB Structures and IndependentSet Algorithms, Computational Optimization and Applications, 15:3, (235-247), Online publication date: 1-Mar-2000.
- Biegler L, Nocedal J, Schmid C and Ternet D (2000). Numerical Experience with a Reduced Hessian Methodfor Large Scale Constrained Optimization, Computational Optimization and Applications, 15:1, (45-67), Online publication date: 1-Jan-2000.
- Triggs B, McLauchlan P, Hartley R and Fitzgibbon A Bundle Adjustment - A Modern Synthesis Proceedings of the International Workshop on Vision Algorithms: Theory and Practice, (298-372)
- Ganti V, Gehrke J and Ramakrishnan R CACTUS—clustering categorical data using summaries Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, (73-83)
- Corbera F, Asenjo R and Zapata E New shape analysis techniques for automatic parallelization of C codes Proceedings of the 13th international conference on Supercomputing, (220-227)
- Ferris M and Horn J (1998). Partitioning mathematical programs for parallel solution, Mathematical Programming: Series A and B, 80:1, (35-61), Online publication date: 1-Jan-1998.
- Dormuth D and Alfa A (1997). Two finite-difference methods for solving MAP(t)/PH(t)/1/K queueing models, Queueing Systems: Theory and Applications, 27:1/2, (55-78), Online publication date: 14-Dec-1997.
- Bretthauer U and Horneber E (1997). Mixed Analog Digital Simulation of Integrated Circuitswith BRASIL, Analog Integrated Circuits and Signal Processing, 14:1-2, (41-51), Online publication date: 1-Sep-1997.
- Bahar R, Frohm E, Gaona C, Hachtel G, Macii E, Pardo A and Somenzi F (1997). Algebric Decision Diagrams and Their Applications, Formal Methods in System Design, 10:2-3, (171-206), Online publication date: 1-Apr-1997.
- Conn A, Coulman P, Haring R, Morrill G and Visweswariah C Optimization of custom MOS circuits by transistor sizing Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, (174-180)
- Bretthauer U and Horneber E BRASIL Proceedings of the conference on European design automation, (10-14)
- Dincer K, Fox G and Hawick K High Performance Fortran and Possible Extensions to Support Conjugate Gradient Algorithms Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
- Baraff D Linear-time dynamics using Lagrange multipliers Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, (137-146)
- van Genderen A and van der Meijs N Using articulation nodes to improve the efficiency of finite-element based resistance extraction Proceedings of the 33rd annual Design Automation Conference, (758-763)
- Duff I and Reid J (1996). Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems, ACM Transactions on Mathematical Software, 22:2, (227-257), Online publication date: 1-Jun-1996.
- Duff I and Reid J (1996). The design of MA48, ACM Transactions on Mathematical Software, 22:2, (187-226), Online publication date: 1-Jun-1996.
- Conn A, Gould N and Toint P (1996). Numerical experiments with the LANCELOT package (release A) for large-scale nonlinear optimization, Mathematical Programming: Series A and B, 73:1, (73-110), Online publication date: 1-Apr-1996.
- Harrison L Examination of a memory access classification scheme for pointer-intensive and numeric programs Proceedings of the 10th international conference on Supercomputing, (133-140)
- Ghuloum A and Fisher A (1995). Flattening and parallelizing irregular, recurrent loop nests, ACM SIGPLAN Notices, 30:8, (58-67), Online publication date: 1-Aug-1995.
- Ghuloum A and Fisher A Flattening and parallelizing irregular, recurrent loop nests Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming, (58-67)
- Ranade A, Taylor V and Messerschmitt D (1995). SPAR, IEEE Transactions on Computers, 44:4, (531-545), Online publication date: 1-Apr-1995.
- Bongartz I, Conn A, Gould N and Toint P (1995). CUTE, ACM Transactions on Mathematical Software, 21:1, (123-160), Online publication date: 1-Mar-1995.
- van der Meijs N and van Genderen A Delayed frontal solution for finite-element based resistance extraction Proceedings of the 32nd annual ACM/IEEE Design Automation Conference, (273-278)
- Karypis G, Gupta A and Kumar V A parallel formulation of interior point algorithms Proceedings of the 1994 ACM/IEEE conference on Supercomputing, (204-213)
- Bik A and Wijshoff H Advanced compiler optimizations for sparse computations Proceedings of the 1993 ACM/IEEE conference on Supercomputing, (430-439)
- Bahar R, Frohm E, Gaona C, Hachtel G, Macii E, Pardo A and Somenzi F Algebraic decision diagrams and their applications Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design, (188-191)
- Grant P, Sharp J, Webster M and Zhang X Some issues in a functional implementation of a finite element algorithm Proceedings of the conference on Functional programming languages and computer architecture, (12-17)
- Taylor V Sparse matrix computations Proceedings of the 1992 ACM/IEEE conference on Supercomputing, (598-607)
- Temam O and Jalby W Characterizing the behavior of sparse algorithms on caches Proceedings of the 1992 ACM/IEEE conference on Supercomputing, (578-587)
- Zitney S Sparse matrix methods for chemical process separation calculations on supercomputers Proceedings of the 1992 ACM/IEEE conference on Supercomputing, (414-423)
- Surles M (1992). An algorithm with linear complexity for interactive, physically-based modeling of large proteins, ACM SIGGRAPH Computer Graphics, 26:2, (221-230), Online publication date: 1-Jul-1992.
- Surles M An algorithm with linear complexity for interactive, physically-based modeling of large proteins Proceedings of the 19th annual conference on Computer graphics and interactive techniques, (221-230)
- Hegland M (1991). On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization, Numerische Mathematik, 59:1, (453-472), Online publication date: 1-Dec-1991.
- Reuter R, Scharffenberger U and Schüle J (1991). Multiplication of a symmetric banded matrix by a vector on a vector multiprocessor computer, IBM Journal of Research and Development, 35:5-6, (697-706), Online publication date: 15-Sep-1991.
- Venugopal S and Naik V Effects of partitioning and scheduling sparse matrix factorization on communication and load balance Proceedings of the 1991 ACM/IEEE conference on Supercomputing, (866-875)
- Taylor V, Ranade A and Messerschmitt D Three-dimensional finite-element analyses Proceedings of the 1991 ACM/IEEE conference on Supercomputing, (786-795)
- Malard J Threshold pivoting for dense LU factorization on distributed memory multiprocessors Proceedings of the 1991 ACM/IEEE conference on Supercomputing, (600-607)
- Dodson D, Grimes R and Lewis J (1991). Sparse extensions to the FORTRAN Basic Linear Algebra Subprograms, ACM Transactions on Mathematical Software, 17:2, (253-263), Online publication date: 1-Jun-1991.
- Paolini G and Santangelo P (1991). An interactive graphic tool to plot the structure of large sparse matrices, IBM Journal of Research and Development, 35:1-2, (231-237), Online publication date: 1-Mar-1991.
- Gallivan K, Sameh A and Zlatev Z (1990). Solving general sparse linear systems using conjugate gradient-type methods, ACM SIGARCH Computer Architecture News, 18:3b, (132-139), Online publication date: 1-Sep-1990.
- Gallivan K, Sameh A and Zlatev Z Solving general sparse linear systems using conjugate gradient-type methods Proceedings of the 4th international conference on Supercomputing, (132-139)
- Battelini J and Isukapalli S A special purpose finite element architecture Proceedings of the 28th annual ACM Southeast Regional Conference, (267-273)
- Witkin A, Gleicher M and Welch W (1990). Interactive dynamics, ACM SIGGRAPH Computer Graphics, 24:2, (11-21), Online publication date: 1-Mar-1990.
- Witkin A, Gleicher M and Welch W Interactive dynamics Proceedings of the 1990 symposium on Interactive 3D graphics, (11-21)
- Amestoy P and Duff L (1989). Vectorization of a Multiprocessor Multifrontal Code, International Journal of High Performance Computing Applications, 3:3, (41-59), Online publication date: 1-Sep-1989.
- Liu J (1989). A graph partitioning algorithm by node separators, ACM Transactions on Mathematical Software, 15:3, (198-219), Online publication date: 1-Sep-1989.
- Gould N and Reid J (1989). New crash procedures for large systems of linear constraints, Mathematical Programming: Series A and B, 45:1-3, (475-501), Online publication date: 1-Aug-1989.
- Sadayappan P and Rao S Communication reduction for distributed sparse matrix factorization on a processor mesh Proceedings of the 1989 ACM/IEEE conference on Supercomputing, (371-379)
- Sadayappan P and Visvanathan V Efficient sparse matrix factorization for circuit simulation on vector supercomputers Proceedings of the 26th ACM/IEEE Design Automation Conference, (13-18)
- Sun X, Sun H and Ni L Parallel algorithms for solution of tridiagonal systems on multicomputers Proceedings of the 3rd international conference on Supercomputing, (303-312)
- Brehm J and Jordan H Parallelizing algorithms for MIMD architectures with shared memory Proceedings of the 3rd international conference on Supercomputing, (244-253)
- Saad Y and Wijshoff H A benchmark package for sparse matrix computations Proceedings of the 2nd international conference on Supercomputing, (500-509)
Index Terms
- Direct methods for sparse matrices
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
The design and use of a sparse direct solver for skew symmetric matrices
We consider the LDL^T factorization of sparse skew symmetric matrices. We see that the pivoting strategies are similar, but simpler, to those used in the factorization of sparse symmetric indefinite matrices, and we briefly describe the algorithms used ...
A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices
A factored sparse approximate inverse is computed and used as a preconditioner for solving general sparse matrices. The algorithm is derived from a matrix decomposition algorithm for inverting dense nonsymmetric matrices. Several strategies and special ...
A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices
A two-phase preconditioning strategy based on a factored sparse approximate inverse is proposed for solving sparse indefinite matrices. In each phase, the strategy first makes the original matrix diagonally dominant to enhance the stability by a ...