Alternatives and similar repositories for cusparse-cholesky-solver

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

• rgl-epfl / cholespy
  An easily integrable Cholesky solver on CPU and GPU
  ☆237Updated 7 months ago
• p-sto / ConjugateGradients
  Implementation of ConjugateGradients method using C and Nvidia CUDA
  ☆51Updated 3 years ago
• InteractiveComputerGraphics / cuNSearch
  A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.
  ☆106Updated last year
• raymondyfei / lbfgsb-gpu
  An open source library for the GPU-implementation of L-BFGS-B algorithm
  ☆133Updated 7 months 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
• polyfem / polysolve
  Easy-to-use linear and non-linear solver
  ☆52Updated 3 weeks ago
• fwilliams / surface-reconstruction-benchmark
  A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al
  ☆53Updated 10 months ago
• gmarkall / cuda_cg
  Conjugate Gradient solver written in CUDA
  ☆29Updated 5 years ago
• rgl-epfl / fastsweep
  Efficient Eikonal equation solver using CUDA
  ☆94Updated 5 months ago
• johnarobinson77 / KdTreeGPU
  A gpu based implementation of a K-D Tree Builder
  ☆114Updated 5 years ago
• cfwen / geometry-processing-package
  Geometry Processing Package
  ☆55Updated 2 years ago
• adshhzy / VIPSS
  ☆58Updated 5 years ago
• ingowald / cuBQL
  'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)
  ☆29Updated last week
• MarcoAttene / CDT
  ☆63Updated last month
• MeshFEM / MeshFEM
  Finite Element Codebase for Triangle/Tetrahedral Meshes
  ☆64Updated 11 months ago
• alecjacobson / convex-optimization-cookbook
  ☆54Updated last year
• ingowald / cudaKDTree
  ☆251Updated 2 weeks ago
• foges / cgls_cuda
  Conjugate Gradient for Least Squares in CUDA
  ☆52Updated 9 years ago
• patr-schm / TinyAD-Examples
  Code examples for automatic differentiation with TinyAD
  ☆29Updated 2 months ago
• wangbolun300 / fast-envelope
  This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…
  ☆57Updated 2 weeks ago
• unclejimbo / Euclid
  C++ Shape Analysis and Geometry Processing
  ☆40Updated last year
• 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
• kayarre / reconbench
  A Benchmark for Surface Reconstruction
  ☆12Updated 9 years ago
• ChinYing-Li / CUDA-kdtree
  GPU-accelerated KD-tree implementation
  ☆45Updated 3 years ago
• mbotsch / polyLaplace
  Source code for serveral papers on discrete Laplace operators on general polygons and polyhedral meshes
  ☆38Updated last year
• fwilliams / numpyeigen
  Fast zero-overhead bindings between NumPy and Eigen
  ☆141Updated 3 months ago
• nmwsharp / nonmanifold-laplacian
  A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]
  ☆136Updated last year
• Lancelot899 / discrete_differential_geometry
  离散几何处理中文版翻译
  ☆60Updated 3 years ago
• jasvob / QRKit
  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
• rubenwiersma / pointcloud-differential
  Gradient, divergence, Laplacian on point clouds. Useful for setting up and solving PDEs on point clouds and learning anisotropic features…
  ☆75Updated 2 years ago