The genetic algorithm was used to obtain sparse arrays with 8, 16, 32 and 64 transducers in a possible aperture size of 128 elements. The optimization was made by minimizing a fitness function that takes into account the ...

The analysis of the beampattern is the base of sparse arrays design process. However, in the case of bidimensional arrays, this analysis has a high computational cost, turning the design process into a long and complex ...

The Bochner–Riesz multipliers are shown to satisfy a range of sparse bounds. The range of sparse bounds increases to the optimal range, as δ increases to the critical value, even assuming only partial information on the ...

This paper deals with approaches for sparse matrix substitutions using vector processing. Many publications have used the W-matrix method to solve the forward/backward substitutions on vector computer. Recently a different ...

This paper deals with approaches for sparse matrix substitutions using vector processing. Many publications have used the W-matrix method to solve the forward/backward substitutions on vector computer. Recently a different ...

We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on toric varieties and basic linear algebra; eigenvalues, eigenvectors and coefficient matrices. We adapt Eigenvalue theorem ...

This work provides a guide to design ultrasonic synthetic aperture systems for non-grid two-dimensional sparse arrays such as spirals or annular segmented arrays. It presents an algorithm that identifies which elements ...

Consider the discrete quadratic phase Hilbert Transform acting on $\ell^{2}(\mathbb{Z})$ finitely supported functions $$ H^{\alpha} f(n) : = \sum_{m \neq 0} \frac{e^{i\alpha m^2} f(n - m)}{m}. $$ We prove that, ...