Alternatives and similar repositories for cusparse-cholesky-solver:

Users that are interested in cusparse-cholesky-solver are comparing it to the libraries listed below

• fwilliams / surface-reconstruction-benchmark
  A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al
  ☆52Updated 5 months ago
• rgl-epfl / fastsweep
  Efficient Eikonal equation solver using CUDA
  ☆91Updated 3 weeks ago
• txstc55 / EGGS
  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
• alecjacobson / sparse-solver-benchmark
  ☆39Updated 2 years ago
• ingowald / closestSurfacePointQueries
  Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point
  ☆24Updated 3 years ago
• rgl-epfl / cholespy
  An easily integrable Cholesky solver on CPU and GPU
  ☆232Updated 2 months ago
• polyfem / polysolve
  Easy-to-use linear and non-linear solver
  ☆51Updated 2 weeks ago
• patr-schm / TinyAD-Examples
  Code examples for automatic differentiation with TinyAD
  ☆28Updated last year
• InteractiveComputerGraphics / cuNSearch
  A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.
  ☆99Updated 9 months ago
• adshhzy / VIPSS
  ☆54Updated 4 years ago
• ingowald / cuBQL
  'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)
  ☆21Updated this week
• dpa1mer / arff
  Algebraic Representations for Volumetric Frame Fields
  ☆20Updated 4 years ago
• jia-kai / SANM
  A symbolic asymptotic numerical solver
  ☆33Updated 3 years ago
• mbotsch / polyLaplace
  Source code for serveral papers on discrete Laplace operators on general polygons and polyhedral meshes
  ☆33Updated 9 months ago
• jiangzhongshi / bijective-projection-shell
  A projection-based bijective map definition and a robust algorithm to construct the prismatic shell domain. https://cs.nyu.edu/~zhongshi/…
  ☆27Updated 3 years ago
• fwilliams / numpyeigen
  Fast zero-overhead bindings between NumPy and Eigen
  ☆139Updated 5 months ago
• p-sto / ConjugateGradients
  Implementation of ConjugateGradients method using C and Nvidia CUDA
  ☆49Updated 2 years ago
• wangbolun300 / fast-envelope
  This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…
  ☆56Updated last year
• MarcoAttene / CDT
  ☆57Updated 6 months ago
• nmwsharp / navigating-intrinsic-triangulations-demo
  Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019
  ☆50Updated 8 months ago
• alecjacobson / minimal-latex-setup-for-siggraph
  ☆23Updated 2 years ago
• mit-gfx / diff_stokes_flow
  Code for the Siggraph Asia 2020 submission
  ☆45Updated 4 years ago
• anapupa / cuMesh
  ☆13Updated 3 years ago
• bldeng / AASolver
  Anderson acceleration for geometry optimization and physics simulation
  ☆43Updated 6 years ago
• evouga / collisiondetection
  ☆54Updated 5 years ago
• GeometryCollective / montecarlo-course
  Course material for CMU course on Monte Carlo Methods and Applications
  ☆24Updated last year
• cfwen / geometry-processing-package
  Geometry Processing Package
  ☆53Updated last year
• ChinYing-Li / CUDA-kdtree
  GPU-accelerated KD-tree implementation
  ☆43Updated 3 years ago
• EPFL-LGG / RotationOptimization
  Gradients/Hessians for optimizing with rotation variables.
  ☆26Updated last year
• davidstutz / mesh-evaluation
  Efficient C++ implementation of mesh-to-mesh and mesh-to-point distance.
  ☆59Updated 6 years ago