Cited in
(28)- Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices
- Improved bracketing parabolic method for numerical solution of nonlinear equations
- On dependence of MR- and MM-algorithms upon the value of switching control variable CTR
- On a class of omnibus algorithms for zero-finding
- A novel method for robust minimisation of univariate functions with quadratic convergence
- A comparison of non-linear equation solvers
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A Fortran program for solving a nonlinear equation by Muller's method
- Markov chain models of a telephone call center with call blending
- A short note on convergence near a high order zero
- Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
- On the structure of zero finders
- HPCC
- RROOT_748
- logcf
- Algorithm 748
- AS 241
- HPL
- GRATIO
- Matrices with tunable infinity-norm condition number and no need for pivoting in LU factorization
- Root refinement for real polynomials using quadratic interval refinement
- Bifurcations of nonlinear reaction-diffusion systems in prolate spheroids
- Always convergent iteration methods for nonlinear equations of Lipschitz functions
- Average-Case Optimality of a Hybrid Secant-Bisection Method
- Upper and lower bounds for the optimal constant in the extended Sobolev inequality. Derivation and numerical results
- Bifurcations of nonlinear reaction-diffusion systems in oblate spheroids
- Several new methods for solving equations
- Improving the efficiency index in enclosing a root of an equation
This page was built for software: zeroin
