Eigensolve

swMATH11986MaRDI QIDQ23920FDOQ23920

Author name not available (Why is that?)

Cited In (24)

• Newton's method in practice: finding all roots of polynomials of degree one million efficiently
• Additive preconditioning and aggregation in matrix computations
• New progress in real and complex polynomial root-finding
• Global optimality conditions and optimization methods for constrained polynomial programming problems
• Root-finding by expansion with independent constraints
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
• A note on generalized companion pencils in the monomial basis
• A bound on the spectral radius of graphs in terms of their Zagreb indices
• Accelerated approximation of the complex roots and factors of a univariate polynomial
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
• Real polynomial root-finding by means of matrix and polynomial iterations
• Backward Error of Polynomial Eigenvalue Problems Solved by Linearization of Lagrange Interpolants
• An adaptive subdivision method for root finding of univariate polynomials
• Computing real roots of real polynomials
• Root-squaring with DPR1 matrices
• Solving secular and polynomial equations: a multiprecision algorithm
• Additive preconditioning, eigenspaces, and the inverse iteration
• An experimental investigation of the normality of irrational algebraic numbers
• An iterated eigenvalue algorithm for approximating roots of univariate polynomials
• Computing multiple roots of inexact polynomials
• Analyticity of the Ising susceptibility: an interpretation
• Efficient isolation of polynomial's real roots.
• Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
• Global optimality conditions and optimization methods for polynomial programming problems

This page was built for software: Eigensolve