CHABIS

swMATH119MaRDI QIDQ12889FDOQ12889

Author name not available (Why is that?)

Cited In (20)

• Intermediate value theorem for simplices for simplicial approximation of fixed points and zeros
• Survey on generalizations of the intermediate value theorem and applications
• Title not available (Why is that?)
• Locating and computing in parallel all the simple roots of special functions using PVM
• A dimension-reducing method for unconstrained optimization
• Artificial nonmonotonic neural networks
• On the complexity of isolating real roots and computing with certainty the topological degree
• Improved Newton's method without direct function evaluations
• On perturbation of roots of homogeneous algebraic systems
• Algorithm 987
• Locating, characterizing and computing the stationary points of a function
• On the zeros of \(J_n(z)\pm iJ_{n+1}(z)\) and \([J_{n+1}(z)]^2- J_n(z) J_{n+2}(z)\)
• An efficient method for locating and computing periodic orbits of nonlinear mappings
• Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions
• Locating three-dimensional roots by a bisection method
• Algorithm 666: Chabis: a mathematical software package for locating and evaluating roots of systems of nonlinear equations
• RFSFNS: A portable package for the numerical determination of the number and the calculation of roots of Bessel functions
• From linear to nonlinear iterative methods
• Novel orbit based symmetric cryptosystems
• Efficiently Computing Many Roots of a Function

This page was built for software: CHABIS