The following pages link to testmatrix (Q26249):
Displaying 50 items.
- Sensitivity analysis for the symplectic QR factorization (Q285688) (← links)
- Efficient and accurate algorithms for computing matrix trigonometric functions (Q313622) (← links)
- Tridiagonal test matrices for eigenvalue computations: two-parameter extensions of the Clement matrix (Q345959) (← links)
- Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem (Q395333) (← links)
- \texttt{smt}: A Matlab toolbox for structured matrices (Q411534) (← links)
- Approximation of functions of large matrices with Kronecker structure (Q504162) (← links)
- On some classes of structured matrices with algebraic trigonometric eigenvalues (Q544056) (← links)
- Efficient orthogonal matrix polynomial based method for computing matrix exponential (Q632884) (← links)
- Incremental norm estimation for dense and sparse matrices (Q698566) (← links)
- The computation of the square roots of circulant matrices (Q716072) (← links)
- Doubling (dual) Hahn polynomials: classification and applications (Q903708) (← links)
- Quadrature rule-based bounds for functions of adjacency matrices (Q977482) (← links)
- A collection of examples where Neville elimination outperforms Gaussian elimination (Q984263) (← links)
- Transpose-free Lanczos-type algorithms for nonsymmetric linear systems (Q1127055) (← links)
- Backward error bounds for constrained least squares problems (Q1293243) (← links)
- Vector sequence transformations: Methodology and applications to linear systems (Q1298813) (← links)
- A Lanczos-type method for solving nonsymmetric linear systems with multiple right-hand sides -- matrix and polynomial interpretation (Q1300798) (← links)
- Computation of pseudospectra via spectral projectors (Q1307565) (← links)
- Stable iterations for the matrix square root (Q1373134) (← links)
- The growth factor and efficiency of Gaussian elimination with rook pivoting (Q1379000) (← links)
- Pseudospectra of linear matrix pencils by block diagonalization (Q1382774) (← links)
- Computing spectral value sets using the subharmonicity of the norm of rational matrices (Q1387235) (← links)
- Computation of pseudospectra by spectral dichotomy methods in a parallel environment (Q1410483) (← links)
- Modified ST algorithms and numerical experiments (Q1412344) (← links)
- Numerically stable generation of correlation matrices and their factors (Q1592689) (← links)
- Some features of Gaussian elimination with rook pivoting (Q1599135) (← links)
- Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems (Q1611915) (← links)
- On the exponential generating function for non-backtracking walks (Q1669018) (← links)
- Two algorithms for computing the matrix cosine function (Q1740011) (← links)
- A new efficient and accurate spline algorithm for the matrix exponential computation (Q1747317) (← links)
- An efficient and accurate algorithm for computing the matrix cosine based on new Hermite approximations (Q1757341) (← links)
- On the sensitivity of the SR decomposition (Q1809104) (← links)
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization (Q1826601) (← links)
- On \(\varepsilon\)-spectra and stability radii (Q1860422) (← links)
- The transmission of shifts and shift blurring in the QR algorithm (Q1923181) (← links)
- Computing the field of values and pseudospectra using the Lanczos method with continuation (Q1923867) (← links)
- A curve tracing algorithm for computing the pseudospectrum (Q1923868) (← links)
- A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining (Q1944967) (← links)
- QR factorization with complete pivoting and accurate computation of the SVD (Q1976914) (← links)
- Backward error and condition of polynomial eigenvalue problems (Q1976923) (← links)
- Computing the reciprocal of a \(\phi\)-function by rational approximation (Q2070289) (← links)
- On the backward and forward error of approximations of analytic functions and applications to the computation of matrix functions (Q2088843) (← links)
- A stabilized GMRES method for singular and severely ill-conditioned systems of linear equations (Q2135556) (← links)
- On initial point selection of the steepest descent algorithm for general quadratic functions (Q2141353) (← links)
- Computing matrix functions arising in engineering models with orthogonal matrix polynomials (Q2256479) (← links)
- Fast Taylor polynomial evaluation for the computation of the matrix cosine (Q2423580) (← links)
- Chebyshev acceleration of the GeneRank algorithm (Q2450052) (← links)
- An error analysis of the modified scaling and squaring method (Q2468911) (← links)
- Some large-scale matrix computation problems (Q2564249) (← links)
- On the numerical solution of \(AX-XB=C\) (Q2565276) (← links)
