SearcharxivSearch

arXiv subjects

Kenneth Allen

Publications and source records attributed to Kenneth Allen.

3 recordsLinked to original sources

Maximal Volume Matrix Cross Approximation for Image Compression and Least Squares Solution

We study the classic matrix cross approximation based on the maximal volume submatrices. Our main results consist of an improvement of the classic estimate for matrix cross approximation and a greedy approach for finding the maximal volume submatrices. More precisely, we present a new proof of the classic estimate of the inequality with an improved constant. Also, we present a family of greedy maximal volume algorithms to improve the computational efficiency of matrix cross approximation. The proposed algorithms are shown to have theoretical guarantees of convergence. Finally, we present two applications: image compression and the least squares approximation of continuous functions. Our numerical results at the end of the paper demonstrate the effective performance of our approach.

math.NA

Level set methods for gradient-free optimization of metasurface arrays

Global optimization techniques are increasingly preferred over human-driven methods in the design of electromagnetic structures such as metasurfaces, and careful construction and parameterization of the physical structure is critical in ensuring computational efficiency and convergence of the optimization algorithm to a globally optimal solution. While many design variables in physical systems take discrete values, optimization algorithms often benefit from a continuous design space. This work demonstrates the use of level set functions as a continuous basis for designing material distributions for metasurface arrays and introduces an improved parameterization which is termed the periodic level set function. We explore the use of alternate norms in the definition of the level set function and define a new pseudo-inverse technique for upsampling basis coefficients with these norms. The level set method is compared to the fragmented parameterization and shows improved electromagnetic responses for two dissimilar cost functions: a narrowband objective and a broadband objective. Finally, we manufacture an optimized level set metasurface and measure its scattering parameters to demonstrate real-world performance.

physics.app-ph

Non-Archimedean H\'enon maps, attractors, and horseshoes

We study the dynamics of the H\'enon map defined over complete, locally compact non-Archimedean fields of odd residue characteristic. We establish basic properties of its one-sided and two-sided filled Julia sets, and we determine, for each H\'enon map, whether these sets are empty or nonempty, whether they are bounded or unbounded, and whether they are equal to the unit ball or not. On a certain region of the parameter space we show that the filled Julia set is an attractor. We prove that, for infinitely many distinct H\'enon maps over ${\mathbb Q}_3$, this attractor is infinite and supports an SRB-type measure describing the distribution of all nearby forward orbits. We include some numerical calculations which suggest the existence of such infinite attractors over ${\mathbb Q}_5$ and ${\mathbb Q}_7$ as well. On a different region of the parameter space, we show that the H\'enon map is topologically conjugate on its filled Julia set to the two-sided shift map on the space of bisequences in two symbols.

math.NT