Polynomials root-finding using a SLEFE-based clipping method (Q2397808)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6722785
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomials root-finding using a SLEFE-based clipping method |
scientific article; zbMATH DE number 6722785 |
Statements
Polynomials root-finding using a SLEFE-based clipping method (English)
0 references
23 May 2017
0 references
Based on the theory of subdividable linear efficient function enclose (SLEFE), the SLEFE clipping algorithm and the SLEFE isolation algorithm are proposed. The SLEFE clipping algorithm requires fewer iterations and consumes less computation time to solve the root-finding problems which have only one root within a given interval. The SLEFE isolation algorithm can compute all the intervals that contain the roots of polynomials rapidly and accurately.
0 references
polynomial root-finding
0 references
real root interval isolation
0 references
subdividable linear efficient function enclose
0 references
clipping algorithm
0 references
isolation algorithm
0 references
roots of polynomials
0 references
0.8014071583747864
0 references
0.7971906661987305
0 references
0.7908685803413391
0 references
0.7871325016021729
0 references
0.7869226932525635
0 references
