Large Growth Factors in Gaussian Elimination with Pivoting
From MaRDI portal
Publication:4730675
DOI10.1137/0610012zbMath0681.65012OpenAlexW2165917639WikidataQ56999054 ScholiaQ56999054MaRDI QIDQ4730675
Nicholas J. Higham, Desmond J. Higham
Publication date: 1989
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: http://eprints.maths.manchester.ac.uk/356/1/0610012.pdf
Related Items
On the complexity of some basic problems in computational convexity. I. Containment problems, The Bunch-Kaufman factorization of symmetric matrices signature similar to sign regular matrices, Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?, The growth factor and efficiency of Gaussian elimination with rook pivoting, On the complete pivoting conjecture for a hadamard matrix of order 12, Hadamard Matrices: Insights into Their Growth Factor and Determinant Computations, Accuracy and stability of quaternion Gaussian elimination, Growth Factors of Random Butterfly Matrices and the Stability of Avoiding Pivoting, A note on matrices with maximal growth factor for Neville elimination, Stability analysis of block factorization for complex symmetric block tridiagonal matrices, Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition, Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra, Random Matrices Generating Large Growth in LU Factorization with Pivoting, On growth factors of the modified Gram-Schmidt algorithm, A collection of examples where Neville elimination outperforms Gaussian elimination, Adaptive data distribution for concurrent continuation, A counterexample to a hadamard matrix pivot conjecture, Generating Extreme-Scale Matrices With Specified Singular Values or Condition Number, Symmetric conference matrices and locally largest regular crosspolytopes in cubes
