Todo List

Subprogram mod_linear_equation::leq_Cholesky (m, v, is_permuted)
fill-permutation matrix ? rebuild permutation matrix

Subprogram mod_linear_equation::leq_getBlock_v (v, r_s, r_e)
verify why it's not work without res_pb declaration

Type mod_linear_equation::linsolve
entrain de les faires

Subprogram mod_matrix::m_cond (m)

verify avantage between fortran basic function and loop implementation

do with singular value (=s[min(m,n)-1])

Subprogram mod_matrix::m_decompCholesky (m, is_permuted)
fill-permutation matrix ?

Subprogram mod_matrix::m_decompQR (m, meth_qr, eps_gsortho, is_permuted)
implement Givens method

Subprogram mod_matrix::m_decompQR_GramSchimdt (m, is_permuted)
rank? Q and R sizes

Subprogram mod_matrix::m_det_chol (m, is_permuted)
check the determinant computing

Subprogram mod_matrix::m_diag (m, i)
optimize the if conditions

Subprogram mod_matrix::m_eig_deflation (m, v0, eps, iter_max)
do not work fine (after the second eigen value)

Subprogram mod_matrix::m_matrixTOvector (m)
add exception

Subprogram mod_matrix::m_norm (m, type_norm)
verify avantage between fortran basic function and loop implementation

Subprogram mod_matrix::m_pow_eig (m, v0, eps, iter_max)
treat complex case

Subprogram mod_matrix::m_prod_vec2 (v, m)
parallel omp ? (ex, conjugate gradient)

Subprogram mod_matrix::m_prod_vec_c (m, v)
parallel omp ? (ex, conjugate gradient)

Subprogram mod_matrix::m_rank (m, tol_rank, meth_rk, eps_svd, iter_max, meth_qr, eps_gsortho, is_permuted)
implement Givens method

Subprogram mod_matrix::m_rank_gaussj (m)
it's not working well (use rank_svd)

Subprogram mod_vector::v_dot (v1, v2)
openmp is better ?
 All Classes Namespaces Files Functions Variables Defines