instruction stringlengths 43 28.1k |
|---|
Can similarity criterion help reducing calculations in Finite Element Analysis (FEA) problems?
I'm using NX (a thermal and CFD simulation software) to simulate the temperature and fluid field of a LED application.
It takes a long time each time i change something.
I'm wondering if I can reduce the calculations by scali... |
While simulating motion of nonlinear inelastic wire one meets the following equations
\begin{align}
&{\partial^2\varphi\over\partial t^2}=2{\partial F\over\partial s}{\partial\varphi\over\partial s}+F{\partial^2\varphi\over\partial s^2} \\
&{\partial^2F\over\partial s^2}+\left({\partial\varphi\over\partial t}\right)^... |
The tutorial case incompressible/pimpleDyMFoam/movingCone describes a cone moving through a "tube" (if you change the far-field patch into a wall) of constant diameter. This is the most related tutorial case I can think of, since what I want to simulate is the same geometry but with a jump in diameter. If any of the fo... |
I am about to start research for my thesis. I am trying to find public datasets of images mostly dominated by contour meaning (An outline, esp. one representing or bounding the shape or form of something.)
Can anyone suggest any? Or give directions please?
|
I need to solve
\begin{alignat}{1}
& \min_{x}\|Ax - b\|^2_{2}, \\
\mathrm{s.t.} & \quad\sum_{i}x_{i} = 1, \\
& \quad x_{i} \geq 0, \quad \forall{i}.
\end{alignat}
I think it is a quadratic problem which should be solvable with CVXOPT, but I can't work out how.
|
I am trying to solving a poisson equation in structured grid with Geometric Multigrid method. However, when coarsening the fine grid, I simply double the grid spacing at each successive level. That means that the number of points on the finest grid must be a power of 2. This is an undesirable constraint when doing s... |
I have a matrix which is complex symmetric. It is around 50,000 elements per side. It is a Method of Moments matrix. Is it feasible to use a standard direct solver such as Lapack to do a matrix decomposition such as $LU$ or $LDL^T$. I need to solve approximately 7200 right hand side vectors with this matrix, so if I we... |
I am trying to solve the following differential equations on matlab. (They are the equations obtained from the yang-mills-higgs lagrangian for the hoofy polyakov monopole ansatz). This is my function file. I have two variables h and k and their derivatives w.r.t to a variable t. My x(1)=h, x(2)=k, x(3)=dh\dt, x(4)=dk\d... |
On several places I found different claims on a sufficient number of distances to recover relative positions of $n$ points in $d$-dimensional space.
For instance, work from
http://www.dimitris-agrafiotis.com/Papers/jcc20078.pdf
(page 5, right column) claims that only $\left(\frac{n-d/2-1}{d+1}\right)$ distances are suf... |
I have an energy functional that I want to optimize using the calculus of variations. Is there any software package that will do this automatically?
As far as I can tell, Maple and Mathematic have some relevant functionality, and they can generate C code as well. However, I could not find a working example. Are there a... |
I know using topoSet and subsetMesh along the lines of the mesh/moveDynamicMesh/simpleHarmonicMotion tutorial, one can cut holes into a mesh and obtain new patches. How can something similar be achieved with a vanishing hole, i.e. can a set of internal faces be turned into two touching patches with opposite orientation... |
I have a method that is supposed to be second order accurate based on asymptotic analysis/Taylor series expansion which assumes that the solution is smooth. I am solving a PDE which has very rough coefficients (one of them is a step function) and thus the solution of the PDE is not smooth, though it does exist and is u... |
I have experience in coding OpenMP for Shared Memory machines (in both C and FORTRAN) to carry out simple tasks like matrix addition, multiplication etc. (Just to see how it competes with LAPACK). I know OpenMP enough to carry out simple tasks without the need to look at documentation.
Recently, I shifted to Python for... |
I would like to do the analysis for the Crank-Nicolson method on a non-uniform grid for the parabolic equation with variable coefficients. I was able to prove everything for a uniform grid by energy methods for the results of stability, where I have used summation by parts to do estimates. Now that I turn to a non-unif... |
I am looking at the pde of the type $u_t=\mathcal{L}u$ for some elliptic operator $\mathcal{L}$ and on some domain $D$. Assume I am solving that with a finite difference method and want to estimate the error. Thus, I create a mesh over $D$ and compute the error in discrete $L^2$ norm, that is at every point on the grid... |
When I read books on finite differences they often end up using discrete $L^2$ norm for estimating the error as it naturally arises from weak formulation. I was wondering if people do that in Sobolev norm and when it is useful. I have not seen any at least in finite-differences book.
To be more specific look at the $$A... |
I am solving the following equation $u_t=x^2u_{xx}+\frac{x-y}{T-t}u_y$ with an initial data $u_0=max(y-C,0)$ for some $C$ in the domain of the numerical method. In time I am solving that on $[0,T]$. Before I implement a numerical method I have to make sure the solution exist and unique. Assume it is done and the next q... |
I'm looking into integrals of the form:
$$\int_a^b {f(x)g(x)dx}$$
Where $f(x)$ is unknown, but it's integral is:
$$\int_a^b {f(x)dx}=F$$
It's been suggested to me that one could approximate this integral by:
$$\int_a^b {f(x)g(x)dx}\sim F \cdot\overline{g(x)}=\frac{F}{b-a}\int_a^b {g(x)dx}$$
This of course being just a ... |
I am trying to diagonalize some dense, ill-conditioned matrices. In machine precision, results are inaccurate (returning negative eigenvalues, eigenvectors do not have the expected symmetries). I switched over to Mathematica's Eigensystem[] function to take advantage of arbitrary precision, but computations are extreme... |
I have two points $x_1, x_2$ between which I would like to have a linear interpolation $P_1$. Those two points are just points where I know the value of the underlying function $f$. I know that the error at any point between the two will be bounded by the second derivative of the function $\sup_{x\in[x_1,x_2]}f^{''}(x)... |
Generally speaking, I've heard numerical analysts utter the opinion that
"Of course, mathematically speaking, time is just another dimension, but still, time is special"
How to justify this? In what sense is time special for computational science?
Moreover, why do we so often prefer to use finite differences, (lea... |
I have a low speed flow with a high voltage discharge occurring within it between two spherical electrodes. We have quite a bit of data from the experiment and have performed 0-D modeling of the chemical kinetics within the plasma discharge, however our next step is to expand the modeling with 1 or 2 spacial dimension... |
My friend was working on this, and he asked me about the stability of PML while applying on pseudo-spectral method, I believe his concern was how to choose the difference(if the difference should be chosen with a directional preference, forward/backward, or inflow/outflow) such that the numerical solution is stable ove... |
What is the best software for solving and simulating the 3D Navier-Stokes equation for incompressible laminar non-Newtonian fluid flow?
|
I currently searching for a subroutine from BLAS or LAPACK which realizes the following operation
A = alpha*A + beta * B
where A and B have different leading dimensions, i.e. A is stored as
REAL*8 A(N,N)
and B is stored as
REAL*B B(LDB,N)
with LDB > N.
Is there a way to use existing BLAS or LAPACK operation to c... |
I would like to solve for the electric potential and magnetic vector potential using the finite volume method (collocated grid). My equations are:
$\nabla\cdot(\sigma\nabla\phi)=0$
$\nabla \cdot \nabla A = \mu_m \sigma \nabla\phi$
The domain is a wedge, with the following boundary conditions:
A fixed gradient for the ... |
I have a question regarding stability analysis for constant coefficient pde. Suppose I am looking at the pde $$u_t= au_{xx}$$ So the first approach is to compute the amplification factor, and this is so-called Fourier approach. Call it $Q(\zeta)$ and for explicit method plugging the test function $e^{ijhw}$ I have for ... |
Given SPD matrix $$A \in \mathbb{R}^{N \times N} $$ and positive diagonal matrix $$D \in \mathbb{R}^{N\times N}.$$ What is then spectrum of the product $$D^TAD.$$ Is there a closed-form relationship between spectra of $A, D$ and that of the product? Or at least can we find bounds of it?
E.g., one can see that if $D = \... |
I'm dealing with a set of points which are already placed on the 2D hull boundary: a convex polygon. I know this for sure. However, the point set is not ordered, and I need the polygon points to be ordered counter-clockwise.
I'm aware of all the 2D algorithms for convex hull generation from the books/literature, but I... |
Suppose I am solving a pde with a solution known with a finite-difference method. I can represent it as $A_hu_h=f$ for some approximating matrix $A_h$. And I define the discrete norm in which I will analyze the convergence to be $$||e||^2=h\sum e_i^2$$. I have the estimate for the error $$||e||\leq C ||\tau||$$ for $\t... |
I'm working from ex2.c of PETSc's example codes. On line 65, the code specifies:
MatMPIAIJSetPreallocation(A,5,PETSC_NULL,5,PETSC_NULL);
I looked up the documentation for MatMPIAIJSetPreallocation(), and understand that its purpose is to allocate memory for the matrix in a compressed sparse row format in parallel... |
Many algorithms used in scientific computing have a different inherent structure than algorithms commonly considered in less math-intensive forms of software engineering. In particular, individual mathematical algorithms tend to be highly complex, often involving hundreds or thousands of lines of code, yet nonetheless ... |
What is the best known algorithm for exactly solving a large sparse system of linear equations? The system I'm working on is not symmetric, not positive definite and integer. The only benefit is being sparse. I also need to point out that the matrix is not square. The dimension is m×n and it is not generally either und... |
Suppose I have a sparse stochastic matrix $M$ (with thousands or millions of stochastic column vectors), possibly encoding some links in a web graph. Now I split it into two matrices: $D$ containing only the diagonal entries of $M$, and $R$ containing the remaining entries of $M$. What would be a fast way to compute $D... |
As stated in the title, I encountered a proof with the final statement of the form
"the eigenvalues of A are then $\{\lambda_1+c, \lambda_2, \dots, \lambda_n \},$ counting algebraic multiplicity.
What does "Counting algebraic multiplicity" mean in general? I'll then try to apply the "general" to my specific problem.
|
I want to solve the following expression (used to obtain an analytic solution to a current distribution inside a workpiece):
$$a_{mn} = -\frac{\frac{4}{ab} \int_0^a \int_0^b f(x',y')\sin(px')\sin(qy')\mathrm{d}x'\mathrm{d}y'}{t\sinh(tc)}$$
Here. $a$,$b$ are scalar constants and $p = \frac{m\pi}{a}$, $q = \frac{n\pi}{b}... |
Suppose I have a symmetric linear operator $A:\mathbb{R}^k \rightarrow \mathbb{R}^k$ where $k$ is "small" (eg., $k=100$), and I want to find it's first few eigenvectors, (eg., $10$ eigenvectors).
If we had a matrix representation of $A$ this would be a standard problem in dense numerical linear algebra. However, the ca... |
Assume you have a stability constraint between the space distance in time and space, for example, with an explicit Euler method for $u_t=u_{xx}$ we know $\tau\leq h^2/2$. That is, one can do stability analysis for a uniform grid, obtain a constraint and then take the minimum over a nonuniform grid for the spacing to se... |
This question is not very deep. Suppose I have a small rectangular matrix $A$, with number of rows and columns between $50$-$100$, respectively.
Given a right-hand side $b$, I want to solve the least-squares problem $Ax = b$, i.e., I want to find $x$ with norm-minimal residual $r = b - Ax$ and $x$ having minimum norm a... |
I want to invert a 10X10 antisymmetric matrix in Python around 10,000 - 20,000 times. Is there a faster way to do it other than to use the built-in inverse function in Python?
Thanks.
|
I'm very new to GPGPU programming so please forgive me if the question is not particularly appropriate. From what I understand GPU programming is a very intricate piece of engineering work when compared to usual CPU programming. One has to be very careful about divergence issues, tiling, pinned memory allocation, and h... |
I have been reading a book by Thomee and he considers the case of $u_t=(au_x)_x$, for the case of $a$ possibly being discontinuous. Then he says that the problems with convergence might occur, and thus to fix that one can smooth the coefficient $a$ and restore convergence rate.
Please correct me if I am wrong but disc... |
I am trying to solve complex valued Poisson equation
$$(C + \nabla. D \nabla )u = f \text{ ;where C, D, u and f are complex numbers.} $$
I am breaking this eqn into real valued problem, which is of the form
$$ \underbrace{\begin{pmatrix} C_r + \nabla. D_r \nabla & -C_i - \nabla. D_i \nabla \\ C_i + \nabla. D_i \na... |
Recently, I saw this question: how to measure the error of a finite difference method
I am student of simulation sciences and unfortunately, for me, it's totally unclear, what norm to use in what context.
Quite often, we use the Euclidian norm or the L2 norm, but why does one choose different norms, what's their meanin... |
The following MATLAB function produces the Eigenvalues and Eigenvectors of matrix X.
[V,D] = eig(X) produces a diagonal matrix D of eigenvalues and a
full matrix V whose columns are the corresponding eigenvectors so
that X*V = V*D.
My questions are:
Does this mean that the first (or principal or dominant) eigenvector... |
I have been reading a recent paper. In it, the authors performed molecular dynamics (MD) simulations of parallel-plate supercapacitors, in which liquid resides between the parallel-plate electrodes. To simplify the situation, let us suppose that the liquid between the electrodes is argon liquid.
The system has a "sla... |
The journal Association for Computing Machinery Transactions on Mathematical Software (ACM TOMS) publishes many articles on numerical algorithms that include software implementations. According to their editorial policy, submission of an algorithm paper includes the source code for an implementation of the algorithm de... |
Assume the optimal value of a primal problem is bounded. Is the following statement true?
If the primal problem is bounded, then its dual problem is bounded as well.
|
Consider a min cost flow problem in a directed graph $G=(V, E)$ as follows:
(*) Min $\sum {c_{ij}f_{ij}}$
s.t.: $\sum_{j\in out(i)}{f_{ij}} - \sum_{j\in in(i)}{f_{ji}} =b(i)$ for each $i\in V$
$f_{ij} \geq 0$
$in(i)$ and $out(i)$ are the set of arcs coming into node i and going out of node i, respectively... |
I'm using Richard Hartley's rectification algorithm to rectify a pair of images before performing stereo disparity computation. The problem is I'm observing shearing in one of the rectified images and it's causing problems on disparity computation.
Consider these two input images (the points pairs were produced using S... |
I have a MPI computation with the following structure: each processor has a large region of read-only memory divided into chunks. During a compute epoch, each processor performs a (different) number of steps of the form:
Gather several chunks of data different processors.
Do some computation and store the results.
D... |
The comments on the accepted answer of my previous question here have left me with a more general question about accurately capturing shockwaves in fluid calculations.
For the sake of having an example, let's say we have a standing shockwave with a pressure or density ratio of 10:1 measured at two points one unit lengt... |
I was wondering whether there is a fast and efficient method to find the number of non zeros in advance for sparse matrix multiplication operation assuming both matrices are in CSC or CSR format.
I know there is one in smmp package but I need something that is already implemented in C or C++.
Any help will be apprecia... |
Suppose I have N different airplanes traveling on a two dimensional rectangular plane of size 400km x 400km (i.e. it is as if all planes travel at the same altitude). Assume each airplane has a randomly generated starting and ending points. Also, assume that the airplanes can have different speeds. We assume that tw... |
I have part of a problem that is described by the momentum conservation equation:
$\frac{\partial \rho}{\partial t} + \frac{1}{\sin\theta} \frac{\partial}{\partial \theta}(\rho u \sin \theta) =0$
Where $u=f(\theta)$ and $ \rho = f(\theta,t) $ (constant velocity).
Naively one could apply one of the solutions listed he... |
The Journal of Computational Physics has been an important outlet for computational science in the past, and I have published there before. For the benefit of those (like me) who have signed the Elsevier boycott, what non-Elsevier journals would be appropriate places to publish articles that could have been submitted ... |
I've seen a lot of publications in Computational Physics journals use different metrics for the performance of their code. Especially for GPGPU code, there seems to be a great variety of timing results people publish. In particular, I've seen:
Comparisons of (essentially) running time on the GPU and CPU versions and r... |
I have a bunch of MPI processes exchanging request messages back and forth. Processes do not know which other processes will send them messages, or how many. Given this situation, I want an efficient way to know whether all other processes consider themselves done sending messages.
This would be accomplished perfectl... |
I have troubles imagining how to compute a volume and centroid of an n-dimesional convex polytope.
For a polygon (especially for convex polygon) the area and centroid are described in (wiki) by
$$
A= \frac{1}{2} \sum \limits_{i=0}^n (x_iy_{i+1}-x_{i+1}y_i)
$$
For k-dimensional case the volume (Volume) is
$$
\int\limi... |
Is there any hope in solving the following linear system efficiently with an iterative method?
$A \in \mathbb{R}^{n \times n}, x \in \mathbb{R}^n, b \in \mathbb{R}^n \text{, with } n > 10^6$
$Ax=b$
with
$
A=(\Delta - K)
$, where $\Delta$ is a very sparse matrix with a few diagonals, arising from the discretization of t... |
I am solving Turing's reaction-diffusion system with following C++ code. It is too slow: for 128x128 pixel texture, acceptable number of iterations is 200 – which results in 2.5 seconds of delay. I need 400 iterations to obtain interesting image – but 5 seconds of waiting is too much. Also, size of the texture should b... |
I have an MPI application that needs to asynchronously respond to both incoming messages and request completions inside a dedicated communication thread. The obvious way to do this is a busy wait that alternately calls MPI_Iprobe and MPI_Testsome. Should I be worried about performance if I do this? Is it better to j... |
Newton's method for solving nonlinear equations is known to converge quadratically when the starting guess is "sufficiently close" to the solution.
What is "sufficiently close"?
Is there literature about the structure of this basin of attraction?
|
I would like to use patchAverage to obtain the average pressure on an object that consists of multiple patches (due to different boundary conditions), however patchAverage only averages over single patches. As long as the constituent patches aren't shared with other objects, I could simply take the area-weighted averag... |
I am investigating the accuracy and stability properties of a non-symmetric discretization of a Poisson problem. The problem originates from a ghost fluid discretization of the projection step of a fractional step Navier-Stokes solver. In this type of approach, grid points away from the geometry surface are discretized... |
I'd like to know if there is an algorithm that given a set o points and an angle computes the convex-hull if the angle is $\alpha = 0$ and given an $\alpha > 0$ computes an envelope that follows more closely the "perimeter".
And if there is a definition of a non intersecting perimeter of a set of points, in this case ... |
I want to have an estimation, that my solution has an error, let's say less than 1e-8.
Usually, I stop the Gauss-Seidel algorithm, when the residual is "small enough" and this is already the problem. How do I know when the residual is small enough, because even when the residual is small, the solution may still have to... |
Suppose $A$ is a real symmetric matrix and its eigenvalue decomposition $V \Lambda V^T$ is given. It is easy to see what happens with the eigenvalues of the sum $A + cI$ where $c$ is a scalar constant (see this question). Can we draw any conclusion in the general case $A + D$ where $D$ is an arbitrary diagonal matrix? ... |
In the worst case complexity analysis of all the polynomial algorithms in linear programming such as ellipsoid method and interior point method, there is an assumption that the input data must be integer. Using this assumption, then they bound the bitlength of input data by $L$. Now, the question is as follows:
Q: How ... |
For solving a very sparse LP: {min $cx$: s.t.: $A_{m \times n}x=b$ , $x\geq 0$}, which one of the following algorithms is faster?
Logarithmic barrier method
Other variants of the interior point
method
Simplex method
What is the best worst case complexity? In general, which algorithm performs well in practice for sp... |
I am familiar with the Courant-Friedrich-Lewy Condition in as far as it applies to the stability of explicit finite difference schemes for standard parabolic and hyperbolic PDEs. However, when solving the Navier-Stokes Equations, the non-linearity of the PDEs make it difficult to derive a CFL condition analytically. ... |
I am trying to write an implementation of a color quantization algorithm in order to find an image's dominant colors (say 5) and then find contrasting colors based on the colors found in the image.
I've tried implementing a k-means algorithm but the result ends up differently every time.
What do you suggest? I need hel... |
I work on non-graded quadtree grids where the entire grid is a hierarchy of cells specified using a quadtree data structure, where, in general, there is no constraint regarding the relative size of neighboring cells (or any cells for that matter).
My library is mainly based on finite difference schemes that sample the... |
Given $d$-dimensional coordinates residing in a matrix $X\in\mathbb{R}^{n\times d}$, the Euclidean distance between items $i$ and $j$ is denoted as $g_{ij}$. Let $c\in\mathbb{R}^d$ denote the centroid of the configuration $X$. Is it possible to establish a relation between $$\sum_{i,\, j} g_{ij}^2,$$ and $$\sum_{i=1}^n... |
Suppose I have a matrix $A$ of size
$n_1 \times n_2 \times n_3$
Now, I have another matrix $B$ of size $n_1 \times n_2 \times n_3 \times N$ where $N<n_3$
I'd like to create the following matrix $C = [A(m,l,B(m,l,k,:))]_{1 \le m \le n_1, 1 \le l \le n_2, 1 \le k \le n_3}$.
What is the most efficient way of doing this w... |
I am seeking for an efficient algorithm to compute a multivariate polynomial of a fixed structure, but different coefficients and evaluation points. The question is the same as this one, which apparently did not draw much attention. I am working in MATLAB, so "efficient" probably in this situation means to vectorize as... |
I am working on a paper part of which is the application of validation rules to find how many principal components give us the least generalization error.
The concept goes more or less like this: "Given that the dimension of the model is reduced, we reset our window size to 60 days to avoid overfitting problem. After ... |
For a given centered configuration of points $X\in\mathbb{R}^{n\times 3}$, the covariance matrix is denoted by $S=\frac{1}{n}X^TX$. Recall that the 2D PCA solution is obtained by $Y=X\cdot U$, where $U\in\mathbb{R}^{3\times 2}$ is a matrix of orthonormal eigenvectors of $S$ associated with its 2 dominant eigenvalues $\... |
The Heat equation is discretized in space with FV (or FEM), and a semi-discrete equation is obtained (system of ODEs). This approach, known as the method of lines, allows to easily switch from one temporal discretization to another, without code duplication. In particular, you can reuse any time integrator for ODEs wit... |
I found R function ridge.cv very useful.
I would like to implement the equivalent function in MATLAB. As a starting point, I used MATLAB function b0 = ridge(y,X,k,scale), however it gives completely different results. Why does this might happen? What value should I set for variable "scale" (1 or 0 and what's their diff... |
I am dealing with optimization of functions for which I do not have derivatives available, and the optimization is not constrained. I am searching for a high quality GNU Public License-compatible optimization library compatible with the C++ language. So far I have managed to find OPT++.
Can someone recommend this or ... |
Recently, I came across an optimization problem with binary decision variables which was constrained with a set of first-order differential equations (resulting from a continuous-time Markov chain model). The objective function is the sum of a partial set of probabilities which are obtained via the set of first-order d... |
I have a complex surface (real dimension 2) in $\mathbb{C}^2$ with coordinates $(z,w)$ given explicitely: for any $\xi \in \mathbb{C}$ I know points $w(\xi)$ of intersection of surface with complex line $z = \xi$. I have to draw it's projection on fixed 3d plane. Please help me with algorithm.
|
I know there are "superfast" $O(n \log^p n)$ algorithms for solving Toeplitz linear systems. Is it possible to compute all eigenvalues of such a matrix with the same complexity?
|
I'm installing PETSc for complex numbers with the C99 standard. I'd like to have it installed using a higher precision than the default (double, I presume) since that will most likely make the LU preconditioner run better. I've tried several different commands that I could google, but it doesn't work. I've searched the... |
In order to achieve a 2D representation $X\in\mathbb{R}^{n\times 2}$ of some high-dimensional data residing in $Y\in\mathbb{R}^{n\times k}$, I use PCA:$$X=Y\cdot U,$$where $U\in\mathbb{R}^{k\times 2}$ contains eigenvectors of $Y^TY$ corresponding to its dominant eigenvalues.
However, in case there are multiple occurren... |
I have a linear programming problem
min $c^T x$
$Ax\leq b$
However, in my problem, $A$ contains also some variables $y$, e.g.
$$A = \begin{pmatrix} y_1 & 4 \\ 3 & y_2 \end{pmatrix}$$
I want to find a value of $y$ such that the solution $x$ of the LP, for that fixed choice of $y$, is positive.
This question is differe... |
I want to access a GPU on a computer remotely, and share this GPU with different desktops. I envision this sort of access as being similar to using a VNC. Is it possible to do something like what I've just described, and if so, how would I go about doing it?
|
I don't want to deal with virtualenv for a local Python installation, I just want to install a few packages locally without dealing with the PYTHONPATH environment variable, how do I do that?
|
I am beginning my graduate studies in engineering and will be working on computational science projects. I noticed that there has been some discussion about the advantages and disadvantages of implementing your own algorithms here. Is the cost-benefit analysis of implementing your own algorithms versus using libraries ... |
Say I would like to generate a pseudo-random number, which only contains the digits 1, 4, 7 (this is arbitrary).
My first guess would be to create and array "147" and create random numbers in the range [0..2] and use these numbers as an index into this array to concatenate a number in a loop.
I wonder if there is a mor... |
For example I consider a heat equation that I want to solve numerically : $$u_t=u_{xx},$$ In order to have a uniqueness on a computational bounded domain I have to have boundary condition specified for both $x_{min}$ and $x_{max}$. Ideally I can specify the value of the function, if it is not known I can specify the va... |
Reading an implementation of the golden section search, I came across the following termination test:
$$| a - d | < \varepsilon ( |b| + |c| )$$
where $a < b < c < d$ are four points at which the function has been probed and $\varepsilon$ is a user-provided tolerance. Why is this a good termination criterion? If I take ... |
Suppose a matrix $A\in\mathbb{R}^{n\times n}$ is given. Faced with a proof for $$x^TAx>0,$$
for a non-zero vector $x\in\mathbb{R}^{n}$, I was thinking to use the information of the spectrum of $A$ (note that the proof of the above is the proof of positive definiteness of $A$). Namely, it is known that the spectrum of $... |
I am looking for an efficient method to compute $$\sum_{i=1}^\left|B\right|\left|Ax_i-b_i\right|^2\rightarrow min$$ under the condition $$\forall i, x_i\ge 0,$$
where $A$ is an n-by-m matrix and $B$ is a set of n-dimensional vectors. Only $B$, $n$ and $m$ are given. In other words the goal is to find $A$ so that the su... |
The thing I dislike most about MPI is dealing with datatypes (i.e. data maps/masks) because they don't fit that nicely with object oriented C++. boost::mpi only supports MPI 1.1, however, from their website:
boost::mpi is a C++ friendly interface to the standard Message Passing Interface… Boost.MPI can build MPI data ... |
We are comparing the performance of various numerical methods that can be used to solve the Schrodinger's Equation for the Hydrogen Atom interacting with a strong laser pulse (too strong to use perturbation methods). When using discretization schemes for the radial part, it seems like most (all) people put the atom in ... |
I need to write MATLAB program (or use an existing one) to obtain Fourier series coefficients. Let's say the series is going to approximate a 1D curve. The boundary conditions are:
value of the curve's function in a few places
curve's first derivative known in a few places
maximum allowed value of curve's second deri... |
I have a non-symmetric matrix, where the non-symmetry only appears at a subset of points. This arises due to the particular manner on which boundary conditions are applied in a Cartesian grid method. I'm looking for a way to factor the matrix into the product of a symmetric sparse matrix and a diagonal matrix with a lo... |
I am looking for existing software or scripts to generate spiral graphs from cyclical (time) data, as presented by Webber and Muller. The graphs shown in the paper look like a great means of visualizing and identifying periodicity in cyclical data, but I haven't been able to Google up any existing solutions for creati... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.