Pages that link to "Item:Q1433125"

The following pages link to Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125):

Displaying 21 items.

• Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
• Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
• New progress in real and complex polynomial root-finding (Q552308) (← links)
• Matrix computations and polynomial root-finding with preprocessing (Q624343) (← links)
• A QR-method for computing the singular values via semiseparable matrices (Q706231) (← links)
• Coefficient-free adaptations of polynomial root-finders (Q814095) (← links)
• Eigen-solving via reduction to DPR1 matrices (Q950043) (← links)
• Additive preconditioning, eigenspaces, and the inverse iteration (Q958010) (← links)
• Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← links)
• Global optimality conditions and optimization methods for constrained polynomial programming problems (Q1663418) (← links)
• Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials (Q1706680) (← links)
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations (Q1780608) (← links)
• The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem (Q2068644) (← links)
• Solving secular and polynomial equations: a multiprecision algorithm (Q2253077) (← links)
• The amended DSeSC power method for polynomial root-finding (Q2387379) (← links)
• Additive preconditioning and aggregation in matrix computations (Q2425466) (← links)
• Root-squaring with DPR1 matrices (Q2452939) (← links)
• Linking the TPR1, DPR1 and arrow-head matrix structures (Q2469906) (← links)
• Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations (Q2483050) (← links)
• On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form (Q2503145) (← links)
• On using symmetric polynomials for constructing root finding methods (Q5113669) (← links)