About: Secant method

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

About: Secant method Goto Sponge NotDistinct Permalink

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

In numerical analysis, the secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f. The secant method can be thought of as a finite-difference approximation of Newton's method. However, the secant method predates Newton's method by over 3000 years.

Attributes	Values
rdf:type	software
rdfs:label	Secant method (en)
rdfs:comment	In numerical analysis, the secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f. The secant method can be thought of as a finite-difference approximation of Newton's method. However, the secant method predates Newton's method by over 3000 years. (en)
sameAs	Secant method Secant method
dbp:wikiPageUsesTemplate	dbt:= dbt:Cite_book dbt:Math dbt:MathWorld dbt:Mvar dbt:Reflist dbt:Short_description dbt:Use_American_English dbt:Root-finding_algorithms
Subject	Root-finding algorithms
gold:hypernym	Algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Secant_method?oldid=1074117731&ns=0
Wikipage page ID	640746 (xsd:integer)
page length (characters) of wiki page	8472 (xsd:nonNegativeInteger)
Wikipage revision ID	1074117731 (xsd:integer)
has abstract	In numerical analysis, the secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f. The secant method can be thought of as a finite-difference approximation of Newton's method. However, the secant method predates Newton's method by over 3000 years. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Secant_method
is Wikipage redirect of	Secant search Secant Method
is Link from a Wikipage to another Wikipage of	List of terms relating to algorithms and data structures Anderson acceleration Bisection method Black–Derman–Toy model Brent's method Broyden's method Broyden–Fletcher–Goldfarb–Shanno algorithm Davidon–Fletcher–Powell formula Line search List of numerical analysis topics List of algorithms Newton's method ITP method Halley's method Internal rate of return Inverse quadratic interpolation Mathematics of artificial neural networks Muller'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