GitHub-Proxy/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2025-06-04 02:33:59 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix UTF-8 encoding errors introduced by #1801

Browse Source
This commit is contained in:
Tyler Veness 2025-01-28 16:52:46 -08:00
parent 2a35a917be
commit 872c179f58
No known key found for this signature in database
GPG Key ID: AA007082A8B65599
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
View File

@ -127,7 +127,7 @@ struct simpl_chol_helper {
// Adapted from:
// Joseph W. Liu. (1986).
// A compact row storage scheme for Cholesky factors using elimination trees.
// ACM Trans. Math. Softw. 12, 2 (June 1986), 127–148. https://doi.org/10.1145/6497.6499
// ACM Trans. Math. Softw. 12, 2 (June 1986), 127-148. https://doi.org/10.1145/6497.6499
// Computes the elimination forest of the lower adjacency matrix, a compact representation of the sparse L factor.
// The L factor may contain multiple elimination trees if a column contains only its diagonal element.
@ -197,7 +197,7 @@ struct simpl_chol_helper {
// Adapted from:
// Gilbert, J. R., Ng, E., & Peyton, B. W. (1994).
// An efficient algorithm to compute row and column counts for sparse Cholesky factorization.
// SIAM Journal on Matrix Analysis and Applications, 15(4), 1075–1091.
// SIAM Journal on Matrix Analysis and Applications, 15(4), 1075-1091.
// Computes the non-zero pattern of the L factor.
static void calc_colcount(const StorageIndex size, const StorageIndex* hadjOuter, const StorageIndex* hadjInner,