PSAPSR

swMATH28496MaRDI QIDQ40210FDOQ40210

Author name not available (Why is that?)

Official website: https://cs.nyu.edu/overton/software/psapsr/index.html

Described by source

• Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix

Cited In (30)

• Destabilising nonnormal stochastic differential equations
• Stability of gyroscopic systems with respect to perturbations
• A new approach for calculating the real stability radius
• A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems
• Preservers of unitary similarity functions on Lie products of matrices
• Pseudospectra of matrix pencils for transient analysis of differential-algebraic equations
• Polytopic uncertainty for linear systems: new and old complexity results
• Low rank differential equations for Hamiltonian matrix nearness problems
• Path-Following Method to Determine the Field of Values of a Matrix with High Accuracy
• Nearest \(\Omega \)-stable matrix via Riemannian optimization
• New algorithms for computing the real structured pseudospectral abscissa and the real stability radius of large and sparse matrices
• First-order perturbation theory for eigenvalues and eigenvectors
• Approximating the real structured stability radius with Frobenius-norm bounded perturbations
• Robust linear stability analysis and a new method for computing the action of the matrix exponential
• Computing the Kreiss constant of a matrix
• Finding the nearest passive or nonpassive system via Hamiltonian eigenvalue optimization
• Continuous approximation of linear impulsive systems and a new form of robust stability
• Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems
• On the method by Rostami for computing the real stability radius of large and sparse matrices
• On matrix nearness problems: distance to delocalization
• HANSO
• Extended and improved criss-cross algorithms for computing the spectral value set abscissa and radius
• A Support Function Based Algorithm for Optimization with Eigenvalue Constraints
• Robust stability of differential-algebraic equations
• On the Nearest Singular Matrix Pencil
• Matrix Stabilization Using Differential Equations
• An iterative method for computing robustness of polynomial stability
• A novel iterative method to approximate structured singular values
• An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
• Faster and more accurate computation of the \(\mathcal{H}_\infty\) norm via optimization

This page was built for software: PSAPSR