Pages that link to "Item:Q4076676"
From MaRDI portal
The following pages link to Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function (Q4076676):
Displayed 14 items.
- Improving the efficiency index in enclosing a root of an equation (Q676171) (← links)
- Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices (Q685967) (← links)
- Bifurcations of nonlinear reaction-diffusion systems in oblate spheroids (Q790730) (← links)
- Markov chain models of a telephone call center with call blending (Q858269) (← links)
- A novel method for robust minimisation of univariate functions with quadratic convergence (Q859875) (← links)
- On dependence of MR- and MM-algorithms upon the value of switching control variable CTR (Q1107267) (← links)
- On a class of omnibus algorithms for zero-finding (Q1118978) (← links)
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem (Q1138346) (← links)
- Bifurcations of nonlinear reaction-diffusion systems in prolate spheroids (Q1837122) (← links)
- Several new methods for solving equations (Q3811596) (← links)
- Root isolation methods based upon lagrangian interpolation (Q3828960) (← links)
- A short note on convergence near a high order zero (Q4104809) (← links)
- On the structure of zero finders (Q4140290) (← links)
- Average-Case Optimality of a Hybrid Secant-Bisection Method (Q4878510) (← links)