scientific article; zbMATH DE number 3383473
From MaRDI portal
Publication:5653524
zbMATH Open0242.65047MaRDI QIDQ5653524FDOQ5653524
Publication date: 1970
Title of this publication is not available (Why is that?)
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)
- Asymptotic analysis and accurate approximate solutions for strongly nonlinear conservative symmetric oscillators
- Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method
- A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
- Quadrature formulae and Hermite-Birkhoff interpolation
- Convergence and dynamics of structurally identical root finding methods
- The solution of Kepler's equation, III
- Real eigenvalues of certain tridiagonal matrix polynomials, with queueing applications
- On a family of symmetric polynomials
- Precise and fast computation of Fermi-Dirac integral of integer and half integer order by piecewise minimax rational approximation
- Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
- Inversion of two level circulant matrices over \(\mathbb{Z}_{p}\)
- Specified precision polynomial root isolation is in NC
- QPmR - Quasi-Polynomial Root-Finder: Algorithm Update and Examples
- Computations with infinite Toeplitz matrices and polynomials
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- Padé approximants and Eisenstein-Ramanujan continued fraction
- A new high order method of regula falsi type for computing a root of an equation
- Obreschkoff's theorem revisited: What convex sets are contained in the set of hyperbolic polynomials?
- Adomian's decomposition method and homotopy perturbation method in solving nonlinear equations
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications
- Solving matrix polynomial equations arising in queueing problems
- A root-finding algorithm based on Newton's method
- Modified homotopy perturbation method for nonlinear equations and comparison with Adomian decomposition method
- Polynomial factorization through Toeplitz matrix computations
- Iteration functions for \(p\)th roots of complex numbers
- On the roots of certain polynomials arising from the analysis of the Nelder-Mead simplex method
- New classes of iterative methods for nonlinear equations
- Two-parameter homotopy method for nonlinear equations
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- A new, simple approach to the derivation of exact analytical formulae for the zeros of analytic functions
- Computing the real roots of a polynomial by the exclusion algorithm
- Chebyshev method and convexity
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- Über Matrixdarstellungen für Iterationsverfahren bei nichtlinearen Gleichungen
- On the partial realization problem
- Some iterative methods free from second derivatives for nonlinear equations
- Indices of convexity and concavity. Application to Halley method
- Locating and counting bifurcation points of satellite components from the main component in the degree-\(n\) bifurcation set
- A family of chebyshev-halley type methods
- Quotient-difference type generalizations of the power method and their analysis
- Quotienten-Differenzen-Algorithmus: Beweis der Regeln von Rutishauser
- Estimating roots of polynomials using perturbation theory
- Properties-preserving high order numerical methods for a kinetic eikonal equation
- Improved iterative methods for solving nonlinear equations
- Finite sequences of orthogonal polynomials connected by a Jacobi matrix
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Quantitative and constructive aspects of the generalized Koenig's and de Montessus's theorems for Padé approximants
- The amended DSeSC power method for polynomial root-finding
- Algorithms for quaternion polynomial root-finding
- Contrasts in the basins of attraction of structurally identical iterative root finding methods
- Generation of root finding algorithms via perturbation theory and some formulas
- A problem that is easier to solve on the unit-cost algebraic RAM
- Analysis of the effects of a pulsed electromagnetic field on the dynamic response of electrically conductive composites
- Numerical computation of polynomial zeros by means of Aberth's method
- Computing a Hurwitz factorization of a polynomial
- On the degeneracy of the Randić entropy and related graph measures
- Inversion of circulant matrices over \(\mathbf{Z}_m\)
- A logarithmic Boolean time algorithm for parallel polynomial division
- Construction of Newton-like iteration methods for solving nonlinear equations
- An analysis of the properties of the variants of Newton's method with third order convergence
- Bigradients, Hankel determinants and the Newton-Padé table
- High order iterative methods without derivatives for solving nonlinear equations
- Random parallel algorithms for finding exact branchings, perfect matchings, and cycles
- A method for obtaining bounds on eigenvalues and eigenfunctions by solving non-homogeneous integral equations
- A relative van Hoeij algorithm over number fields
- Newton-homotopy analysis method for nonlinear equations
- Some third-order families of iterative methods for solving nonlinear equations
- Modified Householder iterative method for nonlinear equations
- Variants of a classic Traub's result
- On the relation between rotation increments in different tangent spaces
- General polynomial roots and their multiplicities inO(N)memory andO(N2)Time∗
- 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
- Model reduction of state space systems via an implicitly restarted Lanczos method
- 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
- Linear system reduction using Pade approximation to allow retention of dominant modes
- Third order derivative free SPH iterative method for solving nonlinear systems
- Localization of an algebraic hypersurface by the exclusion algorithm
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
- Polynomial division and its computational complexity
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- \(e\): the master of all
- On a family of Halley-like methods to find simple roots of nonlinear equations
- High-order parameter approximation for von Mises-Fisher distributions
- An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound
- Parameter optimization for explicit parallel peer two-step methods
- A family of newton type iterative processes
- On using symmetric polynomials for constructing root finding methods
- Simple algorithms for approximating all roots of a polynomial with real roots
- On Bernoulli's method
- Iterative solutions of nonlinear initial value differential equations in Chebyshev series using Lie series
- Threshold behaviour for a chain-binomial S-I-S infectious disease
- Relationships between symmetry-based graph measures
- Hankel and Toeplitz determinants for a subclass of analytic functions
- Icosahedral symmetry and the quintic equation
- Semi-explicit solutions to the water-wave dispersion relation and their role in the non-linear Hamiltonian coupled-mode theory
- Analytical solution of polynomial equations with an application to the quintic equation
- Minimum extinction probability for surnames and favorable mutations
- Newton‐like iteration methods for solving non‐linear equations
- Nonstationary vs. stationary iterative processes
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)