1. Solving unsymmetric sparse systems of linearequations with PARDISO  
   Olaf Schenk;  Klaus Gärtner
   Future Generation Computer Systems 20 (2004) 475--487
2. A new admissible pivot method for linear programming
   Lim, Sungmook; Park, Soondal
   Asia-Pacific Journal of Operational Research, v 21, n 4, December, 2004, p 421-434, Compendex.
3. Efficient a priori pivoting schemes for a sparse direct Gaussian equation solver for the mixed finite element formulation of the Navier-Stokes equations
   Wille, S.O.; Staff, O.; Loula, A.F.D.
   Applied Mathematical Modelling, v 28, n 7, July, 2004, p 607-616, Compendex.
4. Probabilistic analysis of complex Gaussian elimination without pivoting
   Yeung, Man-Chung  
   Linear Algebra and Its Applications, v 384, n 1-3 SUPPL., Jun 1, 2004, p 109-134, Compendex.
5. Scaled pivots and scaled partial pivoting strategies   
   Peña, Juan M.  
   SIAM Journal on Numerical Analysis, v 41, n 3, 2003, p 1022-1031, Compendex.
6. Roundoff Error Estimates of the Modified Gram--Schmidt Algorithm with Column Pivoting
   Wei M.; Liu Q.
   Bit Numerical Mathematics, September 2003, vol. 43, no. 3, pp. 627-645(19), Ingenta.  
7. Analysis of new pivoting strategy for the LDLT decomposition on a multiprocessor system with distributed memory
   Salterain, A.; Galarza, A.; Zubia, I.; Linaza, M.T.
   IEE Proceedings: Computers and Digital Techniques, v 150, n 1, January, 2003, p 53-63, Compendex.
8. Partial Pivoting in the Computation of Krylov Subspaces of Large Sparse Systems
   Hodel, A. Scottedward; Misra, Pradeep
   Proceedings of the IEEE Conference on Decision and Control, v 3, 2003, p 2878-2883, Compendex.
9. Some Features of Gaussian Elimination with Rook Pivoting
   Chang X-W.
   Bit Numerical Mathematics, 2002, vol. 42, no. 1, pp. 66-83(18), Ingenta.  
10. A robust ILU with pivoting based on monitoring the growth of the inverse factors
    Bollhofer M.
    Linear Algebra and its Applications, 15 November 2001, vol. 338, no. 1, pp. 201-218(18), Ingenta.  
11. A parallel algorithm for sparse symbolic LU factorization without pivoting on out-of-core matrices
    Cosnard, M.; Grigori, L.
    Proceedings of the International Conference on Supercomputing, 2001, p 146-153, Compendex.
12. Stability of a pivoting strategy for parallel Gaussian elimination.    
    Mead, J. L.; Renaut, R. A.; Welfert, B. D.     
    Bit Numerical Mathematics, 2001, vol. 41, no. 3, pp. 633--639, MathSciNet.  
13. A priori pivoting in incomplete Gaussian preconditioning for iterative solution of mixed finite-element formulation of the Navier-Stokes equations
    Wille S.O.; Loula A.F.D.
    Computer Methods in Applied Mechanics and Engineering, 13 April 2001, vol. 190, no. 29, pp. 3735-3747(13), Ingenta.  
14. New pivoted banded linear equations solvers
    Stabrowski, M.M.  
    Communications in Numerical Methods in Engineering, v 16, n 5, May, 2000, p 315-323, Compendex.
15. Principal pivot transforms: properties and applications
    Tsatsomeros, Michael J.  
    Linear Algebra and Its Applications, v 307, n 1-3, Mar, 2000, p 151-165, Compendex.  
16. On the Robustness of Gaussian Elimination with Partial Pivoting
    Favati P.; Leoncini M.; Martinez A.
    Bit Numerical Mathematics, 2000, vol. 40, no. 1, pp. 62-73(12), Ingenta.  
17. An orthogonally based pivoting transformation of matrices and some applications.    
    Castillo, Enrique; Cobo, Angel; Jubete, Francisco; Pruneda, Rosa Eva; Castillo, Carmen    
    SIAM J. Matrix Anal. Appl. 22 (2000), no. 3, 666--681 (electronic), MathSciNet.  
18. Partial pivoting Schur-type algorithm for the factorization of matrices with the Jordan displacement structure
    Kim, Kyungsup; Chun, Joohwan
    Proceedings of the American Control Conference, v 5, 2000, p 3378-3382, Compendex.
19. The Rook's pivoting strategy
    Poole, George; Neal, Larry
    Journal of Computational and Applied Mathematics, 1 November 2000, vol. 123, no. 1, pp. 353-369(17), Ingenta.  
20. A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting
    Dax A.
    Linear Algebra and its Applications, 1 May 2000, vol. 310, no. 1, pp. 25-42(18), Ingenta.  
21. QR factorization with complete pivoting and accurate computation of the SVD
    Higham, Nicholas J.  
    Linear Algebra and Its Applications, v 309, n 1-3, Apr, 2000, p 153-174, Compendex.
22. A supernodal approach to sparse partial pivoting.    
    Demmel, James W.; Eisenstat, Stanley C.; Gilbert, John R.; Li, Xiaoye S.; Liu, Joseph W. H.    
    SIAM J. Matrix Anal. Appl. 20 (1999), no. 3, 720--755 (electronic), MathSciNet.  
23. Pivoting strategies leading to diagonal dominance by rows.    
    Peña, J. M.    
    Numer. Math. 81 (1998), no. 2, 293--304, MathSciNet.  
24. The growth factor and efficiency of Gaussian elimination with rook pivoting
    Foster L.V.
    Journal of Computational and Applied Mathematics, 5 October 1998, vol. 98, no. 1, pp. 177-177(1), Ingenta.  
25. Stability of the Gauss-Huard algorithm with partial pivoting.   
    Dekker, T. J.; Hoffmann, W.; Potma, K.    
    Computing 58 (1997), no. 3, 225--244, MathSciNet.  
26. Backward stability of a pivoting strategy for sign-regular linear systems.    
    Peña, J. M.    
    BIT 37 (1997), no. 4, 910--924, MathSciNet.  
27. Efficient Parallel Algorithm for Dense Matrix LU Decomposition with Pivoting on Hypercubes
    Zhiyong L.; Cheung D.W.
    Computers and Mathematics with Applications, April 1997, vol. 33, no. 8, pp. 39-50(12), Ingenta.  
28. Locality of reference in LU decomposition with partial pivoting.    
    Toledo, Sivan    
    SIAM J. Matrix Anal. Appl. 18 (1997), no. 4, 1065--1081, MathSciNet.  
29. The growth factor and efficiency of Gaussian elimination with rook pivoting
    Foster, Leslie V.  
    Journal of Computational and Applied Mathematics, 28 November 1997, vol. 86, no. 1, pp. 177-194(18), Ingenta.  
30. Probabilistic analysis of Gaussian elimination without pivoting.    
    Yeung, Man-Chung; Chan, Tony F.    
    SIAM J. Matrix Anal. Appl. 18 (1997), no. 2, 499--517, MathSciNet.  
31. The Behavior of the QR-Factorization Algorithm with Column Pivoting
    Engler H.
    Applied Mathematics Letters, November 1997, vol. 10, no. 6, pp. 7-11(5), Ingenta.  
32. A new pivoting strategy for Gaussian elimination     
    Olschowka, Markus; Neumaier, Arnold    
    Linear Algebra Appl. 240 (1996), 131--151, MathSciNet.  
33. On the Parallel Complexity of Gaussian Elimination with Pivoting
    Leoncini M.
    Journal of Computer and System Sciences, December 1996, vol. 53, no. 3, pp. 380-394(15), Ingenta.  
34. An Investigation of Interior-Point and Block Pivoting Algorithms for Large-Scale Symmetric Monotone Linear Complementarity Problems
    Fernandes L.; Júdice J.; Patrício J.
    Computational Optimization and Applications, January 1996, vol. 5, no. 1, pp. 49-77(29), Ingenta.  
35. Pivoting strategies leading to small bounds of the errors for certain linear systems.    
    Peña, J. M.    
    IMA J. Numer. Anal. 16 (1996), no. 2, 141--153, MathSciNet.  
36. Frontal program for a PC-based solution of unsymmetric matrices using a buffered pivot search
    Chandrupatla, T.R.; Berry, K.J.
    Advances in Engineering Software, v 27, n 3, Dec, 1996, p 191-199, Compendex.
37. An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems.    
    Fernandes, L.; Júdice, J.; Patrício, J.    
    Comput. Optim. Appl. 5 (1996), no. 1, 49--77, MathSciNet.  
38. Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure  
    I. Gohbert, T. Kailath, V. Olshevsky  
    Mathematics of Computation, Vol. 64, No. 212. (Oct., 1995), pp. 1557-1576, Jstor.  
39. Fast Gaussian elimination with partial pivoting for matrices with displacement structure.    
    Gohberg, I.; Kailath, T.; Olshevsky, V.    
    Math. Comp. 64 (1995), no. 212, 1557--1576, MathSciNet.  
40. A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables  
    Luis F. Portugal, Joaquim J. Judice, Luis N. Vicente  
    Mathematics of Computation, Vol. 63, No. 208. (Oct., 1994), pp. 625-643, Jstor.  
41. New pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point
    Kremers, Hans; Talman, Dolf
    Mathematical Programming, Series A, v 63, n 2, Jan 31, 1994, p 235-252, Compendex.
42. Gaussian elimination with partial pivoting can fail in practice.    
    Foster, Leslie V.    
    SIAM J. Matrix Anal. Appl. 15 (1994), no. 4, 1354--1362, MathSciNet.  
43. Row/column pivoting strategy on multicomputers
    Angelaccio, M.; Colajanni, M.
    Parallel Computing, v 20, n 2, Feb, 1994, p 197-213, Compendex.
44. Scaled pivoting in Gauss and Neville elimination for totally positive systems.    
    Gasca, M.; Peña, J. M.    
    Appl. Numer. Math. 13 (1993), no. 5, 345--355, MathSciNet.  
45. Pivoting to normalize a basic matrix
    Eaves, B. Curtis  
    Mathematical Programming, Series A, v 62, n 3-8, Dec, 1993, p 553-556, Compendex.  
46. A collection of problems for which Gaussian elimination with partial pivoting is unstable.    
    Wright, Stephen J.    
    SIAM J. Sci. Comput. 14 (1993), no. 1, 231--238, MathSciNet.  
47. Processor arrays for matrix triangularisation with partial pivoting
    Wyrzykowski, R.  
    IEE Proceedings, Part E: Computers and Digital Techniques, v 139, n 2, Mar, 1992, p 165-169, Compendex.
48. The role of pivoting in proving some fundamental theorems of linear algebra.    
    Klafszky, Emil; Terlaky, Tamás    
    Linear Algebra Appl. 151 (1991), 97--118, MathSciNet.  
49. Threshold pivoting for dense LU factorization on distributed memory multiprocessor
    Malard, Joel  
    Proc Supercomput 91, 1991, p 600-607, Compendex.
50. On growth in Gaussian elimination with complete pivoting.    
    Gould, Nick    
    SIAM J. Matrix Anal. Appl. 12 (1991), no. 2, 354--361, MathSciNet.  
51. The principal pivoting method revisited.    
    Cottle, Richard W.    
    Math. Programming 48 (1990), no. 3, (Ser. B), 369--385, MathSciNet.  
52. Systolic helix for matrix triangularisation with partial pivoting
    Megson, G.M.  
    Parallel Computing, v 14, n 2, Jun, 1990, p 199-206, Compendex.
53. Parallel sparse Gaussian elimination with partial pivoting. Supercomputers and large-scale optimization: algorithms, software, applications (Minneapolis, MN, 1988).    
    George, Alan; Ng, Esmond    
    Ann. Oper. Res. 22 (1990), no. 1-4, 219--240, MathSciNet.  
54. Gaussian elimination with pivoting on hypercubes
    Rivera, F.F.; Doallo, R.; Bruguera, J.D.; Zapata, E.L.; Peskin, R.
    Parallel Computing, v 14, n 1, May, 1990, p 51-60, Compendex.
55. Efficient linear and bilinear arrays for matrix triangularisation with partial pivoting
    El-Amawy, A.; Barada, H.
    IEE Proceedings, Part E: Computers and Digital Techniques, v 137, n 4, Jul, 1990, p 295-300, Compendex.
56. Parallel pivoting combined with parallel reduction and fill-in control.    
    Alaghband, Gita    
    Parallel Comput. 11 (1989), no. 2, 201--221, MathSciNet.  
57. Large growth factors in Gaussian elimination with pivoting.    
    Higham, Nicholas J.; Higham, Desmond J.    
    SIAM J. Matrix Anal. Appl. 10 (1989), no. 2, 155--164, MathSciNet.  
58. Block QR factorization algorithm using restricted pivoting
    Bischof, Christian H.  
    Proc Supercomput 89, 1989, p 248-256, Compendex.
59. A linear reordering algorithm for parallel pivoting of chordal graphs     
    Liu, Joseph W. H.; Mirzaian, Andranik    
    SIAM J. Discrete Math. 2 (1989), no. 1, 100--107, MathSciNet.  
60. Regular processor arrays for matrix algorithms with pivoting.
    Roychowdhury, V.P.; Kailath, T.
    Proc Int Conf on Systolic Arrays, 1988, p 237-246, Compendex.
61. Parallel QR factorization algorithm using local pivoting
    Bischof, Christian H.  
    Proc Supercomputing 88, 1988, p 400-407, Compendex.
62. Systolic Architecture For Matrix Triangularisation With Partial Pivoting
    Barada, H.; El-Amawy, A.
    IEE Proceedings, Part E: Computers and Digital Techniques, v 135, n 4, Jul, 1988, p 208-213, Compendex.
63. On parallel Gaussian elimination with pivoting. (Chinese)    
    You, Zhao Yong; Li, Lei; Hu, Jie    
    J. Numer. Methods Comput. Appl. 9 (1988), no. 4, 207--213, MathSciNet.  
64. Symbolic factorization for sparse Gaussian elimination with partial pivoting     
    George, Alan; Ng, Esmond    
    SIAM J. Sci. Statist. Comput. 8 (1987), no. 6, 877--898, MathSciNet.   
65. Segmented Partial Pivoting And Parallel Sparse-Matrix Solution On Multiprocessors
    Ko, Howard Fu-Hwa; Sangiovanni-Vincentelli, Alberto
    Proceedings - IEEE International Symposium on Circuits and Systems, 1987, p 1060-1063, Compendex.
66. A partial pivoting strategy for sparse symmetric matrix decomposition     
    Liu, Joseph W. H.    
    ACM Trans. Math. Software 13 (1987), no. 2, 173--182, MathSciNet.  
67. Partial Pivoting Strategy For Sparse Symmetric Matrix Decomposition
    Liu, Joseph W. H.  
    ACM Transactions on Mathematical Software, v 13, n 2, Jun, 1987, p 173-182, Compendex.
68. Studie zur Pivotisierung beim Gaußschen Algorithmus. (German) [Study of pivoting in the Gauss algorithm] Rostock.    
    Berg, Lothar    
    Math. Kolloq. No. 30 (1986), 105--112, MathSciNet.  
69. Analysis of pairwise pivoting in Gaussian elimination     
    Sorensen, Danny C.    
    IEEE Trans. Comput. 34 (1985), no. 3, 274--278, MathSciNet.  
70. An implementation of Gaussian elimination with partial pivoting for sparse systems.     
    George, Alan; Ng, Esmond    
    SIAM J. Sci. Statist. Comput. 6 (1985), no. 2, 390--409, MathSciNet.  
71. Stability of Gaussian elimination without pivoting on tridiagonal Toeplitz matrices.    
    Gunzburger, Max D.; Nicolaides, R. A.    
    Linear Algebra Appl. 45 (1982), 21--28, MathSciNet.  
72. Partial pivoting strategies for symmetric Gaussian elimination.    
    Dax, Achiya    
    Math. Programming 22 (1982), no. 3, 288--303, MathSciNet.  
73. Effect of Equilibration on Residual Size for Partial Pivoting  
    Robert D. Skeel  
    SIAM Journal on Numerical Analysis > Vol. 18, No. 3 (Jun., 1981), pp. 449-454, Jstor.   
74. LU decomposition of M-matrices by elimination without pivoting.    
    Funderlic, R. E.; Plemmons, R. J.    
    Linear Algebra Appl. 41 (1981), 99--110, MathSciNet.  
75. On Factoring a Class of Complex Symmetric Matrices Without Pivoting  
    Steven M. Serbin  
    Mathematics of Computation, Vol. 35, No. 152. (Oct., 1980), pp. 1231-1234, Jstor.  
76. Algorithm 533 Em Dash Nspiv, A Fortran Subroutine For Sparse Gaussian Elimination With Partial Pivoting
    Sherman, Andrew H.
    ACM Transactions on Mathematical Software, v 4, n 4, Dec, 1978, p 391-398, Compendex.
77. On the Gaussian elimination method based on the diagonal maximal pivoting for a system of linear equations whose matrix is Hermitian positive definite or is dia. (Korean)    
    Ho, Song Chang    
    Su-hak kwa Mul-li 22 (1978), no. 3, 4--10, MathSciNet.  
78. A note on partial pivoting and Gaussian elimination.    
    van Veldhuizen, M.    
    Numer. Math. 29 (1977/78), no. 1, 1--10, MathSciNet.  
79. Hierarchical partition---a new optimal pivoting algorithm.    
    Lin, T. D.; Mah, R. S. H.    
    Math. Programming 12 (1977), no. 2, 260--278, MathSciNet.  
80. Pivoting techniques for symmetric Gaussian elimination.    
    Dax, A.; Kaniel, S.    
    Numer. Math. 28 (1977), no. 2, 221--241, MathSciNet.  
81. Some New Results On Decomposition And Pivoting Of Large Sparse Systems Of Linear Equations.
    Jess, Jochen A. G.
    IEEE Transactions on Circuits and Systems, v CAS-23, n 12, Dec, 1976, p 729-738, Compendex.
82. Minimal Triangulation Of A Graph And Optimal Pivoting Order In A Sparse Matrix
    Ohtsuki, Tatsuo; Cheung, Lap Kit; Fujisawa, Toshio
    Journal of Mathematical Analysis and Applications, v 54, n 3, Jun, 1976, p 622-633, Compendex.
83. A Simple Proof for Partial Pivoting (in Mathematical Notes)  
    Donald J. Rose  
    American Mathematical Monthly, Vol. 82, No. 9. (Nov., 1975), pp. 919-921, Jstor.  
84. Parallel Processing Algorithm For Matrix Pivoting
    Ho, C. W.; Zein, D. A.
    IBM Technical Disclosure Bulletin, v 18, n 8, Dec, 1975, p 2368-2371, Compendex.
85. Use Of Pivot Ratios As A Guide To Stability Of Matrix Equations Arising In The Method Of Moments.
    Mittra, Raj; Klein, Charles A.
    IEEE Transactions on Antennas and Propagation, v AP-23, n 3, May, 1975, p 448-450, Compendex.
86. Partial Pivoting Strategies for Symmetric Matrices  
    James R. Bunch  
    SIAM Journal on Numerical Analysis, Vol. 11, No. 3. (Jun., 1974), pp. 521-528, Jstor.  
87. Pivoting-Order Computation Method For Large Random Sparse Systems.
    Hsieh, Hsueh Y.
    IEEE Transactions on Circuits and Systems, v CAS-21, n 2, Mar, 1974, p 225-230, Compendex.
88. An optimal pivoting order for the solution of sparse systems of equations.    
    Nakhla, M.; Singhal, K.; Vlach, J.    
    IEEE Transactions on Circuits and Systems, v CAS-21, n 2, Mar, 1974, p 222-225, MathSciNet.  
89. Pivot Selection And Row Ordering In Givens Reduction On Sparse Matrices.
    Duff, I. S.
    Computing (Vienna/New York), v 13, n 3-4, 1974, p 239-248, Compendex.
90. Probabilistic Approach To Optimal Pivoting And Prediction Of Fill-In For Random Sparse Matrices.
    Hsieh, Hsueh Y.; Ghausi, Mohammed S.
    IEEE Transactions on Circuit Theory, v CT-19, n 4, Jul, 1972, p 329-336, Compendex.
91. On optimal-pivoting algorithms in sparse matrices.
    Hsieh, H. Y.; Ghausi, M. S.    
    IEEE Trans. Circuit Theory CT-19 (Jan, 1972), 93--96, MathSciNet.  
92. Analysis of the Diagonal Pivoting Method  
    J. R. Bunch  
    SIAM Journal on Numerical Analysis, Vol. 8, No. 4. (Dec., 1971), pp. 656-680, Jstor.  
93. Maximum-Rank Minimum- Term- Rank Theorem For The Pivotal Transforms Of A Matrix
    IRI M
    Linear Algebra & Its Applications, v 2, n 4, Oct, 1969, p 427-46, Compendex.

(c) John H. Mathews 2005