na20 - MaRDI portal

Cited in

(only showing first 100 items - show all)

Exact symbolic-numeric computation of planar algebraic curves
On location and approximation of clusters of zeros of analytic functions
New bounds for roots of polynomials based on Fiedler companion matrices
Polynomial evaluation and interpolation and transformations of matrix structures
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
A deterministic algorithm for isolating real roots of a real polynomial
Structured matrix methods for polynomial root-finding
SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS
Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials
Eigenvalue condition numbers and pseudospectra of Fiedler matrices
A further analysis of backward error in polynomial deflation
scientific article; zbMATH DE number 6154261 (Why is no real title available?)
scientific article; zbMATH DE number 1979264 (Why is no real title available?)
Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
Efficient polynomial root-refiners: a survey and new record efficiency estimates
On the evaluation of polynomial coefficients
Locating the Eigenvalues of Matrix Polynomials
New progress in real and complex polynomial root-finding
Point estimation of root finding methods
Root-finding by expansion with independent constraints
The computation of multiple roots of a polynomial
Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
Real Algebraic Numbers: Complexity Analysis and Experimentation
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
Runge-Kutta-Gegenbauer explicit methods for advection-diffusion problems
Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
Accelerated approximation of the complex roots and factors of a univariate polynomial
Tracing index of rational curve parametrizations
Geometry of polynomials and root-finding via path-lifting
Isolating real roots of real polynomials
Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
Spectral Analysis of Nonsymmetric Quasi-Toeplitz matrices with Applications to Preconditioned Multistep Formulas
Complexity of real root isolation using continued fractions
Rational Krylov methods for functions of matrices with applications to fractional partial differential equations
On the complexity of real root isolation using continued fractions
Real root polynomials and real root preserving transformations
On the stability of computing polynomial roots via confederate linearizations
Real polynomial root-finding by means of matrix and polynomial iterations
Sigmoid-like functions and root finding methods
ACETAF
LAPACK95
MultRoot
SYNAPS
EXACUS
PEPACK
MPSolve
logcf
SqFreeEVAL
ISOLATE
Algebraic kernel
Kinetic Framework
na25
na10
Eigensolve
Xalci
PSIFN
ANewDsc
SLV
insulate
Ccluster
Lgp
tpls
On new higher order families of simultaneous methods for finding polynomial zeros
tutte
Computer Algebra in Scientific Computing
Root refinement for real polynomials using quadratic interval refinement
Computing real roots of real polynomials
Transformations of matrix structures work again
A posteriori error bound methods for the inclusion of polynomial zeros
tangent Graeffe
The geometry of multivariate polynomial division and elimination
On the complexity of computing with planar algebraic curves
Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Is the five-flow conjecture almost false?
Overdetermined Weierstrass iteration and the nearest consistent system
Matrix computations and polynomial root-finding with preprocessing
funm
On properties of the Ising model for complex energy/temperature and magnetic field
Solving secular and polynomial equations: a multiprecision algorithm
Fast approximate computations with Cauchy matrices and polynomials
A fractal eigenvector
The Brown-Colbourn conjecture on zeros of reliability polynomials is false
Efficient Halley-like methods for the inclusion of multiple zeros of polynomials
Computing curve intersection by means of simultaneous iterations
On the complexity of the Descartes method when using approximate arithmetic
Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I: General theory and square-lattice chromatic polynomial.
A higher order family for the simultaneous inclusion of multiple zeros of polynomials
Randomized preprocessing of homogeneous linear systems of equations
Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
Cylinder partition function of the 6-vertex model from algebraic geometry
An experimental investigation of the normality of irrational algebraic numbers
Bounds on polynomial roots using intercyclic companion matrices
On the zeros of plane partition polynomials
Fast and Backward Stable Computation of Roots of Polynomials
Planar triangulations with real chromatic roots arbitrarily close to 4
An iterated eigenvalue algorithm for approximating roots of univariate polynomials
Computing curve intersection by homotopy methods
On the convergence condition of generalized root iterations for the inclusion of polynomial zeros
Transfer matrices and partition-function zeros for antiferromagnetic Potts models. III: Triangular-lattice chromatic polynomial
Effective bounds for P-recursive sequences

This page was built for software: na20