instruction
stringlengths
43
28.1k
Are there any existing software toolkits, libraries, frameworks or whatever for studying the quality of pseudorandom number generators that allow one to add a known amount of imperfection - e.g deliberate higher-order correlations - then obtain statistics of various RNGs whose outputs are so modified?
I'm using the Crank-Nicholson method to solve the time-dependent Schrödinger equation with the split-operator method. I'm getting some weird results that are probably the result of a bug somewhere in my code. Just in case, I thought I should probably check to see if the method I'm using is unstable. Does the split-oper...
In the Hartree-Fock self-consistent field method of solving the time-independent electronic Schroedinger equation, we seek to minimize the ground state energy, $E_{0}$, of a system of electrons in an external field with respect to the choice of spin orbitals, $\{\chi_{i}\}$. We do this by iteratively solving the 1-elec...
I would like to understand more details about the implementation of Algebraic Multigrid Methods (AMG). I have been reading "A Multigrid Tutorial", which is quite good and explain all the details of the interpolation, coarse-grid operator and coarse grid selection for AMG. However, I think, there is nothing like playing...
I need a program or an algorithm that computes the intersection of a mesh and a boundary. The mesh is structured orthogonal in nature and the boundary is a circle (for example). This will be used for solving Poisson's equation using finite difference technique with 5 point unequal spacing stencil.
I recently asked a question along the same lines for skew-Hermitian matrices. Inspired by the success of that question, and after banging my head against a wall for a couple of hours, I'm looking at the matrix exponential of real asymmetric matrices. The route to finding the eigenvalues and eigenvectors seems rather co...
I want to calculate a finite difference (something like this SO Post). My data is as follows: I have x-values that are powers of two (4, 8, 16, 32 and 64). Corresponding to them are y-values, such that $$Y=f(X)$$ where $f$ is a monotonic function. My interest is in calculating finite difference such as $$\text{Diff}(x)...
Suppose one is performing Gibbs sampling with a Boltzmann distribution (or if you prefer, simulated annealing) at finite temperature. In general we would want to anneal: as the sampler converges to equilibrium, the temperature should be decreased. If the sampler's rate of convergence (local in time) does not vary, the...
Suppose we have a $n\times n$ Cauchy matrix of which the $ij$-th entry is given by: $$ A_{ij} = \frac{1}{a_i - b_j} $$ the assumption is that the distance between $\{a_i\}$ and $\{b_j\}$ is greater some positive constant, for example: $$ a_k = e^{i\frac{(2k+1)\pi}{n}}, \quad b_k = e^{i\frac{2k\pi}{n}} $$ then we ha...
I need a wavelet frame for $L^2[0,\infty)$. Moreover, the wavelet should be twice differentiable and with continuous second order derivatives. Hopefully, the wavelet should have compact support (either in the time-domain or in the frequency-domain). Is there such a wavelet? Previously I had asked similar questions here...
If I have a square invertible matrix and I take its determinant, and I find that $\det(A) \approx 0$, does this imply that the matrix is poorly conditioned? Is the converse also true? Does an ill-conditioned matrix have a nearly zero determinant? Here is something I tried in Octave: a = rand(4,4); det(a) %0.008 cond(a)...
As far as I see, there are many repositories for 3D shapes. But in FEM and many other applications, a planar mesh domain is also very common. However, I did not find a mesh repository specially designed for 2D shapes. Since 2D meshes can be generated efficiently by some techniques like 2D alpha shape, Delaunay triangul...
I know for a given matrix $M$, there exists a matrix $U$ over the integers with determinant $+1$ or $-1$ such that $UM=E$. I know $E$, but $M$ is not a square matrix. Is there any easy way to get $U$?
I have so far been using VMD to create visualizations of molecular trajectories. However, I find myself not entirely satisfied with the quality of the resulting animations—when you want to do snapshot-by-snapshot movies, the simulation "moves" too quickly. Additionally, I sometimes receive individual graphics images, ...
I'm looking for a convenient, free C++ library for graphs that include a solver for the maximum common subgraph (MCS) problem. I'm aware of the Boost Graph Library and LEMON , but neither includes an MCS solver.
I'm using ViennaCL's interface to Eigen as a way to leverage OpenCL. Specifically, I'm using the ::viennacl::linalg::bicgstab_tag with an Eigen sparse matrix. However, the performance isn't what I hoped that it would be. What tools on Windows 7/Mac OS X/Linux should I use to understand the performance bottlenecks?
I've been reading some resources on the web about Galerkin methods to solve PDEs, but I'm not clear about something. The following is my own account of what I have understood. Consider the following boundary value problem (BVP): $$L[u(x,y)]=0 \quad \text{on}\quad (x,y)\in\Omega, \qquad S[u]=0 \quad \text{on} \quad (x,y...
I have a mesh, faces $F$, edges $E$, and vertices $V$, and I have a list of predefined level set contours. What algorithm can I use to construct contours in the most efficient manner? A plot of the contour is shown above. Lines with the same color have the same $z$ value.
In computational science we often encounter large linear systems which we are required to solve by some (efficient) means, e.g. by either direct or iterative methods. If we focus on the latter, how can we establish that an iterative method for solving a large linear systems is convergent in practice? It is clear that w...
If we use the composite trapezoidal rule, then what is the least number of divisions $N$ for which the error of the integral $\int^1_0{e^{-x}}dx$ doesn't exceed $\frac{1}{12}\times10^{-2}$. My guess is 11 or 5. Kindly tell me which of the answer is correct? I obtained 11 as the answer by applying the formula $$\Big|\...
Is there a speedier way to calculate standard errors for linear regression problems, than by inverting $X'X$? Here I assume we have regression: $$y=X\beta+\varepsilon,$$ where $X$ is $n\times k$ matrix and $y$ is $n\times 1$ vector. For finding least squares problem solution it is impractical to do anything with $X'X$,...
I have already developed a working solution of the Finite Element Method to solve heat transfer problems using GPU and OpenCL using the Conjugate Gradient method. The main disadvantage of this method is high demand for memory. Moreover, in case of graphics cards memory is often very limited. I see two options: Create...
I've written code for an obstructed random walker simulation and I want to run long simulations (6 hours or more on my computer). I don't want to run this simulation on my computer because I will want to run multiple simulations simultaneously and I don't want to have to worry about not having access to my computer's h...
Suppose $$\begin{align*} \min A &\mathrm{vec}(U) \\ &\text{subject to } U_{i,j} \leq \max\{U_{i,k}, U_{k,j}\}, \quad i,j,k = 1, \ldots, n \end{align*}$$ where $U$ is a symmetric $n\times n$ matrix, and $\mathrm{vec}(U)$ reshapes $U$ into a one-dimensional vector with $n^2$ entries. The part of the above program that...
Possible Duplicate: What programming paradigms should I be investing in if I want my code to run on petascale machines in the future? Having entered the multi-core era (som already refers to as the many-core era) for CPUs, I am wondering what would be a good (the best?) future message interface model to be used for ...
Are there any famous problems/algorithms in scientific computing that cannot be sped up by parallelisation? It seems to me whilst reading books on CUDA that most things can be.
Let $H = \triangle + V(x) : \mathbb{R}^2 \rightarrow \mathbb{R}^2$. I am interested in domain decomposition for an eigenproblem involving $H$. The lowest 1000 eigenfunctions of $H$, $ \psi_i $, can be partitioned using a region, $\Omega \subset \mathbb{R}^2$, such that each $\psi_i$ localizes either inside of $\Omega$...
I am trying to implement the fourth order Runge-Kutta method for solving a first order ODE in Python i.e. $\frac{dy}{dx} = f(x,y)$. I understand how the method works, but am trying to write an efficient algorithm that minimises the number of times $f(x,y)$ is calculated as this is quite costly. I have been told that it...
I know that I should use a tolerance for comparing floating point numbers. But for comparing vectors, I can think of 3 possible solutions corresponding to different distance metrics: Compare the components of each vector individually: the vectors are equal if all 3 are within tolerance. This option would behave like...
I am just learning about these packages, so forgive me if this is a trivial/silly question. Our group is working re-developing our code from the ground up using modern software practices. Currently it is an explicit wave propagation code for earthquake source physics, but more and more our group is working on other cou...
An algorithm I'm writing needs to compute rolling quantiles of a time series. Currently I do this in the naive way: for a window of size W and a vector X of size N for t from W to N: q[t,:] = quantiles(X[t-W+1:t]) However, it seems that there should be a faster way, given that I know the previous quantile q[t-1], th...
Suppose we are dealing with a nonlinear problem, say $$ A u := L u + G(u) = f $$ the nonlinearity of the operator $A$ is the polynomial type, ie, $L$ is a linear operator, and $G(u) = u^k$, or more generally we have a Fréchet derivative bound like: $$ \big\|A(u) - A(v) -DA(u)(u-v) \big\|\leq C \|A(u) - A(v)\| $$...
Suppose I have two matrices Nx2, Mx2 representing N, M 2d vectors respectively. Is there a simple and good way to calculate distances between each vector pair (n, m)? The easy but inefficient way is of course: d = zeros(N, M); for i = 1:N, for j = 1:M, d(i,j) = norm(n(i,:) - m(j,:)); endfor; endfor; The closes...
I have a problem when I want to use the high order center difference approximation: $$\left(\frac{-u_{i+2,j}+16u_{i+1,j}-30u_{i,j}+16u_{i-1,j}-u_{i-2,j}}{12}\right)$$ for the Poisson equation $$(u_{xx}+u_{yy}=0)$$ in a square domain in which the boundary conditions are: $$u(0,y)=u(x,0)=u(x,1)=0,u(1,y)=\sin \pi y$$ $$\...
What is a good, common way to express dictionaries (= maps) in pseudocode? I.e. datastructures that basically allow to store values for keys, iterate over all key/value pairs, test for inclusion of a given key, etc. I have something like the following (in this case senseless) Python code in mind: D = {} D[1] = 2 for ke...
I would like to analyze some well-used scientific codes that make heavy use of LAPACK. I.e. I'm looking for codes that both spend a lot of time within LAPACK functions and use LAPACK non-trivially (i.e. calling more than just DGEMM). I would be interested in applications that use either sequential LAPACK or ScaLAPACK o...
I have a sequence of 2D images (png files) encoding the partitioning (segmentation) of a large biological 3D volume. In these files, each pixel has a color, representing the 3D object the pixel belongs to. I was wondering if anybody knew of tools that I can use, hopefully off-the-shelf, to visualize this data in 3D. ...
I'm having a problem where petsc is complaining about the type of PetscScalar (I get a whole bunch of errors from the c++ standard library that revolve around PetscScalar not defined). I believe it is a problem with the way Petsc is compliled (I vaguely remember that Petsc can't seem to have both --with-c-support and -...
I was going through my notes on different finite difference methods and came across something I don't quite understand. I have code that will calculate an approximate solution we can call this $U_{nm}$ that I define on a grid using $h$ and $dt$ for the change in $x$ and time, respectively. Now I have written down the g...
I need to get started using Finite Element Methods. I am about to start reading Numerical solutions of partial differential equations by the finite element method by Claes Johnson, but it's dated 1987. Two questions: 1) What newer good resources/textbooks/e-books/lecture notes on this subject are out there? 2) How mu...
I'm using Valgrind + Callgrind to profile a solver I have written. As the Valgrind user manual states, I've compiled my code with the debugging options for the compiler: "Without debugging info, the best Valgrind tools will be able to do is guess which function a particular piece of code belongs to, which makes both e...
I started to learn OpenFOAM from the Cavity tutorial which is provided at the web-site. When experimenting with different Reynolds numbers, in section "2.1.8.2 Running the code", tutorial says to rerun the solver because "It is sensible to increase the solution time". But when I done this I couldn't find any kind of di...
Note: the following post may include controversial opinions, so please note that they are only my opinions, and not intended to offend anyone. I'm being programming in some form or the other since around 1999. I initially used R, and then later, around 2004, mostly switched to Python. For many scientific applications, ...
Proteins are typically represented in a cartoon form, with β sheets as arrows and α helices as coils: I'm wondering, is there somewhere a reference that describes the construction of this representation? That is, what mathematical objects are used to construct these graphics, and on which atoms/directions are they bui...
Can someone provide an article or book that explains the principle used in frontal solvers? Some examples also may help understand the frontal methods better.Thanks in advance!
How is (generalized) geometric programming different from general convex programming? A geometric program can be transformed into a convex program, and is typically solved by an interior point method. But what is the advantage over directly formulating the problem as a convex program and solving it by an interior point...
Question How would you sort a cloud of points with respect to an unstructured mesh of hexahedral cells? Each cell has a centre and a unique label to represent it. There are two cloud points basically (original point cloud, and a point cloud of the cell centres), but the cell geometry information (bounding box) may be ...
Given certain function $f(X)$ which is quadratic in $X\in\mathbb{R}^{n\times d}$, $$\frac{1}{2}tr(X^TAX) - tr(Y^TBX)$$ for positive definite weighted Laplacian matrices $A, B\in\mathbb{R}^{n\times n}$, i.e. the diagonal elements are negative summation of the negative off-diagonal elements plus a constant for strict di...
DISCLAIMER: I've edited the question repeatedly for clarity and to target the most relevant answer. I have the following general problem $$ \min \|h_1\cdot h_2\|^2 $$ such that $$\|g_1\wedge g_2-h_1\wedge h_2\|^2 = 0,$$ where $h_i,g_i\in \mathbb{R}^n\wedge \mathbb{R}^n$ are skew-symmetric matrices, $A\cdot B$ denotes m...
I am curious how to quickly compute the eigenvalues for arbitrary matrices, sparse or dense, restricted on some given interval of interest. Suppose we have an arbitrary $n\times n$ matrix $A$, normally the complexity of the computing all the eigenvalues for $A$ is $O(n^3)$, I wonder if we could find an algorithm that d...
I want to know which of the classic linear solvers (e.g Gauss-Seidel, Jacobi, SOR) are guaranteed to converge for the problem $Ax=b$ where $A$ is positive semi definite and of course $b \in im(A)$ (Notice $A$ is semi definite and not definite)
A few of the iterative matrix algorithms (CG,GMRES etc.) I have authored are acting rather funny. They converge to the right answers but take abnormally long time to run. I am in the process of finding out why. One of the first steps I thought is to find out the algorithmic complexity of the methods. For instance, I n...
I am looking for preconditioners which don't assume anything about the matrix or its origins. I basically want to be able to type in the following in MATLAB and have quick solving time: a = rand(5000,5000); b = rand(5000,1); precond_a= my_precond_algorithm(a); qmr(a,b,1e-8,100,precond_a) Needless to say, $a$ is dense....
Suppose we want to solve the Poisson equation $\Delta u = f$ on a domain $\Omega$ with Dirichlet boundary conditions. One possible way to do is by a domain decomposition method. There is a condition that the domain has to be decomposed into subdomains such that each subdomain touches the boundary of $\Omega$. Otherwise...
Does there exist a standard format for finite element meshes which is widely used in the industry? Thanks!
Case studies in my PhD thesis require that I have interval extensions of Fortran subroutines in CHEMKIN-II (apologies for the link; it's the best one I could find for a package no longer distributed by Sandia National Laboratory). CHEMKIN-II is a chemistry package used in combustion chemistry; since it's the standard p...
By good I mean minimal and essential. One whose concepts form a minimum spanning tree, and whose words are precious :) (A small pdf would be perfect)
Suppose the following linear system is given $$Lx=c,\tag1$$ where $L$ is the weighted Laplacian known to be positive $semi-$definite with a one dimensional null space spanned by $1_n=(1,\dots,1)\in\mathbb{R}^n$, and the translation variance of $x\in\mathbb{R}^{n}$, i.e., $x+a1_n$ does not change the function value (who...
I am trying to solve the following test problem which is well-known in the community in different variants: Place N = 15 points in the 3-dim. unit cube such that the minimal distance between them is maximal, e.g. like in the case of repellent but confined electrons. Here are Matlab-like non-vectorized/vectorized forms ...
Recently, I wrote an algorithm to obtain a delaunay triangulation of a random point set in $I=[-10,10]$x$[-10,10] \subset R^2$ by projecting these points onto the 3 dimensional paraboloid $z=x^2+y^2$, computing the convex hull, and then projecting the lower hull back onto $R^2$. I have verified that my convex hull alg...
Suppose I'm using a linear congruential pseudo-random number generator (PRNG). Given a seed $x_0$, the multiplying factor (a), the shift factor (c) and the modulus factor (m), how can I determine the period of my PRNG? Do I determine it by experimentation / pattern detection algorithms, or is there a direct formula f...
Let $f, g \in \mathbb{R}[x]$ and $\deg f > \deg g$. I am looking for asymptotically fast and numerically stable algorithms for computing $f \bmod g$. In the applications intended, both $f, g$ are dense polynomials with double precision floating-point coefficients. But, for now, I'm more interested in the algorithms rat...
Suppose you solve a linear system $Au = f$ by an iterative method, e.g. conjugate gradients or Richardson iteration. Then you try to solve a linear system that is slightly perturbed in the matrix and the right-hand side, say, $\tilde A \tilde u = \tilde f$. Does it make sense to use the old solution as starting value $...
It's shown (Yousef Saad, Iterative methods for sparse linear systems, p. 260) that $cond(A'A) \approx cond(A)^2$ Is this true for $AA'$ as well? In case $A$ is $N\times M$ with $N \ll M$, I observe that $cond(A'A) \gg cond(AA')$ Does that mean formulation in terms of $AA'$ is preferable in this case?
The Remez algorithm is a well-known iterative routine to approximate a function by a polynomial in the minimax norm. But, as Nick Trefethen [1] says about it: Most of these [implementations] go back many years and in fact, most of them do not solve the general best approximation problem as posed above but variants in...
In my project I have to solve a couple of tridiagonal matrices at every time step, so it is crucial to have a good solver for those. I did my own implementation, just the classical way to do it described on Wikipedia. I then tried using Lapack instead, and to my surprise it was slower! Now, inside Lapack it seems like...
I was studying Big-Oh notation, and there is apparently a difference between $O(n)$ and $o(n)$. What is it? I think $f(n)$ is $o(n)$ means that $$\lim_{n \to \infty} \frac{f(n)}{g(n)} = 0$$ but what does this mean?
I have a problem similar in formulation to this post, with a few notable differences: What simple methods are there for adaptively sampling a 2D function? Like in that post: I have a $f(x,y)$ and evaluation of this function is somewhat expensive to compute Unlike in that post: I am interested not in the value of the...
As someone who has to teach courses in computational science, I am confronted with the age-old question: how do I evaluate the ability of the students to learn a subject that depends on applications that are difficult to test with "standard" testing methods (written or oral exams)? Part of the course does depend on und...
What are some good resources (books, articles, sites) about polygon intersection and union algorithms?
Suppose a linear system is given $$AX=B,$$ where $A\in\mathbb{R}^{n\times n}$ is a symmetric strictly diagonal matrix, and $X, B\in\mathbb{R}^{n\times 2}$. Therefore, the 2D Jacobi iterative solver is applicable here, $$X_{k+1}=D^{-1}(B-RX_k),$$ where the splitting corresponds to $A=D+R$, with $D$ containing only the d...
Is there an efficient way to numerically compute Stirling numbers of the second kind? An approximate (not exact) method would suffice. Something similar to the connection between factorials and gamma functions would work for me. I googled it a bit and didn't find anything too helpful.
I have a distributed matrix, in block column format. I know that I can reshape the matrix into one long vector and use an all_gatherv operation. I just wanted to avoid the trouble of having to reshape the matrix in my code. So, I was wondering if there's an mpi all gather operation so that in the end, every processo...
I'm simulating two phase immiscible drainage (air displacing water) in a rectangular domain of size .6mm x 2.4mm (2 dimensions) using Ansys FLUENT software. I am using an implicit Volume of Fluid formulation with a PRESTO pressure solver and PISO pressure-velocity coupling, with 2nd order upwind schemes for momentum a...
Given a generic sparse matrix $A \in \mathbb{R}^{n\times n}$ with m << n (correction: $m \ll n^2$) non-zero elements (typically $m \in {\cal O}(n)$). $A$ is generic in the sense that it has no specific properties (e.g. positive definiteness), and no structure (e.g. bandedness) is assumed. What are some of the good nume...
Input var('x') solve((log((x**2 - x), 6) - log((6*x - 10), 6) == 0), x) Output [log(x^2 - x) == log(6*x - 10)] But real roots are 5 and 2. What I doing wrong?
I am going to put this question on math exchange and stack exchange as well (since it doesn't really fit in any of the specific fields, I don't know which it should go in), but here is the question: I am seeking to evaluate spherical harmonics at a given point, but according to a local coordinate system. Let the actual...
Is there any paper or research concerning float128 arithmetics applied to linear algebra problems(e.g. iterative solvers, decompositions etc.)? How much benefit is really there in comparison with double? How much slower is it? I've discovered this toolbox: http://www.advanpix.com/ Unfortunately it is commercial, but ...
For given matrix $A \in R^{n\times n}$, identity matrix $I$ and constant $c > 0$ is this possible to express $cond(A + cI)$ knowing $cond(A)$ and $c$?
I hope this is the right stackexchange for this question; if not, please direct me there! I'm on Linux. I've installed IPOPT and AMPL, and all the third-party stuff required: ASL, HSL, Lapack, Metis, Mumps. When I run the solver from AMPL with binary or integer variables, IPOPT converts them to continuous. Does anyone ...
I am wondering if you can answer a math question that I require answered for an evolutionary program that I am writing. With regards to the phenomenon known as the "space-time tradeoff" (wiki it) - what are the raw numbers for with regards to modern computers for this? IE - what advantages are gained by say - using a 2...
I am currently working on an evolutionary system and most of what I have heard is that a computer like mine at the moment would be able to simulate a bee sized brain (not taking into account the time needed to evolve it) What I am wondering about is what is the storage capacity/computations per second of a normal human...
I'm writing a program that uses PETSc and SLEPc, and I was looking for a convienient way to read in options from the command line. The description of PetscBagSetFromOptions() in the official documentation says it "allows setting options from a bag". Does this mean that if I create a bag with a variety of PetscFoo eleme...
Assuming that I am running Intel MKL (BLAS, LAPACK), is there any difference in performance if I run it on a 32 or 64 bit OS? (Of course, assuming that my hardware remains the same). My processor is a 64 bit Intel i3. But am currently running Debian 32 bit. (Long story why) Most of my work is shared memory paralleliza...
I want to use the sample average $(X_1 + .... X_n)/n$ as a substitute for the expectation $\mathbb{E}(X)$. As claimed by the weak law of large numbers, as n increases the sample average should converge to $\mathbb{E}(X)$. I wish to use this logic in my project, where the $X_i$ are iid exponential random variables. A s...
Can anyone recommend me a good workflow management system (WMS), preferably in Python? So far I have been using GNU Make, but it introduces a layer of complexity that I want to avoid. A good WMS should have the following features: integrate easily with command line tools and Python scripts, simple to use and lightweig...
I'm trying to design the frequency response function for a low-pass filter. I need the function to be polynomial and to fulfill the following constraints: the coefficients must sum to 1, the function must lie at the interval [0, 1] and its' value at 1 must be 1. Inspired by this StackExchange answer, I've tried to sol...
Do anyone know if there exist any widely used parallel computing programming paradigms/models not based on a master/slave concept?
I was looking at the documentation for PetscBagCreate(), and it says that The size of the A struct must be small enough to fit in a PetscInt; by default PetscInt is > 4 bytes. The warning about casting to a shorter length can be ignored below unless your A struct is too large. I assume that this means that a poin...
Given two matrices $A$ and $B$, I'd like to find vectors $x$ and $y$, such that, $$ \min \sum_{ij} (A_{ij} - x_i y_j B_{ij})^2. $$ In matrix form, I'm trying to minimize the Frobenius norm of $A - \mbox{diag}(x) \cdot B \cdot \mbox{diag}(y) = A - B \circ (x y^\top)$. In general, I'd like to find multiple unit vectors $...
Suppose that I'm working on a scientific code in C++. In a recent discussion with a colleague, it was argued that expression templates could be a really bad thing, potentially making software compilable only on certain versions of gcc. Supposedly, this problem has affected a few scientific codes, as alluded to in the s...
I am interested in the adjoint method for shape optimization problems. However, I couldn't find a helpful introduction. So I come here and look forward to some enlightening advices. Could you direct me to any textbooks, published papers or free online source course materials. And to clearify several things: I am famili...
Which software provides a good workflow from simple plotting of a few datapoints up to the creation of publication level graphics with detailed styles, mathematical typesetting and "professional quality"? This is a bit related to the question of David (What attributes make a figure professional quality?) but the focus...
what other recent sources of literature on this topic would you recommend? This is where I'm starting from: Leveque's article: HRIC scheme But the related articles seem to be a bit dated (some up to 20 years). Can anyone with experience with such higher order schemes suggest a direction in which I could search?
I am trying to write computer code which will find the energy and density function for a atom with Z protons and N electrons. I am working in 1D for simplicity and would like to make the overall code as simple as possible (I am using Hartree units aswell). I am using also using the Hartree approximation. This is my ove...
I know that we can use mathematical analysis techniques to prove if an IVP or BVP has a solution, is unique, and depends continuously on the boundary / initial values. For some PDE's, particularly non-linear pde's, it's very difficult, if not impossible, to prove well-posedness. Is there any kind of numerical techniq...
Is there a way, using some established Python package (e.g. SciPy) to define my own probability density function (without any prior data, just $f(x) = a x + b$), so I can then make calculations with it (such as obtaining the variance of the continuous random variable)? Of course I could take, say, SymPy or Sage, create...
I've been trying to use a PetscBag to read in a number of options I want to pass to a program I'm writing. Before I came across the documentation for PetscBag, I was planning on using a struct and a function that would take the struct and use PetscOptionsGetSometype() to set all the values in the struct. I figured that...
For instance, in MUMPS there is option to scale matrix s.t. all rows/columns have the same norm. This claims to decrease condition number and improve numerical properties of the matrix: ftp://cuter.rl.ac.uk/pub/reports/adruRAL2008013.pdf Can anybody explain whether it can be used as a preconditioner and how efficient w...
A bit of a strange question - but I am developing an application where speed is critical, not memory - I have the ability to blow up to 3 TB on the data storage that this application will use and I am wanting to use a space time trade off to increase processing speed. My reasoning goes as such - A compression algorithi...