Abstract
The role of elementary decision algebra in the broad area of multidimensional problems is given, with emphasis on algorithms and computational simplification. The encouraging fact that several difficult problems can be solved in a finite number of steps via rational operations opens up unlimited scope for research into the search for more efficient algorithms. It is pointed out via a counterexample that the only existing synthesis procedure for arbitrary passive multiports with prescribed multivariable positive real matrices is incorrect. In the process, several links to the study of positivity preserving linear transformations which map square matrices into square matrices are unravelled.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
