|
|
||||||
|
|
|
Support Publications
| [1] |
Marshall Bern, John R. Gilbert, Bruce Hendrickson, Nhat Nguyen and Sivan Toledo Support-Graph Preconditioners Submitted to the SIAM Journal on Matrix Analysis and Applications |
| [2] |
Erik G. Boman and Bruce Hendrickson Support Theory for Preconditioning SIAM Journal on Matrix Analysis and Applications 25 (3): 694--717, (2003) |
| [3] |
Erik G. Boman, Doron Chen, Bruce Hendrickson and Sivan Toledo Maximum-weight-basis preconditioners. Numerical Linear Algebra with Applications 11: 695--721 (2004) |
| [4] |
Anil Joshi Topics in Optimization and Sparse Linear Systems. Ph.D. Thesis, University of Illinois at Urbana-Champaign, 1997 |
| [5] |
Keith D. Gremban Combinatorial Preconditioners for Sparse, Diagonally Dominant Linear Systems. Ph.D. Thesis, Carnegie Mellon University, 1996 |
| [6] |
Doron Chen and Sivan Toledo Vaidya's preconditioners: Implementation and experimental study Electronic Transactions on Numerical Analysis 16: 30--49 (2003) |
| [7] |
John Reif Efficient Approximate Solution of Sparse Linear Systems + errata Computers and Mathematics with Applications 36(9): 37--58 (1998) |
| [8] |
Vicki Howle and Stephen Vavasis Preconditioning Complex-Symmetric Layered Systems Arising in Electrical Power Modeling Technical Report |
| [9] |
Daniel A. Spielman and Shang-Hua Teng Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in time O(m1.31). In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 416--427, Cambridge, MA, October 2003. |
| [10] |
Daniel A. Spielman and Shang-Hua Teng Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems In Proceedings of the 36th ACM Symposium on Theory of Computing, pages 81--90, 2004. |
| [11] |
Erik G. Boman, Bruce Hendrickson and Stephen Vavasis Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners Manuscript, Sandia National Lab. and Cornell |
| [12] |
Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo Finding Effective Support-Tree Preconditioners In Proceedings of the 17th ACM Symposium on Parallel Algorithms and Architectures, Las Vegas, 2005. |
| [13] |
Gary L. Miller and Peter C. Richter Lower Bounds for Graph Embeddings and Combinatorial Preconditioners Proceedings of the 16th ACM Symposium on Parallel Algorithms and Architectures, Barcelona, Spain, pages 112--119, 2004 |
| [14] |
Michael Elkin, Yuval Emek, Daniel A. Spielman and Shang-Hua Teng Lower-Stretch Spanning Trees Proceedings of the 37th annual ACM symposium on Theory of computing, Baltimore, pages 494--503, 2005 |
| [15] |
Gene Poole, Yong-Cheng Liu and Jan Mandel Advancing Analysis Capabilities in ANSYS through Solver Technology Electronic Transactions on Numerical Analysis, vol. 15, pp 106-121, 2003. |
| [16] |
Eugene L. Poole, Michael A. Heroux,
Pravin Vaidya and Anil Joshi Performance of iterative methods in ANSYS on Cray parallel/vector supercomputers Computing Systems in Engineering, vol 6, no 3, 1995, pp 251-259. |
| [17] |
Erik G. Boman, Bruce Hendrickson, and Stephen Vavasis Solving Elliptic Finite Element Problems in Near-Linear Time using Support Preconditioners, Manuscript (2004), submitted for publication. |