Efficiency of the Multisection Method

03/06/2023
by   J. S. C. Prentice, et al.
0

We study the efficiency of the multisection method for univariate nonlinear equations, relative to that for the well-known bisection method. We show that there is a minimal effort algorithm that uses more sections than the bisection method, although this optimal algorithm is problem dependent. The number of sections required for optimality is determined by means of a Lambert W function.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/06/2022

The GPGCD Algorithm with the Bézout Matrix for Multiple Univariate Polynomials

We propose a modification of the GPGCD algorithm, which has been present...
research
04/29/2022

RAR-PINN algorithm for the data-driven vector-soliton solutions and parameter discovery of coupled nonlinear equations

This work aims to provide an effective deep learning framework to predic...
research
10/31/2020

Generalized Sorting with Predictions

Generalized sorting problem, also known as sorting with forbidden compar...
research
03/03/2021

A meshless method for the solution of incompressible flow equations

This article reports on the efficiency of a co-located diffuse approxima...
research
10/26/2009

A p-adic RanSaC algorithm for stereo vision using Hensel lifting

A p-adic variation of the Ran(dom) Sa(mple) C(onsensus) method for solvi...
research
04/05/2020

Nonlinear Function Inversion using k-vector

This work introduces a general numerical technique to invert one dimensi...
research
06/05/2018

Level-Based Analysis of the Population-Based Incremental Learning Algorithm

The Population-Based Incremental Learning (PBIL) algorithm uses a convex...

Please sign up or login with your details

Forgot password? Click here to reset