Generation of root finding algorithms via perturbation theory and some formulas (Q879553): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58206701, #quickstatements; #temporary_batch_1712186161777 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3895818 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3997900 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5653524 / rank | |||
Normal rank | |||
Latest revision as of 18:00, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generation of root finding algorithms via perturbation theory and some formulas |
scientific article |
Statements
Generation of root finding algorithms via perturbation theory and some formulas (English)
0 references
14 May 2007
0 references
root finding algorithms
0 references
perturbation theory
0 references
Newton-Raphson method
0 references
Householder's iteration
0 references
higher order iteration formulas
0 references
numerical examples
0 references
Adomian decomposition method
0 references
0 references
