THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX

From MaRDI portal
Publication:3286360

DOI10.1093/qmath/12.1.61zbMath0103.01003OpenAlexW2029981163MaRDI QIDQ3286360

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



Related Items

Block Kronecker linearizations of matrix polynomials and their backward errors, The cumulants of an analogue of pearson's chi-squared, The Composition of Polynomials is a Determinant, Unnamed Item, Stable polefinding and rational least-squares fitting via eigenvalues, A comparison of companion matrix methods to find roots of a trigonometric polynomial, Backward Error of Polynomial Eigenvalue Problems Solved by Linearization of Lagrange Interpolants, Leverrier's algorithm for orthogonal polynomial bases, Barycentric-Remez algorithms for best polynomial approximation in the chebfun system, On algebras related to the discrete cosine transform, Rational Minimax Approximation via Adaptive Barycentric Representations, Fast multipole methods for approximating a function from sampling values, A Framework for Structured Linearizations of Matrix Polynomials in Various Bases, Polynomials with respect to a general basis. I: Theory, Constructing Strong Linearizations of Matrix Polynomials Expressed in Chebyshev Bases, Revisiting the computation of the critical points of the Keplerian distance, On shape properties of the receiver operating characteristic curve, Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach, Castle matrix: 4 October 1980, Solving 1D conservation laws using Pontryagin's minimum principle, Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?, Some applications of the comrade matrix, Congenial matrices, Algebraic linearizations of matrix polynomials, Computing the real roots of a Fourier series-plus-linear-polynomial: a Chebyshev companion matrix approach, Fast computation of eigenvalues of companion, comrade, and related matrices, Implicit QR for rank-structured matrix pencils, Stability of rootfinding for barycentric Lagrange interpolants, Chebfun: A New Kind of Numerical Computing, Generalizations of Gershgorin disks and polynomial zeros, A companion matrix analogue for orthogonal polynomials, Computation of equilibrium measures, Backward Error Analysis of Polynomial Eigenvalue Problems Solved by Linearization, Calculating near-singular eigenvalues of the neutron transport operator with arbitrary order anisotropic scattering, Numerical Instability of Resultant Methods for Multidimensional Rootfinding, Model-free stochastic collocation for an arbitrage-free implied volatility. I., A note on generalized companion pencils in the monomial basis, On the stability of computing polynomial roots via confederate linearizations, Fiedler-comrade and Fiedler--Chebyshev pencils, The logic of causal methods in social science, Rank-Structured QR for Chebyshev Rootfinding, Generalized companion matrices and matrix representations for generalized Bézoutians