Richard Mikael Slevinsky
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Richard Mikael Slevinsky has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Hassan Safouhi
University of Alberta
3 shared publications - Sheehan Olver
Department of Mathematics, Imperial College, London, UK
3 shared publications - Qiang Du
Department of Applied Physics and Applied Mathematics, and Data Science Institute, Columbia University, New York, NY 10027 USA
2 shared publications - Alex Townsend
Department of Mathematics, Cornell University, Ithaca, USA
1 shared publication - Brock Klippenstein
Department of Mathematics, University of Manitoba, Winnipeg, Canada
1 shared publication Hadrien Montanelli
Department of Applied Physics and Applied Mathematics Columbia University New York United States
1 shared publication
Latest Publications
- Open Access
Nonlocal vector calculus on the sphere
We introduce a nonlocal vector calculus on the unit two-sphere using weakly singular integral operators. Within this framework, the operators are diagonalizable in terms of scalar and vector spherical harmonics, a property that facilitates the proof of a nonlocal Stokes theorem. This constitutes the first instance of such a theorem on a curved surface. Furthermore, our analysis demonstrates the strong convergence of these nonlocal operators to the classical differential operators of vector calculus as the interaction range tends to zero.
Open AccessNonlocal vector calculus on the sphere
We introduce a nonlocal vector calculus on the unit two-sphere using weakly singular integral operators. Within this framework, the operators are diagonalizable in terms of scalar and vector spherical harmonics, a property that facilitates the proof of a nonlocal Stokes theorem. This constitutes the first instance of such a theorem on a curved surface. Furthermore, our analysis demonstrates the strong convergence of these nonlocal operators to the classical differential operators of vector calculus as the interaction range tends to zero.
- 13 January 2025
- Published by Springer Nature in Integral Equations and Operator Theory
- Vol. 97 (1) , 1-26
Lifting Sylvester Equations: Singular Value Decay for Non-Normal Coefficients
- 13 January 2025
- Published by Springer Nature in Integral Equations and Operator Theory
- Vol. 97 (1) , 1-26
Lifting Sylvester Equations: Singular Value Decay for Non-Normal Coefficients
- Open Access
Fast measure modification of orthogonal polynomials via matrices with displacement structure
It is well known that matrices with low Hessenberg-structured displacement rank enjoy fast algorithms for certain matrix factorizations. We show how $n\times n$ principal finite sections of the Gram matrix for the orthogonal polynomial measure modification problem has such a displacement structure, unlocking a collection of fast algorithms for computing connection coefficients (as the upper-triangular Cholesky factor) between a known orthogonal polynomial family and the modified family. In general, the ${\cal O}(n^3)$ complexity is reduced to ${\cal O}(n^2)$, and if the symmetric Gram matrix has upper and lower bandwidth b, then the ${\cal O}(b^2n)$ complexity for a banded Cholesky factorization is reduced to ${\cal O}(b n)$. In the case of modified Chebyshev polynomials, we show that the Gram matrix is a symmetric Toeplitz-plus-Hankel matrix, and if the modified Chebyshev moments decay algebraically, then a hierarchical off-diagonal low-rank structure is observed in the Gram matrix, enabling a further reduction in the complexity of an approximate Cholesky factorization powered by randomized numerical linear algebra.Open AccessFast measure modification of orthogonal polynomials via matrices with displacement structure
It is well known that matrices with low Hessenberg-structured displacement rank enjoy fast algorithms for certain matrix factorizations. We show how $n\times n$ principal finite sections of the Gram matrix for the orthogonal polynomial measure modification problem has such a displacement structure, unlocking a collection of fast algorithms for computing connection coefficients (as the upper-triangular Cholesky factor) between a known orthogonal polynomial family and the modified family. In general, the ${\cal O}(n^3)$ complexity is reduced to ${\cal O}(n^2)$, and if the symmetric Gram matrix has upper and lower bandwidth b, then the ${\cal O}(b^2n)$ complexity for a banded Cholesky factorization is reduced to ${\cal O}(b n)$. In the case of modified Chebyshev polynomials, we show that the Gram matrix is a symmetric Toeplitz-plus-Hankel matrix, and if the modified Chebyshev moments decay algebraically, then a hierarchical off-diagonal low-rank structure is observed in the Gram matrix, enabling a further reduction in the complexity of an approximate Cholesky factorization powered by randomized numerical linear algebra. - Open Access
- 5 August 2024
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 25 (5) , 1463-1505
Polynomial and Rational Measure Modifications of Orthogonal Polynomials via Infinite-Dimensional Banded Matrix Factorizations
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via infinite-dimensional banded matrix factorizations and may be used to compute the modified Jacobi matrices all in linear complexity with respect to the truncation degree. A family of orthogonal polynomials with modified classical weights is constructed that support banded differentiation matrices, enabling sparse spectral methods with modified classical orthogonal polynomials. We present several applications and numerical experiments using an open source implementation which make direct use of these results.
- 5 August 2024
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 25 (5) , 1463-1505
Open AccessPolynomial and Rational Measure Modifications of Orthogonal Polynomials via Infinite-Dimensional Banded Matrix Factorizations
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via infinite-dimensional banded matrix factorizations and may be used to compute the modified Jacobi matrices all in linear complexity with respect to the truncation degree. A family of orthogonal polynomials with modified classical weights is constructed that support banded differentiation matrices, enabling sparse spectral methods with modified classical orthogonal polynomials. We present several applications and numerical experiments using an open source implementation which make direct use of these results.
- 28 March 2024
- Published by Springer Nature in Numerical Algorithms
- Vol. 98 (2) , 587-624
Fast and stable rational approximation of generalized hypergeometric functions
- 28 March 2024
- Published by Springer Nature in Numerical Algorithms
- Vol. 98 (2) , 587-624
Fast and stable rational approximation of generalized hypergeometric functions
- Open Access
Polynomial and rational measure modifications of orthogonal polynomials via infinite-dimensional banded matrix factorizations
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via infinite-dimensional banded matrix factorizations and may be used to compute the modified Jacobi matrices all in linear complexity with respect to the truncation degree. A family of orthogonal polynomials with modified classical weights is constructed that support banded differentiation matrices, enabling sparse spectral methods with modified classical orthogonal polynomials.
Open AccessPolynomial and rational measure modifications of orthogonal polynomials via infinite-dimensional banded matrix factorizations
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via infinite-dimensional banded matrix factorizations and may be used to compute the modified Jacobi matrices all in linear complexity with respect to the truncation degree. A family of orthogonal polynomials with modified classical weights is constructed that support banded differentiation matrices, enabling sparse spectral methods with modified classical orthogonal polynomials.
- Open Access
Fast and stable rational approximation of generalized hypergeometric functions
Rational approximations of generalized hypergeometric functions ${}_pF_q$ of type $(n+k,k)$ are constructed by the Drummond and factorial Levin-type sequence transformations. We derive recurrence relations for these rational approximations that require $\mathcal{O}[\max\{p,q\}(n+k)]$ flops. These recurrence relations come in two forms: for the successive numerators and denominators; and, for an auxiliary rational sequence and the rational approximations themselves. Numerical evidence suggests that these recurrence relations are much more stable than the original formulæ~for the Drummond and factorial Levin-type sequence transformations. Theoretical results on the placement of the poles of both transformations confirm the superiority of factorial Levin-type transformation over the Drummond transformation.Open AccessFast and stable rational approximation of generalized hypergeometric functions
Rational approximations of generalized hypergeometric functions ${}_pF_q$ of type $(n+k,k)$ are constructed by the Drummond and factorial Levin-type sequence transformations. We derive recurrence relations for these rational approximations that require $\mathcal{O}[\max\{p,q\}(n+k)]$ flops. These recurrence relations come in two forms: for the successive numerators and denominators; and, for an auxiliary rational sequence and the rational approximations themselves. Numerical evidence suggests that these recurrence relations are much more stable than the original formulæ~for the Drummond and factorial Levin-type sequence transformations. Theoretical results on the placement of the poles of both transformations confirm the superiority of factorial Levin-type transformation over the Drummond transformation. - 5 November 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 92 (1) , 973-983
A recursive algorithm for an efficient and accurate computation of incomplete Bessel functions
- 5 November 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 92 (1) , 973-983
A recursive algorithm for an efficient and accurate computation of incomplete Bessel functions
- 3 June 2022
- Published by Springer Nature in Journal of Mathematical Chemistry
- Vol. 60 (7) , 1337-1355
Compact formulae for three-center nuclear attraction integrals over exponential type functions
- 3 June 2022
- Published by Springer Nature in Journal of Mathematical Chemistry
- Vol. 60 (7) , 1337-1355
Compact formulae for three-center nuclear attraction integrals over exponential type functions
- Open Access
Compact Formulae for Three-Center Nuclear Attraction Integrals Over Exponential Type Functions
In any ab initio molecular orbital (MO) calculations, the major task involves the computation of the so-called molecular multi-center integrals. Multi-center integral calculations is a very challenging mathematical problem in nature. Quantum mechanics only determines which integrals we evaluate, but the techniques employed for their evaluations are entirely mathematical. The three-center nuclear attraction integrals occur in a very large number even for small molecules and are among of the most difficult molecular integrals to compute efficiently to a high pre-determined accuracy. In the present contribution, we report analytical expressions for the three-center nuclear attraction integrals over exponential type functions. We describe how to compute the formula to obtain an efficient evaluation in double precision arithmetic. This requires the rational minimax approximants that minimize the maximum error on the interval of evaluation. The numerical tests show a substantial gain in efficiency over the state-of-the-art.
Open AccessCompact Formulae for Three-Center Nuclear Attraction Integrals Over Exponential Type Functions
In any ab initio molecular orbital (MO) calculations, the major task involves the computation of the so-called molecular multi-center integrals. Multi-center integral calculations is a very challenging mathematical problem in nature. Quantum mechanics only determines which integrals we evaluate, but the techniques employed for their evaluations are entirely mathematical. The three-center nuclear attraction integrals occur in a very large number even for small molecules and are among of the most difficult molecular integrals to compute efficiently to a high pre-determined accuracy. In the present contribution, we report analytical expressions for the three-center nuclear attraction integrals over exponential type functions. We describe how to compute the formula to obtain an efficient evaluation in double precision arithmetic. This requires the rational minimax approximants that minimize the maximum error on the interval of evaluation. The numerical tests show a substantial gain in efficiency over the state-of-the-art.