| http://dbpedia.org/ontology/abstract
|
局所収束性（きょくしょしゅうそくせい、英語: locally convergent、局所的収束性）は、数値解析において初期点が最適解に十分に近いときに最適解に十分に収束することが保証された反復法である。ニュートン法のようなおよび非線形方程式系で使用される反復法は一般的に局所収束性だけを満たす。 任意の初期点に対して収束する反復法は大域収束性、大域的収束性に分類される。線型方程式系で使用される反復法は一般的に大域収束性を満たす。
, In numerical analysis, an iterative method … In numerical analysis, an iterative method is called locally convergent if the successive approximations produced by the method are guaranteed to converge to a solution when the initial approximation is already close enough to the solution. Iterative methods for nonlinear equations and their systems, such as Newton's method are usually only locally convergent. An iterative method that converges for an arbitrary initial approximation is called globally convergent. Iterative methods for systems of linear equations are usually globally convergent.
* v
* t
* esually globally convergent.
* v
* t
* e
|
| http://dbpedia.org/ontology/wikiPageID
|
16344093
|
| http://dbpedia.org/ontology/wikiPageLength
|
748
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
865949636
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Newton%27s_method +
, http://dbpedia.org/resource/Linear_equations +
, http://dbpedia.org/resource/Approximation +
, http://dbpedia.org/resource/Iterative_method +
, http://dbpedia.org/resource/Category:Numerical_analysis +
, http://dbpedia.org/resource/Nonlinear_equation +
, http://dbpedia.org/resource/Numerical_analysis +
, http://dbpedia.org/resource/Category:Iterative_methods +
, http://dbpedia.org/resource/Limit_of_a_sequence +
, http://dbpedia.org/resource/Category:Optimization_algorithms_and_methods +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Mathanalysis-stub +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Numerical_analysis +
, http://dbpedia.org/resource/Category:Optimization_algorithms_and_methods +
, http://dbpedia.org/resource/Category:Iterative_methods +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Local_convergence?oldid=865949636&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Local_convergence +
|
| owl:sameAs |
http://ja.dbpedia.org/resource/%E5%B1%80%E6%89%80%E5%8F%8E%E6%9D%9F%E6%80%A7 +
, http://www.wikidata.org/entity/Q6664310 +
, https://global.dbpedia.org/id/4qzFV +
, http://dbpedia.org/resource/Local_convergence +
, http://rdf.freebase.com/ns/m.03whb8h +
, http://yago-knowledge.org/resource/Local_convergence +
|
| rdf:type |
http://dbpedia.org/class/yago/Activity100407535 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/WikicatIterativeMethods +
, http://dbpedia.org/class/yago/Algorithm105847438 +
, http://dbpedia.org/class/yago/WikicatOptimizationAlgorithmsAndMethods +
, http://dbpedia.org/class/yago/Event100029378 +
, http://dbpedia.org/class/yago/Procedure101023820 +
, http://dbpedia.org/class/yago/Act100030358 +
, http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
, http://dbpedia.org/class/yago/Method105660268 +
, http://dbpedia.org/class/yago/Know-how105616786 +
, http://dbpedia.org/class/yago/Ability105616246 +
, http://dbpedia.org/class/yago/Rule105846932 +
, http://dbpedia.org/class/yago/YagoPermanentlyLocatedEntity +
, http://dbpedia.org/class/yago/Cognition100023271 +
|
| rdfs:comment |
In numerical analysis, an iterative method … In numerical analysis, an iterative method is called locally convergent if the successive approximations produced by the method are guaranteed to converge to a solution when the initial approximation is already close enough to the solution. Iterative methods for nonlinear equations and their systems, such as Newton's method are usually only locally convergent. An iterative method that converges for an arbitrary initial approximation is called globally convergent. Iterative methods for systems of linear equations are usually globally convergent.
* v
* t
* esually globally convergent.
* v
* t
* e
, 局所収束性（きょくしょしゅうそくせい、英語: locally convergent、局所的収束性）は、数値解析において初期点が最適解に十分に近いときに最適解に十分に収束することが保証された反復法である。ニュートン法のようなおよび非線形方程式系で使用される反復法は一般的に局所収束性だけを満たす。 任意の初期点に対して収束する反復法は大域収束性、大域的収束性に分類される。線型方程式系で使用される反復法は一般的に大域収束性を満たす。
|
| rdfs:label |
Local convergence
, 局所収束性
|
