Abstract

The Gaussian matrix is a symmetric Toeplitz matrix and in addition the elements in its first row form a pattern. This enables a specific formula to be obtained, in the nonsingular case, for the elements in the first row of the inverse. Recurrence formulae are then obtained which enable this inverse to be obtained in $\frac{1} {2}n^2 $ flops, as against $2n^2 $ flops, for a general symmetric Toeplitz matrix using the Trench algorithm.

Full Text
Paper version not known

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 call

Disclaimer: 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.