Skip header Section
Skip Bibliometrics Section
Computer Solution of Large Sparse Positive DefiniteFebruary 1981
- Authors:
- Alan George,
- Joseph W. Liu
Abstract
No abstract available.
Cited By
- Harbrecht H, Multerer M, Schenk O and Schwab C (2024). Multiresolution kernel matrix algebra, Numerische Mathematik, 156:3, (1085-1114), Online publication date: 1-Jun-2024.
Bik A, Koanantakool P, Shpeisman T, Vasilache N, Zheng B and Kjolstad F (2022). Compiler Support for Sparse Tensor Computations in MLIR, ACM Transactions on Architecture and Code Optimization, 19:4, (1-25), Online publication date: 31-Dec-2022.- Schlag S, Heuer T, Gottesbüren L, Akhremtsev Y, Schulz C and Sanders P (2023). High-Quality Hypergraph Partitioning, ACM Journal of Experimental Algorithmics, 27, (1-39), Online publication date: 31-Dec-2022.
- Segovia P, Rajaoarisoa L, Nejjari F, Duviella E and Puig V A communication-based distributed model predictive control approach for large-scale systems 2019 IEEE 58th Conference on Decision and Control (CDC), (8366-8371)
- Tian M, Wang J, Zhang Z, Du W, Pan J and Liu T (2022). swSuperLU: A highly scalable sparse direct solver on Sunway manycore architecture, The Journal of Supercomputing, 78:9, (11441-11463), Online publication date: 1-Jun-2022.
- Gonzaga de Oliveira S and Carvalho C (2022). Metaheuristic algorithms for the bandwidth reduction of large-scale matrices, Journal of Combinatorial Optimization, 43:4, (727-784), Online publication date: 1-May-2022.
- Khosravi Dehdezi E and Karimi S (2021). A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems, Calcolo: a quarterly on numerical analysis and theory of computation, 58:4, Online publication date: 1-Dec-2021.
- Zhang R and Lavaei J (2021). Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion, Mathematical Programming: Series A and B, 188:1, (351-393), Online publication date: 1-Jul-2021.
- Cummings R, Fahrbach M and Fatehpuria A A fast minimum degree algorithm and matching lower bound Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (724-734)
- Slota G, Root C, Devine K, Madduri K and Rajamanickam S (2020). Scalable, Multi-Constraint, Complex-Objective Graph Partitioning, IEEE Transactions on Parallel and Distributed Systems, 31:12, (2789-2801), Online publication date: 1-Dec-2020.
- Cheng Y and Sun Q (2020). Iteration-based adjoint method for the sensitivity analysis of static aeroelastic loads, Structural and Multidisciplinary Optimization, 62:6, (3329-3345), Online publication date: 1-Dec-2020.
- de Oliveira S and Silva L (2019). Evolving reordering algorithms using an ant colony hyperheuristic approach for accelerating the convergence of the ICCG method, Engineering with Computers, 36:4, (1857-1873), Online publication date: 1-Oct-2020.
- Li M, Liu Y, Yang H, Luan Z, Gan L, Yang G and Qian D (2020). Accelerating Sparse Cholesky Factorization on Sunway Manycore Architecture, IEEE Transactions on Parallel and Distributed Systems, 31:7, (1636-1650), Online publication date: 1-Jul-2020.
- Silva P, Brandão D, Morais I and de Oliveira S A Biased Random-Key Genetic Algorithm for Bandwidth Reduction Computational Science and Its Applications – ICCSA 2020, (312-321)
- de Oliveira S, Carvalho C and Osthoff C The Influence of Reordering Algorithms on the Convergence of a Preconditioned Restarted GMRES Method Computational Science and Its Applications – ICCSA 2020, (19-32)
- Fan W, Liu M, Tian C, Xu R and Zhou J (2020). Incrementalization of graph partitioning algorithms, Proceedings of the VLDB Endowment, 13:8, (1261-1274), Online publication date: 1-Apr-2020.
- Cao Y and Sandeep R (2020). Minimum fill-in, Information and Computation, 271:C, Online publication date: 1-Apr-2020.
- García-Fernández Á, Rahmathullah A and Svensson L (2020). A Metric on the Space of Finite Sets of Trajectories for Evaluation of Multi-Target Tracking Algorithms, IEEE Transactions on Signal Processing, 68, (3917-3928), Online publication date: 1-Jan-2020.
- Rafiei A, Bollhöfer M and Benkhaldoun F (2019). A block version of left-looking AINV preconditioner with one by one or two by two block pivots, Applied Mathematics and Computation, 350:C, (366-385), Online publication date: 1-Jun-2019.
- Evangelopoulos X, Brockmeier A, Mu T and Goulermas J (2019). Continuation methods for approximate large scale object sequencing, Machine Language, 108:4, (595-626), Online publication date: 1-Apr-2019.
- Deng Y, Mehlitz P and Prüfert U (2019). Optimal control in first-order Sobolev spaces with inequality constraints, Computational Optimization and Applications, 72:3, (797-826), Online publication date: 1-Apr-2019.
- Hernández-Santamaría V, Lazar M and Zuazua E (2019). Greedy optimal control for elliptic problems and its application to turnpike problems, Numerische Mathematik, 141:2, (455-493), Online publication date: 1-Feb-2019.
- Velikoivanenko E, Milenin A, Popov A, Sidoruk V and Khimich A (2019). Methods of Numerical Forecasting of Serviceability of Welded Structures on Computers of Hybrid Architecture, Cybernetics and Systems Analysis, 55:1, (117-127), Online publication date: 1-Jan-2019.
- Bock N, Negre C, Mniszewski S, Mohd-Yusof J, Aradi B, Fattebert J, Osei-Kuffuor D, Germann T and Niklasson A (2018). The basic matrix library (BML) for quantum chemistry, The Journal of Supercomputing, 74:11, (6201-6219), Online publication date: 1-Nov-2018.
- Konolige T and Brown J A Parallel Solver for Graph Laplacians Proceedings of the Platform for Advanced Scientific Computing Conference, (1-11)
- Hogg J, Scott J and Thorne S (2017). Numerically Aware Orderings for Sparse Symmetric Indefinite Linear Systems, ACM Transactions on Mathematical Software, 44:2, (1-22), Online publication date: 30-Jun-2018.
- Hager W, Hungerford J and Safro I (2018). A multilevel bilinear programming algorithm for the vertex separator problem, Computational Optimization and Applications, 69:1, (189-223), Online publication date: 1-Jan-2018.
- Cheshmi K, Kamil S, Strout M and Dehnavi M Sympiler Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, (1-13)
- Pak P and Pleek J (2017). Sparse direct solver for large finite element problems based on the minimum degree algorithm, Advances in Engineering Software, 113:C, (2-6), Online publication date: 1-Nov-2017.
- Ma F, Wang Y and Hao J (2017). Path relinking for the vertex separator problem, Expert Systems with Applications: An International Journal, 82:C, (332-343), Online publication date: 1-Oct-2017.
- Akhmetzyanov A and Salnikov A (2017). Mathematical Models of Unsteady Flow Distribution in Gas Transport Systems**Supported by the Program of Russian Foundation for Basic Research 15-08-08698., Procedia Computer Science, 112:C, (1160-1167), Online publication date: 1-Sep-2017.
- Greif C, He S and Liu P (2017). SYM-ILDL, ACM Transactions on Mathematical Software, 44:1, (1-21), Online publication date: 24-Jul-2017.
- Yang Y, Wang W and Lin J (2017). Direct-Iterative Hybrid Solution in Nonlinear Dynamic Structural Analysis, Computer-Aided Civil and Infrastructure Engineering, 32:5, (397-411), Online publication date: 1-May-2017.
- Zayer R, Steinberger M and Seidel H (2017). A GPU-Adapted Structure for Unstructured Grids, Computer Graphics Forum, 36:2, (495-507), Online publication date: 1-May-2017.
- Gould N and Robinson D (2017). A dual gradient-projection method for large-scale strictly convex quadratic problems, Computational Optimization and Applications, 67:1, (1-38), Online publication date: 1-May-2017.
- Zhu Y and Sameh A (2017). PSPIKE+, Journal of Computational and Applied Mathematics, 311:C, (682-703), Online publication date: 1-Feb-2017.
- Cao Y and Sandeep R Minimum fill-in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, (875-880)
- 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.
- Lin S and Xie Z (2017). A Jacobi_PCG solver for sparse linear systems on multi-GPU cluster, The Journal of Supercomputing, 73:1, (433-454), Online publication date: 1-Jan-2017.
- 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.
- Rizzuti G and Mulder W (2016). Multigrid-based 'shifted-Laplacian' preconditioning for the time-harmonic elastic wave equation, Journal of Computational Physics, 317:C, (47-65), Online publication date: 15-Jul-2016.
- Wei H, Yu J, Lu C and Lin X Speedup Graph Processing by Graph Ordering Proceedings of the 2016 International Conference on Management of Data, (1813-1828)
- Sreepathi S, D'Azevedo E, Philip B and Worley P Communication Characterization and Optimization of Applications Using Topology-Aware Task Mapping on Large Supercomputers Proceedings of the 7th ACM/SPEC on International Conference on Performance Engineering, (225-236)
- 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.
- Bernardes J and Oliveira S (2015). A Systematic Review of Heuristics for Profile Reduction of Symmetric Matrices, Procedia Computer Science, 51:C, (221-230), Online publication date: 1-Sep-2015.
- Chagas G and Oliveira S (2015). Metaheuristic-based Heuristics for Symmetric-matrix Bandwidth Reduction, Procedia Computer Science, 51:C, (211-220), Online publication date: 1-Sep-2015.
- Shun J An Evaluation of Parallel Eccentricity Estimation Algorithms on Undirected Real-World Graphs Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (1095-1104)
- Golovach P, Heggernes P, Hof P, Manne F, Paulusma D and Pilipczuk M (2015). Modifying a Graph Using Vertex Elimination, Algorithmica, 72:1, (99-125), Online publication date: 1-May-2015.
- Janna C, Castelletto N and Ferronato M (2015). The effect of graph partitioning techniques on parallel Block FSAI preconditioning, Numerical Algorithms, 68:4, (813-836), Online publication date: 1-Apr-2015.
- Karantasis K, Lenharth A, Nguyen D, Garzarán M and Pingali K Parallelization of reordering algorithms for bandwidth and wavefront reduction Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, (921-932)
- Carpentieri B, Liao J and Sosonkina M (2014). VBARMS, Journal of Computational and Applied Mathematics, 259:PA, (164-173), Online publication date: 15-Mar-2014.
- Tang W, Tan W, Ray R, Wong Y, Chen W, Kuo S, Goh R, Turner S and Wong W Accelerating sparse matrix-vector multiplication on GPUs using bit-representation-optimized schemes Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, (1-12)
- 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.
- Hashemikhabir S, Ayaz E, Kavurucu Y, Can T and Kahveci T (2012). Large-Scale Signaling Network Reconstruction, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9:6, (1696-1708), Online publication date: 1-Nov-2012.
- Golovach P, Heggernes P, Kratsch D and Saei R An exact algorithm for subset feedback vertex set on chordal graphs Proceedings of the 7th international conference on Parameterized and Exact Computation, (85-96)
- George T, Gupta A and Sarin V (2012). An Empirical Analysis of the Performance of Preconditioners for SPD Systems, ACM Transactions on Mathematical Software, 38:4, (1-30), Online publication date: 1-Aug-2012.
- Golovach P, Heggernes P, van't Hof P, Manne F, Paulusma D and Pilipczuk M How to eliminate a graph Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science, (320-331)
- Shantharam M, Srinivasmurthy S and Raghavan P Fault tolerant preconditioned conjugate gradient for sparse linear system solution Proceedings of the 26th ACM international conference on Supercomputing, (69-78)
- Belmonte R, Heggernes P and van 't Hof P (2012). Edge contractions in subclasses of chordal graphs, Discrete Applied Mathematics, 160:7-8, (999-1010), Online publication date: 1-May-2012.
- Davis T (2011). Algorithm 915, SuiteSparseQR, ACM Transactions on Mathematical Software, 38:1, (1-22), Online publication date: 1-Nov-2011.
- Davis T and Hu Y (2011). The university of Florida sparse matrix collection, ACM Transactions on Mathematical Software, 38:1, (1-25), Online publication date: 1-Nov-2011.
- Belmonte R, Heggernes P and van 't Hof P Edge contractions in subclasses of chordal graphs Proceedings of the 8th annual conference on Theory and applications of models of computation, (528-539)
- 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.
- Blelloch G, Koutis I, Miller G and Tangwongsan K Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, (1-12)
- Koohestani B and Poli R A genetic programming approach to the matrix bandwidth-minimization problem Proceedings of the 11th international conference on Parallel problem solving from nature: Part II, (482-491)
- Lee I A robust ILU preconditioner using constraints diagonal Markowitz Proceedings of the 48th annual ACM Southeast Conference, (1-6)
- Jarre F and Vavasis S Convex optimization Algorithms and theory of computation handbook, (32-32)
- Emiris I, Pan V and Tsigaridas E Algebraic and numerical algorithms Algorithms and theory of computation handbook, (17-17)
- Golovach P, Heggernes P, Kratsch D, Lokshtanov D, Meister D and Saurabh S Bandwidth on AT-Free Graphs Proceedings of the 20th International Symposium on Algorithms and Computation, (573-582)
- Heggernes P, Kratsch D and Meister D (2009). Bandwidth of bipartite permutation graphs in polynomial time, Journal of Discrete Algorithms, 7:4, (533-544), Online publication date: 1-Dec-2009.
- Gupta A, Koric S and George T Sparse matrix factorization on massively parallel computers Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, (1-12)
- Chiu C, Chen K and Ke C Optimal RFID networks scheduling using genetic algorithm and swarm intelligence Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics, (1201-1208)
- 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)
- Davis T and Hager W (2009). Dynamic Supernodes in Sparse Cholesky Update/Downdate and Triangular Solves, ACM Transactions on Mathematical Software, 35:4, (1-23), Online publication date: 1-Feb-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.
- Liu Q (2008). Some preconditioning techniques for linear systems, WSEAS Transactions on Mathematics, 7:9, (579-588), Online publication date: 1-Sep-2008.
- Mulder W (2008). Geophysical modelling of 3D electromagnetic diffusion with multigrid, Computing and Visualization in Science, 11:3, (129-138), Online publication date: 1-May-2008.
- Heggernes P, Kratsch D and Meister D Bandwidth of bipartite permutation graphs in polynomial time Proceedings of the 8th Latin American conference on Theoretical informatics, (216-227)
- Son S, Malkowski K, Chen G, Kandemir M and Raghavan P (2007). Reducing energy consumption of parallel sparse matrix applications through integrated link/CPU voltage scaling, The Journal of Supercomputing, 41:3, (179-213), Online publication date: 1-Sep-2007.
- Botsch M, Pauly M, Kobbelt L, Alliez P, Lévy B, Bischoff S and Rössl C Geometric modeling based on polygonal meshes Video files associated with this course are available from the citation page ACM SIGGRAPH 2007 courses, (1-es)
- Heggernes P, Paul C, Telle J and Villanger Y Interval completion with few edges Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, (374-381)
- 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.
- Pisinger G and Zimmermann A (2007). Bivariate least squares approximation with linear constraints , BIT, 47:2, (427-439), Online publication date: 1-Jun-2007.
- Heggernes P, Suchan K, Todinca I and Villanger Y Characterizing minimal interval completions towards better understanding of profile and pathwidth Proceedings of the 24th annual conference on Theoretical aspects of computer science, (236-247)
- Wang M and Sarin V Parallel support graph preconditioners Proceedings of the 13th international conference on High Performance Computing, (387-398)
- Chevalier C and Pellegrini F Improvement of the efficiency of genetic algorithms for scalable parallel graph partitioning in a multi-level framework Proceedings of the 12th international conference on Parallel Processing, (243-252)
- Botsch M, Pauly M, Rossl C, Bischoff S and Kobbelt L Geometric modeling based on triangle meshes ACM SIGGRAPH 2006 Courses, (1-es)
- Malkowski K, Lee I, Raghavan P and Irwin M Conjugate gradient sparse solvers Proceedings of the 20th international conference on Parallel and distributed processing, (297-297)
- Brezger A and Lang S (2006). Generalized structured additive regression based on Bayesian P-splines, Computational Statistics & Data Analysis, 50:4, (967-991), Online publication date: 1-Feb-2006.
- Bollhöfer M and Saad Y (2005). Multilevel Preconditioners Constructed From Inverse-Based ILUs, SIAM Journal on Scientific Computing, 27:5, (1627-1650), Online publication date: 1-Jan-2006.
- Mane S, Murray C, Shekhar S, Srivastava J and Pusey A Spatial Clustering of Chimpanzee Locations for Neighborhood Identification Proceedings of the Fifth IEEE International Conference on Data Mining, (737-740)
- Shi J, Cai Y, Hong X and Tan S Efficient simulation of power/ground networks with package and vias Proceedings of the 15th international conference on Integrated Circuit and System Design: power and Timing Modeling, Optimization and Simulation, (318-328)
- Botsch M, Bommes D and Kobbelt L Efficient linear system solvers for mesh processing Proceedings of the 11th IMA international conference on Mathematics of Surfaces, (62-83)
- O'Leary D (2005). Solving Sparse Linear Systems, Computing in Science and Engineering, 7:5, (62-70), Online publication date: 1-Sep-2005.
- Mane S, Srivastava J and Hwang S Estimating missed actual positives using independent classifiers Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, (648-653)
- Wirz A, Süß M and Leopold C A comparison of task pool variants in OpenMP and a proposal for a solution to the busy waiting problem Proceedings of the 2005 and 2006 international conference on OpenMP shared memory parallel programming, (397-408)
- 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.
- Malkowski K and Raghavan P Multi-pass mapping schemes for parallel sparse matrix computations Proceedings of the 5th international conference on Computational Science - Volume Part I, (245-255)
- Bekas C and Saad Y (2005). Computation of Smallest Eigenvalues using Spectral Schur Complements, SIAM Journal on Scientific Computing, 27:2, (458-481), Online publication date: 1-Jan-2005.
- Saad Y (2005). Multilevel ILU With Reorderings for Diagonal Dominance, SIAM Journal on Scientific Computing, 27:3, (1032-1057), Online publication date: 1-Jan-2005.
- Davis T, Gilbert J, Larimore S and Ng E (2004). A column approximate minimum degree ordering algorithm, ACM Transactions on Mathematical Software, 30:3, (353-376), Online publication date: 1-Sep-2004.
- Bai Y, Gansterer W and Ward R (2004). Block tridiagonalization of "effectively" sparse symmetric matrices, ACM Transactions on Mathematical Software, 30:3, (326-352), Online publication date: 1-Sep-2004.
- Boxerman E and Ascher U Decomposing cloth Proceedings of the 2004 ACM SIGGRAPH/Eurographics symposium on Computer animation, (153-161)
- Botsch M and Kobbelt L A remeshing approach to multiresolution modeling Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing, (185-192)
- Heggernes P and Villanger Y Simple and efficient modifications of elimination orderings Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing, (788-797)
- Teranishi K and Raghavan P Parallel hybrid sparse solvers through flexible incomplete cholesky preconditioning Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing, (637-643)
- Mellor-Crummey J and Garvin J (2004). Optimizing Sparse Matrix-Vector Product Computations Using Unroll and Jam, International Journal of High Performance Computing Applications, 18:2, (225-236), 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.
- Kojekine N, Savchenko V and Hagiwara I Surface reconstruction based on compactly supported radial basis functions Geometric modeling, (218-231)
- Teranishi K, Raghavan P and Yang C Time-memory trade-offs using sparse matrix methods for large-scale eigenvalue problems Proceedings of the 2003 international conference on Computational science and its applications: PartI, (840-847)
- Lin W (2003). Finding Optimal Ordering of Sparse Matrices for Column-Oriented Parallel Cholesky Factorization, The Journal of Supercomputing, 24:3, (259-277), Online publication date: 1-Mar-2003.
- Qin Z and Cheng C RCLK-VJ network reduction with Hurwitz polynomial approximation Proceedings of the 2003 Asia and South Pacific Design Automation Conference, (283-291)
- Dongarra J, Foster I, Fox G, Gropp W, Kennedy K, Torczon L and White A References Sourcebook of parallel computing, (729-789)
- Bollhöfer M (2003). A Robust and Efficient ILU that Incorporates the Growth of the Inverse Triangular Factors, SIAM Journal on Scientific Computing, 25:1, (86-103), Online publication date: 1-Jan-2003.
- Saad Y (2002). Finding Exact and Approximate Block Structures for ILU Preconditioning, SIAM Journal on Scientific Computing, 24:4, (1107-1123), Online publication date: 1-Jan-2003.
- 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)
- Zheng H and Pileggi L Robust and passive model order reduction for circuits containing susceptance elements Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design, (761-766)
- Tan P, Kumar V and Srivastava J Selecting the right interestingness measure for association patterns Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, (32-41)
- Zheng Z, Pileggi L, Beattie M and Krauter B Window-Based Susceptance Models for Large-Scale RLC Circuit Analyses Proceedings of the conference on Design, automation and test in Europe
- Hénon P, Ramet P and Roman J (2002). PASTIX, Parallel Computing, 28:2, (301-321), Online publication date: 1-Feb-2002.
- Bank R and Smith R (2001). An Algebraic Multilevel Multigraph Algorithm, SIAM Journal on Scientific Computing, 23:5, (1572-1592), Online publication date: 1-Jan-2002.
- Hager W (2001). Minimizing the Profile of a Symmetric Matrix, SIAM Journal on Scientific Computing, 23:5, (1799-1816), Online publication date: 1-Jan-2002.
- Chen J and Taylor V (2002). Mesh Partitioning for Efficient Use of Distributed Systems, IEEE Transactions on Parallel and Distributed Systems, 13:1, (67-79), Online publication date: 1-Jan-2002.
- Gilbert J, Li X, Ng E and Peyton B (2001). Computing Row and Column Counts for Sparse QR and LU Factorization, BIT, 41:4, (693-710), Online publication date: 1-Sep-2001.
- Schulze J (2001). Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse Matrix Ordering Methods, BIT, 41:4, (800-841), Online publication date: 1-Sep-2001.
- Mellor-Crummey J, Whalley D and Kennedy K (2001). Improving Memory Hierarchy Performance for Irregular Applications Using Data and Computation Reorderings, International Journal of Parallel Programming, 29:3, (217-247), Online publication date: 1-Jun-2001.
- Bridson R and Tang W (2000). A Structural Diagnosis of Some IC Orderings, SIAM Journal on Scientific Computing, 22:5, (1527-1532), Online publication date: 1-Jan-2001.
- Carvalho L, Giraud L and Le Tallec P (2000). Algebraic Two-Level Preconditioners for the Schur Complement Method, SIAM Journal on Scientific Computing, 22:6, (1987-2005), Online publication date: 1-Jan-2001.
- Bridson R and Tang W (2001). Multiresolution Approximate Inverse Preconditioners, SIAM Journal on Scientific Computing, 23:2, (463-479), Online publication date: 1-Jan-2001.
- Gryazin Y, Klibanov M and Lucas T (2001). Numerical Solution of a Subsurface Imaging Inverse Problem, SIAM Journal on Applied Mathematics, 62:2, (664-683), Online publication date: 1-Jan-2001.
- 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)
- Benzi M and Tuma M (1999). Orderings for Factorized Sparse Approximate Inverse Preconditioners, SIAM Journal on Scientific Computing, 21:5, (1851-1868), Online publication date: 1-Jan-2000.
- George A, Huang L, Tang W and Wu Y (1999). Numerical Simulation of Unsteady Incompressible Flow (\em Re \protect\boldmath $\leq$ 9500) on the Curvilinear Half-Staggered Mesh, SIAM Journal on Scientific Computing, 21:6, (2331-2351), Online publication date: 1-Jan-2000.
- Maheswaran M, Webb K and Siegel H (1999). MCGS, The Journal of Supercomputing, 14:3, (257-280), Online publication date: 1-Dec-1999.
- Lee L, Siek J and Lumsdaine A (1999). The generic graph component library, ACM SIGPLAN Notices, 34:10, (399-414), Online publication date: 1-Oct-1999.
- Lee L, Siek J and Lumsdaine A The generic graph component library Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (399-414)
- Nielsen S (1999). Dense and Sparse Matrix Classes Using the C++ Standard Template Library, Computational Economics, 14:1-2, (47-68), Online publication date: 1-Oct-1999.
- 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)
- Chatterjee S, Jain V, Lebeck A, Mundhra S and Thottethodi M Nonlinear array layouts for hierarchical memory systems Proceedings of the 13th international conference on Supercomputing, (444-453)
- Sheehan B ENOR Proceedings of the 36th annual ACM/IEEE Design Automation Conference, (17-21)
- Moran D, Dooling D, Wilkins T and Williams R Integrated manufacturing and development (IMaD) Proceedings of the 1999 ACM/IEEE conference on Supercomputing, (9-es)
- Huang J and Greengard L (1999). A Fast Direct Solver for Elliptic Partial Differential Equations on Adaptively Refined Meshes, SIAM Journal on Scientific Computing, 21:4, (1551-1566), Online publication date: 1-Jan-1999.
- Bridson R and Tang W (1999). Ordering, Anisotropy, and Factored Sparse Approximate Inverses, SIAM Journal on Scientific Computing, 21:3, (867-882), Online publication date: 1-Jan-1999.
- Saad Y and Zhang J (1999). BILUM, SIAM Journal on Scientific Computing, 20:6, (2103-2121), Online publication date: 1-Jan-1999.
- Benzi M, Szyld D and van Duin A (1999). Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems, SIAM Journal on Scientific Computing, 20:5, (1652-1670), Online publication date: 1-Jan-1999.
- Bank R and Smith R (1999). The Incomplete Factorization Multigraph Algorithm, SIAM Journal on Scientific Computing, 20:4, (1349-1364), Online publication date: 1-Jan-1999.
- Wang F and Xu J (1999). A Crosswind Block Iterative Method for Convection-Dominated Problems, SIAM Journal on Scientific Computing, 21:2, (620-645), Online publication date: 1-Jan-1999.
- Yang T and Fu C (1998). Space/time-efficient scheduling and execution of parallel irregular computations, ACM Transactions on Programming Languages and Systems, 20:6, (1195-1222), Online publication date: 1-Nov-1998.
- Gilbert J, Miller G and Teng S (1998). Geometric Mesh Partitioning, SIAM Journal on Scientific Computing, 19:6, (2091-2110), Online publication date: 1-Nov-1998.
- Feige U Approximating the bandwidth via volume respecting embeddings (extended abstract) Proceedings of the thirtieth annual ACM symposium on Theory of computing, (90-99)
- Natanzon A, Shamir R and Sharan R A polynomial approximation algorithm for the minimum fill-in problem Proceedings of the thirtieth annual ACM symposium on Theory of computing, (41-47)
- Benzi M and Tuma M (1998). A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems, SIAM Journal on Scientific Computing, 19:3, (968-994), Online publication date: 1-May-1998.
- De Silva A and Abramson D (1998). A Parallel Interior Point Method and Its Application to Facility Location Problems, Computational Optimization and Applications, 9:3, (249-273), Online publication date: 1-Mar-1998.
- Field M (1998). Optimizing a Parallel Conjugate Gradient Solver, SIAM Journal on Scientific Computing, 19:1, (27-37), Online publication date: 1-Jan-1998.
- Hendrickson B and Rothberg E (1998). Improving the Run Time and Quality of Nested Dissection Ordering, SIAM Journal on Scientific Computing, 20:2, (468-489), Online publication date: 1-Jan-1998.
- Karypis G and Kumar V (1998). A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, SIAM Journal on Scientific Computing, 20:1, (359-392), Online publication date: 1-Jan-1998.
- Conroy J, Kratzer S, Lucas R and Naiman A (1998). Data-Parallel Sparse Factorization, SIAM Journal on Scientific Computing, 19:2, (584-604), Online publication date: 1-Jan-1998.
- Czyzyk J, Fourer R and Mehrotra S (1998). Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method, SIAM Journal on Scientific Computing, 19:2, (553-565), Online publication date: 1-Jan-1998.
- Kotlyar V, Pingali K and Stodghill P Compiling parallel code for sparse matrix applications Proceedings of the 1997 ACM/IEEE conference on Supercomputing, (1-18)
- Jiang T and Ma S (1997). Contour matching using wavelet transform and multigrid methods, Journal of Computer Science and Technology, 12:6, (564-570), Online publication date: 1-Nov-1997.
- Ashcraft C and Liu J (2022). Using domain decomposition to find graph bisectors, BIT, 37:3, (506-534), Online publication date: 1-Sep-1997.
- Chen J and Taylor V PART Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors
- Gupta A, Karypis G and Kumar V (1997). Highly Scalable Parallel Algorithms for Sparse Matrix Factorization, IEEE Transactions on Parallel and Distributed Systems, 8:5, (502-520), Online publication date: 1-May-1997.
- Heath M and Raghavan P (1997). Performance of a Fully Parallel Sparse Solver, International Journal of High Performance Computing Applications, 11:1, (49-64), Online publication date: 1-Mar-1997.
- Wilson D Determinant algorithms for random planar structures Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (258-267)
- Benzi M, Meyer C and Tůma M (1996). A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method, SIAM Journal on Scientific Computing, 17:5, (1135-1149), Online publication date: 1-Sep-1996.
- Saad Y (1996). ILUM, SIAM Journal on Scientific Computing, 17:4, (830-847), Online publication date: 1-Jul-1996.
- Kerns K and Yang A Stable and efficient reduction of large, multiport RC networks by pole analysis via congruence transformations Proceedings of the 33rd annual Design Automation Conference, (280-285)
- Spielman D and Teng S Disk packings and planar separators Proceedings of the twelfth annual symposium on Computational geometry, (349-358)
- Rothberg E (1996). Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers, SIAM Journal on Scientific Computing, 17:3, (699-713), Online publication date: 1-May-1996.
- Sun C (1996). Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors, SIAM Journal on Scientific Computing, 17:3, (666-685), Online publication date: 1-May-1996.
- Karypis G and Kumar V Parallel Multilevel Graph Partitioning Proceedings of the 10th International Parallel Processing Symposium, (314-319)
- Andersen K (1996). An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms, SIAM Journal on Optimization, 6:1, (74-95), Online publication date: 1-Feb-1996.
- Bik A and Wijshoff H (1996). Automatic Data Structure Selection and Transformation for Sparse Matrix Computations, IEEE Transactions on Parallel and Distributed Systems, 7:2, (109-126), Online publication date: 1-Feb-1996.
- Boyse W and Seidl A (1996). A Block QMR Method for Computing Multiple Simultaneous Solutions to Complex Symmetric Systems, SIAM Journal on Scientific Computing, 17:1, (263-274), Online publication date: 1-Jan-1996.
- Fan Q, Forsyth P, McMacken J and Tang W (1996). Performance Issues for Iterative Solvers in Device Simulation, SIAM Journal on Scientific Computing, 17:1, (100-117), Online publication date: 1-Jan-1996.
- Gupta A and Kumar V Parallel algorithms for forward and back substitution in direct solution of sparse linear systems Proceedings of the 1995 ACM/IEEE conference on Supercomputing, (74-es)
- Karypis G and Kumar V Analysis of multilevel graph partitioning Proceedings of the 1995 ACM/IEEE conference on Supercomputing, (29-es)
- Eppstein D, Miller G and Teng S (1995). A Deterministic Linear Time Algorithm For Geometric Separators And Its Applications, Fundamenta Informaticae, 22:4, (309-329), Online publication date: 1-Dec-1995.
- Kerns K, Wemple I and Yang A Stable and efficient reduction of substrate model networks using congruence transforms Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, (207-214)
- Chakrabarti S, Demmel J and Yelick K Modeling the benefits of mixed data and task parallelism Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, (74-83)
- Manne F and Hafsteinsson H (1995). Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer, SIAM Journal on Scientific Computing, 16:4, (934-950), Online publication date: 1-Jul-1995.
- Saab Y (1995). A Fast and Robust Network Bisection Algorithm, IEEE Transactions on Computers, 44:7, (903-913), Online publication date: 1-Jul-1995.
- Gupta A, Kumar V and Sameh A (1995). Performance and Scalability of Preconditioned Conjugate Gradient Methods on Parallel Computers, IEEE Transactions on Parallel and Distributed Systems, 6:5, (455-469), Online publication date: 1-May-1995.
- Ranade A, Taylor V and Messerschmitt D (1995). SPAR, IEEE Transactions on Computers, 44:4, (531-545), Online publication date: 1-Apr-1995.
- Natarajan R (1995). Domain Decomposition Using Spectral Expansions of Steklov–Poincaré Operators, SIAM Journal on Scientific Computing, 16:2, (470-495), Online publication date: 1-Mar-1995.
- Monga-Made M (1995). Ordering Strategies for Modified Block Incomplete Factorizations, SIAM Journal on Scientific Computing, 16:2, (378-399), Online publication date: 1-Mar-1995.
- Vanderbei R (1995). Symmetric Quasidefinite Matrices, SIAM Journal on Optimization, 5:1, (100-113), Online publication date: 1-Feb-1995.
- Wemple I and Yang A Mixed-signal switching noise analysis using Voronoi-tessellated substrate macromodels Proceedings of the 32nd annual ACM/IEEE Design Automation Conference, (439-444)
- Kaporin I and Axelsson O (1995). On a Class of Nonlinear Equation Solvers Based on the Residual Norm Reduction over a Sequence of Affine Subspaces, SIAM Journal on Scientific Computing, 16:1, (228-249), Online publication date: 1-Jan-1995.
- Fraley C and Burns P (1995). Large-Scale Estimation of Variance and Covariance Components, SIAM Journal on Scientific Computing, 16:1, (192-209), Online publication date: 1-Jan-1995.
- Gupta A and Kumar V A scalable parallel algorithm for sparse Cholesky factorization Proceedings of the 1994 ACM/IEEE conference on Supercomputing, (793-802)
- 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)
- Rothberg E and Gupta A (1994). An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization, SIAM Journal on Scientific Computing, 15:6, (1413-1439), Online publication date: 1-Nov-1994.
- Agrawal D, Choy M, Va Leong H and Singh A Mixed consistency Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, (101-110)
- Gallivan K, Marsolf B and Wijshoff H The parallel solution of nonsymmetric sparse linear systems using the H* reordering and an associated factorization Proceedings of the 8th international conference on Supercomputing, (419-430)
- Bik A and Wijshoff H Nonzero structure analysis Proceedings of the 8th international conference on Supercomputing, (226-235)
- Pommerell C and Fichtner W (1994). Memory Aspects and Performance of Iterative Solvers, SIAM Journal on Scientific Computing, 15:2, (460-473), Online publication date: 1-Mar-1994.
- Gremban K, Miller G and Teng S Moments of inertia and graph separators Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, (452-461)
- Barnard S, Pothen A and Simon H A spectral algorithm for envelope reduction of sparse matrices Proceedings of the 1993 ACM/IEEE conference on Supercomputing, (493-502)
- Bik A and Wijshoff H Advanced compiler optimizations for sparse computations Proceedings of the 1993 ACM/IEEE conference on Supercomputing, (430-439)
- Ng E and Peyton B (1993). Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers, SIAM Journal on Scientific Computing, 14:5, (1034-1056), Online publication date: 1-Sep-1993.
- Bik A and Wijshoff H Compilation techniques for sparse matrix computations Proceedings of the 7th international conference on Supercomputing, (416-424)
- Lin H and Sips H Parallel direct solution of large sparse systems in finite element computations Proceedings of the 7th international conference on Supercomputing, (261-270)
- Eppstein D, Miller G and Teng S A deterministic linear time algorithm for geometric separators and its applications Proceedings of the ninth annual symposium on Computational geometry, (99-108)
- Visweswariah C and Wehbeh J Incremental event-driven simulation of digital FET circuits Proceedings of the 30th international Design Automation Conference, (737-741)
- Ng E and Peyton B (1993). A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors, SIAM Journal on Scientific Computing, 14:4, (761-769), Online publication date: 1-Jul-1993.
- Kortanek K (1993). Vector-Supercomputer Experiments with the Primal Affine Linear Programming Scaling Algorithm, SIAM Journal on Scientific Computing, 14:2, (279-294), Online publication date: 1-Mar-1993.
- Venugopal S, Naik V and Saltz J Performance of distributed sparse Cholesky factorization with pre-scheduling Proceedings of the 1992 ACM/IEEE conference on Supercomputing, (52-61)
- Pothen A, Simon H, Wang L and Barnard S Towards a fast implementation of spectral nested dissection Proceedings of the 1992 ACM/IEEE conference on Supercomputing, (42-51)
- Agarwal R, Gustavson F and Zubair M A high performance algorithm using pre-processing for the sparse matrix-vector multiplication Proceedings of the 1992 ACM/IEEE conference on Supercomputing, (32-41)
- Gilbert J and Schreiber R (1992). Highly Parallel Sparse Cholesky Factorization, SIAM Journal on Scientific and Statistical Computing, 13:5, (1151-1172), Online publication date: 1-Sep-1992.
- Padakanti V Sparse cholesky factorization on a simulated hypercube Proceedings of the 30th annual ACM Southeast Regional Conference, (300-307)
- Singh J, Weber W and Gupta A (1992). SPLASH, ACM SIGARCH Computer Architecture News, 20:1, (5-44), Online publication date: 1-Mar-1992.
- Pommerell C, Annaratone M and Fichtner W (1992). A Set of New Mapping and Coloring Heuristics for Distributed-Memory Parallel Processors, SIAM Journal on Scientific and Statistical Computing, 13:1, (194-226), Online publication date: 1-Jan-1992.
- Bischof C and Hansen P (1991). Structure-Preserving and Rank-Revealing QR-Factorizations, SIAM Journal on Scientific and Statistical Computing, 12:6, (1332-1350), Online publication date: 1-Nov-1991.
- Rothberg E and Gupta A (1991). Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy, ACM Transactions on Mathematical Software, 17:3, (313-334), Online publication date: 1-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)
- Pommerell C and Fichtner W PILS: an iterative linear solver package for ill-conditioned systems Proceedings of the 1991 ACM/IEEE conference on Supercomputing, (588-599)
- 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.
- Liu J (1991). A generalized envelope method for sparse factorization by rows, ACM Transactions on Mathematical Software, 17:1, (112-129), Online publication date: 1-Mar-1991.
- Rothberg E and Gupta A Techniques for improving the performance of sparse matrix factorization on multiprocessor workstations Proceedings of the 1990 ACM/IEEE conference on Supercomputing, (232-241)
- Lustig I (1990). Feasibility issues in a primal-dual interior-point method for linear programming, Mathematical Programming: Series A and B, 49:1-3, (145-162), Online publication date: 1-Nov-1990.
- Notay Y (1989). Incomplete factorizations of singular linear systems, BIT, 29:4, (682-702), Online publication date: 1-Dec-1989.
- Beauwens R (1989). Approximate factorizations with S/P consistently ordered M-factors, BIT, 29:4, (658-681), Online publication date: 1-Dec-1989.
- Duff I and Meurant G (1989). The effect of ordering on preconditioned conjugate gradients, BIT, 29:4, (635-657), Online publication date: 1-Dec-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.
- Coleman T and Hulbert L (1989). A direct active set algorithm for large sparse quadratic programs with simple bounds, Mathematical Programming: Series A and B, 45:1-3, (373-406), 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)
- Charrier P and Roman J (1989). Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées, Numerische Mathematik, 55:4, (463-476), Online publication date: 1-Jul-1989.
- Naik V and Patrick M Data traffic reduction schemes for Cholesky factorization on asynchronous multiprocessor systems Proceedings of the 3rd international conference on Supercomputing, (283-294)
- Utku S, Salama M and Melosh R (1989). A Family of Permutations for Concurrent Factorization of Block Tridiagonal Matrices, IEEE Transactions on Computers, 38:6, (812-824), Online publication date: 1-Jun-1989.
- Greenberg A and McKenna J (1989). Solution of closed, product form, queueing networks via the RECAL and tree-RECAL methods on a shared memory multiprocessor, ACM SIGMETRICS Performance Evaluation Review, 17:1, (127-135), Online publication date: 1-Apr-1989.
- Greenberg A and McKenna J Solution of closed, product form, queueing networks via the RECAL and tree-RECAL methods on a shared memory multiprocessor Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (127-135)
- Olesen T and Petersen J Vectorized dissection on the hypercube Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2, (1762-1769)
- Aykanat C, Özgüner F, Ercal F and Sadayappan P (1988). Iterative Algorithms for Solution of Large Sparse Systems of Linear Equations on Hypercubes, IEEE Transactions on Computers, 37:12, (1554-1568), Online publication date: 1-Dec-1988.
- Saad Y and Wijshoff H A benchmark package for sparse matrix computations Proceedings of the 2nd international conference on Supercomputing, (500-509)
- Coleman T (1988). A chordal preconditioner for large-scale optimization, Mathematical Programming: Series A and B, 40:1-3, (265-287), Online publication date: 1-Jan-1988.
- Björck Å (1988). A direct method for sparse least squares problems with lower and upper bounds, Numerische Mathematik, 54:1, (19-32), Online publication date: 1-Jan-1988.
- Coleman T and Pothen A (1987). The Null Space Problem II. Algorithms, SIAM Journal on Algebraic and Discrete Methods, 8:4, (544-563), Online publication date: 1-Oct-1987.
- Liu J (1987). On threshold pivoting in the multifrontal method for sparse indefinite systems, ACM Transactions on Mathematical Software, 13:3, (250-261), Online publication date: 1-Sep-1987.
- Gilbert J and Heath M (1987). Computing a Sparse Basis for the Null Space, SIAM Journal on Algebraic and Discrete Methods, 8:3, (446-459), Online publication date: 1-Jul-1987.
- Liu J (1987). An Application of Generalized Tree Pebbling to Sparse Matrix Factorization, SIAM Journal on Algebraic and Discrete Methods, 8:3, (375-395), Online publication date: 1-Jul-1987.
- Barrett W, Johnson C, Olesky D and van den Driessche P (1987). Inherited Matrix Entries, SIAM Journal on Algebraic and Discrete Methods, 8:3, (313-322), Online publication date: 1-Jul-1987.
- Liu J (1986). On the storage requirement in the out-of-core multifrontal method for sparse factorization, ACM Transactions on Mathematical Software, 12:3, (249-264), Online publication date: 1-Sep-1986.
- Edenbrandt A (1986). Quotient tree partitioning of undirected graphs, BIT, 26:2, (148-155), Online publication date: 1-Jun-1986.
- Johnsson S (1985). Solving narrow banded systems on ensemble architectures, ACM Transactions on Mathematical Software, 11:3, (271-288), Online publication date: 1-Sep-1985.
- Veldhorst M (1985). Approximation of the Consecutive Ones Matrix Augmentation Problem, SIAM Journal on Computing, 14:3, (709-729), Online publication date: 1-Aug-1985.
- Nour-Omid B and Parlett B (2006). Element Preconditioning Using Splitting Techniques, SIAM Journal on Scientific and Statistical Computing, 6:3, (761-770), Online publication date: 1-Jul-1985.
- Chan T and Saied F (2006). A Comparison of Elliptic Solvers for General Two-Dimensional Regions, SIAM Journal on Scientific and Statistical Computing, 6:3, (742-760), Online publication date: 1-Jul-1985.
- Dodson D and Lewis J (1985). Proposed sparse extensions to the Basic Linear Algebra Subprograms, ACM SIGNUM Newsletter, 20:1, (22-25), Online publication date: 1-Jan-1985.
- Liniger W (1984). On factored discretizations of the laplacian for the fast solution of Poisson's equation on general regions, BIT, 24:4, (592-608), Online publication date: 1-Dec-1984.
- Rivara M (1984). Design and data structure of fully adaptive, multigrid, finite-element software, ACM Transactions on Mathematical Software, 10:3, (242-264), Online publication date: 28-Aug-1984.
- Funderlic R and Plemmons R (1984). A Combined Direct-Iterative Method for Certain M-Matrix Linear Systems, SIAM Journal on Algebraic and Discrete Methods, 5:1, (33-42), Online publication date: 1-Mar-1984.
- Lewis J (1983). Numerical experiments with SPARSPAK, ACM SIGNUM Newsletter, 18:3, (12-22), Online publication date: 1-Jul-1983.
- George A and Ng E (1983). On Row and Column Orderings for Sparse Least Squares Problems, SIAM Journal on Numerical Analysis, 20:2, (326-344), Online publication date: 1-Apr-1983.
- Li M, Nour-Omid B and Parlett B (1982). A Fast Solver Free of Fill-In for Finite Element Problems, SIAM Journal on Numerical Analysis, 19:6, (1233-1242), Online publication date: 1-Dec-1982.
- Duff I, Grimes R, Lewis J and Poole B (1982). Sparse matrix test problems, ACM SIGNUM Newsletter, 17:2, (22-22), Online publication date: 1-Jun-1982.
- Greenberg H, Lundgren J and Maybee J (1981). Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices, SIAM Journal on Algebraic and Discrete Methods, 2:3, (227-239), Online publication date: 1-Sep-1981.
- George A and Ng E (1981). A brief description of SPARSPAK Waterloo sparse linear equations package, ACM SIGNUM Newsletter, 16:2, (17-20), Online publication date: 1-Jun-1981.
- Gourlay A and Morris J (1980). The Extrapolation of First Order Methods for Parabolic Partial Differential Equations, II, SIAM Journal on Numerical Analysis, 17:5, (641-655), Online publication date: 1-Oct-1980.
Recommendations
On the HSS iteration methods for positive definite Toeplitz linear systems
We study the HSS iteration method for large sparse non-Hermitian positive definite Toeplitz linear systems, which first appears in Bai, Golub and Ng's paper published in 2003 [Z.-Z. Bai, G.H. Golub, M.K. Ng, Hermitian and skew-Hermitian splitting ...
The Hermitian Positive Definite Solution of Some Matrix Equations
APCIP '09: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02In this paper, the Hermitian positive definite solutions of the nonlinear matrix equation are studied. We discuss the relation between and by the eigen value and eigenvector of and respectively, and the property of numerical range of. An iterative ...
Tensor Sparse Coding for Positive Definite Matrices
In recent years, there has been extensive research on sparse representation of vector-valued signals. In the matrix case, the data points are merely vectorized and treated as vectors thereafter (for example, image patches). However, this approach cannot ...