About: Halley's method

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Halley's method Goto Sponge Distinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

In numerical analysis, Halley's method is a root-finding algorithm used for functions of one real variable with a continuous second derivative. It is named after its inventor Edmond Halley. The algorithm is second in the class of Householder's methods, after Newton's method. Like the latter, it iteratively produces a sequence of approximations to the root; their rate of convergence to the root is cubic. Multidimensional versions of this method exist.

Attributes	Values
rdf:type	software
rdfs:label	Halley's method (en)
rdfs:comment	In numerical analysis, Halley's method is a root-finding algorithm used for functions of one real variable with a continuous second derivative. It is named after its inventor Edmond Halley. The algorithm is second in the class of Householder's methods, after Newton's method. Like the latter, it iteratively produces a sequence of approximations to the root; their rate of convergence to the root is cubic. Multidimensional versions of this method exist. (en)
sameAs	Halley's method Halley's method
dbp:wikiPageUsesTemplate	dbt:Math dbt:MathWorld dbt:Use_dmy_dates
Subject	Root-finding algorithms
gold:hypernym	Algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Halley's_method?oldid=1055549873&ns=0
Wikipage page ID	9053035 (xsd:integer)
page length (characters) of wiki page	6795 (xsd:nonNegativeInteger)
Wikipage revision ID	1055549873 (xsd:integer)
Link from a Wikipage to another Wikipage	Numerical analysis Root-finding algorithms Taylor's theorem Padé approximant Secant method Second derivative Householder's method Edmond Halley Newton's method Muller's method Rate of convergence Root-finding algorithms
has abstract	In numerical analysis, Halley's method is a root-finding algorithm used for functions of one real variable with a continuous second derivative. It is named after its inventor Edmond Halley. The algorithm is second in the class of Householder's methods, after Newton's method. Like the latter, it iteratively produces a sequence of approximations to the root; their rate of convergence to the root is cubic. Multidimensional versions of this method exist. Halley's method exactly finds the roots of a linear-over-linear Padé approximation to the function, in contrast to Newton's method or the Secant method which approximate the function linearly, or Muller's method which approximates the function quadratically. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Halley's_method
is Wikipage redirect of	Bailey's method (root finding) Halley method
is Link from a Wikipage to another Wikipage of	Bailey's method (root finding) Adi Ben-Israel Methods of successive approximation Methods of computing square roots Cube root Householder's method List of numerical analysis topics Edmond Halley List of algorithms Newton's method Fixed-point iteration Golden ratio Fast inverse square root Laguerre's method Lambert W function Natural logarithm Halley method
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Halley's_method

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software