THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
From MaRDI portal
Publication:3286360
DOI10.1093/QMATH/12.1.61zbMATH Open0103.01003OpenAlexW2029981163MaRDI QIDQ3286360FDOQ3286360
Authors: Irving John Good
Publication date: 1961
Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/qmath/12.1.61
Cited In (42)
- \texttt{Chebfun}: A new kind of numerical computing
- Vector spaces of linearizations for matrix polynomials: a bivariate polynomial approach
- Some applications of the comrade matrix
- Rational minimax approximation via adaptive barycentric representations
- Block Kronecker linearizations of matrix polynomials and their backward errors
- Fast multipole methods for approximating a function from sampling values
- Backward error of polynomial eigenvalue problems solved by linearization of Lagrange interpolants
- A framework for structured linearizations of matrix polynomials in various bases
- Constructing strong linearizations of matrix polynomials expressed in Chebyshev bases
- Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
- Calculating near-singular eigenvalues of the neutron transport operator with arbitrary order anisotropic scattering
- A new aspect of comrade matrices by reachability matrices
- A note on generalized companion pencils in the monomial basis
- Backward error analysis of polynomial eigenvalue problems solved by linearization
- Generalized companion matrices and matrix representations for generalized Bézoutians
- Stability of rootfinding for barycentric Lagrange interpolants
- The composition of polynomials is a determinant
- Numerical instability of resultant methods for multidimensional rootfinding
- Computation of equilibrium measures
- The cumulants of an analogue of pearson's chi-squared
- Fiedler-comrade and Fiedler-Chebyshev pencils
- On the stability of computing polynomial roots via confederate linearizations
- Stable polefinding and rational least-squares fitting via eigenvalues
- Algebraic linearizations of matrix polynomials
- Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
- Castle matrix: 4 October 1980
- Revisiting the computation of the critical points of the Keplerian distance
- On shape properties of the receiver operating characteristic curve
- Implicit QR for rank-structured matrix pencils
- Rank-Structured QR for Chebyshev Rootfinding
- Polynomials with respect to a general basis. I: Theory
- Congenial matrices
- A comparison of companion matrix methods to find roots of a trigonometric polynomial
- Leverrier's algorithm for orthogonal polynomial bases
- Model-free stochastic collocation for an arbitrage-free implied volatility. I.
- Computing the real roots of a Fourier series-plus-linear-polynomial: a Chebyshev companion matrix approach
- The logic of causal methods in social science
- Fast computation of eigenvalues of companion, comrade, and related matrices
- Solving 1D conservation laws using Pontryagin's minimum principle
- A companion matrix analogue for orthogonal polynomials
- On algebras related to the discrete cosine transform
- Generalizations of Gershgorin disks and polynomial zeros
This page was built for publication: THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3286360)