scientific article; zbMATH DE number 3383473

Publication date 1970

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) Numerical computation of solutions to single equations (65H05)

Cited in

(only showing first 100 items - show all)

Simple algorithms for approximating all roots of a polynomial with real roots
Quantitative and constructive aspects of the generalized Koenig's and de Montessus's theorems for Padé approximants
Computing a Hurwitz factorization of a polynomial
On the degeneracy of the Randić entropy and related graph measures
Real eigenvalues of certain tridiagonal matrix polynomials, with queueing applications
\(e\): the master of all
A problem that is easier to solve on the unit-cost algebraic RAM
A family of chebyshev-halley type methods
Chebyshev method and convexity
Random parallel algorithms for finding exact branchings, perfect matchings, and cycles
On the roots of certain polynomials arising from the analysis of the Nelder-Mead simplex method
A new, simple approach to the derivation of exact analytical formulae for the zeros of analytic functions
Computations with infinite Toeplitz matrices and polynomials
QPmR-quasi-polynomial root-finder: algorithm update and examples
Analysis of the effects of a pulsed electromagnetic field on the dynamic response of electrically conductive composites
On a family of Halley-like methods to find simple roots of nonlinear equations
Convergence and dynamics of structurally identical root finding methods
Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
Padé approximants and Eisenstein-Ramanujan continued fraction
The amended DSeSC power method for polynomial root-finding
New classes of iterative methods for nonlinear equations
Construction of third-order modifications of Newton's method
On the numerical solution of nonlinear problems in fluid dynamics by least squares and finite element methods. II: Application to transonic flow simulations
The solution of Kepler's equation, III
Quotient-difference type generalizations of the power method and their analysis
Efficient polynomial root-refiners: a survey and new record efficiency estimates
Model reduction of state space systems via an implicitly restarted Lanczos method
Locating and counting bifurcation points of satellite components from the main component in the degree-\(n\) bifurcation set
Variants of a classic Traub's result
Inversion of two level circulant matrices over \(\mathbb{Z}_{p}\)
Two-parameter homotopy method for nonlinear equations
Quotienten-Differenzen-Algorithmus: Beweis der Regeln von Rutishauser
A root-finding algorithm based on Newton's method
Inversion of circulant matrices over \(\mathbf{Z}_m\)
A logarithmic Boolean time algorithm for parallel polynomial division
A method for obtaining bounds on eigenvalues and eigenfunctions by solving non-homogeneous integral equations
Optimal and nearly optimal algorithms for approximating polynomial zeros
Algorithms for quaternion polynomial root-finding
On the relation between rotation increments in different tangent spaces
Finite sequences of orthogonal polynomials connected by a Jacobi matrix
Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
A test, based on conversion to the Bernstein polynomial basis, for an interval to be free of zeros applicable to polynomials in Chebyshev form and to transcendental functions approximated by Chebyshev series
Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method
On the partial realization problem
Construction of Newton-like iteration methods for solving nonlinear equations
A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
Adomian's decomposition method and homotopy perturbation method in solving nonlinear equations
Linear system reduction using Pade approximation to allow retention of dominant modes
Third order derivative free SPH iterative method for solving nonlinear systems
Modified homotopy perturbation method for nonlinear equations and comparison with Adomian decomposition method
Localization of an algebraic hypersurface by the exclusion algorithm
Some third-order families of iterative methods for solving nonlinear equations
A new high order method of regula falsi type for computing a root of an equation
General polynomial roots and their multiplicities inO(N)memory andO(N²)Time^∗
Computing the real roots of a polynomial by the exclusion algorithm
Iteration functions for \(p\)th roots of complex numbers
High-order parameter approximation for von Mises-Fisher distributions
Asymptotic analysis and accurate approximate solutions for strongly nonlinear conservative symmetric oscillators
On a family of symmetric polynomials
An analysis of the properties of the variants of Newton's method with third order convergence
Precise and fast computation of Fermi-Dirac integral of integer and half integer order by piecewise minimax rational approximation
Contrasts in the basins of attraction of structurally identical iterative root finding methods
Estimating roots of polynomials using perturbation theory
Numerical computation of polynomial zeros by means of Aberth's method
Bigradients, Hankel determinants and the Newton-Padé table
A relative van Hoeij algorithm over number fields
Modified Householder iterative method for nonlinear equations
Properties-preserving high order numerical methods for a kinetic eikonal equation
Sequential and parallel complexity of approximate evaluation of polynomial zeros
A family of newton type iterative processes
An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound
Generation of root finding algorithms via perturbation theory and some formulas
Parameter optimization for explicit parallel peer two-step methods
Über Matrixdarstellungen für Iterationsverfahren bei nichtlinearen Gleichungen
Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
Some iterative methods free from second derivatives for nonlinear equations
High order iterative methods without derivatives for solving nonlinear equations
Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications
Polynomial division and its computational complexity
Newton-homotopy analysis method for nonlinear equations
Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
Improved iterative methods for solving nonlinear equations
Obreschkoff's theorem revisited: What convex sets are contained in the set of hyperbolic polynomials?
Polynomial factorization through Toeplitz matrix computations
Quadrature formulae and Hermite-Birkhoff interpolation
Indices of convexity and concavity. Application to Halley method
On using symmetric polynomials for constructing root finding methods
Specified precision polynomial root isolation is in NC
Solving matrix polynomial equations arising in queueing problems
On a companion operator for analytic functions
Eigenvalue localization for the Tikhonova model of crystal growth
A modification of the classical quadrature method for locating zeros of analytic functions
Recursive elucidation of polynomial congruences using root-finding numerical techniques
A modification of the Delves-Lyness method for locating the zeros of analytic functions
A simple quadrature-type method for the computation of real zeros of analytic functions in finite intervals
Analytical solution of the Lagrange quintic equation in the three-body problem in celestial mechanics
Minimum extinction probability for surnames and favorable mutations
On formal fractions associated with the symmetric groups
Graph measures with high discrimination power revisited: a random polynomial approach
Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach

This page was built for publication:

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