Algorithm 694
From MaRDI portal
Cited in
(56)- BHESS
- Reliable solution of bidiagonal systems with applications
- MACHAR
- Matrix Depot
- anymatrix
- The growth factor and efficiency of Gaussian elimination with rook pivoting
- Parallel computation of spectral portrait of large matrices by Davidson type methods
- Modified ST algorithms and numerical experiments
- On the robustness of Gaussian elimination with partial pivoting
- HPCC
- INTERVAL_ARITHMETIC
- toms/782
- Checking robust nonsingularity of tridiagonal matrices in linear time
- 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
- NLREG
- Algorithm 695
- Algorithm 722
- CONTEST
- Algorithm 710
- Algorithm 696
- Algorithm 818
- Algorithm 719
- testmatrix
- Anymatrix: an extensible MATLAB matrix collection
- Accurate and fast computations with positive extended Schoenmakers-Coffey matrices
- Parallel minimum norm solution of sparse block diagonal column overlapped underdetermined systems
- NLEVP, a collection of nonlinear eigenvalue problems
- Algorithm 933
- HPL
- Variational bounds on the entries of the inverse of a matrix
- 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
- Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
- About the Qualitative Computation of Jordan Forms
- Computation of the matrix sign function using continued fraction expansion
- Gaussian Elimination with Partial Pivoting Can Fail in Practice
- On the Sensitivity of Solution Components in Linear Systems of Equations
- Rank-Deficient and Discrete Ill-Posed Problems
- Stability of block algorithms with fast level-3 BLAS
- Explicit polar decomposition of companion matrices
- Reliable Solution of Tridiagonal Systems of Linear Equations
- amslatex
- Matrix algebra. Theory, computations and applications in statistics
- Matrix Powers in Finite Precision Arithmetic
- Computations in the neighbourhood of algebraic singularities
- scientific article; zbMATH DE number 1406958 (Why is no real title available?)
- Algorithm 841: BHESS: Gaussian reduction to a similar banded Hessenberg form
- 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
- Factorised preconditionings of successive approximations in finite precision
- NESSIE
- Estimating the matrix p-norm
- Chebyshev semi-iteration in preconditioning for problems including the mass matrix
- A collection of examples where Neville elimination outperforms Gaussian elimination
This page was built for software: Algorithm 694
