Talk:Root-finding algorithm - Revision history

King of Hearts: King of Hearts moved page Talk:Root-finding algorithms to Talk:Root-finding algorithm over redirect: Talk:Root-finding algorithms#Requested move 21 July 2024

2024-07-22T01:24:31Z

King of Hearts moved page Talk:Root-finding algorithms to Talk:Root-finding algorithm over redirect: Talk:Root-finding algorithms#Requested move 21 July 2024

← Previous revision	Revision as of 01:24, 22 July 2024
(No difference)

King of Hearts: /* Requested move 21 July 2024 */ Closing RM: Speedy moved (closeRM)

2024-07-22T01:24:04Z

Requested move 21 July 2024: Closing RM: Speedy moved (closeRM)

← Previous revision		Revision as of 01:24, 22 July 2024
Line 307:		Line 307:
	== Requested move 21 July 2024 ==		== Requested move 21 July 2024 ==

			<div class="boilerplate mw-archivedtalk" style="background-color: #efe; margin: 0; padding: 0 10px 0 10px; border: 1px dotted #aaa;"><!-- Template:RM top -->
	{{requested move/dated\|Root-finding algorithm}}
			:''The following is a closed discussion of a [[Wikipedia:Requested moves\|requested move]]. <span style="color:red">'''Please do not modify it.'''</span> Subsequent comments should be made in a new section on the talk page. Editors desiring to contest the closing decision should consider a [[Wikipedia:move review\|move review]] after discussing it on the closer's talk page. No further edits should be made to this discussion.''

			The result of the move request was: '''Speedy moved'''. Reverting unilateral move by {{u\|D.Lazard}} to restore original title. An RM may be filed at any time in the opposite direction. [[User:King of Hearts\|<b style="color:red">King of ♥</b>]][[User talk:King of Hearts\|<b style="color:red"> ♦</b>]][[Special:Contributions/King of Hearts\|<b style="color:black"> ♣</b>]][[Special:EmailUser/King of Hearts\|<b style="color:black"> ♠</b>]] 01:23, 22 July 2024 (UTC)
			----
	[[:Root-finding algorithms]] → {{no redirect\|Root-finding algorithm}} – [[WP:SINGULAR]]. –[[User:LaundryPizza03\|<b style="color:#77b">Laundry</b><b style="color:#fb0">Pizza</b><b style="color:#b00">03</b>]] ([[User talk:LaundryPizza03\|<span style="color:#0d0">d</span>]][[Special:Contribs/LaundryPizza03\|<span style="color:#0bf">c̄</span>]]) 23:31, 21 July 2024 (UTC)		[[:Root-finding algorithms]] → {{no redirect\|Root-finding algorithm}} – [[WP:SINGULAR]]. –[[User:LaundryPizza03\|<b style="color:#77b">Laundry</b><b style="color:#fb0">Pizza</b><b style="color:#b00">03</b>]] ([[User talk:LaundryPizza03\|<span style="color:#0d0">d</span>]][[Special:Contribs/LaundryPizza03\|<span style="color:#0bf">c̄</span>]]) 23:31, 21 July 2024 (UTC)

			<div style="padding-left: 1.6em; font-style: italic; border-top: 1px solid #a2a9b1; margin: 0.5em 0; padding-top: 0.5em">The discussion above is closed. <b style="color: #FF0000;">Please do not modify it.</b> Subsequent comments should be made on the appropriate discussion page. No further edits should be made to this discussion.</div><!-- from [[Template:Archive bottom]] -->
			</div><div style="clear:both;" class=></div>

LaundryPizza03: Proposing move to :Root-finding algorithm

2024-07-21T23:31:07Z

Proposing move to Root-finding algorithm

← Previous revision		Revision as of 23:31, 21 July 2024
Line 304:		Line 304:
	:Missing phrase: "Also, even with a good approximation, when one evaluates a polynomial at an approximate root, one may get a result that is far ***MISSING PHRASE*** to be close to zero."		:Missing phrase: "Also, even with a good approximation, when one evaluates a polynomial at an approximate root, one may get a result that is far ***MISSING PHRASE*** to be close to zero."
	:[[User:SlotAndSplit\|SlotAndSplit]] ([[User talk:SlotAndSplit\|talk]]) 17:55, 12 October 2022 (UTC)		:[[User:SlotAndSplit\|SlotAndSplit]] ([[User talk:SlotAndSplit\|talk]]) 17:55, 12 October 2022 (UTC)

			== Requested move 21 July 2024 ==

			{{requested move/dated\|Root-finding algorithm}}

			[[:Root-finding algorithms]] → {{no redirect\|Root-finding algorithm}} – [[WP:SINGULAR]]. –[[User:LaundryPizza03\|<b style="color:#77b">Laundry</b><b style="color:#fb0">Pizza</b><b style="color:#b00">03</b>]] ([[User talk:LaundryPizza03\|<span style="color:#0d0">d</span>]][[Special:Contribs/LaundryPizza03\|<span style="color:#0bf">c̄</span>]]) 23:31, 21 July 2024 (UTC)

Cewbot: Maintain {{WPBS}}: 2 WikiProject templates. Remove 1 deprecated parameter: field.

2024-03-09T04:15:36Z

Maintain {{WPBS}}: 2 WikiProject templates. Remove 1 deprecated parameter: field.

← Previous revision		Revision as of 04:15, 9 March 2024
Line 1:		Line 1:
	{{WikiProject banner shell\|class=C\|vital=yes\|		{{WikiProject banner shell\|class=C\|vital=yes\|
	{{WikiProject Mathematics\|importance=mid~~\|field=analysis~~}}		{{WikiProject Mathematics\|importance=mid}}
	{{WikiProject Computer science}}		{{WikiProject Computer science}}
	}}		}}

Cewbot: Maintain {{WPBS}} and vital articles: 2 WikiProject templates. Merge {{VA}} into {{WPBS}}. Keep majority rating "C" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{Maths rating}}.

2024-01-10T12:22:04Z

Maintain {{WPBS}} and vital articles: 2 WikiProject templates. Merge {{VA}} into {{WPBS}}. Keep majority rating "C" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{Maths rating}}.

← Previous revision		Revision as of 12:22, 10 January 2024
Line 1:		Line 1:
	{{~~Vital~~ ~~article~~\|class=C\|~~level~~=5\|~~topic=Mathematics}}~~		{{WikiProject banner shell\|class=C\|vital=yes\|
	{{~~WikiProjectBannerShell\|{{maths~~ ~~rating\|class=C~~\|importance=mid\|field=analysis}}		{{WikiProject Mathematics\|importance=mid\|field=analysis}}
	{{WikiProject Computer ~~Science~~}}}}		{{WikiProject Computer science}}
			}}

	==Jacoby's method==		==Jacoby's method==

SlotAndSplit: /* Root finding of polynomials */ Reply

2022-10-12T17:55:29Z

Root finding of polynomials: Reply

← Previous revision		Revision as of 17:55, 12 October 2022
Line 299:		Line 299:

	I hope that you will agree that these edits improve the covering of the subject. [[User:D.Lazard\|D.Lazard]] ([[User talk:D.Lazard\|talk]]) 19:12, 30 December 2018 (UTC)		I hope that you will agree that these edits improve the covering of the subject. [[User:D.Lazard\|D.Lazard]] ([[User talk:D.Lazard\|talk]]) 19:12, 30 December 2018 (UTC)

			:The sentence: "Also, even with a good approximation, when one evaluates a polynomial at an approximate root, one may get a result that is far to be close to zero." seems to be missing a phrase, but I am not sure how to fix it. Did you intend, "too large in magnitude"?
			:Missing phrase: "Also, even with a good approximation, when one evaluates a polynomial at an approximate root, one may get a result that is far ***MISSING PHRASE*** to be close to zero."
			:[[User:SlotAndSplit\|SlotAndSplit]] ([[User talk:SlotAndSplit\|talk]]) 17:55, 12 October 2022 (UTC)

RenatUK: Fixed {{Vital article}}

2022-01-29T12:49:50Z

Fixed {{Vital article}}

← Previous revision		Revision as of 12:49, 29 January 2022
Line 1:		Line 1:
	{{Vital article\|class=C\|level=5\|~~link~~=~~Wikipedia:Vital articles/Level/5/~~Mathematics~~\|anchor=Theoretical computer science (57 articles)~~}}		{{Vital article\|class=C\|level=5\|topic=Mathematics}}
	{{WikiProjectBannerShell\|{{maths rating\|class=C\|importance=mid\|field=analysis}}		{{WikiProjectBannerShell\|{{maths rating\|class=C\|importance=mid\|field=analysis}}
	{{WikiProject Computer Science}}}}		{{WikiProject Computer Science}}}}

AVM2019: /* Fixed Point Iteration */

2020-09-14T21:56:45Z

Fixed Point Iteration

← Previous revision		Revision as of 21:56, 14 September 2020
Line 193:		Line 193:
	Why isn't fixed point iteration mentioned in this article ? <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/168.96.204.43\|168.96.204.43]] ([[User talk:168.96.204.43\|talk]]) 17:45, 29 June 2011 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->		Why isn't fixed point iteration mentioned in this article ? <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/168.96.204.43\|168.96.204.43]] ([[User talk:168.96.204.43\|talk]]) 17:45, 29 June 2011 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
	:What do you have in mind? [[User:Bo Jacoby\|Bo Jacoby]] ([[User talk:Bo Jacoby\|talk]]) 06:40, 30 June 2011 (UTC).		:What do you have in mind? [[User:Bo Jacoby\|Bo Jacoby]] ([[User talk:Bo Jacoby\|talk]]) 06:40, 30 June 2011 (UTC).
			: {{reply to\|User:Bo Jacoby}} Probably the user meant iteration <math>x_{k+1} := g(x_k) </math> to solve the equation <math> x = g(x) </math>, as described e.g. in [http://home.iitk.ac.in/~psraj/mth101/lecture_notes/lecture8.pdf]. I second the request for it to be included in the article. I think this method is important to know to see a broader picture: for example, the gradient descent can be interpreted as the simple fixed point iteration method applied to find a zero of the first derivative, in which the step size <math> s </math> should be chosen small enough to guarantee the convergence condition <math>\|s g'(x)\| < 1</math>. [[User:AVM2019\|AVM2019]] ([[User talk:AVM2019\|talk]]) 21:56, 14 September 2020 (UTC)

	== Vincent-Uspenski-Collins-Akritas-Zimmerman ==		== Vincent-Uspenski-Collins-Akritas-Zimmerman ==

D.Lazard: /* top */ rm empty {{todo}}

2020-04-12T08:18:16Z

top: rm empty {{todo}}

← Previous revision		Revision as of 08:18, 12 April 2020
Line 2:		Line 2:
	{{WikiProjectBannerShell\|{{maths rating\|class=C\|importance=mid\|field=analysis}}		{{WikiProjectBannerShell\|{{maths rating\|class=C\|importance=mid\|field=analysis}}
	{{WikiProject Computer Science}}}}		{{WikiProject Computer Science}}}}
	{{to do}}

	==Jacoby's method==		==Jacoby's method==

Cewbot: Maintain {{Vital article}}: The article is listed in the level 5 page: Theoretical computer science (57 articles)

2020-04-12T08:13:47Z

Maintain {{Vital article}}: The article is listed in the level 5 page: Theoretical computer science (57 articles)

← Previous revision		Revision as of 08:13, 12 April 2020
Line 1:		Line 1:
			{{Vital article\|class=C\|level=5\|link=Wikipedia:Vital articles/Level/5/Mathematics\|anchor=Theoretical computer science (57 articles)}}
	{{WikiProjectBannerShell\|{{maths rating\|class=C\|importance=mid\|field=analysis}}		{{WikiProjectBannerShell\|{{maths rating\|class=C\|importance=mid\|field=analysis}}
	{{WikiProject Computer Science}}}}		{{WikiProject Computer Science}}}}

← Previous revision		Revision as of 23:31, 21 July 2024
Line 304:		Line 304:
	:Missing phrase: "Also, even with a good approximation, when one evaluates a polynomial at an approximate root, one may get a result that is far ***MISSING PHRASE*** to be close to zero."		:Missing phrase: "Also, even with a good approximation, when one evaluates a polynomial at an approximate root, one may get a result that is far ***MISSING PHRASE*** to be close to zero."
	:[[User:SlotAndSplit\|SlotAndSplit]] ([[User talk:SlotAndSplit\|talk]]) 17:55, 12 October 2022 (UTC)		:[[User:SlotAndSplit\|SlotAndSplit]] ([[User talk:SlotAndSplit\|talk]]) 17:55, 12 October 2022 (UTC)

			== Requested move 21 July 2024 ==

			{{requested move/dated\|Root-finding algorithm}}

			[[:Root-finding algorithms]] → {{no redirect\|Root-finding algorithm}} – [[WP:SINGULAR]]. –[[User:LaundryPizza03\|<b style="color:#77b">Laundry</b><b style="color:#fb0">Pizza</b><b style="color:#b00">03</b>]] ([[User talk:LaundryPizza03\|<span style="color:#0d0">d</span>]][[Special:Contribs/LaundryPizza03\|<span style="color:#0bf">c̄</span>]]) 23:31, 21 July 2024 (UTC)