Parameterizing intersecting surfaces via invariants

DOI10.1016/J.LAA.2026.05.009MaRDI QIDQ7285452zbMATH OpenFDO

Authors Timon S. Gutleb, Rhyan Barrett, Julia Westermayr, C. Ortner

Publication date 19 June 2026

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.LAA.2026.05.009

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04) Numerical computation of solutions to single equations (65H05)

Cites work

• A note on companion matrices
• A real symmetric tridiagonal matrix with a given characteristic polynomial
• A recurrence scheme for converting from one orthogonal expansion into another
• A short account of the history of symmetric functions of roots of equations.
• A Survey of Practical Rational and Polynomial Approximation of Functions
• A unified rounding error bound for polynomial evaluation
• An introduction to symmetric functions and their combinatorics
• Atomic cluster expansion: completeness, efficiency and stability
• Begleitmatrizen und lineare homogene Differentialausdrücke.
• Bounds for Eigenvalues of Tridiagonal Symmetric Matrices Computed by the LR Method
• Bounds on real eigenvalues and singular values of interval matrices
• Characterizing and approximating eigenvalue sets of symmetric interval matrices
• Chebyshev polynomials. From approximation theory to algebra and number theory
• Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
• Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
• Conversion of a power to a series of Chebyshev polynomials
• Die Lage der Nullstellen eines Polynoms
• Error analysis of an algorithm for summing certain finite series
• Expressing a polynomial as the characteristic polynomial of a symmetric matrix
• Fast and Backward Stable Computation of Roots of Polynomials
• Fast and backward stable computation of roots of polynomials. II: Backward error analysis; companion matrix and companion pencil
• Gershgorin's Theorem and the Zeros of Polynomials
• scientific article; zbMATH DE number 48629 (Why is no real title available?)
• scientific article; zbMATH DE number 192975 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• scientific article; zbMATH DE number 1930503 (Why is no real title available?)
• scientific article; zbMATH DE number 3009965 (Why is no real title available?)
• scientific article; zbMATH DE number 3245839 (Why is no real title available?)
• scientific article; zbMATH DE number 3300540 (Why is no real title available?)
• scientific article; zbMATH DE number 3110365 (Why is no real title available?)
• Interval analysis and automatic result verification
• Introduction to Interval Analysis
• Numerical linear algebra. Twenty-fifth anniversary edition
• On the stability of computing polynomial roots via confederate linearizations
• Polynomial Roots from Companion Matrix Eigenvalues
• Root Neighborhoods of a Polynomial
• Six myths of polynomial interpolation and quadrature
• Structured backward errors in linearizations
• The Band Theory of Graphite
• The Calculation of Eigenvectors by the Method of Lanczos
• THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
• The Condition of Orthogonal Polynomials
• The Condition of Polynomials in Power Form
• The continuing influence of Fiedler's work on companion matrices
• The evaluation of the zeros of ill-conditioned polynomials. I, II
• The Theory of Composites
• Theorie der bilinearen Formen mit ganzen Coefficienten.
• Validated numerics. A short introduction to rigorous computations.

This page was built for publication: Parameterizing intersecting surfaces via invariants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285452)