Algorithm 694
From MaRDI portal
Software:25043
No author found.
Related Items (37)
Unnamed Item ⋮ Algorithm 933 ⋮ Checking robust nonsingularity of tridiagonal matrices in linear time ⋮ Matrix Powers in Finite Precision Arithmetic ⋮ The growth factor and efficiency of Gaussian elimination with rook pivoting ⋮ About the Qualitative Computation of Jordan Forms ⋮ Computation of the matrix sign function using continued fraction expansion ⋮ 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 ⋮ Parallel computation of spectral portrait of large matrices by Davidson type methods ⋮ Variational bounds on the entries of the inverse of a matrix ⋮ Computations in the neighbourhood of algebraic singularities ⋮ Gaussian Elimination with Partial Pivoting Can Fail in Practice ⋮ Anymatrix: an extensible MATLAB matrix collection ⋮ Matrix Algebra ⋮ Accurate and fast computations with positive extended Schoenmakers-Coffey matrices ⋮ On the Sensitivity of Solution Components in Linear Systems of Equations ⋮ Modified ST algorithms and numerical experiments ⋮ Rank-Deficient and Discrete Ill-Posed Problems ⋮ Stability of block algorithms with fast level-3 BLAS ⋮ Explicit polar decomposition of companion matrices ⋮ Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem ⋮ Chebyshev semi-iteration in preconditioning for problems including the mass matrix ⋮ A collection of examples where Neville elimination outperforms Gaussian elimination ⋮ Factorised preconditionings of successive approximations in finite precision ⋮ Algorithm 841: BHESS: Gaussian reduction to a similar banded Hessenberg form ⋮ NLEVP ⋮ On the robustness of Gaussian elimination with partial pivoting ⋮ The Lack of Influence of the Right-Hand Side on the Accuracy of Linear System Solution ⋮ Handbook of Writing for the Mathematical Sciences, Second Edition ⋮ 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 ⋮ Reliable solution of bidiagonal systems with applications ⋮ Parallel Minimum Norm Solution of Sparse Block Diagonal Column Overlapped Underdetermined Systems ⋮ Reliable Solution of Tridiagonal Systems of Linear Equations ⋮ Estimating the matrix \(p\)-norm
This page was built for software: Algorithm 694
