About: Linear multistep method

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

About: Linear multistep method Goto Sponge NotDistinct Permalink

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

Linear multistep methods are used for the numerical solution of ordinary differential equations. Conceptually, a numerical method starts from an initial point and then takes a short step forward in time to find the next solution point. The process continues with subsequent steps to map out the solution. Single-step methods (such as Euler's method) refer to only one previous point and its derivative to determine the current value. Methods such as Runge–Kutta take some intermediate steps (for example, a half-step) to obtain a higher order method, but then discard all previous information before taking a second step. Multistep methods attempt to gain efficiency by keeping and using the information from previous steps rather than discarding it. Consequently, multistep methods refer to several

Attributes	Values
rdfs:label	Linear multistep method (en)
rdfs:comment	Linear multistep methods are used for the numerical solution of ordinary differential equations. Conceptually, a numerical method starts from an initial point and then takes a short step forward in time to find the next solution point. The process continues with subsequent steps to map out the solution. Single-step methods (such as Euler's method) refer to only one previous point and its derivative to determine the current value. Methods such as Runge–Kutta take some intermediate steps (for example, a half-step) to obtain a higher order method, but then discard all previous information before taking a second step. Multistep methods attempt to gain efficiency by keeping and using the information from previous steps rather than discarding it. Consequently, multistep methods refer to several (en)
sameAs	Linear multistep method Linear multistep method
dbp:wikiPageUsesTemplate	dbt:Citation dbt:Harv dbt:Harvtxt dbt:Main dbt:MathWorld dbt:No_footnotes dbt:Redirect dbt:Harvnb dbt:Numerical_integrators
Subject	Numerical analysis Numerical differential equations
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Linear_multistep_method?oldid=1047572029&ns=0
Wikipage page ID	2090865 (xsd:integer)
page length (characters) of wiki page	22650 (xsd:nonNegativeInteger)
Wikipage revision ID	1047572029 (xsd:integer)
Link from a Wikipage to another Wikipage	Forest Ray Moulton Francis Bashforth Numerical methods for ordinary differential equations Backward Euler method Backward differentiation formula Taylor series Cambridge University Press Capillary action Germund Dahlquist Numerical analysis Numerical differential equations Linear combination Predictor–corrector method Runge–Kutta methods Springer Science+Business Media Truncation error (numerical integration) John Couch Adams Newton's method Energy drift Finite difference method Explicit and implicit methods Initial value problem Lagrange polynomial Trapezoidal rule (differential equations) Euler method Stiff equation Iterative method Lax equivalence theorem Polynomial interpolation Recurrence relation
has abstract	Linear multistep methods are used for the numerical solution of ordinary differential equations. Conceptually, a numerical method starts from an initial point and then takes a short step forward in time to find the next solution point. The process continues with subsequent steps to map out the solution. Single-step methods (such as Euler's method) refer to only one previous point and its derivative to determine the current value. Methods such as Runge–Kutta take some intermediate steps (for example, a half-step) to obtain a higher order method, but then discard all previous information before taking a second step. Multistep methods attempt to gain efficiency by keeping and using the information from previous steps rather than discarding it. Consequently, multistep methods refer to several previous points and derivative values. In the case of linear multistep methods, a linear combination of the previous points and derivative values is used. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Linear_multistep_method
is Wikipage redirect of	Adam-Bashford Adams-Bashford Adams-Bashforth Adams-Bashforth methods Adams-Moulton methods Adams–Moulton method Linear Multistep Method Multistep method Multistep methods Adams' Method Adams' method Adams-Bashford method Adams-Bashforth-Moulton Method Adams-Bashforth-Moulton method Adams-Bashforth method Adams-Bashforth multistep method Adams-Moulton method Adams-bashforth-moulton method Adams Bashforth Adams–Bashforth Adams–Bashforth method Adams–Bashforth methods Adams–Moulton methods Zero-stability
is Link from a Wikipage to another Wikipage of	Forest Ray Moulton Fractional-order system Francis Bashforth Numerical methods for ordinary differential equations Numerov's method Adam-Bashford Adams-Bashford Adams-Bashforth Adams-Bashforth methods Adams-Moulton methods Adams method Adams–Moulton method Backward Euler method Backward differentiation formula Beeman's algorithm General linear methods Germund Dahlquist Discretization error Linear Multistep Method List of mathematics-based methods List of numerical analysis topics Composite methods for structural dynamics Continuous simulation John C. Butcher List of algorithms

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 (71 GB total memory, 997 MB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software