Abstract
Fast algorithms for computing the linear least-squares estimate of a three-dimensional random field from noisy observations inside a sphere are derived. The algorithms can be viewed as generalized split Levinson and fast Cholesky algorithms, since they exploit the (assumed) Toeplitz structure of the double Radon transform of the random field covariance, and therefore they require fewer computations than would solution of the multidimensional Wiener-Hopf equation. Unlike previous generalized Levinson algorithms, no quarter-plane or asymmetric half-plane support assumptions for the filter are necessary; nor is the multidimensional filtering problem treated as a multichannel (vector) filtering problem. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
