Algorithm 694
From MaRDI portal
Publication:4371762
DOI10.1145/114697.116805zbMath0900.65120OpenAlexW2006411943WikidataQ56999021 ScholiaQ56999021MaRDI QIDQ4371762
Publication date: 18 March 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1991-17/
Related Items (19)
Checking robust nonsingularity of tridiagonal matrices in linear time ⋮ The growth factor and efficiency of Gaussian elimination with rook pivoting ⋮ Convergence in finite precision of successive iteration methods under high nonnormality ⋮ On the condition number of linear least squares problems in a weighted Frobenius norm ⋮ Computations in the neighbourhood of algebraic singularities ⋮ Anymatrix: an extensible MATLAB matrix collection ⋮ Accurate and fast computations with positive extended Schoenmakers-Coffey matrices ⋮ Modified ST algorithms and numerical experiments ⋮ Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem ⋮ Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems ⋮ A collection of examples where Neville elimination outperforms Gaussian elimination ⋮ Algorithm 694 ⋮ Condition number of singular value: zero-structured and patterned case ⋮ Computationally Efficient Decompositions of Oblique Projection Matrices ⋮ Generating Extreme-Scale Matrices With Specified Singular Values or Condition Number ⋮ Matrices with Tunable Infinity-Norm Condition Number and No Need for Pivoting in LU Factorization ⋮ One-sided reduction to bidiagonal form ⋮ The eigenproblem of a tridiagonal 2-Toeplitz matrix ⋮ Estimating the matrix \(p\)-norm
Uses Software
This page was built for publication: Algorithm 694
