instruction
stringlengths
43
28.1k
Let $T$ be a triangle and let $f$ be a smooth function on $T$. We can use mid-point quadrature $\int f dx \approx |T|\cdot f(x_M)$, where $x_M$ is the middle-point of $T$. Can you provide me with (a reference for) higher-order formulas on a simplex?
I am running a linear algebra iterative method (PCG) for solving Ax=b, the dimension of the matrix is 10000x10000. So, I did 2 preliminary analyses: Memory Analysis The size of the matrix dominates the total storage required. Thats about 1E4 x 1E4 = 1E8 elements of double precision which is approximately 0.8 GB of da...
I am working on an assignment where I am determining the temperature distribution of a chip on a substrate. When I decrease the nodal spacing the results change drastically. The smaller the nodal spacing the larger the temperatures i get. However when the nodal spacing is really small as in .00001m the temperature is n...
It was suggested I should try posting this question here from Mathematics Background I'm working on a numerical linear algebra package in C#. I'm trying to implement a variety of "principal pivoting" methods to solve optimization problems (specifically linear complementarity problems, but I think similar schemes are ...
Which is the fastest library for performing delaunay triangulation of sets with millions if 3D points? Are there also GPU versions available? From the other side, having the voronoi tessellation of the same set of points, would help (in terms of performance) for getting the delaunay triangulation?
I am doing research on the structure in the Schur complements and find an interesting phenomenon: Suppose that A is from 5--pt laplacian. If I use nested dissection ordering and multifrontal method to compute the LU factorization and then check the last schur complement block, it has low-rank for the off-diagonal block...
When memory bandwidth limited computations are performed in shared memory environments (e.g. threaded via OpenMP, Pthreads, or TBB), there is a dilemma of how to ensure that the memory is correctly distributed across physical memory, such that each thread mostly accesses memory on a "local" memory bus. Although the int...
I am not an xray crystallographer, but from what I've heard there's often a good deal of guess work and intuition involved in the process of fitting a ball-and-stick molecular model to a crystal-derived electron density map. This guess work tends to introduce a substantial amount of error into the the final set of atom...
I'm writing a petsc code using a sequential matrix type. Since I want it to be easy to parallelize, I put some stuff in the code that is useless now, but will make it easier to parallelize later. One of the things I added was MatGetOwnershipRange() to define the range of iterators that I'm using to build a matrix. The ...
The meta seemed to suggest that career advice is ok . . . so here goes. I have a couple of close friends in the ML and mathematical modeling fields just finishing PhD's and starting out on the job hunt. While both are quite qualified and talented, neither are interested in staying in Academia. Besides personal referr...
Basically the formulation of the problem I'd like to solve is very simple. Given 2 simple polygons (without self-intersections) report all intersecting edge pairs in O(n+k) time, where n - is a total number of edges, k - number of intersections between two polygons. It is very important to stay within mentioned time ha...
I've had a glimpse of Numerical Analysis (majorly, Numerical Methods like root finding, quadratic equations and other preliminary stuff) in my Calculus class but now, I find myself wanting more sophistication in my work. Is there a good book which will help me understand concepts such as stability of algorithms, desig...
I would like to master Inverse PDE Problems particularly with the use of Finite Elements. My problem is I don't know where to start. Should I begin by reading a book on Inverse Problems or on PDE-constrianed Optimization! Could I get some book recommendations and/or route to follow.
Suppose A is a general sparse matrix, and I want to compute the eigenvalues. I do not know how to detect the multiplicity for the eigenvalues. As far as I know, for a special case, finding the polynomial roots by companion matrix method, we can apply RRQR to detect the multiplicity for the roots.
I have a similarity matrix which is symmetric and sparse. How can I parallelize the computation of the eigenvalues of this matrix in MATLAB?
I have a class of matrices $A$ which are created by a domain decomposition method. Each matrix represents several subproblems of equal size, and I know that for some permutation matrix $P$, $PAP^T$ will be a block diagonal system, i.e. $$ A = \begin{bmatrix} A_1 & 0 & 0 \\ 0 & A_2 & 0 \\ 0 & 0 & A_3 \\ \end{bmat...
I have a job which stops unexpectedly with Exit_status=15. What is the most probable error ?
As far as I understand, the order in which non-blocking point-to-point MPI messages (Isend and Irecv) are received is consistent with the order in which they are sent. Are there any techniques for giving certain messages priority over others? For example, we have a multi-level algorithm in which the high resolution so...
Given the system $$Ax=b,$$ where $A\in\mathbb{R}^{n\times n}$, I read that, in case Jacobi iteration is used as a solver, the method will not converge if $b$ has a non-zero component in the null-space of $A$. So, how could one formally state that, provided that $b$ has a non-zero component spanning the null-space of $...
For a general matrix A, there are many properties to describe it: symmetric positive definite or indefinite, condition number, spectrum and so on. I am curious about how these properties affect the solving of matrix A for both direct method and iterative method like multigrid, krylov subspace methods. Thanks.
I have a Hermitian matrix $\mathbf{H}$ which depends on two parameters say $x$ and $y$. When I diagonalize it at two close points $(x_1,y_1)$ and $(x_2,y_2)$ I get two close eigenvalues ($\varepsilon_1$ and $\varepsilon_2$) and two corresponding eigenspaces ($S_1$ and $S_2$) of the same dimension. Note that they are n...
I'm trying to match items. Given a set of $n$ items I can rank on a scale from 0 to 100 of how similar they are to one another. For instance, if item $n_1$ is milk and item $n_2$ is also milk, then the similarity between $n_1$ and $n_2$ would be 100%. If $n_3$ is soda, then the similarity between $n_1$ and $n_3$ would ...
For computing the gradient of a scalar field, one can use the weighted least squares method as described in the paper Revisiting the Least-squares Procedure for Gradient Reconstruction on Unstructured Meshes by Dimitri Mavriplis (pg. 23). My question is: How can I reconstruct a gradient of a vector field? In the paper ...
I am new to programming and I am trying to solve my first big problem and write my first big program. I have looked for open source examples of code to learn from, but so far have only found code in languages I don't fully understand or that does related but still-too-distant things for me to really learn from. I am ha...
Suppose two Gram matrices are given $A, B\in\mathbb{R}^{n\times n}$, such that $$A=XX^T,~~~~~~~~~~~~~B=YY^T,$$ for some $X, Y\in\mathbb{R}^{n\times k}$, $k\ll n$. Also, suppose a Gram matrix based on linear interpolation $X+Y$ is denoted by $C=(X+Y)(X+Y)^T$. I'm aware that $$C=A+B+XY^T+YX^T,$$ but I wonder how I could ...
It was suggested that this might be a better place for this question than Mathematics Stack Exchange where I asked it before. Suppose one has a black-box function which can be evaluated anywhere (cheaply) on a specified interval $[a,b]$ and has no noise (except floating point granularity, say). What would be the best w...
The fact that the back substitution is not done in parallel is not important, because it uses a negligible amount of computer time when N is large, compared to the forward elimination. This is a citation from this book (page 204) when discussing the implementation of parallel solution of linear systems using Gaus...
I'm currently getting very long propagation times when attempting to use the Time Stepping propagators in Petsc 3.2, and in the interest of speeding things up, I'm curious how I can reduce the accuracy (or see what it is in the first place) to speed it up.
I'm trying to write a full SVM implementation in Python and I have a few issues computing the Lagrange coefficients. First let me rephrase what I understand from the algorithm to make sure I'm on the right path. If $x_1, x_2, ..., x_n$ is a dataset and $y_i \in \{-1, 1\}$ is the class label of $x_i$, then $$\forall i, ...
I can't seem to find any literature on algorithms which can be used to solve a many-to-many generalized assignment problem (GAP), i.e. models where not only can more tasks be assigned to one agent, but multiple agents can also be assigned to one task (one-to-one and one-to-many AP's are discussed in a paper by Pentico)...
Could the runtime of methods within a system potentially be reduced via refactoring during development (pre-public release)? i.e. Let's assume that methodX() takes 2 seconds to complete without having been refactored. It has been discovered that methodX() is suffering from severe code smells. After refactoring (for e...
We have a flow that is dominated by adhesion forces from the substrate and surface tension from the free surface. The material is nearly solid and at rest first, and gets a bit less solid by heating. So we have a creeping flow, which can be modeled by Stokes equation. Because of the difficulties in simulating the free ...
Hill climbing seems to be a very powerful tool for optimization. However, how to generate the "neighbors" of a solution always puzzles me. For example, I am optimizing a solution $(x_1, x_2, x_3)$. Here $x_1$ is in range $(0, 0.1)$, $x_2$ is in range $(0, 100)$, $x_3$ is in range $(0, 1000000)$. What's the best way to...
This is a follow up question to one I made previously about non-linear equations and ranged real numbers in Solver Foundation. I acknowledge that where possible, rewriting a problem that is non-linear into linear could avoid some issues, however it is likely for various reasons this won’t be a viable option. The requi...
There are numerous FD schemes for the advection equation $\frac{\partial T}{\partial t}+u\frac{\partial T}{\partial x}=0$ discuss in the web. For instance here: http://farside.ph.utexas.edu/teaching/329/lectures/node89.html But I haven't seen anyone propose an "implicit" upwind scheme like this: $\frac{T^{n+1}_i-T^{n}_...
I was wondering what differences and relations are between "search methods" and "optimization methods"? Especially when solving an optimization problem? I emphasize the context of solving optimization problems, because I guess search methods are not just for solving optimization problems, but also non-optimization pr...
For optimization, from Wikipedia: In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the problem being optimized and can s...
The paper "Expression Templates Revisited: A Performance Analysis of Current Methodologies" in SIAM Journal of Scientific Computing references the "Blaze" linear algebra library. I haven't heard of it before, and can't seem to find online references. (The obvious google searches are giving the above paper back.) So wh...
I am looking for recommendations for a C++ math library, with a permissive licence, well suited to calculating a wide variety of statistics on segmentations of timebased parameter data. I would be particularly interested in anything that can quantify properties of the curve shapes as well as the raw data set.
From Wikipedia: In computer science, hill climbing is a mathematical optimization technique which belongs to the family of local search. It is an iterative algorithm that starts with an arbitrary solution to a problem, then attempts to find a better solution by incrementally changing a single element of the so...
I was wondering if anybody had any suggestions for texts or survey articles on decomposition methods (e.g. primal, dual, Dantzig–Wolfe decompositions) for solving large mathematical programming problems. I liked Stephen Boyd's "Notes on Decomposition Methods", and it would be great to find for example a textbook that c...
I need to do a large number of matrix operations in Matlab, but one of the matrices is 4-D and my normal instincts for correct vectorization are failing me. Right now I'm using a loop. Maybe somebody can fix my dumb brain? for k=1:kNum for l=1:lNum L(k,l,:) = squeeze(M(k,l,:,:))\squeeze(P(k,l,:)); end end
How much slower is petsc4py vs c/c++/fortran? I realize it will depend significantly on the code being executed, but what about something simple like a matrix-vector product?
I have functions defined as follows: $f1(A) = \sum\|x_i-x_j\|_A = \sum\sqrt{(x_i-x_j)^TA(x_i-x_j)}$ and $f2(A) = \sum\|x_k-x_l\|^2_A$ where A is PSD matrix, x are number vectors. Task is to minimize function $f(A) = f2(A)$ subject to: $f1(A) \geq 1$ and $A \succeq 0$ . I can compute its gradient and hessian to use in N...
An Amazon EC2 compute cluster costs about \$800-\$1000 (depending on duty cycle) per physical CPU core over the course of 3 years. In our last round of hardware acquisition, my lab picked up 48 cores worth of hardware very similar to that of Amazon's clusters for about ~$300 a core. Am I missing something here? Are the...
From Wikipedia, assume that we have a function $M(x)$, and we want to solve the equation $M(x) = 0$. But we cannot directly observe the function $M(x)$, we can instead obtain measurements of the random variable $N(x)$ where $E[N(x)] = M(x)$. The Robbins–Monro algorithm is to solve this problem by generating iterates o...
The problem I'm currently working on a Finite Element Navier Stokes simulation and I would like to investigate the effects of a variety of parameters. Some parameters are specified in an input file or via a command line options; other parameters are provided as flags in a Makefile so my code has to be recompiled whenev...
Given some data points in 3D, $X\in\mathbb{R}^{n\times 3}$, could one say that $$Y=XP,$$ for some $P\in\mathbb{R}^{3\times 2}$ actually corresponds to a particular viewpoint on a 3D data? Basically, does any $P$ correspond to a viewpoint, which is a 2D projection? I'm trying to understand the relation, and I'm interest...
How to estimate $$\max_i |\mathrm{Arg}(-\lambda_i)|,$$ where $\{\lambda_i\}$ are eigenvalues of a large sparse matrix $A$ all lying in the left complex half-plane?
I am implementing the paper "Optimal Mass Transport for Registration and Warping", my goal being to put it online as I just cannot find any eulerian mass transportation code online and this would be interesting at least for the research community in image processing. The paper can be summarized as follows : - find an i...
What is the difference between MATSEQMAIJ and MATSEQAIJ in PETSc? Also, where can I find more information on each of the MatTypes? I went to the MatType documentation, but it didn't have anything but the definitions.
One of the major issues that we have to deal with in molecular simulations is the calculation of distance-dependent forces. If we can restrict the force and distance functions to have even powers of the separation distance $r$, then we can just compute the square of the distance $r^2 = {\bf r \cdot r}$ and not have to ...
I work in computational science, and as a result, I spend a non-trivial amount of my time trying to increase the scientific throughput of many codes, as well as understanding the efficiency of these codes. Let's assume I have evaluated the performance vs. readability/reusability/maintainability tradeoff of the software...
Trying to explain my problem better, I need to start with the diffusion Equation, which is the one that I am trying to solve. The Diffusion Equation \begin{equation} \dfrac{\partial u}{\partial t}=\dfrac 3 x\dfrac \partial{\partial x}\left(\sqrt x \frac \partial {\partial x}(\nu(T(u,x))u\sqrt x)\right) \end{equation} H...
I try to use the matlab fminunc functionality in java and found the optimisation functions in commons-math. I have absolutely no clue how to use them right because the example tells nothing about the usage of gradients or how to implement them. Can anybody show me some examples?
What I did is Create some PC named pc, and PCSetOperators(pc,A,A,..); Create KSP named ksp; KSPSetPC(ksp,pc); After the above process, am I still obliged to KSPSetOperators(ksp,A,A,..), or I can skip this? From the source code of Petsc, it seems I do not need. Just want to make sure. Thanks!
I am running molecular dynamics (MD) simulations using several software packages, like Gromacs and DL_POLY. Gromacs now supports both the particle decomposition and domain decomposition algorithms. By default, Gromacs simulations use domain decomposition, although for many years, until recently, particle decomposition...
What is the best platform for high performance computing (HPC)? Windows is long gone, I think. So only Unix and Linux stand the chance. What platform will strongly back my interest on computational mechanics? The application field is large dynamic FEM problem, the approach will be Multi-physics, Multi-scale modeling. C...
The conclusion here: How much better are Fortran compilers really? is that gfortran and gcc are as fast for simple code. So I wanted try something more complicated. I took the spectral norm shootout example. I first precalculate the 2D matrix A(:, :), and then calculate the norm. (This solution is not allowed on the sh...
In Octave, how do I specify that the solution to a matrix equation should be over integers? I.e., Given matrix $A$, vectors $x$ and $b$; $Ax=b$. Find vector $x=A^{-1}b$ such that all its entries are integers. While I'm primarily concerned with Octave, your answer may alternatively consider Wolfram|Alpha, or any other s...
I have to make a coordinates transformation between two reference systems (axes). For that, three matrices ($3\times3$) have to be multiplied due to some intermediate axes being used. I have thought about two approaches to resolve this: Method #1: Making the multiplication directly, that is, $$v_f = R_1\ R_2\ R_3\ v_i...
I'm trying to generate all graphs with n or fewer vertices that can be embedded in some lattice, eg square, triangular, Kagome. Do there exist algorithms to both enumerate and draw these graphs? What I am looking for is a technique to: Start with a listing of graphs (probably in adjacency matrix format) of size k From...
This is a simple symmetry enumeration problem. I give the full background here, but no knowledge of quantum chemistry is needed. The two particle integral $\langle ij|kl\rangle$ is: $$ \langle ij|kl\rangle = \int {\psi_i^*({\bf x})\psi_j^*({\bf x}')\psi_k({\bf x})\psi_l({\bf x}') \over | {\bf...
Given the function $\mathcal{M} = g + Ah + Bh^2$ where $A$ and $B$ are constants and $g$ and $h$ are random variables with their distributions $f_G(g)$ and $f_H(h)$ known, is it possible to compute the probability density function $f_\mathcal{M}$? We can obviously generate samples of it by creating realizations of $g$...
I'm making a simple eigenvalue solver with SLEPc, using a 5-point stencil and the finite difference method. I want to be able to assemble the matrix in parallel. My first thought was just to use MatGetOwnershipRange() to get range_begin and range_end, then use tests inside the loop to determine if that row represents...
Does matrix multiplication (both Mat*Mat, and Mat*Vec) scale with number of non-zeros, or with the size of the matrix? Or some combination of the two. What about with shape. For example, I have a 100 x 100 matrix with 100 values in it, or a 1000 x 1000 matrix with 100 values in it. When squaring these matrices (or mul...
Possible Duplicate: How to reorder variables to produce a banded matrix of minimum bandwidth? What is the time and space complexity of direct sparse solvers (e.g., UMFPACK, SUPERLU, PARDISO, etc.) for finite element matrices in 2D and 3D? How does the complexity splits into the creation of the inverse and the forwar...
In petsc, there are already SetValues(Local) methods. But when does one need GetArray methods? A related question: to copy a portion of a Mat/Vec to part of another Mat/Vec, it is usually suggested that one use a Scatter object. Is using scatter always better than the GetArray method?
When I think of solving non-linear equations, I generally think of linearizing first, then applying a preconditioner to the linear matrix. The thought occurred to me that it might be possible to condition the non-linear equations BEFORE they are linearized. Are there any general strategies to precondition non-linear ...
I have matrices $A$ and $G$. $A$ is sparse and is $n\times n$ with $n$ very large (can be on the order of several million.) $G$ is an $n\times m$ tall matrix with $m$ rather small ($1 \lt m \lt 1000$) and each column can only have a single $1$ entry with the rest being $0$'s, such that $G^TG = I$. $A$ is huge, so it is...
For a project I am working on (in hyperbolic PDEs) I would like to get some rough handle on the behavior by looking at some numerics. I am, however, not a very good programmer. Can you recommend some resources for learning how to effectively code finite difference schemes in Scientific Python (other languages with sma...
I have a bounded non-convex 2-D function which I'd like to find the minimum of. The function is quite smooth. Evaluating it is costly. An acceptable error is about 3% of the function's domain in each axis. I tried running the implementation of the DIRECT algorithm in the NLOPT library, but it didn't give a considerable...
Anyone knows references summarizing the history and ideas behind supercomputing including mentioning of developments in parallel programming languages, applications, startup companies (some was establish but didn't survive), needs of industry, etc.
As much as I try to find a concise explanation on the internet, I can't seem to grasp the concept of a mimetic finite difference, or how it even relates to standard finite differences. It would be really helpful to see some simple examples of how they are implemented for classic linear PDE's (hyperbolic, elliptic and ...
I am interested in the solutions of a very large quadratic programming (QP) problem \begin{align} \min_{x \in \mathbb{R}^n} & x^T Q x\\ \mathrm{subject\ to} & A x = b\\ & x \in \{0,1\}^n \end{align} where $n=10^7$, $Q$ is a dense, positive-semidefinite matrix whose entries are natural numbers that can be computed rapid...
I have a $p \times n$ matrix $B$ (where $n < p$) with orthonormal columns and would like to find a numerically efficient way to extend this matrix to get a complete $p$-dimensional orthonormal basis. In other words I want to compute a $p$ by $p-n$ complementary matrix $W$ so that $[B|W]$ is orthonormal. At the momen...
I have a PetscBag in my program that I want to write to a filename I have stored as a string. If I want to write to stdout, there is a pre-made PetscViewer macro for that. How do I create a viewer for a PetscBag that writes to a specified file?
My challenge is to solve the following system of equations, which describe gas combustion in porous media: 1) Continuity $\varepsilon \frac{\partial \rho_g}{\partial t} +\frac{\partial}{\partial x} \left(\rho_g u_x\right)=0$ 2) Darcy law (momentum) $u_x=-\frac{k}{\mu} \frac{\partial p}{\partial x}$ 3) Equation of state...
I'm looking at using OpenFOAM for solving basic internal flows in CFD. What is the best way to get started, and could anyone please point me to a good online reference to go to with any questions I might have once I dive in? I've heard that it is quite niche as of now and many solver functions are not that well documen...
when optimizing my code, i find myself often writing something like the following ... do i = 1,n r = t(i) y(i) = r*r*2.0 f(i) = r*3.5 enddo what i am doing with my variable, r is really irrelavent except that it is used more than once, and is most likely used as many as 5 or 6 times. now, in my head, i do ...
Suppose a 3D configuration of points is given, $X\in\mathbb{R}^{n\times 3}$, and a matrix $Q\in\mathbb{3\times 2}$, with orthonormal columns. Now, suppose a mapping to 2D is obtained as $$Y=XQ.$$ Could it be safely assumed that $Y$ simply corresponds to a rotated or reflected configuration $X$ restricted to first 2 axe...
When we calculate products of multiple matrices, e.g., $ABC$, do you think it can be done in a cheaper way than as two consecutive multiplications? Note that I'm not talking about applying matrices to vectors but exactly matrix multiplication.
I am very interested in computational physics and it is great lot of fun studying these topics. Since I am planning to go one semester abroad, I was wondering what universities are known for computational physics? Especially in regard to universities in the USA? I am aware that computational physics is not a huge and i...
If there are any COMSOL gurus here, I want to simulate a 3D RF system infinite in 1 direction. I realize I need to use PML's, but am unsure how to configure them. it seems that simply scaling them by lambda isn't enough - anyone know if I need to configure the material itself in a special way? Thanks! EDIT: I want to s...
I know of, and have used f2py2e to wrap some old Fortran 77 code, but my understanding is that it does not work with newer Fortran 95 code. I've researched what I should use, and have come across fwrap and G3 f2py, neither of which seem to give any explanation of their current state, or how to use them (beyond basic us...
I'm trying to solve $Ax = b$ given a vector $b$ and a large, symmetric positive definite, sparse, banded matrix $A$ that has a very poor condition number. I know several iterative methods that could be used for this task (but haven't implemented them all): a) (Preconditioned) Conjugate Gradient. b) Simple Gradient De...
Summary: Are there good algorithms for out-of-core dense matrix transpose if each row of the matrix is separately compressed? Details: The matrix is about 1 TB uncompressed, and is roughly but not exactly square. An uncompressed row is less than 6 MB, so many of them fit in RAM at once. On disk, I would like to separ...
Assume that we have generalized eigenvalue problem: $B^HB\textbf{x} = \lambda A\textbf{x}$ where $A$ is an nxn Hermitian sparse matrix (n is very large, so we do not have $A^{-1}$ but can solve using iterative methods) and full-rank, and $B$ is a 2xn matrix such that $B^HB$ is also nxn but only rank 2. Thus, we know th...
I have sets of multipoint field data, each point data set relates to a single cell of an unstructured mesh. The goal is to interpolate the data to the cell centre, directly or indirectly, in the most accurate way. If I use Inverse Distance Weighted interpolation, in the case when the distance between the source and th...
what would be good methods (and/or software packages) to try for solving a problem minimizing a quadratic function $f(x) = \sum_{i=1}^N{(x_i - y_i)^2}$, s.t. $0 \leq x_i \leq 1$, and there are more constraints some of which are non-linear (and non-differentiable), e.g. $\sum_i x_i \mathbf{1}_{x_i>a} < b$ ? I am thinki...
In PETSC, there are many xxxSetyyy methods, e.g. MatSetLocalToGlobalMapping(A,rmap,cmap). I wonder whether contents of rmap and cmap (or generally yyy, that set to xxx) pointing to are copied to somewhere in A (or xxx). In other words, shall I destroy 'yyy' after set to 'xxx' or I should not before finish using 'yyy'...
What is the best software for quickly implement and test a Reynolds Averaged Navier-Stokes turbulence model ?
I am currently developing structural FEM solver in FORTRAN. My question is about Rigid Body Elements (Multi Point Constraints). In NASTRAN there is RBE2 element defined by one independent and one or more dependent nodes. Given degrees of freedom of the independent nodes, defined by the user, are rigidly transferred to...
I am attempting to solve an equation of the type: $ \left( -\tfrac{\partial^2}{\partial x^2} - f\left(x\right) \right) \psi(x) = \lambda \psi(x) $ Where $f(x)$ has a simple pole at $0$, for the smallest $N$ eigenvalues and eigenvectors. The boundary conditions are: $\psi(0) = 0$ and $\psi(R)=0$, and I'm only looking a...
I am doing a text classification task with R, and I obtain a document-term matrix with size 22490 by 120,000 (only 4 million non-zero entries, less than 1% entries). Now I want to reduce the dimensionality by utilizing PCA (Principal Component Analysis). Unfortunately, R cannot handle this huge matrix, so I store this ...
suppose solving sequential generalized eigenvalue problems $$A_i x= \lambda Bx, i=1,2,3,\ldots $$ In general setting, we always need to perform LU for matrix B (preconditioned) before to apply the rest iterative algorithm. Is there a numerical library(I have programming experiences with PETSc+SLEPc) or a toolkit that c...
I've spent the last couple of months on coding a Fortran program for solving a particular PDE system (describes fluid flow/combustion). I tryed to use latest-standard Fortran and the new OOP capabilites modern Fortran has. I am working on my own and have no Fortran guru beside me to ask questions, so a nataral way to l...
For the purpose of model fitting in a large time series dataset, I am using stochastic gradient descent of the negative log likelihood. The model is nonlinear and non-convex. Is there a thumb rule for choosing a good step size? I could choose a very small step size for stable but painfully slow convergence, but I would...
I am trying to rewrite some MATLAB/Octave code in Python, and I don't know what would be the nicest or most intuitive way of writing octave:10> dt = 0.1; octave:12> T = 0:dt:1 T = 0.00000 0.10000 0.20000 0.30000 0.40000 0.50000 0.60000 0.70000 0.80000 0.90000 1.00000 octave:15> dt = 0...
I have a question about the memory usage within the graphics card. What does happen when the used application needs more memory than the graphic card does contain? let`s say the reserved main memory is also not enough. The scenario I am talking about is something like: Consider a graphics card with, let's say, 50 MB me...