instruction stringlengths 43 28.1k |
|---|
This may be a Petsc newbie question, but...
I'm using Petsc to solve a large sparse linear system. The initial creation of the matrix is fairly slow, which I'm given to understand is largely due to memory allocations; that's tolerable for the moment. My problem is that as the simulation progresses, the structure of my ... |
I am looking for information from anyone that has tried to use OpenCL in their scientific code. Has anyone tried (recently) ViennaCL? If so, how does it compare to cusp?
What about OCLTools? Does it live up to the promise? If so, would it be a feasible way to start writing math kernels in OpenCL?
|
I'm looking for C/C++ implementations of functions that return random variates multinomial and Dirichlet distributions. This is in the context of a calculation for posterior predictive p-values, part of which includes a MCMC step. I've been using Python, but am rewriting parts of my code in C++ for speed reasons. I've ... |
When solving sparse linear systems using direct factorization methods, the ordering strategy used significantly impacts the fill-in factor of non-zero elements in the factors. One such ordering strategy is nested dissection. I am wondering if it is possible to come up with the nested dissection ordering ahead of time g... |
I am trying to integrate
$$\int^1_0 t^{2n+2}\exp\left({\frac{\alpha r_0}{t}}\right)dt$$
which is a simple transformation of
$$\int^{\infty}_1 x^{2n}\exp(-\alpha r_0 x)dx$$
using $t = \frac1{x}$ because it is difficult to numerically approximate improper integrals.
This does, however, lead to the problem of evaluating t... |
If we employ the Method of Lines for discretization (separate time and space discretization) of hyperbolic PDEs we obtain after spatial discretization by our favorite numerical method (fx. Finite Volume Method) does it matter in practice which ODE solver we employ for the temporal discretization (TVD/SSP/etc)?
Some add... |
Developers of software have the choice to choose an appropriate license in accordance with the goal(s) of the work.
Can anyone give some recommendations/experiences on which license to pick for software?
What are the pros/cons of "giving away" all the coded work as open source codes?
How to deal with industrial players... |
I would like to visualize a molecular vibration that is not a normal mode. I'd like to present a static, vectorial representation of the motion, and I would like some flexibility in the vector style (size, color etc). I'm also interested in producing a video of the vibration.
What are some good resources for displayin... |
Is it possible to apply Richardson extrapolation with Euler-Maruyama scheme to improve strong rate of convergence of stochastic differential equations?
|
I'm not running any parallel code right now, but I anticipate running parallel code in the future using a hybrid of OpenMP and MPI. Debuggers have been invaluable tools for me when running serial projects.
Can anyone recommend a parallel debugger (or multiple debuggers) to use for debugging parallel software? Free soft... |
To do some calculation on QCD on Lattice, I needed a Monte Carlo multi integration. I wrote a a C++ program according to what I understood from the paper “ Lepage (1978) “ A New Algorith For Adaptive Multidimensional Integration” SLAC_Pub_1839 November 1976” The results I got, however, were not accurate, so I copied t... |
I hope this is on topic, I found this through the proposal here:
https://area51.meta.stackexchange.com/questions/320/shall-we-unite-computational-science-proposals
A good visual description of BOW:
I don't quite understand the point of some of the steps here however. I know feature extraction gets some form of unique ... |
My thesis is on developing numerical methods for model reduction in combustion. I run my methods purely on the chemistry part of combustion simulations, and I have plenty of case studies for 0-D simulations (no flow). What I would like is to run simulations that do have flow in them, preferably 2-D or 3-D simulations.
... |
The cluster I work on has a filesystem labelled as "fast" with no further explanation. But the filesystem type is "lustre", which strongly hints at a Lustre filesystem. While general information about this file system type is easy to find, I have not been able to find any information about how to get the most performan... |
What is the convergence rate for Monte-Carlo variance estimate for a random variable $X \in {L^q}(\Omega ,R),2 < q < 4$?
|
I am trying to fit some raw data using a function of the form
$f(r) = \sum_{i=1}^{K} d_kS_k(n_k,\alpha_k,r)$
where
$S_k(n_k,\alpha_k,r) = \frac{\alpha_k ^{n_k+3}}{(n_k+2)!}r^{n_k}\exp(-\alpha_kr)$
(note that the actual fit function is far more complex).
Now, for each $k$, this has two non-linear parameters ($\alpha_k$ ... |
I'm planning to use multigrid to calulate some eigenvalues and vectors, and I noticed PETSc has high-level support for multigrid. The PETSc documentation says that this part of PETSc should not be used, as it is being replaced soon.
Which other libraries have high-level support for multigrid, and roughly how soon will... |
I'm preparing for a thesis in computer science on calculations based on concepts from Neuroelectrodynamics.
In short this theory states, that information transfer is not done by spike time coding, but by movement of electric charges. Also this charges affect (and get affected by) proteins in the brain cells, so the cel... |
For example, I would like to numerically compute the $L^2$-norm of $\displaystyle u = \frac{1}{(x^2+y^2+z^2)^{1/3}}$ in some domain that includes zero, I tried Gauss quadrature and it fails, it is kinda far from the real $L^2$-norm on the unit ball using spherical coordinates to integrate, is there any good way to do t... |
I know that most methods of finding approximate solutions to PDEs scale poorly with the number of dimensions, and that Monte Carlo is used for situations that call for ~100 dimensions.
What are good methods for efficiently numerically solving PDEs in ~4-10 dimensions? 10-100?
Are there any methods besides Monte Carlo t... |
I'm working on a machine with a version of PETSc compiled by someone else. Is there a straightforward way to find out which options were used at compile time from the installation itself? For example, is there a file that has all of the compile time options that is generated by make?
|
The qsub command which submits PBS jobs has a -p option that allows you to set the priority. From the man page:
Defines the priority of the job. The priority argument must be a integer between -1024 and +1023 inclusive. The default is no priority which is equivalent to a priority of zero.
And that's all that is in ... |
As far as I can tell, the two big generic US Department of Energy computational science software frameworks are PETSc and Trilinos. They seem similar at first glance, beyond differences in language (C versus C++). What are the main differences between the two frameworks, and what factors should influence choosing one ... |
I want to get started on scientific programming on the Mac using Objective-C. I am very familiar with MATLAB which makes it easy to store complex-valued waveform data in vectors and generating plots. I was wondering if there might be a good resource that might compare how you would implement common MATLAB operations ... |
Sometimes it is useful in my work to modify someone else open-source code or find out how to develop specific things for your own application. However, not all software have good documentation.
What is a good way to understand the overall structure of a code base?
For example, which routines calls which routines, etc. ... |
There are several correspondences between matrices and graphs, e.g., each matrix is the adjacancy matrix of a weighted graph. The terms support preconditioner or combinatorial preconditioner refer to preconditioners which have been designed using graph theoretical tools that rely on these correspondences.
It certainly ... |
Standard finite difference formulas are usable to numerically compute a derivative under the expectation that you have function values $f(x_k)$ at evenly spaced points, so that $h \equiv x_{k+1} - x_k$ is a constant. What if I have unevenly spaced points, so that $h$ now varies from one pair of adjacent points to the n... |
What would you say would be the advantages/disadvantages of two approaches to coding a general (finite volume, fem, dg) library for Computational Continuum Mechanics? This is how I see things right now, so please provide your own experiences and don't flame me for mine :) :
1) C++:
generic programming, virtual functi... |
I'm learning PETSc and trying to make the examples written in C. However, when I use the provided makefile, I get the following error:
/usr/bin/ld: cannot find -lmkl
When I check in the mkl/lib directory, I find that none of the .a or .so files are called libmkl.
Do I need to recompile PETSc to have the built-in make... |
I'm working with the OpenFOAM C++ Computational Continuum Mechanics library (it can deal with fluid-solid interaction, MHD flows...) which uses arbitrary unstructured meshes. This was driven by the idea of using the advantage of fast generation (automatic usually) of unstructured meshes to simulate problems in complex ... |
Is there an $O(n^3+n^2 k)$ method to solve $k$ linear systems of the form $(D_i + A) x_i = b_i$ where $A$ is a fixed SPD matrix and $D_i$ are positive diagonal matrices?
For example, if each $D_i$ is scalar, it suffices to compute the SVD of $A$. However, this breaks down for general $D$ due to lack of commutativity.
... |
What considerations should I be making when choosing between BFGS and conjugate gradient for optimization? The function I am trying to fit with these variables are exponential functions; however, the actual objective function involves integration, among other things, and is very costly if that helps at all.
|
What can go wrong when using preconditoned Krylov methods from KSP (PETSc's linear solver package) to solve a sparse linear system such as those obtained by discretizing and linearizing partial differential equations?
What steps can I take to determine what is going wrong for my problem?
What changes can I make to succ... |
We have a 3D (volume) unstructured, possibly hybrid, degenerative irregular mesh data structure that we are capable of generating (mostly composed of hexahedra and general polyhedra, using a mix of CSG and b-rep) and a set of triangulated surfaces that we know intersect the mesh. We would like to split the volume mesh ... |
I am looking for a reference - paper, book, discussion, anything that has a mathematical proof for stability of the conjugate gradient method in floating point arithmetic.
Something similar for modified Gram-Schmidt would be as good.
Does anyone have any suggestions?
|
Given a real function of real variables, is there software available that can automatically generate numerically-accurate code to calculate the function over all inputs on a machine equipped with IEEE 754 arithmetic?
For example, if the real function to be evaluated were:
The software would consider catastrophic cance... |
What is the best (scalability and efficiency) algorithms for generating unstructured quad meshes in 2D?
Where can I find a good unstructured quad mesh-generator? (open-source preferred)
|
This question arises from the need I have to prepare a lesson on the limitations of Density Functional Theory as a computational approach. I would like to know not only the limitations, but also reference texts I can use to prepare a more appealing and complete lesson.
Thanks
|
This is mostly aimed for elliptic PDEs over convex domains, so that I can get a good overview of the two methods.
|
I am looking to solve a constrained optimization problem where I know the bounds on some of the variables (specifically a boxed constraint).
$$ \arg \min_u f(u,x) $$
subject to
$$ c(u,x) = 0 $$
$$ a \le d(u,x) \le b $$
where $u$ is a vector of design variables, $x$ is a vector of state variables, and $c(u,x)$ is an equ... |
Right now I have a code that uses the Crank-Nicholson algorithm, but I think that I would like to move to a higher-order algorithm for timestepping. I know that the Crank-Nicholson algorithm is stable in the domain I want to work in, but I am concerned that some other algorithms may not be.
I know how to calculate the ... |
I am using backward Euler in a FEM scheme for a convection-diffusion problem. On a given mesh, I can take arbitrarily large time steps, as expected. But if I decrease time step, at some point it will generate oscillations in the solution (spikes). Is this a known behavior? It's not mentioned in text books, at least the... |
In my physics class, I had to calculate the trajectory of a projectile that was fired (very fast) with $v_0$ in an angle off a planet (radius $R$, mass $M$) from the surface. The projectile would reach a maximum distance and start to circle around the planet. The question was whether it would hit the planet. We solved ... |
Back towards the dawn of OS X, there seemed to be a great deal of hubbub, at least in the Mac world (I was nowhere near scientific computing at the time) about the Mac OS as a platform for scientific computing and HPC applications.
XGrid came out of the box, Virginia Tech had their fancy Mac-based computing cluster, St... |
Is it possible to get second order accuracy for hexahedral finite elements with fewer than 8 Gauss points without introducing unphysical modes? A single central Gauss point introduces an unphysical shearing mode, and the standard symmetric arrangement of 8 Gauss points is expensive compared to tetrahedral discretizati... |
Moore's law states that the number of transistors on an integrated circuit grow exponentially, roughly doubling at a period of 20 months. This affects the amount of memory available and the speed of computation, which roughly double at the same rate.
This also affects the speed of floating-point computation, if the pre... |
I'm looking for the algorithm of Preparata and Supowit for testing a simple polygon for monotonicity in linear time.
I've found it referenced in many textbooks but I can't find the algorithm itself.
Here's the information on the original article:
http://md1.csa.com/partners/viewrecord.php?requester=gs&collection=TRD&r... |
For the final project in my computational physics class, I've built and will be presenting results for monte carlo simulations of phase transition in the three dimensional ising model. Using the metropolis algorithm, I've been able to graph the magnetism of the system after a long period of evolution against different ... |
Suppose we have an element in the polar coordinate as $0\leq r\leq 1$, $0\leq\theta\leq \alpha$. What are the correct basis functions in this element? For this kind of mesh, there
are a lot of references on finite difference discretization. But I can not find a fem solution.
|
Consider $Ax=b$ with $A$ nearly singular which means there is an eigenvalue $\lambda_0$ of $A$ that is very small. The usual stop criterion of an iterative method is based on the residual $r_n:=b-Ax_n$ and regards the iterations can stop when $\|r_n\|/\|r_0\|<tol$ with $n$ the iteration number. But in the case we are c... |
I'm thinking a bit about the Front Tracking method used for simulation of Two phase flow with sharp interfaces. The literature tells me that the main issue is the surface mesh representation (operations + container) of the fluidic interface.
Does anyone here know about a good C++ library for dynamically (truly dynamic... |
There is at least one quite comprehensive encyclopaedia of quadrature rules that doesn't seem to have been updated in quite a while and has restricted access. This source refers to several classical and modern sources, and generally is well put together. However, it approaches the construction of quadrature rules fro... |
I am trying to put together a complete list of all of the tools that computational scientists have found useful when trying to munge data, i.e. take data in one format, extract the useful bits, and put it into a different format.
So what are the libraries that you've used in the past to obtain data from fixed-width, CS... |
I read this answer, and realized I have been using the difference between sucessive iterates to define a stop criterion for an iterative method of finding eigenvalues/vectors.
What are good stop criteria for iterative methods that converge to eigenvalues and eigenvectors?
|
The Fast Fourier Transform algorithm computes a Fourier decomposition under the assumption that its input points are equally spaced in the time domain, $t_k = kT$. What if they're not? Is there another algorithm I could use, or some way I could modify the FFT, to account for what is effectively a variable sampling rate... |
For some simple convex domain $\Omega$ in 2D, we have some $u(x)$ satisfying the following equation:
$$
-\mathrm{div}(A\nabla u)+cu^n = f
$$
with certain Dirichlet and/or Neumann boundary conditions. To my knowledge, applying Newton's method in a finite element space would be a relative straightforward way to numeric... |
I am currently researching on the viability of using KS methods for solving large dense systems. What I wish to prove (or disprove) is that methods like CG, BiCG and QMR are as good (if not better) than the generic LU or QR decomposition methods in place today.
Till now I have tried non-preconditioned versions of CG on... |
Concurrent to my research on Krylov Subspace Methods, I have the option of exploring mathematics behind HPC a step ahead or the theory of computation (hardware, OS, compilers etc.).
Currently, I know both enough to just get by. For instance, I know how to derive the equations for CG and the basics of iterative methods... |
I have a set of files consisting of randomly selected points from a dataset, each file belonging to a particular class. Each row in these files contains the coordinates in n-space of the point. I'd like to compare the distributions in n-space of each of these files - and am inspired by the K-S test for comparing hist... |
I am looking for some clues for an optimization problem.
My problem consists of arriving to a image by optimizing multiple layers with the pixel position probability.
This is an overview of the problem:
The first image on the left is a zoom of the greyscale image with only two grey values, followed by the probability ... |
Indefinite systems of matrices appear for example in the discretization of saddle point problems by mixed finite elements. The system matrix can then be put in the form
$$\begin{pmatrix} A & B^t \\ B & C\end{pmatrix}$$
where $A$ is negative (semi)-definite, $C$ is positive (semi-) definite and $B$ is arbitrary. Of cour... |
I have a question. I need to calculate the computational complexity of image segmentation algorithms. Can anyone please help me?
For example, I have a screen-size picture with white background containing k randomly-positioned black objects with random sizes (between 90*90 to 110*110) in it. I am going to calculate how... |
Background and question
I often work with simulations of dynamical systems and I usually track a single parameter $x$, such as the number of agents (for agents based models) or the error rate (for neural networks). This parameter usually has some interesting transient behavior. The type and length of this behavior depe... |
Considering regular matrix approximation inequality
|| $A - QQ^TA $|| < e
where we try to approximate matrix $A$ by a lower rank orthonormal matrix $Q$. I've read an article on probabilistic algorithms for such an purpose. You simply pick random (Gaussian etc.) vectors $\omega$, then generate vectors from the range of ... |
Many important problems can be expressed as a mixed integer linear program. Unfortunately computing the optimal solution to this class of problems is NP-Complete. Luckily there are approximation algorithms that can sometimes provide quality solutions with only moderate amounts of computation.
How should I analyze a pa... |
Suppose I have a scan from an STM image (very much like the things you see here). Suppose I have a simple square lattice with lattice parameter a.
What I'd like to do is to numerically find the lattice parameter, measured in units of pixels, assuming that calibration is done elsewhere.
A first idea of mine was to hav... |
There are many different linear solvers, some which work best for diagonally dominant matrices, some for symmetric, some for positive definite ones, some for banded matrices, etc... There are direct methods, iterative methods, Krylov space methods, etc... Is there a good heuristic to choose a linear solver that scales ... |
Software is a fundamental part of computational science, and is increasingly recognized as an essential part of the scientific record. Given the value of using existing and well-tested code, it seems worthwhile to communicate the existence of useful codes as widely as possible and credit their creators. In an academi... |
Scholarly papers in scientific computing (and many other fields, nowadays) typically involve some amount of code or even whole software packages that were written specifically for that paper or were used to obtain results in the paper. What is the best way to help readers of the paper access the code? My current appr... |
I have a fortran 90 code that distributes blocks of computations (from a matrix) to multiple nodes in a cluster using MPI, but in each node, the for loops are executed in parallel using openmp. I tried using the following command:
mpif90 mycode.f
which produces the following output:
mycode.f(49): (col. 3) remark: LOO... |
I have taken a basic introduction to Finite Element Method, which did not emphasize a sophisticated understanding of a 'weak formulation'. I understand that with the galerkin method, we multiply both sides of the (elliptical) PDE by a test function and then integrate (by parts or by Divergence theorem). Sometimes, I ... |
Can anybody help me to find the books on numerical solutions(finite difference and Crank–Nicolson methods) of Poisson and diffusion equations including examples on irregular geometry, such as a domain consisting of the area between a rectangle and a circle (especially books or links on MATLAB code examples in this case... |
Suppose I have a black and white image (composed of binary pixel values in a 2D cartesian array) that contains an irregular, nonconvex shape. Let's further suppose that the shape is one connected region. Instead of storing each individual pixel location (which may be too costly for very large images), I want to repre... |
To use the Fast Fourier Transform (FFT) on uniformly sampled data, e.g. in connection with PDE solvers, it is well known that the FFT is an $\mathcal{O}(n\log(n)$) algorithm. How well do the FFT scale when processed in parallel for $n\to\infty$ (i.e. very large)?
|
Which is computed faster, $a^b$ or $\log_a c$ or $\sqrt[b]{c}$? $a$, $b$ and $c$ are positive reals with $b>1$.
What kinds of algorithms will you use in the comparison? What are their complexities?
For example, when $c \equiv a^b$ or $c \approx a^b$
This question was inspired by the comments on the Mathematics stack e... |
In an application I have to solve a series of positive definite linear systems of the form $A^TA x = A^Tb$ (i.e. normal equations). The next system is obtained from the previous one by adding and/or removing a small number of columns to $A$ (usually one or two). The vector $b$ stays the same throughout. It seems clear ... |
I'm looking to use the finite element method with B-splines as my function basis. Which C/C++ libraries have good B-spline support?
Specifically, I'm looking for an implementation of a stable algorithm, even if it's slow. I plan to precompute a lot of the inner products I need and store them in a file somewhere if the ... |
My question is related in spirit to "Is algorithmic analysis by flop counting obsolete?". Counting the number of computational operations in an algorithm is commonly used as a first-order model to aid in understanding the computational costs of an algorithm. However, the unit cost (in, say, time per operation) of data... |
Reproducible research in computation aims to make the code needed to generate the results in a computational paper available to other researchers so that they can run this code to reproduce the results in that paper. I'd like to make all of my research reproducible, but I'm running into a bit of a snag: a couple paper... |
I have a Mathematica program which performs some integrals in 3 or 4 dimensions using the QuasiMonteCarlo method. The problem is, it takes an annoyingly long time to run, to the point where some of these calculations can't complete in the maximum job time available on our HPC cluster. So I'm considering rewriting the p... |
Does anybody know of an implementation of Nédélec elements that does not come along with a huge bulk of additional software?
Is there a small library written in a language like Python, Matlab, or Octave? The only implementations I know of are part of larger FEM libraries which are too difficult to learn for the sole pu... |
What numerical analysis situations become more/less stable, have faster/slower convergence, or are otherwise quite different when dealing with functions of complex variable instead of functions of a real variable?
|
I have heard that one of the current goals in scientific computing is to surpass the exascale level by 2018 or so... After having passed the petascale a few years ago, one would think that the exascale wouldn't be so much of a challenge... If it's theoretically possible, what challenges are there to computing at this s... |
I know that delaunay triangulation can be extended into arbitrary dimensions by solving the convex hull problem in $(p+1)$ dimensions and projecting the lower hull into dimension $p$ to obtain a mesh in dimension $p$. However, this approach is asymptotically $\Omega({n}^{{p}/{2}})$. I was wondering if there are any o... |
I have always been told that the Voronoi diagram is the dual of the Delaunay triangulation problem. In what sense can they be duals of each other? I thought that dual problems (i.e. in linear programming) are supposed to produce the same answer. Clearly, the two problems do not have the same solution. How can we cons... |
As I understand it, since a solution to a linear program always occurs at a vertex of its polyhedral feasible set (if a solution exists and the optimal objective function value is bounded from below, assuming a minimization problem), how can a search through the interior of the feasible region be better? Does it conve... |
I have heard that some journals are rated more highly than others. Is this true? And if so, what are the criteria for judging the value of one peer reviewed journal over another? How do I find out its rating? Will my publication be of less "worth" if it is accepted in a less reputable journal than, say, the SIAM Rev... |
Suppose i was trying to solve a parabolic PDE (heat equation) on a rectangular domain using an explicit finite difference scheme. I am storing my solution vector in a matrix form (because it closely resembles the shape of the domain). I know that I can break the matrix into rectangular blocks and send information acr... |
I have a data set $x_{1}, x_{2}, \ldots, x_{k}$ and want to find the parameter $m$ such that it minimizes the sum $$\sum_{i=1}^{k}\big|m-x_i\big|.$$
that is
$$\min_{m}\sum_{i=1}^{k}\big|m-x_i\big|.$$
|
Suppose I had the following problem:
$U_{tt}=U_{xx}+U_{yy}$ in $\Omega=[0,1]\times[0,1]$
$U(x,y,0)=f(x,y)$
$U_{t}(x,y,0)=g(x,y)$
$U=0$ on $\partial \Omega$
I know that there is an explicit finite difference scheme to solve this problem of the form:
$\frac{U(i,j,k+1) - 2U(i,j,k)+U(i,j,k-1)}{\Delta t^2} = \frac{U(i+1... |
As I understand it, the multigrid method solves a linear system by solving a coarser version of the same problem (there by eliminating low frequency error) then projecting back to the fine grid to smoothen out the high frequency errors. For large systems, i can see how an iterative method can be implemented in paralle... |
I am trying to solve a linear system of equations that is sparse, but lacks any kind of banded structure. I have heard that there is a way to extend the principles of a multigrid solver for implicit finite difference schemes to a general linear problem (if I'm not mistaken, it's called algebraic multigrid solver). Af... |
I'm trying to create a figure of particle distribution from a reference surface in python. I plan to get a distribution in python and then prettify it with tikz. I tried this:
xs = np.linspace(-1, 1, 10)
ys = np.linspace(-1, 1, 10)
X, Y = np.meshgrid(xs, ys)
Z = X
for i in range (0, 10):
for j in range (0, 10):
... |
I need instructions on how to install a binary package in R.
|
As far as I am aware, multigrid solvers use iterative smoothers such as Jacobi, Gauss-Seidel, and SOR to dampen the error at various frequencies. Could a Krylov subspace method (like conjugate gradient, GMRES, etc.) be utilized instead? I don't think they are classified as "smootheners", but they can be used to appro... |
I am looking for reasonably fast implementations of the discrete Fourier transform (DFT) on a 2D triangular or hexagonal lattice.
I would appreciate pointers to such implementations (especially ones easily usable from Python or Mathematica), and also to descriptions of how to reduce this problem to the 1D DFT, which is... |
As I understand it, successive over relaxation works by choosing a parameter $0\leq\omega\leq2$ and using a linear combination of a (quasi) Gauss-Seidel iteration and the value at the previous timestep... that is
${u}^{k+1} = (\omega){u_{gs}}^{k+1} + (1-\omega)u^{k}$
I state 'quasi' because ${u_{gs}}^{k+1}$ include... |
I have a list of vertical cut planes, and I have a polygonal mesh ( it's a 2D+0.5D mesh, something like a 2D mesh with an extra dimension, $z$ attached to each point). One can assume that the mesh contains vertices $V$ , edges $E$ and face $F$.
The mesh is a real life 3D terrain.
Now, given a list of vertical cut plane... |
Adaptive mesh refinement (AMR) is a common technique for dealing with the problem of widely varying spatial scales in the numerical solution of PDEs. What general-purpose libraries exist for AMR on structured grids? Ideally I'd like something in the spirit of PETSc, where the library handles just the adaptive meshes ... |
I have a linear system whose matrix that is diagonally dominant, non-symmetric, but banded. Since the band-radius is 2 (producing only 5 variables per equation), a banded direct solver (gaussian elimination without pivoting) should be fairly fast to produce a solution. I was just wondering if there is a way to paral... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.