A general chebyshev complex function approximation procedure and an application to beamforming

Journal of the Acoustical Society of America

Volumn 72, Issue 1, 1982, Pages 181-190

  Streit, R L ^a   Nuttall, A H ^a  

^a NAVAL UNDERSEA WARFARE CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SONAR;

EID: 0020160371     PISSN: 00014966     EISSN: NA     Source Type: Journal    
DOI: 10.1121/1.388002     Document Type: Article

References (12)

1. I. Barrodale and C. Phillips, “Solution of an Overdetermined System of Linear Equations in the Chebyshev Norm,” Algorithm 495, ACM Trans. Math. Software 1, 264-270 (1975).
2. I. Barrodale and C. Phillips, “An Improved Algorithm for Discrete Chebyshev Linear Approximation,” Proceedings of the Fourth Manitoba Conference on Numerical Mathematics, edited by B. L. Hartnell and H. C. Williams (Utilitas Math., 1975).
3. A. H. Nuttall, “Some Windows with Very Good Sidelobe Behavior,” IEEE Trans. Acoust. Speech Signal Process. ASSP-29 (1) (1981).
4. R. L. Streit and A. H. Nuttall, “Linear, Chebyshev Complex Function Approximation,” NUSC Tech. Rep. 6403, Nav. Underwater Syst. Cent., New London, CT (26 February 1981).
5. J. T. Lewis and R. L. Streit, “Real Excitation Coefficients Suffice for Sidelobe Control in a Linear Array,” IEEE Trans. Antennas Propag. (to appear); [also in NUSC Tech. Memo. No. 811114 (17 August, 1981)].
6. G. W. McMahon, B. Hubley, and A. Mohammed, “Design of Optimum Directional Arrays Using Linear Programming Techniques,” J. Acoust. Soc. Am. 51, 304-309 (1972).
7. G. L. Wilson, “Computer Optimization of Transducer-Array Patterns,” J. Acoust. Soc. Am. 59, 195-203 (1976).
8. Barrodale, L. M. Delves, and J. C. Mason, “Linear Chebyshev Approximation of Complex-Valued Functions,” Math. Computation 32, 853-863 (1978).
9. G. Meinardus, Approximation of Functions: Theory and Numerical Methods (Springer-Verlag, New York, 1967), p. 1.
10. I. Barrodale and A. Young, “Algorithms for Best Lx and Lx Linear Approximations on a Discrete Set,” Num. Math. 8, 295-306 (1966).
11. G. B. Dantzig, Linear Programming and Extensions (Princeton U. P., Princeton, NJ, 1963), p. 160.
12. E. H. McCall, “Performance Results of the Simplex Algorithm for a Set of Real-World Linear Programming Models,” Tech. Rep. 80-4, Comput. Sci. Dep., Univ. Minnesota, Minneapolis, MN (January 1980).