Computational Performance of MATLAB and Python for Electromagnetic Applications

2021 ◽  
Vol 35 (11) ◽  
pp. 1394-1395
Author(s):  
Alec Weiss ◽  
Atef Elsherbeni
Keyword(s):  
Angle Of Arrival ◽  
Computationally Efficient ◽  
Scripting Languages ◽  
Electromagnetic Problems ◽  
Computational Performance ◽  
Realistic Problem ◽  
Mathematical Operations

MATLAB and Python are two commonly used scripting languages for prototyping electromagnetic problems today. Each of these languages provides access to computationally efficient functions allowing a user to easily run many math heavy problems with minimal programming. In this paper we will discuss the usage of MATLAB and a variety of libraries in Python capable of running these efficient computations. Tests will be run in both languages to compare both CPU and GPU computations. The runtimes of a variety of problems using each of these platforms will also be compared for a variety of mathematical operations typically used in electromagnetic problems. Finally, a simple angle of arrival calculation using conventional beamforming will be performed to show these speeds on a realistic problem.

Modeling of Fluid Interaction Produced by Water Hammer

2011 ◽  
Vol 1 (1) ◽  
pp. 29-41 ◽  
Author(s):  
Kaveh Hariri Asli ◽  
Faig Bakhman Ogli Naghiyev ◽  
Soltan Ali Ogli Aliyev ◽  
Hoosein Hariri Asli
Keyword(s):  
Method Of Characteristics ◽  
Transient Flow ◽  
Practical Investigations ◽  
Computationally Efficient ◽  
Hydraulic Simulation ◽  
Computational Performance ◽  
Difference Form ◽  
Large Water ◽  
Water Transmission ◽  
Fluid Interaction

This paper compares the computational performance of two numerical methods for two models of Transient Flow. One model was defined by method of the Eulerian based expressed in a method of characteristics “MOC”, finite difference form. The other model was defined by method of Regression. Each method was encoded into an existing hydraulic simulation model. Results indicated that the accuracy of the methods was comparable but that the “MOC” was more computationally efficient for analysis of large water transmission line. Practical investigations in this article have shown mainly this tendency.

scholarly journals Computationally-Efficient Distributed Algorithms of Navigation of Teams of Autonomous UAVs for 3D Coverage and Flocking

Drones ◽  
2021 ◽  
Vol 5 (4) ◽  
pp. 124
Author(s):  
Taha Elmokadem ◽  
Andrey V. Savkin
Keyword(s):  
Obstacle Avoidance ◽  
Precision Agriculture ◽  
Control Strategies ◽  
Autonomous Underwater Vehicles ◽  
Three Dimensional ◽  
Problem Formulation ◽  
Computationally Efficient ◽  
Control Approach ◽  
Computational Performance ◽  
Coverage Problems

This paper proposes novel distributed control methods to address coverage and flocking problems in three-dimensional (3D) environments using multiple unmanned aerial vehicles (UAVs). Two classes of coverage problems are considered in this work, namely barrier and sweep problems. Additionally, the approach is also applied to general 3D flocking problems for advanced swarm behavior. The proposed control strategies adopt a region-based control approach based on Voronoi partitions to ensure collision-free self-deployment and coordinated movement of all vehicles within a 3D region. It provides robustness for the multi-vehicle system against vehicles’ failure. It is also computationally-efficient to ensure scalability, and it handles obstacle avoidance on a higher level to avoid conflicts in control with the inter-vehicle collision avoidance objective. The problem formulation is rather general considering mobile robots navigating in 3D spaces, which makes the proposed approach applicable to different UAV types and autonomous underwater vehicles (AUVs). However, implementation details have also been shown considering quadrotor-type UAVs for an example application in precision agriculture. Validation of the proposed methods have been performed using several simulations considering different simulation platforms such as MATLAB and Gazebo. Software-in-the-loop simulations were carried out to asses the real-time computational performance of the methods showing the actual implementation with quadrotors using C++ and the Robot Operating System (ROS) framework. Good results were obtained validating the performance of the suggested methods for coverage and flocking scenarios in 3D using systems with different sizes up to 100 vehicles. Some scenarios considering obstacle avoidance and robustness against vehicles’ failure were also used.

Modeling of Fluid Interaction Produced by Water Hammer

2013 ◽  
pp. 27-39
Author(s):  
Kaveh Hariri Asli ◽  
Faig Bakhman Ogli Naghiyev ◽  
Soltan Ali Ogli Aliyev ◽  
Hoosein Hariri Asli
Keyword(s):  
Transient Flow ◽  
Practical Investigations ◽  
The Other ◽  
Computationally Efficient ◽  
Hydraulic Simulation ◽  
Computational Performance ◽  
Difference Form ◽  
Large Water ◽  
Water Transmission ◽  
Fluid Interaction

This paper compares the computational performance of two numerical methods for two models of Transient Flow. One model was defined by method of the Eulerian based expressed in a method of characteristics “MOC”, finite difference form. The other model was defined by method of Regression. Each method was encoded into an existing hydraulic simulation model. Results indicated that the accuracy of the methods was comparable but that the “MOC” was more computationally efficient for analysis of large water transmission line. Practical investigations in this article have shown mainly this tendency.

scholarly journals Multi-Target Localization Based on Unidentified Multiple RSS/AOA Measurements in Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (13) ◽  
pp. 4455
Author(s):  
Seyoung Kang ◽  
Taehyun Kim ◽  
Wonzoo Chung
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Complexity Analysis ◽  
Target Localization ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Angle Of Arrival ◽  
Computationally Efficient ◽  
Localization Algorithms ◽  
Single Target

All existing hybrid target localization algorithms using received signal strength (RSS) and angle of arrival (AOA) measurements in wireless sensor networks, to the best of our knowledge, assume a single target such that even in the presence of multiple targets, the target localization problem is translated to multiple single-target localization problems by assuming that multiple measurements in a node are identified with their originated targets. Herein, we first consider the problem of multi-target localization when each anchor node contains multiple RSS and AOA measurement sets of unidentified origin. We propose a computationally efficient method to cluster RSS/AOA measurement sets that originate from the same target and apply the existing single-target linear hybrid localization algorithm to estimate multiple target positions. The complexity analysis of the proposed algorithm is presented, and its performance under various noise environments is analyzed via simulations.

scholarly journals MLPF: efficient machine-learned particle-flow reconstruction using graph neural networks

2021 ◽  
Vol 81 (5) ◽  
Author(s):  
Joosep Pata ◽  
Javier Duarte ◽  
Jean-Roch Vlimant ◽  
Maurizio Pierini ◽  
Maria Spiropulu
Keyword(s):  
Heterogeneous Computing ◽  
Particle Flow ◽  
High Luminosity ◽  
Computationally Efficient ◽  
Proton Proton ◽  
Detector Resolution ◽  
Rule Based ◽  
Computational Performance ◽  
Flow Reconstruction ◽  
Flow Algorithm

AbstractIn general-purpose particle detectors, the particle-flow algorithm may be used to reconstruct a comprehensive particle-level view of the event by combining information from the calorimeters and the trackers, significantly improving the detector resolution for jets and the missing transverse momentum. In view of the planned high-luminosity upgrade of the CERN Large Hadron Collider (LHC), it is necessary to revisit existing reconstruction algorithms and ensure that both the physics and computational performance are sufficient in an environment with many simultaneous proton–proton interactions (pileup). Machine learning may offer a prospect for computationally efficient event reconstruction that is well-suited to heterogeneous computing platforms, while significantly improving the reconstruction quality over rule-based algorithms for granular detectors. We introduce MLPF, a novel, end-to-end trainable, machine-learned particle-flow algorithm based on parallelizable, computationally efficient, and scalable graph neural network optimized using a multi-task objective on simulated events. We report the physics and computational performance of the MLPF algorithm on a Monte Carlo dataset of top quark–antiquark pairs produced in proton–proton collisions in conditions similar to those expected for the high-luminosity LHC. The MLPF algorithm improves the physics response with respect to a rule-based benchmark algorithm and demonstrates computationally scalable particle-flow reconstruction in a high-pileup environment.

Analysis of an Oscillating Airfoil in a Power-Extraction Regime Based on the Compressible Navier-Stokes Equations With Low-Speed Preconditioning

2012 ◽  
Author(s):  
M. Sergio Campobasso ◽  
Jernej Drofelnik
Keyword(s):  
Stokes Equations ◽  
Unsteady Aerodynamics ◽  
Navier Stokes ◽  
Navier Stokes Equations ◽  
Flow Solver ◽  
Low Speed ◽  
Power Extraction ◽  
Computational Performance ◽  
Realistic Problem ◽  
The Relationship

A wing that is simultaneously heaving and pitching may extract energy from an oncoming air flow. The relationship between the aerodynamics and the theoretical performance of this device is here investigated by means of time-dependent laminar flow simulations performed with a research compressible Navier-Stokes solver. The presented analyses confirm the findings of other studies that the efficiency of the power extraction of this device can reach 34%, due to the favourable effects of a strong dynamic stall. In view of aeroacoustic applications, the developed flow solver uses the compressible Navier-Stokes equations with carefully optimized low-speed preconditioning. To demonstrate the modeling capabilities and the high computational performance of this approach, the unsteady aerodynamics of the energy-extracting device is simulated by using a computationally challenging freestream Mach number of 0.001. A fundamental element of novelty of this study is a thorough assessment of the proposed approach partly based on the challenging and realistic problem associated with the oscillating wing device.

scholarly journals A new computational algorithm for the solution of second order initial value problems in ordinary differential equations

2018 ◽  
Vol 3 (1) ◽  
pp. 167-174 ◽  
Author(s):  
P.K. Pandey
Keyword(s):  
Differential Equations ◽  
Ordinary Differential Equations ◽  
Initial Value Problems ◽  
Computational Algorithm ◽  
Second Order ◽  
Computational Method ◽  
Computationally Efficient ◽  
Initial Value ◽  
Computational Performance ◽  
Non Linear

AbstractIn this article, we propose a new computational method for second order initial value problems in ordinary differential equations. The algorithm developed is based on a local representation of theoretical solution of the second order initial value problem by a non-linear interpolating function. Numerical examples are solved to ensure the computational performance of the algorithm for both linear and non-linear initial value problems. From the results we obtained, the algorithm can be said computationally efficient and effective.

Efficient Direct Differentiation Sensitivity Analysis for General Multi-Rigid-Body Dynamic Systems

2001 ◽  
Author(s):  
Yuhung Hsu ◽  
Kurt S. Anderson
Keyword(s):  
Sensitivity Analysis ◽  
Rigid Body ◽  
Design Optimization ◽  
Dynamic Systems ◽  
Computationally Efficient ◽  
Rigid Body Dynamic ◽  
Direct Differentiation ◽  
Computational Performance ◽  
Analysis Scheme ◽  
Body Dynamic

Abstract Sensitivity analysis plays an important role in modern engineering applications where design optimization is desired. A computationally efficient sensitivity analysis scheme is presented in this paper in an effort to facilitate design optimization as it pertains to general, complex multi-rigid-body dynamic systems. Based on the underlying velocity space projection, state space formulation, and direct differentiation approach, the first-order sensitivity information can be efficiently determined in a fully recursive manner for general multi-rigid-body dynamic systems involving an arbitrary number of closed loops. The overall computational expense of this method is bilinear in the number of design variables and the number of system generalized coordinates. The solution accuracy and the computational performance are demonstrated by several numerical examples.

scholarly journals A Multiscale Model of Terrain Dynamics for Real-Time Earthmoving Simulation

2020 ◽  
Author(s):  
Martin Servin ◽  
Tomas Berglund ◽  
Samuel Nystedt
Keyword(s):  
Real Time ◽  
Multibody Dynamics ◽  
Reference Model ◽  
Multiscale Model ◽  
Particle Model ◽  
Model Parameters ◽  
Computationally Efficient ◽  
Computational Performance ◽  
Wide Range ◽  
Dynamics Simulations

Abstract A multiscale model for real-time simulation of terrain dynamics is explored. To represent the dynamics on different scales the model combines the description of soil as a continuous solid, as distinct particles and as rigid multibodies. The models are dynamically coupled to each other and to the earthmoving equipment. Agitated soil is represented by a hybrid of contacting particles and continuum solid, with the moving equipment and resting soil as geometric boundaries. Each zone of active soil is aggregated into distinct bodies, with the proper mass, momentum and frictional-cohesive properties, which constrain the equipment's multibody dynamics. The particle model parameters are pre-calibrated to the bulk mechanical parameters for a wide range of different soils. The result is a computationally efficient model for earthmoving operations that resolve the motion of the soil, using a fast iterative solver, and provide realistic forces and dynamic for the equipment, using a direct solver for high numerical precision. Numerical simulations of excavation and bulldozing operations are performed to validate model and measure the computational performance. Reference data is produced using coupled discrete element and multibody dynamics simulations at relatively high resolution. The digging resistance and soil displacements with the real-time multiscale model agree with the reference model up to 10-25%, and run more than three orders in magnitude faster.

Sign in / Sign up

Export Citation Format

Share Document