scientific article; zbMATH DE number 3994877
[For the entire collection see Zbl 0607.00009.] Some general purpose linear programming and least squares routines are exploited to obtain best or near-best approximations to real or complex data, and a variety of numerical examples are given. Firstly, a standard least squares method is used, but with heavily weighted zero data imposed at null areas, to steer nulls in non-symmetric antenna array patterns in radar and acoustics. Secondly, an LP algorithm of \textit{F. D. K. Roberts} and \textit{I. Barrodale} [Int. J. Numer. Methods Eng. 15, 797-807 (1980; Zbl 0427.65045)], for minimax approximation with equality and inequality constraints, is used to fit symmetric antenna array patterns while steering nulls and constraining excitation coefficients. Thirdly, the Roberts-Barrodale LP algorithm is used in conjunction with a rational approximation algorithm such as Loeb's algorithm, either to perform simultaneous interpolation and approximation, or to constrain denominator values. The latter type of constraint is seen to have a very significant effect in some cases.
- A cutting plane method for solving minimax problems in the complex plane
- scientific article; zbMATH DE number 3988596 (Why is no real title available?)
- THE USE OF LINEAR PROGRAMMING IN THE DESIGN OF ANTENNA PATTERNS WITH PRESCRIBED NULLS AND OTHER CONSTRAINTS
- scientific article; zbMATH DE number 19438 (Why is no real title available?)
- Approximation algorithms for optimization of real-valued general conjugate complex forms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4721499)