Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Explicit formulae for progressively computing a real root of the smooth function

From MaRDI portal
Publication:4996563
Jump to:navigation, search

DOI10.3785/J.ISSN.1008-9497.2021.02.002zbMATH Open1474.65137MaRDI QIDQ4996563FDOQ4996563


Authors: Ping Zhu, Xiao-Diao Chen, Weiyin Ma, Nichang Jiang Edit this on Wikidata


Publication date: 1 July 2021





Recommendations

  • Efficient rational quadratic clipping method for computing roots of a polynomial
  • A rational cubic clipping method for computing real roots of a polynomial
  • Rational cubic clipping with linear complexity for computing roots of polynomials
  • A fast and robust method for computing real roots of nonlinear equations
  • An improved rational cubic clipping method for computing real roots of a polynomial


zbMATH Keywords

reparameterizationroot-findingconvergence ordernumerical iterative methodclipping method


Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)



Cited In (1)

  • Forcing smooth square roots and integration





This page was built for publication: Explicit formulae for progressively computing a real root of the smooth function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4996563)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4996563&oldid=19447935"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 09:54. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki