Structured eigenvalue condition numbers for parameterized quasiseparable matrices
From MaRDI portal
Publication:728451
DOI10.1007/s00211-015-0779-5zbMath1364.65084OpenAlexW2253889537MaRDI QIDQ728451
Kenet Pomés, Froilán M. Dopico
Publication date: 20 December 2016
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10016/22097
fast algorithmlow-rank matricesparameterized quasiseparable matrixrelative perturbation of parametersstructued eigenvalue condition number
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items (7)
Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations ⋮ On the sensitivity of generators for the QR factorization of quasiseparable matrices with total nonpositivity ⋮ Structured condition numbers for some matrix factorizations of structured matrices ⋮ Accurate singular values of a class of parameterized negative matrices ⋮ Structured condition numbers for linear systems with parameterized quasiseparable coefficient matrices ⋮ Structured generalized eigenvalue condition numbers for parameterized quasiseparable matrices ⋮ Structured condition number for multiple right-hand side linear systems with parameterized quasiseparable coefficient matrix
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for the inversion of general Toeplitz matrices
- A fast implicit QR eigenvalue algorithm for companion matrices
- On generators of quasiseparable finite block matrices
- Implicit double shift \(QR\)-algorithm for companion matrices
- A contribution to the theory of condition
- On a new class of structured matrices
- Generalized totally nonnegative matrices
- Relative perturbation theory. III: More bounds on eigenvalue variation
- Introduction to hierarchical matrices with applications.
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- A fast direct solver for boundary integral equations in two dimensions
- Sensitivity of eigenvalues of an unsymmetric tridiagonal matrix
- Separable type representations of matrices and fast algorithms. Volume 1. Basics. Completion problems. Multiplication and inversion algorithms
- Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- Balancing a matrix for calculation of eigenvalues and eigenvectors
- Hybrid cross approximation of integral operators
- On inverting a class of patterned matrices
- Inverses of Matrices $\{a_{ij}\}$ which Satisfy $a_{ij} = 0$ for $j > i+p$.
- Finite Boundary Value Problems Solved by Green's Matrix.
- Why Finite Element Discretizations Can Be Factored by Triangular Hierarchical Matrices
- A note on the representation and definition of semiseparable matrices
- A QR-Based Solver for Rank Structured Matrices
- Scaled Givens Rotations for the Solution of Linear Least Squares Problems on Systolic Arrays
- Structured Backward Error and Condition of Generalized Eigenvalue Problems
- Accuracy and Stability of Numerical Algorithms
- Fast and Backward Stable Computation of Roots of Polynomials
- The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
- Stability of QR-based fast system solvers for a subclass of quasiseparable rank one matrices
- Nested Product Decomposition of Quasiseparable Matrices
- Structured Eigenvalue Condition Numbers
- On computing givens rotations reliably and efficiently
- A Theory of Condition
- A bibliography on semiseparable matrices
- Parallel black box $$\mathcal {H}$$ -LU preconditioning for elliptic boundary value problems
This page was built for publication: Structured eigenvalue condition numbers for parameterized quasiseparable matrices
