Support graph preconditioners for off-lattice cell-based models
From MaRDI portal
Cites work
- A 3-D model used to explore how cell adhesion and stiffness affect cell sorting and movement in multicellular systems
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
- Accuracy and Stability of Numerical Algorithms
- Algorithms for Sparse Linear Systems
- Cellular Automata: Analysis and Applications
- COARSE GRAINING IN SIMULATED CELL POPULATIONS
- Computing the Minimum Fill-In is NP-Complete
- Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems
- Error norm estimation and stopping criteria in preconditioned conjugate gradient iterations
- Error norm estimation in the conjugate gradient algorithm
- Flexible conjugate gradients
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 6876117 (Why is no real title available?)
- Krylov subspace methods. Principles and analysis.
- Maximum‐weight‐basis preconditioners
- Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
- Patient-calibrated agent-based modelling of ductal carcinoma in situ (DCIS): from microscopic measurements to macroscopic predictions of clinical progression
- Proceedings of the 32nd annual ACM-SIAM symposium on discrete algorithms, SODA 2021, Alexandria, VA, USA, virtual, January 10--13, 2021
- Stability of block LU factorization
- Support-Graph Preconditioners
- The effect of ordering on preconditioned conjugate gradients
- Vaidya's preconditioners: Implementation and experimental study
- Vector diffusion maps and the connection Laplacian
This page was built for publication: Support graph preconditioners for off-lattice cell-based models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858923)
