scientific article; zbMATH DE number 3316497
From MaRDI portal
Publication:5595535
zbMath0198.49302MaRDI QIDQ5595535
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (23)
Automatic quadrature of functions of the form \(g(| f(x)|)\) ⋮ On a class of omnibus algorithms for zero-finding ⋮ Complex compound option models -- can practitioners truly operationalize them? ⋮ SFQEDtoolkit: a high-performance library for the accurate modeling of strong-field QED processes in PIC and Monte Carlo codes ⋮ A superlinear scaling factor regula falsi root finder that detects the simple or multiple character of the root ⋮ ON NEW HYBRID ROOT-FINDING ALGORITHMS FOR SOLVING TRANSCENDENTAL EQUATIONS USING EXPONENTIAL AND HALLEY'S METHODS ⋮ A modified Brent's method for finding zeros of functions ⋮ Steplength algorithms for minimizing a class of nondifferentiable functions ⋮ Effects of passive dendritic tree properties on the firing dynamics of a leaky-integrate-and-fire neuron ⋮ A two-point Newton method suitable for nonconvergent cases and with super-quadratic convergence ⋮ Superlinear bracketing method for solving nonlinear equations ⋮ Some efficient methods for enclosing simple zeros of nonlinear equations ⋮ Zero-clusters of polynomials: best approach in supercomputing era ⋮ Exact solutions for concentration dependent diffusion and the inverse complementary error function ⋮ On the structure of zero finders ⋮ Combined bracketing methods for solving nonlinear equations ⋮ A comparison of non-linear equation solvers ⋮ Methods without secant steps for finding a bracketed root ⋮ On the convergence of a multigrid method for Moreau-regularized variational inequalities of the second kind ⋮ The catline for deep regression ⋮ Bounds for monetary-unit sampling in auditing: an adjusted empirical likelihood approach ⋮ On the Complexity of Reliable Root Approximation ⋮ The numerical range of elementary operators
This page was built for publication:
