This HTML5 document contains 52 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n13https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:List_of_algorithms
dbo:wikiPageWikiLink
dbr:Stone's_method
Subject Item
dbr:List_of_numerical_analysis_topics
dbo:wikiPageWikiLink
dbr:Stone's_method
Subject Item
dbr:Stone's_method
rdfs:label
Stone's method
rdfs:comment
In numerical analysis, Stone's method, also known as the strongly implicit procedure or SIP, is an algorithm for solving a sparse linear system of equations. The method uses an incomplete LU decomposition, which approximates the exact LU decomposition, to get an iterative solution of the problem. The method is named after Harold S. Stone, who proposed it in 1968. In the iterative methods, if the preconditioner matrix M is a good approximation of coefficient matrix A then the convergence is faster. This brings one to idea of using approximate factorization LU of A as the iteration matrix M.
dct:subject
dbc:Numerical_linear_algebra dbc:Articles_with_example_pseudocode
dbo:wikiPageID
4077966
dbo:wikiPageRevisionID
1100842518
dbo:wikiPageWikiLink
dbr:Random_access_memory dbr:Incomplete_LU_factorization dbr:Two-dimensional dbr:Harold_S._Stone dbr:Joel_H._Ferziger dbr:Partial_differential_equation dbr:Numerical_analysis dbc:Articles_with_example_pseudocode dbr:Pentadiagonal_matrix dbr:Instruction_(computer_science) dbr:Finite_difference dbr:Sparse_matrix dbr:Algorithm dbr:LU_decomposition dbr:Linear_system_of_equations dbr:Elliptic_operator dbr:Preconditioned dbr:Iterative_method dbc:Numerical_linear_algebra
owl:sameAs
wikidata:Q7619072 n13:4vUrK
dbp:wikiPageUsesTemplate
dbt:Multiple_issues dbt:Cite_book dbt:No_footnotes dbt:Reflist dbt:Cite_journal dbt:! dbt:Math dbt:= dbt:CFDWiki dbt:Clarify dbt:Numerical_linear_algebra dbt:Primary_sources
dbp:date
March 2016
dbp:reason
vague
dbo:abstract
In numerical analysis, Stone's method, also known as the strongly implicit procedure or SIP, is an algorithm for solving a sparse linear system of equations. The method uses an incomplete LU decomposition, which approximates the exact LU decomposition, to get an iterative solution of the problem. The method is named after Harold S. Stone, who proposed it in 1968. The LU decomposition is an excellent general-purpose linear equation solver. The biggest disadvantage is that it fails to take advantage of coefficient matrix to be a sparse matrix. The LU decomposition of a sparse matrix is usually not sparse, thus, for a large system of equations, LU decomposition may require a prohibitive amount of memory and number of arithmetical operations. In the iterative methods, if the preconditioner matrix M is a good approximation of coefficient matrix A then the convergence is faster. This brings one to idea of using approximate factorization LU of A as the iteration matrix M. A version of incomplete lower-upper decomposition method was proposed by Stone in 1968. This method is designed for equation system arising from discretisation of partial differential equations and was firstly used for a pentadiagonal system of equations obtained while solving an elliptic partial differential equation in a two-dimensional space by a finite difference method. The LU approximate decomposition was looked in the same pentadiagonal form as the original matrix (three diagonals for L and three diagonals for U) as the best match of the seven possible equations for the five unknowns for each row of the matrix.
prov:wasDerivedFrom
wikipedia-en:Stone's_method?oldid=1100842518&ns=0
dbo:wikiPageLength
4274
foaf:isPrimaryTopicOf
wikipedia-en:Stone's_method
Subject Item
dbr:Stone_method
dbo:wikiPageWikiLink
dbr:Stone's_method
dbo:wikiPageRedirects
dbr:Stone's_method
Subject Item
dbr:Strongly_implicit_procedure
dbo:wikiPageWikiLink
dbr:Stone's_method
dbo:wikiPageRedirects
dbr:Stone's_method
Subject Item
wikipedia-en:Stone's_method
foaf:primaryTopic
dbr:Stone's_method