# Tagged Questions

A high-dimensionality space is one that can only be spanned by a basis set with a large number of elements. High-dimensional problems often suffer from the *Curse of Dimensionality*, which is exponential growth in the problem size as a function of the number of dimensions.

112 views

### most efficient way to calculate eigen states of a 2D or 3D potential (Matlab)

I know of several ways to calculated the eigen states of 1D potentials (i.e. DVR, Crank–Nicolson, etc). However I wonder what is the most efficient way to do the same for a N-Dimensional potential? ...
244 views

### Dimensionality reduction of the domain of f(x)

I'm wondering if there is something analogous to a PCA for data sets where there is a dependent variable. (Though I am interested in any method of dimensionality reduction, PCA is just an example.) ...
225 views

### What is the current state of the art in solving higher dimensional parabolic PDEs (multi-electron Schrödinger equation)

What is the current state of the art for solving higher dimensional (3-10) parabolic PDEs in the complex domain with simple poles (of the form $\frac{1}{|\vec{r}_1 - \vec{r}_2|}$) and absorbing ...
171 views

### K-nearest neighbours search in subspaces of a high-dimensional space

I'm looking for a good way to partition a large, fairly high-dimensional dataset in order to perform fast kNN searches not just in the full $N$-dimensional space, but also in lower-dimensional ...
308 views

### Best incremental multidimensional Delaunay tessellation algorithm

I'm looking for a specific type of Delaunay tessellation algorithm. The algorithm should be: incremental so that I can add new sites inside known simplexes (i.e. no searching for the right simplex ...
506 views

### Multivariate Orthogonal Polynomial Generation

I'm trying to apply the stochastic galerkin method to partial differential equation with multiple uniform random coefficients. I'm puzzled as to how to extend the corresponding orthogonal (legendre) ...
194 views

### Is there an Implementation of the Hilbert curve from $[0,1]$ to $[0,1]^n$, where $n$ is large? ($n=10,000$, say)

I would like to map each point in $[0,1]$ to $[0,1]^n$ with a Hilbert curve, where $n=10,000$. That is $$f: [0,1] \to [0,1]^n,$$ is the $n$-dimensional Hilbert curve. I found the library of Cortesi,...