Talk:Fast Kalman filter
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
This looks slightly worrying: from one of the pages on the "fast Kalman filter" site linked to from this stub:
- Mr. Antti Lange, Ph.D., who works as a senior scientist at the Finnish Meteorological Institute, is challenging Christians all over the world to take part in the battle for the microchip. Because, if it results in wrong hands, it will turn into the mark 666 of the beast spoken of in the book of Revelation. [1].
However, there also seem to be some legitimate references outside of the linked site to Lange as the inventor of a "Fast Kalman Filter". Can peoply knowledgeable in the field let us know whether this an important concept or a fringe concept? -- The Anome 14:17, Feb 17, 2005 (UTC)
Article cleanup
editIt is my impression that this article contains a unclear mixture of "method" and "aplications", two properties which should be separated. Furthermore I get the impression that FKF only applies to systems with sparse matrices, since Helmert-Wolf blocking is a methos to solve sparse linear equations. The ordinary Kalman filter is still computationally optimal for general systems. This limitation should be pointed out clearly! --Fredrik Orderud 14:47, 20 May 2005 (UTC) Please let me though point out that an optimal Kalman filter is reliable only if both of its observability and conrollability conditions are continuously satisfied. The ordinary Kalman filtering not only usually but very typically ignores the observability condition. Consequently, such mere optimality of computing is made at the expense of safety.86.115.200.70 (talk) 11:47, 9 March 2018 (UTC)Andy
External links modified
editHello fellow Wikipedians,
I have just modified 2 external links on Fast Kalman filter. 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/20050313174050/http://bass.gmu.edu/ececourses/ece521/lecturenote/chap3/chap3.html to http://bass.gmu.edu/ececourses/ece521/lecturenote/chap3/chap3.html
- Added archive https://web.archive.org/web/20050309133540/http://www.bmva.ac.uk/bmvc/1998/papers/d043/h043.htm to http://www.bmva.ac.uk/bmvc/1998/papers/d043/h043.htm
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) 16:22, 28 September 2017 (UTC)
Other approaches?
editAt the moment only Lange's method is described here, but his method is no longer the only one (you can google for "fast kalman filter" and see for youselves). It would be nice to see them here also. (Why I am not doing it myself? Because it is a wayyyyyyyyy outside of my expertise.) 193.166.223.5 (talk) 07:21, 23 April 2020 (UTC)