scientific article; zbMATH DE number 3383473
From MaRDI portal
Publication:5653524
zbMath0242.65047MaRDI QIDQ5653524
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical computation of solutions to single equations (65H05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01)
Related Items (only showing first 100 items - show all)
A stability test for real polynomials ⋮ Numerical integration error method for zeros of analytic functions ⋮ Inversion of two level circulant matrices over \(\mathbb{Z}_{p}\) ⋮ Polynomial factorization through Toeplitz matrix computations ⋮ Specified precision polynomial root isolation is in NC ⋮ A modification of the classical quadrature method for locating zeros of analytic functions ⋮ A modification of the Delves-Lyness method for locating the zeros of analytic functions ⋮ A new, simple approach to the derivation of exact analytical formulae for the zeros of analytic functions ⋮ Threshold behaviour for a chain-binomial S-I-S infectious disease ⋮ Random parallel algorithms for finding exact branchings, perfect matchings, and cycles ⋮ Polynomial division and its computational complexity ⋮ Precise and fast computation of Fermi-Dirac integral of integer and half integer order by piecewise minimax rational approximation ⋮ Algebraic complexity of computing polynomial zeros ⋮ On a modification of the Koenig theorem ⋮ Real eigenvalues of certain tridiagonal matrix polynomials, with queueing applications ⋮ Computations with infinite Toeplitz matrices and polynomials ⋮ Tracking poles, representing Hankel operators, and the Nehari problem ⋮ Sequential and parallel complexity of approximate evaluation of polynomial zeros ⋮ Analytical solution of polynomial equations with an application to the quintic equation ⋮ Construction of Newton-like iteration methods for solving nonlinear equations ⋮ Locating and counting bifurcation points of satellite components from the main component in the degree-\(n\) bifurcation set ⋮ Hankel matrices of finite rank with applications to signal processing and polynomials ⋮ Polynomial root computation by means of the LR algorithm ⋮ A logarithmic Boolean time algorithm for parallel polynomial division ⋮ Analysis of the effects of a pulsed electromagnetic field on the dynamic response of electrically conductive composites ⋮ An analysis of the properties of the variants of Newton's method with third order convergence ⋮ A new class of quite elementary closed-form integral formulae for roots of nonlinear equations ⋮ Fractal patterns from the dynamics of combined polynomial root finding methods ⋮ On the relation between rotation increments in different tangent spaces ⋮ A power method for computing square roots of complex matrices ⋮ Optimal and nearly optimal algorithms for approximating polynomial zeros ⋮ Model reduction of state space systems via an implicitly restarted Lanczos method ⋮ Improved iterative methods for solving nonlinear equations ⋮ Generation of root finding algorithms via perturbation theory and some formulas ⋮ High order iterative methods without derivatives for solving nonlinear equations ⋮ High-order parameter approximation for von Mises-Fisher distributions ⋮ On global integer extrema of real-valued box-constrained multivariate quadratic functions ⋮ Über Matrixdarstellungen für Iterationsverfahren bei nichtlinearen Gleichungen ⋮ Stability of magneto-acoustic waves in a thermally conducting compressible fluid ⋮ Efficient polynomial root-refiners: a survey and new record efficiency estimates ⋮ Minimum extinction probability for surnames and favorable mutations ⋮ Variants of a classic Traub's result ⋮ Iteration functions for \(p\)th roots of complex numbers ⋮ Quantitative and constructive aspects of the generalized Koenig's and de Montessus's theorems for Padé approximants ⋮ Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method ⋮ Perturbations in eigenvalues ⋮ Quotienten-Differenzen-Algorithmus: Beweis der Regeln von Rutishauser ⋮ Recursive elucidation of polynomial congruences using root-finding numerical techniques ⋮ Polynomiography for the polynomial infinity norm via Kalantari's formula and nonstandard iterations ⋮ Third order derivative free SPH iterative method for solving nonlinear systems ⋮ On the rediscovery of Halley's iterative method for computing the zero of an analytic function ⋮ Numerical computation of polynomial zeros by means of Aberth's method ⋮ Localization of an algebraic hypersurface by the exclusion algorithm ⋮ Properties-preserving high order numerical methods for a kinetic eikonal equation ⋮ Padé approximants and Eisenstein-Ramanujan continued fraction ⋮ A case against a divide and conquer approach to the nonsymmetric eigenvalue problem ⋮ A problem that is easier to solve on the unit-cost algebraic RAM ⋮ Icosahedral symmetry and the quintic equation ⋮ Two-parameter homotopy method for nonlinear equations ⋮ Obreschkoff's theorem revisited: What convex sets are contained in the set of hyperbolic polynomials? ⋮ Computing the real roots of a polynomial by the exclusion algorithm ⋮ Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding ⋮ Perturbation theorems for estimating magnitudes of roots of polynomials ⋮ On a family of symmetric polynomials ⋮ The Budan-Fourier theorem for splines ⋮ A de Montessus type convergence study of a least-squares vector-valued rational interpolation procedure II ⋮ Symmetric functions and root-finding algorithms ⋮ On formal fractions associated with the symmetric groups ⋮ New classes of iterative methods for nonlinear equations ⋮ Some iterative methods free from second derivatives for nonlinear equations ⋮ Fixed point and Newton's methods in the complex plane ⋮ Subspace selection algorithms to be used with the nonlinear projection methods in solving systems of nonlinear equations ⋮ \(e\): the master of all ⋮ Parameter optimization for explicit parallel peer two-step methods ⋮ Iterative solutions of nonlinear initial value differential equations in Chebyshev series using Lie series ⋮ On the location of the zeros of a generalized polynomial ⋮ Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems ⋮ Quotient-difference type generalizations of the power method and their analysis ⋮ Adomian's decomposition method and homotopy perturbation method in solving nonlinear equations ⋮ Bigradients, Hankel determinants and the Newton-Padé table ⋮ Simple algorithms for approximating all roots of a polynomial with real roots ⋮ Finite sequences of orthogonal polynomials connected by a Jacobi matrix ⋮ On the numerical solution of nonlinear problems in fluid dynamics by least squares and finite element methods. II: Application to transonic flow simulations ⋮ On Hadamard powers of polynomials ⋮ A parallel algorithm for simple roots of polynomials ⋮ Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros ⋮ Improving the Van de Vel root-finding method ⋮ Chebyshev method and convexity ⋮ Indices of convexity and concavity. Application to Halley method ⋮ A note on stable matrices ⋮ On the partial realization problem ⋮ Eigenvalue localization for the Tikhonova model of crystal growth ⋮ Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems ⋮ A simple quadrature-type method for the computation of real zeros of analytic functions in finite intervals ⋮ A globally convergent method for finding zeros of smooth functions ⋮ Analytical solution of the Lagrange quintic equation in the three-body problem in celestial mechanics ⋮ An optimum partition for inverting a nonsingular matrix ⋮ Rectified approximations for the solution of nonlinear equations ⋮ On the roots of certain polynomials arising from the analysis of the Nelder-Mead simplex method ⋮ An elementary noniterative quadrature-type method for the numerical solution of a nonlinear equation
This page was built for publication:
