Showing 5 of total 5 results (show query)
rdinnager
rbff:R Interface to Boundary First Flattening Software (BFF)
Flatten 3D meshes into arbitrary 2D shapes using boundary first flattening (<https://github.com/GeometryCollective/boundary-first-flattening>).
Maintained by Russell Dinnage. Last updated 3 years ago.
30.0 match 5 stars 2.40 score 6 scriptsfabnavarro
gasper:Graph Signal Processing
Provides the standard operations for signal processing on graphs: graph Fourier transform, spectral graph wavelet transform, visualization tools. It also implements a data driven method for graph signal denoising/regression, for details see De Loynes, Navarro, Olivier (2019) <arxiv:1906.01882>. The package also provides an interface to the SuiteSparse Matrix Collection, <https://sparse.tamu.edu/>, a large and widely used set of sparse matrix benchmarks collected from a wide range of applications.
Maintained by Fabien Navarro. Last updated 7 months ago.
data-sciencegraphgraph-signal-processinggraph-waveletmachine-learningspectral-graph-theorystatisticssuitesparsewavelet-transformopenblascpp
17.5 match 8 stars 4.03 score 27 scriptsr-forge
Matrix:Sparse and Dense Matrix Classes and Methods
A rich hierarchy of sparse and dense matrix classes, including general, symmetric, triangular, and diagonal matrices with numeric, logical, or pattern entries. Efficient methods for operating on such matrices, often wrapping the 'BLAS', 'LAPACK', and 'SuiteSparse' libraries.
Maintained by Martin Maechler. Last updated 7 days ago.
2.8 match 1 stars 17.23 score 33k scripts 12k dependentsflorianschwendinger
scs:Splitting Conic Solver
Solves convex cone programs via operator splitting. Can solve: linear programs ('LPs'), second-order cone programs ('SOCPs'), semidefinite programs ('SDPs'), exponential cone programs ('ECPs'), and power cone programs ('PCPs'), or problems with any combination of those cones. 'SCS' uses 'AMD' (a set of routines for permuting sparse matrices prior to factorization) and 'LDL' (a sparse 'LDL' factorization and solve package) from 'SuiteSparse' (<https://people.engr.tamu.edu/davis/suitesparse.html>).
Maintained by Florian Schwendinger. Last updated 2 years ago.
0.8 match 8 stars 6.72 score 16 scripts 53 dependentsandrewzm
sparseinv:Computation of the Sparse Inverse Subset
Creates a wrapper for the 'SuiteSparse' routines that execute the Takahashi equations. These equations compute the elements of the inverse of a sparse matrix at locations where the its Cholesky factor is structurally non-zero. The resulting matrix is known as a sparse inverse subset. Some helper functions are also implemented. Support for spam matrices is currently limited and will be implemented in the future. See Rue and Martino (2007) <doi:10.1016/j.jspi.2006.07.016> and Zammit-Mangion and Rougier (2018) <doi:10.1016/j.csda.2018.02.001> for the application of these equations to statistics.
Maintained by Andrew Zammit-Mangion. Last updated 7 years ago.
0.5 match 4.10 score 14 scripts 6 dependents