gishi523 / cusparse-cholesky-solver
A sample code for sparse cholesky solver with cuSPARSE and cuSOLVER library
☆19Updated 5 years ago
Alternatives and similar repositories for cusparse-cholesky-solver:
Users that are interested in cusparse-cholesky-solver are comparing it to the libraries listed below
- Easy-to-use linear and non-linear solver☆51Updated last week
- An easily integrable Cholesky solver on CPU and GPU☆234Updated 5 months ago
- Code examples for automatic differentiation with TinyAD☆28Updated this week
- A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al☆52Updated 7 months ago
- EGGS, a method to speed up sparse matrix operations when the same sparsity is used for multiple times. This repo contains examples that s…☆25Updated 4 years ago
- A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.☆100Updated last year
- Implementation of ConjugateGradients method using C and Nvidia CUDA☆51Updated 2 years ago
- Source code for serveral papers on discrete Laplace operators on general polygons and polyhedral meshes☆39Updated last year
- Efficient Eikonal equation solver using CUDA☆91Updated 3 months ago
- Conjugate Gradient solver written in CUDA☆29Updated 5 years ago
- ☆39Updated 3 years ago
- ☆56Updated 5 years ago
- A projection-based bijective map definition and a robust algorithm to construct the prismatic shell domain. https://cs.nyu.edu/~zhongshi/…☆28Updated 4 years ago
- A fast and robust total curvature estimation method, for both triangle meshes and point clouds.☆32Updated 5 months ago
- Finite Element Codebase for Triangle/Tetrahedral Meshes☆61Updated 9 months ago
- QRKit is an extension of Eigen C++ library that allows for efficient QR decomposition of sparse matrices with common sparsity patterns.☆16Updated 4 years ago
- GPU-Accelerated multigrid solver for Poisson's equation in 2D☆22Updated 4 years ago
- C++ implementation of "Surface Multigrid via Intrinsic Prolongation"☆66Updated 2 years ago
- Gradient, divergence, Laplacian on point clouds. Useful for setting up and solving PDEs on point clouds and learning anisotropic features…☆75Updated 2 years ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆57Updated last month
- Fast zero-overhead bindings between NumPy and Eigen☆139Updated last month
- Anderson acceleration for geometry optimization and physics simulation☆46Updated 6 years ago
- Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point☆24Updated 3 years ago
- Robust Coarse Curved TetMesh Generation☆36Updated last year
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆26Updated last month
- Fixed Radius Nearest Neighbor Search on GPU☆185Updated last year
- Algebraic Representations for Volumetric Frame Fields☆23Updated 4 years ago
- GPU-accelerated KD-tree implementation☆44Updated 3 years ago
- C++ Shape Analysis and Geometry Processing☆38Updated 11 months ago
- Conjugate Gradient for Least Squares in CUDA☆52Updated 9 years ago