#### Filter Results:

- Full text PDF available (23)

#### Publication Year

1968

2017

- This year (2)
- Last 5 years (6)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Gregory Beylkin, Martin J. Mohlenkamp
- Proceedings of the National Academy of Sciences…
- 2002

When an algorithm in dimension one is extended to dimension d, in nearly every case its computational cost is taken to the power d. This fundamental difficulty is the single greatest impediment to solving many important problems and has been dubbed the curse of dimensionality. For numerical analysis in dimension d, we propose to use a representation for… (More)

- Gregory Beylkin, Martin J. Mohlenkamp
- SIAM J. Scientific Computing
- 2005

Nearly every numerical analysis algorithm has computational complexity that scales exponentially in the underlying physical dimension. The separated representation, introduced previously, allows many operations to be performed with scaling that is formally linear in the dimension. In this paper we further develop this representation by (i) discussing the… (More)

Spherical Harmonics arise on the sphere S in the same way that the (Fourier) exponential functions {e}k∈Z arise on the circle. Spherical Harmonic series have many of the same wonderful properties as Fourier series, but have lacked one important thing: a numerically stable fast transform analogous to the Fast Fourier Transform. Without a fast transform,… (More)

We show that the problems of approximating tensors and multivariate functions as a sums of (tensor) products of vectors/functions can be considered in a unified framework, thus exposing their common multilinear structure. We study the alternating least squares algorithm within this framework from the orthogonal projection and gradient perspectives. We then… (More)

- Gregory Beylkin, Nicholas Coult, Martin J. Mohlenkamp
- 1998

We present a fast algorithm for the construction of a spectral projector. This algorithm allows us to compute the density matrix, as used in, e.g., the Kohn–Sham iteration, and so obtain the electron density. We compute the spectral projector by constructing the matrix sign function through a simple polynomial recursion. We present several matrix… (More)

- Gregory Beylkin, Jochen Garcke, Martin J. Mohlenkamp
- SIAM J. Scientific Computing
- 2009

Abstract. We present an algorithm for learning (or estimating) a function of many variables from scattered data. The function is approximated by a sum of separable functions, following the paradigm of separated representations. The central fitting algorithm is linear in both the number of data points and the number of variables, and thus is suitable for… (More)

Modern computers have made commonplace many calculations that were impossible to imagine a few years ago. Still, when you face a problem with a high physical dimension, you immediately encounter the Curse of Dimensionality [1, p.94]. This curse is that the amount of computing power that you need grows exponentially with the dimension. The simplest… (More)

The wavefunction for the multiparticle Schrödinger equation is a function of many variables and satisfies an antisymmetry condition, so it is natural to approximate it as a sum of Slater determinants. Many current methods do so, but they impose additional structural constraints on the determinants, such as orthogonality between orbitals or an excitation… (More)

This pamphlet is intended for the scientist who is considering using Spherical Harmonics for some application. It is designed to introduce the Spherical Harmonics from a theoretical perspective and then discuss those practical issues necessary for their use in applications. I expect great variability in the backgrounds of the readers. In order to be… (More)

- Maŕıa Cristina Pereyra, Martin J. Mohlenkamp
- 2004

These notes were created by Maŕıa Cristina Pereyra for the short course Wavelets: Theory and Applications, at the I Panamerican Advanced Studies Institute in Computational Science and Engineering (PASI), Universidad Nacional de Córdoba, Córdoba, Argentina, June 24–July 5, 2002. They were modified and extended by Martin J. Mohlenkamp for the short course… (More)