testmatrix
From MaRDI portal
Software:26249
swMATH14347MaRDI QIDQ26249FDOQ26249
Author name not available (Why is that?)
Source code repository: https://github.com/carandraug/testmatrix/blob/master/Test%20Matrix%20Toolbox/matrix.m
Cited In (85)
- On \(\varepsilon\)-spectra and stability radii
- Title not available (Why is that?)
- A new efficient and accurate spline algorithm for the matrix exponential computation
- 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.
- Title not available (Why is that?)
- Fast Taylor polynomial evaluation for the computation of the matrix cosine
- An algorithm for approximating the singular triplets of complex symmetric matrices
- An efficient and accurate algorithm for computing the matrix cosine based on new Hermite approximations
- On initial point selection of the steepest descent algorithm for general quadratic functions
- Accurate and fast computations with positive extended Schoenmakers-Coffey matrices
- Acceleration procedures for matrix iterative methods
- A New Lower Bound on the Size of the Smallest Vertex Separator of a Graph
- Computing the reciprocal of a \(\phi\)-function by rational approximation
- On the backward and forward error of approximations of analytic functions and applications to the computation of matrix functions
- Computing spectral value sets using the subharmonicity of the norm of rational matrices
- Parallel computation of pseudospectra by fast descent
- Chebyshev acceleration of the GeneRank algorithm
- Anymatrix: an extensible MATLAB matrix collection
- Preconditioned iterative methods for the nine-point approximation to the convection-diffusion equation
- Linearization estimates of the backward errors for least squares problems.
- A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining
- Incremental norm estimation for dense and sparse matrices
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- On some classes of structured matrices with algebraic trigonometric eigenvalues
- Componentwise perturbation analyses for the QR factorization
- The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis
- A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization
- Sensitivity analysis for the symplectic QR factorization
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- The computation of the square roots of circulant matrices
- Transpose-free Lanczos-type algorithms for nonsymmetric linear systems
- Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
- A collection of examples where Neville elimination outperforms Gaussian elimination
- Title not available (Why is that?)
- Stable iterations for the matrix square root
- Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations
- Numerically stable generation of correlation matrices and their factors
- \texttt{smt}: A Matlab toolbox for structured matrices
- A Practical Upper Bound for Departure from Normality
- Quadrature rule-based bounds for functions of adjacency matrices
- Computing the field of values and pseudospectra using the Lanczos method with continuation
- Matrix Powers in Finite Precision Arithmetic
- Title not available (Why is that?)
- Computing matrix functions arising in engineering models with orthogonal matrix polynomials
- A Lanczos-type method for solving nonsymmetric linear systems with multiple right-hand sides -- matrix and polynomial interpretation
- Pseudospectra of linear matrix pencils by block diagonalization
- Efficient and accurate algorithms for computing matrix trigonometric functions
- Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
- Computation of pseudospectra via spectral projectors
- The growth factor and efficiency of Gaussian elimination with rook pivoting
- Updating and Downdating Techniques for Optimizing Network Communicability
- A network model for polarization of political opinion
- Computation of pseudospectra by spectral dichotomy methods in a parallel environment
- Efficient orthogonal matrix polynomial based method for computing matrix exponential
- Some features of Gaussian elimination with rook pivoting
- On the sensitivity of the SR decomposition
- Row-Wise Backward Stable Elimination Methods for the Equality Constrained Least Squares Problem
- Title not available (Why is that?)
- A stabilized GMRES method for singular and severely ill-conditioned systems of linear equations
- An error analysis of the modified scaling and squaring method
- Backward error and condition of polynomial eigenvalue problems
- On the exponential generating function for non-backtracking walks
- A curve tracing algorithm for computing the pseudospectrum
- QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices
- QR factorization with complete pivoting and accurate computation of the SVD
- Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix
- Tridiagonal test matrices for eigenvalue computations: two-parameter extensions of the Clement matrix
- Factorizing complex symmetric matrices with positive definite real and imaginary parts
- Vector sequence transformations: Methodology and applications to linear systems
- Title not available (Why is that?)
- Some large-scale matrix computation problems
- The transmission of shifts and shift blurring in the QR algorithm
- Two algorithms for computing the matrix cosine function
- Approximation of functions of large matrices with Kronecker structure
- Backward error bounds for constrained least squares problems
- On the numerical solution of \(AX-XB=C\)
- Doubling (dual) Hahn polynomials: classification and applications
- How many zeros of a random polynomial are real?
- Iterative refinement for linear systems and LAPACK
- Cayley continuants
- Block Matrix Formulations for Evolving Networks
- Modified ST algorithms and numerical experiments
- Structured Backward Error and Condition of Generalized Eigenvalue Problems
This page was built for software: testmatrix