Abstract

A unified discussion of least p th approximation as it relates to optimal computer-aided design of networks and systems is presented. General objective functions are proposed and their properties discussed. The main result is that a wider variety of design problems and a wider range of specifications than appear to have been considered previously from the least pth point of view should now be tractable.

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.