Brad Osgood
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Brad Osgood has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Martin Chuaqui
Pontificia Universidad Católica de Chile
11 shared publications - Peter Duren
University of Michigan
11 shared publications M. Chuaqui
P. Universidad Católica de Chile
4 shared publications- Aditya Siripuram
Indian Institute of Technology Hyderabad, Hyderabad, India
3 shared publications - Martin Chuaqui
Facultad de Matemáticas, Pontificia Universidad Católica de Chile, Santiago, Chile
3 shared publications - Aditya Siripuram
Department of Electrical Engineering Department of Electrical Engineering Indian Institute of Technology Hyderabad Indian Institute of Technology Hyderabad
1 shared publication
Latest Publications
- Open Access
- 24 March 2025
- Published by Springer Nature in Computational Methods and Function Theory
- Vol. 25 (1) , 9-11
Peter Larkin Duren 1935–2020
- 24 March 2025
- Published by Springer Nature in Computational Methods and Function Theory
- Vol. 25 (1) , 9-11
Open AccessPeter Larkin Duren 1935–2020
- Open Access
Numerical Stability of DFT Computation for Signals with Structured Support
We consider the problem of building numerically stable algorithms for computing Discrete Fourier Transform (DFT) of $N$- length signals with known frequency support of size $k$. A typical algorithm, in this case, would involve solving (possibly poorly conditioned) system of equations, causing numerical instability. When $N$ is a power of 2, and the frequency support is a random subset of $\mathbb{Z}_N$, we provide an algorithm that has (a possibly optimal) $O(k \log k)$ complexity to compute the DFT while solving system of equations that are $O(1)$ in size.Open AccessNumerical Stability of DFT Computation for Signals with Structured Support
We consider the problem of building numerically stable algorithms for computing Discrete Fourier Transform (DFT) of $N$- length signals with known frequency support of size $k$. A typical algorithm, in this case, would involve solving (possibly poorly conditioned) system of equations, causing numerical instability. When $N$ is a power of 2, and the frequency support is a random subset of $\mathbb{Z}_N$, we provide an algorithm that has (a possibly optimal) $O(k \log k)$ complexity to compute the DFT while solving system of equations that are $O(1)$ in size. - 12 December 2023
- Published by Springer Nature in Computational Methods and Function Theory
- Vol. 25 (1) , 139-149
Best Möbius Approximations of Convex and Concave Mappings
- 12 December 2023
- Published by Springer Nature in Computational Methods and Function Theory
- Vol. 25 (1) , 139-149
Best Möbius Approximations of Convex and Concave Mappings
- 3 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (2) , 1498-1524
Fast DFT Computation for Signals With Structured Support
Suppose an $N-$ length signal has known frequency support of size $k$ . Given access to samples of this signal, how fast can we compute the DFT? The answer to this question depends on the structure of the frequency support. We first identify some frequency supports for which (an ideal) $O(k \log k)$ complexity can be achieved, which we refer to as homogeneous sets. We give a generalization of the radix-2 FFT that enables $O(k\log k)$ computation of signals with homogeneous frequency support. We use homogeneous sets as building blocks to construct more complex support structures for which the complexity of $O(k\log k)$ is achievable. Applying these ideas, we present an $O(k\log ^{2}k)$ algorithm for computing the DFT of signals whose frequency support is additively structured. We also present partial converses.
- 3 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (2) , 1498-1524
Fast DFT Computation for Signals With Structured Support
Suppose an $N-$ length signal has known frequency support of size $k$ . Given access to samples of this signal, how fast can we compute the DFT? The answer to this question depends on the structure of the frequency support. We first identify some frequency supports for which (an ideal) $O(k \log k)$ complexity can be achieved, which we refer to as homogeneous sets. We give a generalization of the radix-2 FFT that enables $O(k\log k)$ computation of signals with homogeneous frequency support. We use homogeneous sets as building blocks to construct more complex support structures for which the complexity of $O(k\log k)$ is achievable. Applying these ideas, we present an $O(k\log ^{2}k)$ algorithm for computing the DFT of signals whose frequency support is additively structured. We also present partial converses.
- 8 June 2022
- Published by Babes-Bolyai University Cluj-Napoca in Studia Universitatis Babes-Bolyai Matematica
- Vol. 67 (2) , 431-440
On convolution, convex, and starlike mappings
Let C and S stand for the classes of convex and starlike mapping in D, and let co(C), co(S) denote the closures of the respective convex hulls. We derive characterizations for when the convolution of mappings in co(C) is convex, as well as when the convolution of mappings in co(S) is starlike. Several characterizations in terms of convolution are given for convexity within co(C) and for starlikeness within co(S). We also obtain a correspondence via convo- lution between C and S, as well as correspondences between the subclasses of convex and starlike mappings that have n-fold symmetry.
- 8 June 2022
- Published by Babes-Bolyai University Cluj-Napoca in Studia Universitatis Babes-Bolyai Matematica
- Vol. 67 (2) , 431-440
On convolution, convex, and starlike mappings
Let C and S stand for the classes of convex and starlike mapping in D, and let co(C), co(S) denote the closures of the respective convex hulls. We derive characterizations for when the convolution of mappings in co(C) is convex, as well as when the convolution of mappings in co(S) is starlike. Several characterizations in terms of convolution are given for convexity within co(C) and for starlikeness within co(S). We also obtain a correspondence via convo- lution between C and S, as well as correspondences between the subclasses of convex and starlike mappings that have n-fold symmetry.
- 12 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 4773-4781
Convolution Idempotents With a Given Zero-Set
We investigate the structure of N-length discrete signals h satisfying h*h=h that vanish on a given set of indices. We motivate this problem from examples in sampling, Fuglede's conjecture, and orthogonal interpolation of bandlimited signals. When $N = p^M$ is a prime power, we characterize all such h in terms of base-p expansions of nonzero indices in the Discrete Fourier transform of h.- 12 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 4773-4781
Convolution Idempotents With a Given Zero-Set
We investigate the structure of N-length discrete signals h satisfying h*h=h that vanish on a given set of indices. We motivate this problem from examples in sampling, Fuglede's conjecture, and orthogonal interpolation of bandlimited signals. When $N = p^M$ is a prime power, we characterize all such h in terms of base-p expansions of nonzero indices in the Discrete Fourier transform of h.- 12 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (12) , 8119-8130
Discrete Sampling: A Graph Theoretic Approach to Orthogonal Interpolation
We study the problem of finding unitary submatrices of the N × N discrete Fourier transform matrix, in the context of interpolating a discrete bandlimited signal using an orthogonal basis. This problem is related to a diverse set of questions on idempotents on ZN and tiling ZN. In this work, we establish a graph-theoretic approach and connections to the problem of finding maximum cliques. We identify the key properties of these graphs that make the interpolation problem tractable when N is a prime power, and we identify the challenges in generalizing to arbitrary N. Finally, we investigate some connections between graph properties and the spectral-tile direction of the Fuglede conjecture.
- 12 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (12) , 8119-8130
Discrete Sampling: A Graph Theoretic Approach to Orthogonal Interpolation
We study the problem of finding unitary submatrices of the N × N discrete Fourier transform matrix, in the context of interpolating a discrete bandlimited signal using an orthogonal basis. This problem is related to a diverse set of questions on idempotents on ZN and tiling ZN. In this work, we establish a graph-theoretic approach and connections to the problem of finding maximum cliques. We identify the key properties of these graphs that make the interpolation problem tractable when N is a prime power, and we identify the challenges in generalizing to arbitrary N. Finally, we investigate some connections between graph properties and the spectral-tile direction of the Fuglede conjecture.
- Open Access
On convex mappings
We establish a new characterization for a conformal mapping of the unit disk $\mathbb{D}$ to be convex, and identify the mappings onto a half-plane or a parallel strip as extremals. We also show that, with these exceptions, the level sets of $\lambda$ of the Poincar\'e metric $\lambda|dw|$ of a convex domain are strictly convex.Open AccessOn convex mappings
We establish a new characterization for a conformal mapping of the unit disk $\mathbb{D}$ to be convex, and identify the mappings onto a half-plane or a parallel strip as extremals. We also show that, with these exceptions, the level sets of $\lambda$ of the Poincar\'e metric $\lambda|dw|$ of a convex domain are strictly convex. - 1 June 2018
- Published by Springer Nature in Journal d'Analyse Mathématique
- Vol. 135 (2) , 487-526
Quasiconformal extensions to space of Weierstrass-Enneper lifts
- 1 June 2018
- Published by Springer Nature in Journal d'Analyse Mathématique
- Vol. 135 (2) , 487-526
Quasiconformal extensions to space of Weierstrass-Enneper lifts
- Open Access
Quasiconformal Extensions to Space of Weierstrass-Enneper Lifts
We derive a quasiconformal extension to 3-space of the Weierstrass-Enneper lifts of a class of harmonic mappings defined in the unit disk. The extension is based on fibrations of space by circles in domain and image that correspond to each other in a natural way. Convexity plays an essential role in the analysis. As a corollary we derive a sufficient condition for the underlying harmonic mapping to be univalent in the disk, with an explicit quasiconformal extension to the extended plane that generalizes the well known formula by Ahlfors-Weill.
Open AccessQuasiconformal Extensions to Space of Weierstrass-Enneper Lifts
We derive a quasiconformal extension to 3-space of the Weierstrass-Enneper lifts of a class of harmonic mappings defined in the unit disk. The extension is based on fibrations of space by circles in domain and image that correspond to each other in a natural way. Convexity plays an essential role in the analysis. As a corollary we derive a sufficient condition for the underlying harmonic mapping to be univalent in the disk, with an explicit quasiconformal extension to the extended plane that generalizes the well known formula by Ahlfors-Weill.