Abstract: We show how to perform sparse approximate Gaussian elimination for Laplacian matrices. We present a simple, nearly linear time algorithm that approximates a Laplacian by the product of a ...
Abstract: Iterative model-based algorithms are known to enable more accurate and quantitative optoacoustic (photoacoustic) tomographic reconstructions than standard back-projection methods. However, ...
Engineering Research Center of Ministry of Education for Financial Computing and Digital Engineering, Renmin University of China, Beijing, China. LDPC code is a ...
Growth-transform (GT) neurons and their population models allow for independent control over the spiking statistics and the transient population dynamics while optimizing a physically plausible ...
The Locally Competitive Algorithm (LCA) is a biologically plausible computational architecture for sparse coding, where a signal is represented as a linear combination of elements from an ...
This library provides common numerical analysis functionality, without requiring any external bindings. It aims to serve as an experimental platform for scientific ...
The Universal Java Matrix Package (UJMP) is an open source library for dense and sparse matrix computations and linear algebra in Java. In addition to the basic operations like matrix multiplication, ...
Scientific computing increasingly requires both accurate simulations of physical systems as well as optimizing them over many parameters for tasks such as inverse ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results