testmatrix
From MaRDI portal
Testmatrix
Cited in
(only showing first 100 items - show all)- Transpose-free Lanczos-type algorithms for nonsymmetric linear systems
- Backward error bounds for constrained least squares problems
- Vector sequence transformations: Methodology and applications to linear systems
- A Lanczos-type method for solving nonsymmetric linear systems with multiple right-hand sides -- matrix and polynomial interpretation
- Computation of pseudospectra via spectral projectors
- PDFIND
- Matrix Depot
- Stable iterations for the matrix square root
- The growth factor and efficiency of Gaussian elimination with rook pivoting
- Pseudospectra of linear matrix pencils by block diagonalization
- Computing spectral value sets using the subharmonicity of the norm of rational matrices
- Computation of pseudospectra by spectral dichotomy methods in a parallel environment
- Modified ST algorithms and numerical experiments
- COBRA
- Numerically stable generation of correlation matrices and their factors
- Some features of Gaussian elimination with rook pivoting
- HPEC
- Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
- On the exponential generating function for non-backtracking walks
- mctoolbox
- Two algorithms for computing the matrix cosine function
- A new efficient and accurate spline algorithm for the matrix exponential computation
- An efficient and accurate algorithm for computing the matrix cosine based on new Hermite approximations
- On the sensitivity of the SR decomposition
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- On -spectra and stability radii
- Eigtool
- Seigtool
- Expint
- The transmission of shifts and shift blurring in the QR algorithm
- Computing the field of values and pseudospectra using the Lanczos method with continuation
- A curve tracing algorithm for computing the pseudospectrum
- A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining
- QR factorization with complete pivoting and accurate computation of the SVD
- Backward error and condition of polynomial eigenvalue problems
- Computing the reciprocal of a -function by rational approximation
- On the backward and forward error of approximations of analytic functions and applications to the computation of matrix functions
- smt
- toms729gw
- A stabilized GMRES method for singular and severely ill-conditioned systems of linear equations
- On initial point selection of the steepest descent algorithm for general quadratic functions
- Computing matrix functions arising in engineering models with orthogonal matrix polynomials
- na5
- rrgmrestbx
- na31
- TOEPLITZ
- Fast Taylor polynomial evaluation for the computation of the matrix cosine
- Chebyshev acceleration of the GeneRank algorithm
- CONTEST
- An error analysis of the modified scaling and squaring method
- Algorithm 710
- Algorithm 694
- Hadamard
- Some large-scale matrix computation problems
- On the numerical solution of AX-XB=C
- Cayley continuants
- MATLAB expm
- Anymatrix: an extensible MATLAB matrix collection
- Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations
- apfloat
- Sensitivity analysis for the symplectic QR factorization
- Linearization estimates of the backward errors for least squares problems.
- DOTmark
- A new algorithm for generalized Sylvester-observer equation and its application to state and velocity estimations in vibrating systems.
- Accurate and fast computations with positive extended Schoenmakers-Coffey matrices
- Efficient and accurate algorithms for computing matrix trigonometric functions
- Temporal_Eigenvector_Centrality
- A network model for polarization of political opinion
- HPL
- A parallel block Lanczos algorithm and its implementation for the evaluation of some eigenvalues of large sparse symmetric matrices on multicomputers
- Preconditioning linear least-squares problems by identifying a basis matrix
- Tridiagonal test matrices for eigenvalue computations: two-parameter extensions of the Clement matrix
- Updating and downdating techniques for optimizing network communicability
- mftoolbox
- MMQ Toolbox
- SONEST
- CONEST
- GeneRank
- Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
- \texttt{smt}: A Matlab toolbox for structured matrices
- A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization
- Factorizing complex symmetric matrices with positive definite real and imaginary parts
- scientific article; zbMATH DE number 1222713 (Why is no real title available?)
- Structured Backward Error and Condition of Generalized Eigenvalue Problems
- scientific article; zbMATH DE number 1292259 (Why is no real title available?)
- scientific article; zbMATH DE number 1342075 (Why is no real title available?)
- How many zeros of a random polynomial are real?
- Iterative refinement for linear systems and LAPACK
- scientific article; zbMATH DE number 1083101 (Why is no real title available?)
- An algorithm for approximating the singular triplets of complex symmetric matrices
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- scientific article; zbMATH DE number 2078361 (Why is no real title available?)
- The deformed graph Laplacian and its applications to network centrality analysis
- Row-Wise Backward Stable Elimination Methods for the Equality Constrained Least Squares Problem
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Matrix Powers in Finite Precision Arithmetic
- A Practical Upper Bound for Departure from Normality
- Approximation of functions of large matrices with Kronecker structure
- QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices
- Block matrix formulations for evolving networks
This page was built for software: testmatrix