Pages that link to "Item:Q955257"

The following pages link to Computing entries of the inverse of a sparse matrix using the FIND algorithm (Q955257):

Displaying 17 items.

• A fast algorithm for sparse matrix computations related to inversion (Q401614) (← links)
• Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions (Q422929) (← links)
• A two-dimensional domain decomposition technique for the simulation of quantum-scale devices (Q422951) (← links)
• An approximate framework for quantum transport calculation with model order reduction (Q729108) (← links)
• A hybrid method for the parallel computation of Green's functions (Q834057) (← links)
• Improvements on non-equilibrium and transport Green function techniques: the next-generation Transiesta (Q1687073) (← links)
• Parallelized integrated nested Laplace approximations for fast Bayesian inference (Q2677902) (← links)
• Fast Sparse Selected Inversion (Q2947058) (← links)
• A nested dissection approach to modeling transport in nanodevices: Algorithms and applications (Q2952324) (← links)
• Efficient Covariance Approximations for Large Sparse Precision Matrices (Q3391172) (← links)
• A probing method for computing the diagonal of a matrix inverse (Q4922262) (← links)
• Numerical methods for Kohn–Sham density functional theory (Q5230523) (← links)
• An Uncertainty-Weighted Asynchronous ADMM Method for Parallel PDE Parameter Estimation (Q5241247) (← links)
• Finding off‐diagonal entries of the inverse of a large symmetric sparse matrix (Q5397304) (← links)
• A fast boundary element based solver for localized inelastic deformations (Q6554365) (← links)
• Multiresolution kernel matrix algebra (Q6562913) (← links)
• Integrated nested Laplace approximations for large-scale spatiotemporal Bayesian modeling (Q6575345) (← links)