| http://dbpedia.org/ontology/abstract
|
In numerical analysis, the ITP method, sho … In numerical analysis, the ITP method, short for Interpolate Truncate and Project, is the first root-finding algorithm that achieves the superlinear convergence of the secant method while retaining the optimal worst-case performance of the bisection method. It is also the first method with guaranteed average performance strictly better than the bisection method under any continuous distribution. In practice it performs better than traditional interpolation and hybrid based strategies (Brent's Method, Ridders, Illinois), since it not only converges super-linearly over well behaved functions but also guarantees fast performance under ill-behaved functions where interpolations fail. The ITP method follows the same structure of standard bracketing strategies that keeps track of upper and lower bounds for the location of the root; but it also keeps track of the region where worst-case performance is kept upper-bounded. As a bracketing strategy, in each iteration the ITP queries the value of the function on one point and discards the part of the interval between two points where the function value shares the same sign. The queried point is calculated with three steps: it interpolates finding the regula falsi estimate, then it perturbes/truncates the estimate (similar to Regula falsi § Improvements in regula falsi) and then projects the perturbed estimate onto an interval in the neighbourhood of the bisection midpoint. The neighbourhood around the bisection point is calculated in each iteration in order to guarantee minmax optimality (Theorem 2.1 of ). The method depends on three hyper-parameters and where is the golden ratio : the first two control the size of the truncation and the third is a slack variable that controls the size of the interval for the projection step.e of the interval for the projection step.
, Em análise numérica, o método ITP, abrevia … Em análise numérica, o método ITP, abreviação de Interpolar, Truncar e Projetar, é o primeiro algoritmo de busca de raízes a atingir a convergência superlinear do método secante garantindo o desempenho de pior caso do método de biseção. O método ITP segue a mesma estrutura das estratégias que mantém o controle dos limites superior e inferior para a localização da raiz; e, em adição, o método mantém o controle da região onde o desempenho do pior caso é mantido sob controle. Em cada iteração o método ITP consulta o valor da função em um ponto intermediário do intervalo e descarta a parte do intervalo entre dois pontos onde o valor da função compartilha o mesmo sinal . O método ITP também é o primeiro método com desempenho médio estritamente melhor do que o método de biseção sob qualquer distribuição contínua .seção sob qualquer distribuição contínua .
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/ITPstep1.png?width=300 +
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://info.growkudos.com/ +
, https://docs.rs/kurbo/0.8.1/kurbo/common/fn.solve_itp.html +
, https://link.growkudos.com/1iwxps83474 +
|
| http://dbpedia.org/ontology/wikiPageID
|
66104540
|
| http://dbpedia.org/ontology/wikiPageLength
|
12388
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1115183773
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/File:ITPstep3.png +
, http://dbpedia.org/resource/File:ITPstep1.png +
, http://dbpedia.org/resource/Secant_method +
, http://dbpedia.org/resource/Category:Root-finding_algorithms +
, http://dbpedia.org/resource/Engineering +
, http://dbpedia.org/resource/File:ITPall_steps.png +
, http://dbpedia.org/resource/Pseudocode +
, http://dbpedia.org/resource/Superlinear_convergence +
, http://dbpedia.org/resource/Best%2C_worst_and_average_case +
, http://dbpedia.org/resource/Ridders%27_method +
, http://dbpedia.org/resource/Regula_falsi +
, http://dbpedia.org/resource/Numerical_analysis +
, http://dbpedia.org/resource/Root-finding_algorithms +
, http://dbpedia.org/resource/Bisection_method +
, http://dbpedia.org/resource/Computer_science +
, http://dbpedia.org/resource/Brent%27s_method +
, http://dbpedia.org/resource/File:ITPstep2.png +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Efn +
, http://dbpedia.org/resource/Template:Notelist +
, http://dbpedia.org/resource/Template:More_citations_needed +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Section_link +
, http://dbpedia.org/resource/Template:Short_description +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Root-finding_algorithms +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/ITP_method?oldid=1115183773&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/ITPstep1.png +
, http://commons.wikimedia.org/wiki/Special:FilePath/ITPstep2.png +
, http://commons.wikimedia.org/wiki/Special:FilePath/ITPstep3.png +
, http://commons.wikimedia.org/wiki/Special:FilePath/ITPall_steps.png +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/ITP_method +
|
| owl:sameAs |
http://pt.dbpedia.org/resource/M%C3%A9todo_ITP +
, http://dbpedia.org/resource/ITP_method +
, http://www.wikidata.org/entity/Q104880843 +
, https://global.dbpedia.org/id/FXfW6 +
|
| rdfs:comment |
Em análise numérica, o método ITP, abrevia … Em análise numérica, o método ITP, abreviação de Interpolar, Truncar e Projetar, é o primeiro algoritmo de busca de raízes a atingir a convergência superlinear do método secante garantindo o desempenho de pior caso do método de biseção. O método ITP segue a mesma estrutura das estratégias que mantém o controle dos limites superior e inferior para a localização da raiz; e, em adição, o método mantém o controle da região onde o desempenho do pior caso é mantido sob controle. Em cada iteração o método ITP consulta o valor da função em um ponto intermediário do intervalo e descarta a parte do intervalo entre dois pontos onde o valor da função compartilha o mesmo sinal . O método ITP também é o primeiro método com desempenho médio estritamente melhor do que o método de biseção sob qualquer dist que o método de biseção sob qualquer dist
, In numerical analysis, the ITP method, sho … In numerical analysis, the ITP method, short for Interpolate Truncate and Project, is the first root-finding algorithm that achieves the superlinear convergence of the secant method while retaining the optimal worst-case performance of the bisection method. It is also the first method with guaranteed average performance strictly better than the bisection method under any continuous distribution. In practice it performs better than traditional interpolation and hybrid based strategies (Brent's Method, Ridders, Illinois), since it not only converges super-linearly over well behaved functions but also guarantees fast performance under ill-behaved functions where interpolations fail.haved functions where interpolations fail.
|
| rdfs:label |
ITP method
, Método ITP
|
