/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

nhigham.com
| | fabricebaudoin.blog

In this section, we consider a diffusion operator $latex L=\sum_{i,j=1}^n \sigma_{ij} (x) \frac{\partial^2}{ \partial x_i \partial x_j} +\sum_{i=1}^n b_i (x)\frac{\partial}{\partial x_i}, $ where $latex b_i$ and $latex \sigma_{ij}$ are continuous functions on $latex \mathbb{R}^n$ and for every $latex x \in \mathbb{R}^n$, the matrix $latex (\sigma_{ij}(x))_{1\le i,j\le n}$ is a symmetric and non negative matrix. Our...
2.3 parsecs

Travel
| |
| | www.jeremykun.com

For fixed integers $ r > 0$, and odd $ g$, a Moore graph is an $ r$-regular graph of girth $ g$ which has the minimum number of vertices $ n$ among all such graphs with the same regularity and girth. (Recall, A the girth of a graph is the length of its shortest cycle, and it's regular if all its vertices have the same degree) Problem (Hoffman-Singleton): Find a useful constraint on the relationship between $ n$ and $ r$ for Moore graphs of girth $ 5$ and degree $ r$.
2.1 parsecs

Travel
| |
| | drorspei.com

In signal processing it is often that we need to compare two finite impulse responses (FIR). It is also often that we don't care to know the difference between two FIRs outside a specific frequency band, and only care about the difference within that band. Given the difference FIR $latex p$, given as $latex n+1$...
2.2 parsecs

Travel
| |
| | www.interviewbit.com

Explore our top 9 best data science courses online for 2024. Find the right course to boost your career in data science, from beginner to advanced levels.
16.6 parsecs

Travel
|