Calculation of oblate spheroidal wave functions with complex argument

Arnie L. Van Buren

Home/Archive/arXiv

arXiv · 2009.01618

Calculation of oblate spheroidal wave functions with complex argument

Arnie L. Van Buren

View original source ↗Read source document ↗Export metadata ↓

Abstract

A previous article showed that alternative expressions for calculating oblate spheroidal radial functions of both kinds can provide accurate values over very large parameter ranges using double precision arithmetic, even where the traditional expressions fail. The size parameter c was assumed real. This paper considers the case where c = cr + ici is complex with an imaginary part ci often used to represent losses in wave behavior. The methods for c real modified to complex arithmetic work reasonably well as long as ci is very small. This paper describes the substantial changes necessary to obtain useful results for larger values of ci. It shows that accurate eigenvalues can usually be obtained even though the matrix methods used to obtain them for c real provide increasingly inaccurate values, primarily for those with relatively small magnitude, as ci increases. It also shows that some of the eigenvalues can be prolate-like with values that are well approximated using asymptotic estimates for prolate eigenvalues where c is replaced with -ic. A method to order the eigenvalues is presented. The modifications necessary to compute accurately the radial and angular functions for complex c are discussed. A resulting Fortran program coblfcn provides useful function values for a reasonably wide range of c, the order m, and the radial coordinate when using double precision arithmetic. The results can be improved by using quadruple precision for the Bouwkamp procedure to ensure accurate double precision eigenvalues. Further improvement is obtained using full quadruple precision. Coblfcn is freely available at www.mathieuandspheroidalwavefunctions.com

Explore related subjects

math.NA cs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Arnie L. Van Buren. 2020-08-31. Calculation of oblate spheroidal wave functions with complex argument. https://arxiv.org/abs/2009.01618

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗

arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗

arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗