| dbo:abstract |
Das Richardson-Verfahren ist in der numerischen Mathematik ein iterativer Algorithmus zur näherungsweisen Lösung von linearen Gleichungssystemen. Es wurde 1910 vom britischen Meteorologen Lewis Fry Richardson entwickelt und zählt wie das Gauß-Seidel-Verfahren zur Klasse der Splitting-Verfahren. (de) Modified Richardson iteration is an iterative method for solving a system of linear equations. Richardson iteration was proposed by Lewis Fry Richardson in his work dated 1910. It is similar to the Jacobi and Gauss–Seidel method. We seek the solution to a set of linear equations, expressed in matrix terms as The Richardson iteration is where is a scalar parameter that has to be chosen such that the sequence converges. It is easy to see that the method has the correct fixed points, because if it converges, then and has to approximate a solution of . (en) |
| dbo:wikiPageID |
8518299 (xsd:integer) |
| dbo:wikiPageLength |
4193 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID |
1009449721 (xsd:integer) |
| dbo:wikiPageWikiLink |
dbr:Jacobi_method dbc:Iterative_methods dbr:Gauss–Seidel_method dbr:Richardson_extrapolation dbr:Eigenvectors dbr:Gradient dbr:Gradient_descent dbr:Condition_number dbr:Convex_function dbr:Lewis_Fry_Richardson dbr:Fixed_point_(mathematics) dbr:Chebyshev_iteration dbr:Iterative_method dbc:Numerical_linear_algebra dbr:Philosophical_Transactions_of_the_Royal_Society_A dbr:Positive_semi-definite_matrix dbr:Symmetric_positive_definite dbr:System_of_linear_equations dbr:Eigenvalues |
| dbp:accessdate |
2010-05-25 (xsd:date) |
| dbp:authorLink |
Vyacheslav Ivanovich Lebedev (en) |
| dbp:editor |
Michiel Hazewinkel (en) |
| dbp:editorLink |
Michiel Hazewinkel (en) |
| dbp:first |
Vyacheslav Ivanovich (en) |
| dbp:isbn |
1 (xsd:integer) |
| dbp:last |
Lebedev (en) |
| dbp:title |
Chebyshev iteration method (en) |
| dbp:wikiPageUsesTemplate |
dbt:Cite_journal dbt:Reflist dbt:Short_description dbt:SpringerEOM dbt:Numerical_linear_algebra |
| dct:subject |
dbc:Iterative_methods dbc:Numerical_linear_algebra |
| rdfs:comment |
Das Richardson-Verfahren ist in der numerischen Mathematik ein iterativer Algorithmus zur näherungsweisen Lösung von linearen Gleichungssystemen. Es wurde 1910 vom britischen Meteorologen Lewis Fry Richardson entwickelt und zählt wie das Gauß-Seidel-Verfahren zur Klasse der Splitting-Verfahren. (de) Modified Richardson iteration is an iterative method for solving a system of linear equations. Richardson iteration was proposed by Lewis Fry Richardson in his work dated 1910. It is similar to the Jacobi and Gauss–Seidel method. We seek the solution to a set of linear equations, expressed in matrix terms as The Richardson iteration is where is a scalar parameter that has to be chosen such that the sequence converges. It is easy to see that the method has the correct fixed points, because if it converges, then and has to approximate a solution of . (en) |
| rdfs:label |
Richardson-Verfahren (de) Modified Richardson iteration (en) |
| owl:sameAs |
freebase:Modified Richardson iteration wikidata:Modified Richardson iteration dbpedia-de:Modified Richardson iteration https://global.dbpedia.org/id/PHMU |
| prov:wasDerivedFrom |
wikipedia-en:Modified_Richardson_iteration?oldid=1009449721&ns=0 |
| foaf:isPrimaryTopicOf |
wikipedia-en:Modified_Richardson_iteration |
| is dbo:wikiPageRedirects of |
dbr:Richardson_iteration dbr:MR_iteration |
| is dbo:wikiPageWikiLink of |
dbr:List_of_numerical_analysis_topics dbr:Neumann–Neumann_methods dbr:Lewis_Fry_Richardson dbr:Chebyshev_iteration dbr:Iterative_method dbr:Richardson_iteration dbr:MR_iteration |
| is owl:differentFrom of |
dbr:Richardson–Lucy_deconvolution |
| is foaf:primaryTopic of |
wikipedia-en:Modified_Richardson_iteration |