Fixed-point iteration (original) (raw)
نقطة ثابتة تكرارية (بالإنجليزية: Fixed-point iteration) تستخدم هذه الطريقة التكرارية لحل المعادلات و تتميز بأنها لا تتطلب حساب قيم أي مشتقات كما في طريقة نيوتن حيث لحل المعادلة نحتاج إلى حساب قيمة مشتقة الدالة عند كل خطوة.
| Property | Value |
|---|---|
| dbo:abstract | نقطة ثابتة تكرارية (بالإنجليزية: Fixed-point iteration) تستخدم هذه الطريقة التكرارية لحل المعادلات و تتميز بأنها لا تتطلب حساب قيم أي مشتقات كما في طريقة نيوتن حيث لحل المعادلة نحتاج إلى حساب قيمة مشتقة الدالة عند كل خطوة. (ar) Eine Fixpunktiteration (oder auch ein Fixpunktverfahren) ist in der Mathematik ein numerisches Verfahren zur näherungsweisen Bestimmung von Lösungen einer Gleichung oder eines Gleichungssystems. Die Gleichung muss dazu zuerst in eine Fixpunktgleichung, also in eine Gleichung der Form mit einer Funktion umgeformt werden. Anschließend wird eine Startnäherung gewählt und berechnet. Das Ergebnis wird wieder in die Funktion eingesetzt, und so weiter. Unter geeigneten Zusatzvoraussetzungen nähert sich die so erhaltene Folge einer Lösung von und somit einer Lösung des ursprünglichen Problems immer weiter an. (de) El método del punto fijo es un método iterativo que permite resolver sistemas de ecuaciones no necesariamente lineales. En particular se puede utilizar para determinar raíces de una función de la forma , siempre y cuando se cumplan los criterios de convergencia. (es) In numerical analysis, fixed-point iteration is a method of computing fixed points of a function. More specifically, given a function defined on the real numbers with real values and given a point in the domain of , the fixed-point iteration is which gives rise to the sequence of iterated function applications which is hoped to converge to a point . If is continuous, then one can prove that the obtained is a fixed point of , i.e., More generally, the function can be defined on any metric space with values in that same space. (en) In analisi numerica, l'iterazione di punto fisso o iterazione funzionale è un metodo per trovare le radici di una funzione, ovvero per risolvere un'equazione nella forma . Se sono due funzioni tali che , allora si ha se e solo se , cioè è radice di se e solo se è punto fisso di . Il metodo consiste nel risolvere l'equazione dove la generica espressione di è: Si vede quindi che , ovvero la funzione di iterazione, può essere scelta in vari modi. Ad esempio se si può scegliere: La soluzione si approssima (scelto un punto iniziale) con la successione: (it) Em análise numérica, iteração de ponto fixo é um método de se calcular pontos fixos de funções. Ponto fixo de dada função é o número que quando aplicado na função resulta nele mesmo, i.e. . Dada uma aproximação inicial para , o método consiste em iterar sucessivamente a função dada sobre . Ou seja, constrói-se a sequência sendo cada uma nova aproximação do ponto fixo . Uma importante aplicação deste método aparece no cálculo numérico de soluções de equações de uma variável real. (pt) Метод простой итерации — один из простейших численных методов решения уравнений. Метод основан на принципе сжимающего отображения, который применительно к численным методам в общем виде также может называться методом простой итерации или методом последовательных приближений. В частности, для систем линейных алгебраических уравнений существует аналогичный метод итерации. (ru) Метод простої ітерації - метод обчислення нерухомої точки функції. (uk) |
| dbo:thumbnail | wiki-commons:Special:FilePath/Sine_fixed_point.svg?width=300 |
| dbo:wikiPageExternalLink | https://archive.org/details/numericalanalys00burd https://algonum.appspot.com/%23fixpoint.picard https://wydawnictwa.ptm.org.pl/index.php/antiquitates-mathematicae/article/view/7056/6528 http://user.mendelu.cz/marik/maw/index.php%3Flang=en&form=banach https://books.google.com/books%3Fid=9Wxk_z9HskAC&pg=PA165 https://books.google.com/books%3Fid=Kf8TiuXgNYQC https://books.google.com/books%3Fid=T2uTAwAAQBAJ https://books.google.com/books%3Fid=VKs7Afjkng4C&pg=PA141 |
| dbo:wikiPageID | 7344320 (xsd:integer) |
| dbo:wikiPageLength | 14990 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1119689321 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Bellman_equation dbr:Babylonian_method dbr:Root-finding_algorithm dbr:Convergence_acceleration dbr:Dottie_number dbr:Dynamical_system dbr:Limit_of_a_sequence dbr:Quadratic_convergence dbr:Complex_number dbr:Anderson_acceleration dbc:Iterative_methods dbr:Contraction_mapping dbr:Cosine dbr:Limit_(mathematics) dbr:Linear_differential_equation dbr:Lipschitz_continuity dbr:Logistic_map dbr:Lyapunov_stable dbr:Steffensen's_method dbr:Strange_attractor dbr:Complete_metric_space dbr:Dense_set dbr:Halley's_method dbr:Domain_of_a_function dbr:Cubic_convergence dbr:Aitken's_delta-squared_process dbr:Dynamic_programming dbr:Fixed_point_(mathematics) dbr:Banach_fixed-point_theorem dbr:Numerical_analysis dbr:Fractal dbr:Iterated_function_system dbr:Colebrook_equation dbr:Attractor dbc:Fixed-point_theorems dbr:Iterated_function dbc:Root-finding_algorithms dbr:Bifurcation_theory dbr:Cobweb_model dbr:Cobweb_plot dbr:Picard–Lindelöf_theorem dbr:Square_root dbr:Infinite_compositions_of_analytic_functions dbr:Metric_space dbr:Newton's_method dbr:Ordinary_differential_equation dbr:Radian dbr:Real_number dbr:Sequence dbr:Markov_chain dbr:Fixed-point_combinator dbr:Fixed-point_theorems dbr:Sierpinski_triangle dbr:Runge–Kutta_method dbr:Linear_convergence dbr:A-stability dbr:Periodic_orbits dbr:Price_theory dbr:Antiquitates_Mathematicae dbr:File:Sine_fixed_point.svg dbr:File:Sierpinski_Chaos.gif dbr:File:Cosine_fixed_point.svg |
| dbp:wikiPageUsesTemplate | dbt:Anchor dbt:Cite_book dbt:Cite_journal dbt:Div_col dbt:Div_col_end dbt:Efn dbt:Main dbt:Mvar dbt:Refimprove dbt:Reflist dbt:Tmath dbt:Ulist |
| dct:subject | dbc:Iterative_methods dbc:Fixed-point_theorems dbc:Root-finding_algorithms |
| rdf:type | yago:WikicatRoot-findingAlgorithms yago:Ability105616246 yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Cognition100023271 yago:Event100029378 yago:Know-how105616786 yago:Method105660268 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:WikicatIterativeMethods yago:YagoPermanentlyLocatedEntity yago:Rule105846932 |
| rdfs:comment | نقطة ثابتة تكرارية (بالإنجليزية: Fixed-point iteration) تستخدم هذه الطريقة التكرارية لحل المعادلات و تتميز بأنها لا تتطلب حساب قيم أي مشتقات كما في طريقة نيوتن حيث لحل المعادلة نحتاج إلى حساب قيمة مشتقة الدالة عند كل خطوة. (ar) El método del punto fijo es un método iterativo que permite resolver sistemas de ecuaciones no necesariamente lineales. En particular se puede utilizar para determinar raíces de una función de la forma , siempre y cuando se cumplan los criterios de convergencia. (es) In numerical analysis, fixed-point iteration is a method of computing fixed points of a function. More specifically, given a function defined on the real numbers with real values and given a point in the domain of , the fixed-point iteration is which gives rise to the sequence of iterated function applications which is hoped to converge to a point . If is continuous, then one can prove that the obtained is a fixed point of , i.e., More generally, the function can be defined on any metric space with values in that same space. (en) In analisi numerica, l'iterazione di punto fisso o iterazione funzionale è un metodo per trovare le radici di una funzione, ovvero per risolvere un'equazione nella forma . Se sono due funzioni tali che , allora si ha se e solo se , cioè è radice di se e solo se è punto fisso di . Il metodo consiste nel risolvere l'equazione dove la generica espressione di è: Si vede quindi che , ovvero la funzione di iterazione, può essere scelta in vari modi. Ad esempio se si può scegliere: La soluzione si approssima (scelto un punto iniziale) con la successione: (it) Em análise numérica, iteração de ponto fixo é um método de se calcular pontos fixos de funções. Ponto fixo de dada função é o número que quando aplicado na função resulta nele mesmo, i.e. . Dada uma aproximação inicial para , o método consiste em iterar sucessivamente a função dada sobre . Ou seja, constrói-se a sequência sendo cada uma nova aproximação do ponto fixo . Uma importante aplicação deste método aparece no cálculo numérico de soluções de equações de uma variável real. (pt) Метод простой итерации — один из простейших численных методов решения уравнений. Метод основан на принципе сжимающего отображения, который применительно к численным методам в общем виде также может называться методом простой итерации или методом последовательных приближений. В частности, для систем линейных алгебраических уравнений существует аналогичный метод итерации. (ru) Метод простої ітерації - метод обчислення нерухомої точки функції. (uk) Eine Fixpunktiteration (oder auch ein Fixpunktverfahren) ist in der Mathematik ein numerisches Verfahren zur näherungsweisen Bestimmung von Lösungen einer Gleichung oder eines Gleichungssystems. Die Gleichung muss dazu zuerst in eine Fixpunktgleichung, also in eine Gleichung der Form (de) |
| rdfs:label | نقطة ثابتة تكرارية (ar) Fixpunktiteration (de) Método del punto fijo (es) Fixed-point iteration (en) Iterazione di punto fisso (it) Метод простой итерации (ru) Iteração de ponto fixo (pt) Метод простої ітерації (uk) |
| owl:sameAs | freebase:Fixed-point iteration yago-res:Fixed-point iteration wikidata:Fixed-point iteration dbpedia-ar:Fixed-point iteration dbpedia-de:Fixed-point iteration dbpedia-es:Fixed-point iteration dbpedia-it:Fixed-point iteration dbpedia-no:Fixed-point iteration dbpedia-pt:Fixed-point iteration dbpedia-ru:Fixed-point iteration dbpedia-sl:Fixed-point iteration dbpedia-uk:Fixed-point iteration https://global.dbpedia.org/id/7iN5 |
| prov:wasDerivedFrom | wikipedia-en:Fixed-point_iteration?oldid=1119689321&ns=0 |
| foaf:depiction | wiki-commons:Special:FilePath/Cosine_fixed_point.svg wiki-commons:Special:FilePath/Sine_fixed_point.svg wiki-commons:Special:FilePath/Sierpinski_Chaos.gif |
| foaf:isPrimaryTopicOf | wikipedia-en:Fixed-point_iteration |
| is dbo:wikiPageDisambiguates of | dbr:FPI |
| is dbo:wikiPageRedirects of | dbr:Picard_iteration dbr:Fixed_point_algorithm dbr:Fixed_point_iteration dbr:Fixed_point_iteration_method dbr:Fixed_point_method dbr:Fixpoint_algorithm dbr:Fixpoint_iteration |
| is dbo:wikiPageWikiLink of | dbr:Root-finding_algorithms dbr:Engset_formula dbr:FPI dbr:Morlet_wavelet dbr:Method_of_successive_substitution dbr:Incomplete_LU_factorization dbr:List_of_numerical_analysis_topics dbr:Anderson_acceleration dbr:Kepler's_equation dbr:Methods_of_successive_approximation dbr:Hartree–Fock_method dbr:Language_equation dbr:Banach_fixed-point_theorem dbr:Numerical_methods_for_ordinary_differential_equations dbr:Chase_(algorithm) dbr:Fluid–structure_interaction dbr:QR_algorithm dbr:Backward_Euler_method dbr:Latitude dbr:Cobweb_plot dbr:Picard_iteration dbr:Bueno-Orovio–Cherry–Fenton_model dbr:Mean_value_analysis dbr:Fixed-point_combinator dbr:Streamline_upwind_Petrov–Galerkin_pres...ncompressible_Navier–Stokes_equations dbr:Fixed_point_algorithm dbr:Fixed_point_iteration dbr:Fixed_point_iteration_method dbr:Fixed_point_method dbr:Fixpoint_algorithm dbr:Fixpoint_iteration |
| is foaf:primaryTopic of | wikipedia-en:Fixed-point_iteration |
