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