Talk:Levinson recursion
It is of interest to the following WikiProjects:
This article is substantially duplicated in one or more external publications. Since these publication(s) copied Wikipedia, rather than the reverse, please do not flag this article as a copyright violation of the following source:
|
--Tbackstr 13:39, 12 Mar 2004 (UTC) I copied a description of the algorithm directly from my own PhD-thesis, i.e., with permission from the author.
References
[edit ]The in-text references in the first paragraph
http://web.comlab.ox.ac.uk/oucl/work/richard.brent/pd/rpb143tr.pdf and http://saaz.cs.gsu.edu/papers/sfast.pdf
appear to be dead. 141.24.93.165 (talk) 16:07, 20 November 2008 (UTC) [reply ]
It isn't true that this algorithm will work whenever the main diagonal is zero. Consider the counterexample
2 2 1 2 2 2 1 2 2
This matrix can be inverted as
0 1 -1 1 -1.5 1 -1 1 0
But the algorithm described in this article would have a divide by zero as er and ef would both be 1. I think that the Toeplitz matrix must be positive definite but that may be too stringent. Maybe the main diagonal values need only be nonzero and unique. 96.11.231.254 (talk) 14:05, 30 July 2009 (UTC) [reply ]
This page has been plagiarized by NetHelper
[edit ]Nethelper.com.au appears to have an exact copy of this page: http://www.nethelper.com.au/article/Levinson_recursion
Since the math formatting isn't done correctly, and the format of the page is in a wiki-style, and since Nethelper.com.au appears to be largely or perhaps entirely copies of wiki pages without any visible citations, I'd say it seems pretty clear that Nethelper just trawls Wikipedia (and possibly other sites) for content. Their "about us" page (http://www.nethelper.com.au/aboutus.php) is also fairly suspicious. — Preceding unsigned comment added by 199.3.246.231 (talk) 21:18, 4 February 2014 (UTC) [reply ]
- That's ok! That's the point of Wikipedia. Anyone should be able to grab stuff from here and do what they want with it. Hamsterlopithecus (talk) 05:12, 18 January 2016 (UTC) [reply ]
External links modified
[edit ]Hello fellow Wikipedians,
I have just modified 2 external links on Levinson recursion. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
- Added archive https://web.archive.org/web/20091115041852/http://etd.gsu.edu/theses/available/etd-04182008-174330/unrestricted/kimitei_symon_k_200804.pdf to http://etd.gsu.edu/theses/available/etd-04182008-174330/unrestricted/kimitei_symon_k_200804.pdf
- Added
{{dead link}}tag to http://locus.siam.org/fulltext/SISC/volume-06/0906025.pdf - Added archive https://web.archive.org/web/20060921204908/http://sep.stanford.edu/oldreports/fgdp2/fgdp_07.pdf to http://sep.stanford.edu/oldreports/fgdp2/fgdp_07.pdf
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).
- If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
- If you found an error with any archives or the URLs themselves, you can fix them with this tool.
Cheers.—InternetArchiveBot (Report bug) 03:41, 22 December 2017 (UTC) [reply ]