Simple rational approximation: Difference between revisions

Content deleted Content added

Revision as of 12:52, 27 June 2020 edit Redav (talk \| contribs) Extended confirmed users 2,388 edits m Gander(1978) → Gander (1978) ← Previous edit		Latest revision as of 04:03, 11 March 2025 edit undo Citation bot (talk \| contribs) Bots 5,864,497 edits Altered url. URLs might have been anonymized. \| Use this bot. Report bugs. \| Suggested by Dominic3203 \| Category:Interpolation \| #UCB_Category 39/59
(2 intermediate revisions by 2 users not shown)
Line 24: The algebraic interpretation of this iteration is obtained by solving :<math>g(x)=1-\frac{\alpha}{{f(x)}}=0.</math> This one-point second-order method is known to show a locally quadratic convergence if the root of the equation is simple. SRA strictly implies this one-point second-order interpolation by a simple rational function. Line 49: \| title = The spectrum of a modified linear pencil \| volume = 46 \| year = 2003~~}}.~~\| doi-access = free }}. {{citation \| last1 = Gu \| first1 = Ming Line 60 ⟶ 61: \| title = A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem \| volume = 16 \| year = 1995\| url = https://zenodo.org/record/1236142~~/files/article.pdf~~ }}. {{citation