On the Simplification of the Linear Approximation Problem in Hilbert Space with Application to Least Squares
Purchase Print Copy
| Format | List Price | Price | |
|---|---|---|---|
| Add to Cart | Paperback24 pages | $20.00 | $16.00 20% Web Discount |
A method for reducing the order of a matrix inversion required in the linear approximation problem in abstract Hilbert space. The components of the basic vectors of the approximating vectors are identified with the members of an orthonormal sequence in the Hilbert space. Another, less preferred, method of partitioning by block decomposition is briefly presented. Then the preferred method is applied to the problem of the best least-squares approximation to a function x(t) defined over a finite interval under three conditions. In each of these cases, the matrix inverse required is at most of the order of n+1-r.
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.