Accurate computation of generalized eigenvalues of regular SR-BP pairs
From MaRDI portal
Publication:5021022
DOI10.1137/21M1392152zbMATH Open1480.65081OpenAlexW4206820322MaRDI QIDQ5021022FDOQ5021022
Authors: Rong Huang 
Publication date: 11 January 2022
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m1392152
Recommendations
- Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations
- A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy
- Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices
- Accurate eigenvalues of certain sign regular matrices
- Accurate computations of eigenvalues of quasi-Cauchy-Vandermonde matrices
Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Roundoff error (65G50) Toeplitz, Cauchy, and related matrices (15B05) Matrix pencils (15A22)
Cites Work
- Templates for the Solution of Algebraic Eigenvalue Problems
- Computing the singular value decomposition with high relative accuracy
- Title not available (Why is that?)
- Totally positive matrices
- Title not available (Why is that?)
- Accurate Computations with Totally Nonnegative Matrices
- Title not available (Why is that?)
- Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- Shape from Moments—An Estimation Theory Perspective
- Polynomial least squares fitting in the Bernstein basis
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- Accurate solution of structured least squares problems via rank-revealing decompositions
- Accurate solution of structured linear systems via rank-revealing decompositions
- Accurate Singular Value Decompositions of Structured Matrices
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- An Algorithm for Generalized Matrix Eigenvalue Problems
- Arnoldi and Jacobi-Davidson methods for generalized eigenvalue problems $Ax=\lambda Bx$ with singular $B$
- Accurate computation of the smallest eigenvalue of a diagonally dominant \(M\)-matrix
- Computing singular values of diagonally dominant matrices to high relative accuracy
- A Tangent Algorithm for Computing the Generalized Singular Value Decomposition
- Accurate bidiagonal decomposition of totally positive Cauchy-Vandermonde matrices and applications
- On a Generalized Eigenvalue Problem for Nonsquare Pencils
- Perturbation of partitioned Hermitian definite generalized eigenvalue problems
- New Developments in Molecular Orbital Theory
- Accurate Symmetric Rank Revealing and Eigendecompositions of Symmetric Structured Matrices
- Accurate and efficient expression evaluation and linear algebra
- A Quasi-Separable Approach to Solve the Symmetric Definite Tridiagonal Generalized Eigenvalue Problem
- Multishift Variants of the QZ Algorithm with Aggressive Early Deflation
- On perturbations of matrix pencils with real spectra, a revisit
- Solving the Generalized Eigenvalue Problem for Rational Toeplitz Matrices
- A canonical parametrization of the Kronecker form of a matrix pencil
- Gerschgorin's theorem for generalized eigenvalue problems in the Euclidean metric
- On Accurate Computations of the Perron Root
- An Efficient and Stable Algorithm for the Symmetric-Definite Generalized Eigenvalue Problem
- Accurate solutions of product linear systems associated with rank-structured matrices
- A periodic qd-type reduction for computing eigenvalues of structured matrix products to high relative accuracy
- A rational QZ method
- Implicit QR for companion-like pencils
- Accurate eigenvalues and exact zero Jordan blocks of totally nonnegative matrices
- Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations
- A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy
- Accurate solutions of weighted least squares problems associated with rank-structured matrices
- A Householder-Based Algorithm for Hessenberg-Triangular Reduction
- A domain decomposition Rayleigh-Ritz algorithm for symmetric generalized eigenvalue problems
Cited In (4)
- Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations
- Computing eigenvalues of quasi-rational Said-Ball-Vandermonde matrices
- Computing eigenvalues for products of two classes of sign regular matrices to high relative accuracy
- A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy
Uses Software
This page was built for publication: Accurate computation of generalized eigenvalues of regular SR-BP pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021022)
