Mercurial > octave
view libinterp/corefcn/__ichol__.cc @ 31605:e88a07dec498 stable
maint: Use macros to begin/end C++ namespaces.
* oct-conf-post-public.in.h: Define two macros (OCTAVE_BEGIN_NAMESPACE,
OCTAVE_END_NAMESPACE) that can be used to start/end a namespace.
* mk-opts.pl, build-env.h, build-env.in.cc, __betainc__.cc, __contourc__.cc,
__dsearchn__.cc, __eigs__.cc, __expint__.cc, __ftp__.cc, __gammainc__.cc,
__ichol__.cc, __ilu__.cc, __isprimelarge__.cc, __lin_interpn__.cc,
__magick_read__.cc, __pchip_deriv__.cc, __qp__.cc, amd.cc, auto-shlib.cc,
auto-shlib.h, balance.cc, base-text-renderer.cc, base-text-renderer.h,
besselj.cc, bitfcns.cc, bsxfun.cc, c-file-ptr-stream.cc, c-file-ptr-stream.h,
call-stack.cc, call-stack.h, ccolamd.cc, cellfun.cc, chol.cc, colamd.cc,
colloc.cc, conv2.cc, daspk.cc, dasrt.cc, dassl.cc, data.cc, data.h, debug.cc,
defaults.cc, defaults.h, defun-int.h, defun.cc, det.cc, dirfns.cc, display.cc,
display.h, dlmread.cc, dmperm.cc, dot.cc, dynamic-ld.cc, dynamic-ld.h, eig.cc,
ellipj.cc, environment.cc, environment.h, error.cc, error.h, errwarn.h,
event-manager.cc, event-manager.h, event-queue.cc, event-queue.h, fcn-info.cc,
fcn-info.h, fft.cc, fft2.cc, fftn.cc, file-io.cc, filter.cc, find.cc,
ft-text-renderer.cc, ft-text-renderer.h, gcd.cc, getgrent.cc, getpwent.cc,
getrusage.cc, givens.cc, gl-render.cc, gl-render.h, gl2ps-print.cc,
gl2ps-print.h, graphics-toolkit.cc, graphics-toolkit.h, graphics.cc,
graphics.in.h, gsvd.cc, gtk-manager.cc, gtk-manager.h, hash.cc, help.cc,
help.h, hess.cc, hex2num.cc, hook-fcn.cc, hook-fcn.h, input.cc, input.h,
interpreter-private.cc, interpreter-private.h, interpreter.cc, interpreter.h,
inv.cc, jsondecode.cc, jsonencode.cc, kron.cc, latex-text-renderer.cc,
latex-text-renderer.h, load-path.cc, load-path.h, load-save.cc, load-save.h,
lookup.cc, ls-ascii-helper.cc, ls-ascii-helper.h, ls-oct-text.cc, ls-utils.cc,
ls-utils.h, lsode.cc, lu.cc, mappers.cc, matrix_type.cc, max.cc, mex-private.h,
mex.cc, mgorth.cc, nproc.cc, oct-fstrm.cc, oct-fstrm.h, oct-hdf5-types.cc,
oct-hdf5-types.h, oct-hist.cc, oct-hist.h, oct-iostrm.cc, oct-iostrm.h,
oct-opengl.h, oct-prcstrm.cc, oct-prcstrm.h, oct-procbuf.cc, oct-procbuf.h,
oct-process.cc, oct-process.h, oct-stdstrm.h, oct-stream.cc, oct-stream.h,
oct-strstrm.cc, oct-strstrm.h, oct-tex-lexer.in.ll, oct-tex-parser.yy,
ordqz.cc, ordschur.cc, pager.cc, pager.h, pinv.cc, pow2.cc, pr-flt-fmt.cc,
pr-output.cc, procstream.cc, procstream.h, psi.cc, qr.cc, quad.cc, quadcc.cc,
qz.cc, rand.cc, rcond.cc, regexp.cc, schur.cc, settings.cc, settings.h,
sighandlers.cc, sighandlers.h, sparse-xdiv.cc, sparse-xdiv.h, sparse-xpow.cc,
sparse-xpow.h, sparse.cc, spparms.cc, sqrtm.cc, stack-frame.cc, stack-frame.h,
stream-euler.cc, strfind.cc, strfns.cc, sub2ind.cc, svd.cc, sylvester.cc,
symbfact.cc, syminfo.cc, syminfo.h, symrcm.cc, symrec.cc, symrec.h,
symscope.cc, symscope.h, symtab.cc, symtab.h, syscalls.cc, sysdep.cc, sysdep.h,
text-engine.cc, text-engine.h, text-renderer.cc, text-renderer.h, time.cc,
toplev.cc, tril.cc, tsearch.cc, typecast.cc, url-handle-manager.cc,
url-handle-manager.h, urlwrite.cc, utils.cc, utils.h, variables.cc,
variables.h, xdiv.cc, xdiv.h, xnorm.cc, xnorm.h, xpow.cc, xpow.h,
__delaunayn__.cc, __fltk_uigetfile__.cc, __glpk__.cc, __init_fltk__.cc,
__init_gnuplot__.cc, __ode15__.cc, __voronoi__.cc, audiodevinfo.cc,
audioread.cc, convhulln.cc, fftw.cc, gzip.cc, mk-build-env-features.sh,
mk-builtins.pl, cdef-class.cc, cdef-class.h, cdef-fwd.h, cdef-manager.cc,
cdef-manager.h, cdef-method.cc, cdef-method.h, cdef-object.cc, cdef-object.h,
cdef-package.cc, cdef-package.h, cdef-property.cc, cdef-property.h,
cdef-utils.cc, cdef-utils.h, ov-base.cc, ov-base.h, ov-bool-mat.cc,
ov-builtin.h, ov-cell.cc, ov-class.cc, ov-class.h, ov-classdef.cc,
ov-classdef.h, ov-complex.cc, ov-fcn-handle.cc, ov-fcn-handle.h, ov-fcn.h,
ov-java.cc, ov-java.h, ov-mex-fcn.h, ov-null-mat.cc, ov-oncleanup.cc,
ov-struct.cc, ov-typeinfo.cc, ov-typeinfo.h, ov-usr-fcn.cc, ov-usr-fcn.h,
ov.cc, ov.h, octave.cc, octave.h, mk-ops.sh, op-b-b.cc, op-b-bm.cc,
op-b-sbm.cc, op-bm-b.cc, op-bm-bm.cc, op-bm-sbm.cc, op-cdm-cdm.cc, op-cell.cc,
op-chm.cc, op-class.cc, op-cm-cm.cc, op-cm-cs.cc, op-cm-m.cc, op-cm-s.cc,
op-cm-scm.cc, op-cm-sm.cc, op-cs-cm.cc, op-cs-cs.cc, op-cs-m.cc, op-cs-s.cc,
op-cs-scm.cc, op-cs-sm.cc, op-dm-dm.cc, op-dm-scm.cc, op-dm-sm.cc,
op-dm-template.cc, op-dms-template.cc, op-fcdm-fcdm.cc, op-fcm-fcm.cc,
op-fcm-fcs.cc, op-fcm-fm.cc, op-fcm-fs.cc, op-fcn.cc, op-fcs-fcm.cc,
op-fcs-fcs.cc, op-fcs-fm.cc, op-fcs-fs.cc, op-fdm-fdm.cc, op-fm-fcm.cc,
op-fm-fcs.cc, op-fm-fm.cc, op-fm-fs.cc, op-fs-fcm.cc, op-fs-fcs.cc,
op-fs-fm.cc, op-fs-fs.cc, op-i16-i16.cc, op-i32-i32.cc, op-i64-i64.cc,
op-i8-i8.cc, op-int-concat.cc, op-m-cm.cc, op-m-cs.cc, op-m-m.cc, op-m-s.cc,
op-m-scm.cc, op-m-sm.cc, op-mi.cc, op-pm-pm.cc, op-pm-scm.cc, op-pm-sm.cc,
op-pm-template.cc, op-range.cc, op-s-cm.cc, op-s-cs.cc, op-s-m.cc, op-s-s.cc,
op-s-scm.cc, op-s-sm.cc, op-sbm-b.cc, op-sbm-bm.cc, op-sbm-sbm.cc,
op-scm-cm.cc, op-scm-cs.cc, op-scm-m.cc, op-scm-s.cc, op-scm-scm.cc,
op-scm-sm.cc, op-sm-cm.cc, op-sm-cs.cc, op-sm-m.cc, op-sm-s.cc, op-sm-scm.cc,
op-sm-sm.cc, op-str-m.cc, op-str-s.cc, op-str-str.cc, op-struct.cc,
op-ui16-ui16.cc, op-ui32-ui32.cc, op-ui64-ui64.cc, op-ui8-ui8.cc, ops.h,
anon-fcn-validator.cc, anon-fcn-validator.h, bp-table.cc, bp-table.h,
comment-list.cc, comment-list.h, filepos.h, lex.h, lex.ll, oct-lvalue.cc,
oct-lvalue.h, oct-parse.yy, parse.h, profiler.cc, profiler.h,
pt-anon-scopes.cc, pt-anon-scopes.h, pt-arg-list.cc, pt-arg-list.h,
pt-args-block.cc, pt-args-block.h, pt-array-list.cc, pt-array-list.h,
pt-assign.cc, pt-assign.h, pt-binop.cc, pt-binop.h, pt-bp.cc, pt-bp.h,
pt-cbinop.cc, pt-cbinop.h, pt-cell.cc, pt-cell.h, pt-check.cc, pt-check.h,
pt-classdef.cc, pt-classdef.h, pt-cmd.h, pt-colon.cc, pt-colon.h, pt-const.cc,
pt-const.h, pt-decl.cc, pt-decl.h, pt-eval.cc, pt-eval.h, pt-except.cc,
pt-except.h, pt-exp.cc, pt-exp.h, pt-fcn-handle.cc, pt-fcn-handle.h, pt-id.cc,
pt-id.h, pt-idx.cc, pt-idx.h, pt-jump.h, pt-loop.cc, pt-loop.h, pt-mat.cc,
pt-mat.h, pt-misc.cc, pt-misc.h, pt-pr-code.cc, pt-pr-code.h, pt-select.cc,
pt-select.h, pt-spmd.cc, pt-spmd.h, pt-stmt.cc, pt-stmt.h, pt-tm-const.cc,
pt-tm-const.h, pt-unop.cc, pt-unop.h, pt-vm-eval.cc, pt-walk.cc, pt-walk.h,
pt.cc, pt.h, token.cc, token.h, Range.cc, Range.h, idx-vector.cc, idx-vector.h,
range-fwd.h, CollocWt.cc, CollocWt.h, aepbalance.cc, aepbalance.h, chol.cc,
chol.h, gepbalance.cc, gepbalance.h, gsvd.cc, gsvd.h, hess.cc, hess.h,
lo-mappers.cc, lo-mappers.h, lo-specfun.cc, lo-specfun.h, lu.cc, lu.h,
oct-convn.cc, oct-convn.h, oct-fftw.cc, oct-fftw.h, oct-norm.cc, oct-norm.h,
oct-rand.cc, oct-rand.h, oct-spparms.cc, oct-spparms.h, qr.cc, qr.h, qrp.cc,
qrp.h, randgamma.cc, randgamma.h, randmtzig.cc, randmtzig.h, randpoisson.cc,
randpoisson.h, schur.cc, schur.h, sparse-chol.cc, sparse-chol.h, sparse-lu.cc,
sparse-lu.h, sparse-qr.cc, sparse-qr.h, svd.cc, svd.h, child-list.cc,
child-list.h, dir-ops.cc, dir-ops.h, file-ops.cc, file-ops.h, file-stat.cc,
file-stat.h, lo-sysdep.cc, lo-sysdep.h, lo-sysinfo.cc, lo-sysinfo.h,
mach-info.cc, mach-info.h, oct-env.cc, oct-env.h, oct-group.cc, oct-group.h,
oct-password.cc, oct-password.h, oct-syscalls.cc, oct-syscalls.h, oct-time.cc,
oct-time.h, oct-uname.cc, oct-uname.h, action-container.cc, action-container.h,
base-list.h, cmd-edit.cc, cmd-edit.h, cmd-hist.cc, cmd-hist.h, f77-fcn.h,
file-info.cc, file-info.h, lo-array-errwarn.cc, lo-array-errwarn.h, lo-hash.cc,
lo-hash.h, lo-ieee.h, lo-regexp.cc, lo-regexp.h, lo-utils.cc, lo-utils.h,
oct-base64.cc, oct-base64.h, oct-glob.cc, oct-glob.h, oct-inttypes.h,
oct-mutex.cc, oct-mutex.h, oct-refcount.h, oct-shlib.cc, oct-shlib.h,
oct-sparse.cc, oct-sparse.h, oct-string.h, octave-preserve-stream-state.h,
pathsearch.cc, pathsearch.h, quit.cc, quit.h, unwind-prot.cc, unwind-prot.h,
url-transfer.cc, url-transfer.h : Use new macros to begin/end C++ namespaces.
author | Rik <rik@octave.org> |
---|---|
date | Thu, 01 Dec 2022 14:23:45 -0800 |
parents | 820d2c802247 |
children | aac27ad79be6 |
line wrap: on
line source
//////////////////////////////////////////////////////////////////////// // // Copyright (C) 2013-2022 The Octave Project Developers // // See the file COPYRIGHT.md in the top-level directory of this // distribution or <https://octave.org/copyright/>. // // This file is part of Octave. // // Octave is free software: you can redistribute it and/or modify it // under the terms of the GNU General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // Octave is distributed in the hope that it will be useful, but // WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // // You should have received a copy of the GNU General Public License // along with Octave; see the file COPYING. If not, see // <https://www.gnu.org/licenses/>. // //////////////////////////////////////////////////////////////////////// #if defined (HAVE_CONFIG_H) # include "config.h" #endif #include "oct-locbuf.h" #include "oct-norm.h" #include "defun.h" #include "error.h" #include "builtin-defun-decls.h" OCTAVE_BEGIN_NAMESPACE(octave) // Secondary functions for complex and real case used in ichol algorithms. Complex ichol_mult_complex (Complex a, Complex b) { #if defined (HAVE_CXX_COMPLEX_SETTERS) b.imag (-b.imag ()); #elif defined (HAVE_CXX_COMPLEX_REFERENCE_ACCESSORS) b.imag () = -b.imag (); #else b = b.conj (); #endif return a * b; } double ichol_mult_real (double a, double b) { return a * b; } bool ichol_checkpivot_complex (Complex pivot) { if (pivot.imag () != 0) error ("ichol: non-real pivot encountered. The matrix must be Hermitian."); else if (pivot.real () < 0) error ("ichol: negative pivot encountered"); return true; } bool ichol_checkpivot_real (double pivot) { if (pivot < 0) error ("ichol: negative pivot encountered"); return true; } template <typename octave_matrix_t, typename T, T (*ichol_mult) (T, T), bool (*ichol_checkpivot) (T)> void ichol_0 (octave_matrix_t& sm, const std::string michol = "off") { const octave_idx_type n = sm.cols (); octave_idx_type j1, jend, j2, jrow, jjrow, j, jw, i, k, jj, r; T tl; char opt; enum {OFF, ON}; if (michol == "on") opt = ON; else opt = OFF; // Input matrix pointers octave_idx_type *cidx = sm.cidx (); octave_idx_type *ridx = sm.ridx (); T *data = sm.data (); // Working arrays OCTAVE_LOCAL_BUFFER (octave_idx_type, Lfirst, n); OCTAVE_LOCAL_BUFFER (octave_idx_type, Llist, n); OCTAVE_LOCAL_BUFFER (octave_idx_type, iw, n); OCTAVE_LOCAL_BUFFER (T, dropsums, n); // Initialize working arrays for (i = 0; i < n; i++) { iw[i] = -1; Llist[i] = -1; Lfirst[i] = -1; dropsums[i] = 0; } // Loop over all columns for (k = 0; k < n; k++) { j1 = cidx[k]; j2 = cidx[k+1]; for (j = j1; j < j2; j++) iw[ridx[j]] = j; jrow = Llist[k]; // Iterate over each non-zero element in the actual row. while (jrow != -1) { jjrow = Lfirst[jrow]; jend = cidx[jrow+1]; for (jj = jjrow; jj < jend; jj++) { r = ridx[jj]; jw = iw[r]; tl = ichol_mult (data[jj], data[jjrow]); if (jw != -1) data[jw] -= tl; else // Because of the symmetry of the matrix, we know // the drops in the column r are also in the column k. if (opt == ON) { dropsums[r] -= tl; dropsums[k] -= tl; } } // Update the linked list and the first entry of the actual column. if ((jjrow + 1) < jend) { Lfirst[jrow]++; j = jrow; jrow = Llist[jrow]; Llist[j] = Llist[ridx[Lfirst[j]]]; Llist[ridx[Lfirst[j]]] = j; } else jrow = Llist[jrow]; } if (opt == ON) data[j1] += dropsums[k]; // Test for j1 == j2 must be first to avoid invalid ridx[j1] access if (j1 == j2 || ridx[j1] != k) error ("ichol: encountered a pivot equal to 0"); if (! ichol_checkpivot (data[j1])) break; data[cidx[k]] = std::sqrt (data[j1]); // Update Llist and Lfirst with the k-column information. Also, // scale the column elements by the pivot and reset the working array iw. if (k < (n - 1)) { iw[ridx[j1]] = -1; for (i = j1 + 1; i < j2; i++) { iw[ridx[i]] = -1; data[i] /= data[j1]; } Lfirst[k] = j1; if ((Lfirst[k] + 1) < j2) { Lfirst[k]++; jjrow = ridx[Lfirst[k]]; Llist[k] = Llist[jjrow]; Llist[jjrow] = k; } } } } DEFUN (__ichol0__, args, , doc: /* -*- texinfo -*- @deftypefn {} {@var{L} =} __ichol0__ (@var{A}, @var{michol}) Undocumented internal function. @end deftypefn */) { if (args.length () != 2) print_usage (); std::string michol = args(1).string_value (); // In ICHOL0 algorithm the zero-pattern of the input matrix is preserved // so its structure does not change during the algorithm. The same input // matrix is used to build the output matrix due to that fact. if (! args(0).iscomplex ()) { SparseMatrix sm = Ftril (args(0))(0).sparse_matrix_value (); ichol_0 <SparseMatrix, double, ichol_mult_real, ichol_checkpivot_real> (sm, michol); return ovl (sm); } else { SparseComplexMatrix sm = Ftril (args(0))(0).sparse_complex_matrix_value (); ichol_0 <SparseComplexMatrix, Complex, ichol_mult_complex, ichol_checkpivot_complex> (sm, michol); return ovl (sm); } } template <typename octave_matrix_t, typename T, T (*ichol_mult) (T, T), bool (*ichol_checkpivot) (T)> void ichol_t (const octave_matrix_t& sm, octave_matrix_t& L, const T* cols_norm, const T droptol, const std::string michol = "off") { const octave_idx_type n = sm.cols (); octave_idx_type j, jrow, jend, jjrow, i, k, jj, total_len, w_len, max_len, ind; char opt; enum {OFF, ON}; if (michol == "on") opt = ON; else opt = OFF; // Input matrix pointers octave_idx_type *cidx = sm.cidx (); octave_idx_type *ridx = sm.ridx (); T *data = sm.data (); // Output matrix data structures. Because the final zero pattern pattern of // the output matrix is not known due to fill-in elements, a heuristic // approach has been adopted for memory allocation. The size of ridx_out_l // and data_out_l is incremented 10% of their actual size (nnz (A) in the // beginning). If that amount is less than n, their size is just incremented // in n elements. This way the number of reallocations decreases throughout // the process, obtaining a good performance. max_len = sm.nnz (); max_len += (0.1 * max_len) > n ? 0.1 * max_len : n; Array <octave_idx_type> cidx_out_l (dim_vector (n + 1, 1)); octave_idx_type *cidx_l = cidx_out_l.fortran_vec (); Array <octave_idx_type> ridx_out_l (dim_vector (max_len, 1)); octave_idx_type *ridx_l = ridx_out_l.fortran_vec (); Array <T> data_out_l (dim_vector (max_len, 1)); T *data_l = data_out_l.fortran_vec (); // Working arrays OCTAVE_LOCAL_BUFFER (T, w_data, n); OCTAVE_LOCAL_BUFFER (octave_idx_type, Lfirst, n); OCTAVE_LOCAL_BUFFER (octave_idx_type, Llist, n); OCTAVE_LOCAL_BUFFER (T, col_drops, n); std::vector<octave_idx_type> vec (n, 0); std::vector<bool> mark (n, false); T zero = T (0); cidx_l[0] = cidx[0]; for (i = 0; i < n; i++) { Llist[i] = -1; Lfirst[i] = -1; w_data[i] = 0; col_drops[i] = zero; } total_len = 0; for (k = 0; k < n; k++) { ind = 0; for (j = cidx[k]; j < cidx[k+1]; j++) { w_data[ridx[j]] = data[j]; // Mark column index, intentionally outside the if-clause to ensure // that mark[k] will be set to true as well. mark[ridx[j]] = true; if (ridx[j] != k) { vec[ind] = ridx[j]; ind++; } } jrow = Llist[k]; while (jrow != -1) { jjrow = Lfirst[jrow]; jend = cidx_l[jrow+1]; for (jj = jjrow; jj < jend; jj++) { j = ridx_l[jj]; // If the element in the j position of the row is zero, // then it will become non-zero, so we add it to the // vector that tracks non-zero elements in the working row. if (! mark[j]) { mark[j] = true; vec[ind] = j; ind++; } w_data[j] -= ichol_mult (data_l[jj], data_l[jjrow]); } // Update the actual column first element and // update the linked list of the jrow row. if ((jjrow + 1) < jend) { Lfirst[jrow]++; j = jrow; jrow = Llist[jrow]; Llist[j] = Llist[ridx_l[Lfirst[j]]]; Llist[ridx_l[Lfirst[j]]] = j; } else jrow = Llist[jrow]; } // Resizing output arrays if ((max_len - total_len) < n) { max_len += (0.1 * max_len) > n ? 0.1 * max_len : n; data_out_l.resize (dim_vector (max_len, 1)); data_l = data_out_l.fortran_vec (); ridx_out_l.resize (dim_vector (max_len, 1)); ridx_l = ridx_out_l.fortran_vec (); } // The sorting of the non-zero elements of the working column can be // handled in a couple of ways. The most efficient two I found, are // keeping the elements in an ordered binary search tree dynamically or // keep them unsorted in a vector and at the end of the outer iteration // order them. The last approach exhibits lower execution times. std::sort (vec.begin (), vec.begin () + ind); data_l[total_len] = w_data[k]; ridx_l[total_len] = k; w_len = 1; // Extract the non-zero elements of working column and // drop the elements that are lower than droptol * cols_norm[k]. for (i = 0; i < ind ; i++) { jrow = vec[i]; if (w_data[jrow] != zero) { if (std::abs (w_data[jrow]) < (droptol * cols_norm[k])) { if (opt == ON) { col_drops[k] += w_data[jrow]; col_drops[jrow] += w_data[jrow]; } } else { data_l[total_len + w_len] = w_data[jrow]; ridx_l[total_len + w_len] = jrow; w_len++; } } // Clear mark, vec, and w_data. However, mark[k] is not set to zero. mark[jrow] = false; vec[i] = 0; w_data[jrow] = zero; } // Compensate column sums --> michol option if (opt == ON) data_l[total_len] += col_drops[k]; if (data_l[total_len] == zero) error ("ichol: encountered a pivot equal to 0"); if (! ichol_checkpivot (data_l[total_len])) break; // Once elements are dropped and compensation of column sums are done, // scale the elements by the pivot. data_l[total_len] = std::sqrt (data_l[total_len]); for (jj = total_len + 1; jj < (total_len + w_len); jj++) data_l[jj] /= data_l[total_len]; total_len += w_len; // Check if there are too many elements to be indexed with // octave_idx_type type due to fill-in during the process. if (total_len < 0) error ("ichol: integer overflow. Too many fill-in elements in L"); cidx_l[k+1] = cidx_l[k] - cidx_l[0] + w_len; // Update Llist and Lfirst with the k-column information. if (k < (n - 1)) { Lfirst[k] = cidx_l[k]; if ((Lfirst[k] + 1) < cidx_l[k+1]) { Lfirst[k]++; jjrow = ridx_l[Lfirst[k]]; Llist[k] = Llist[jjrow]; Llist[jjrow] = k; } } } // Build the output matrices L = octave_matrix_t (n, n, total_len); for (i = 0; i <= n; i++) L.cidx (i) = cidx_l[i]; for (i = 0; i < total_len; i++) { L.ridx (i) = ridx_l[i]; L.data (i) = data_l[i]; } } DEFUN (__icholt__, args, , doc: /* -*- texinfo -*- @deftypefn {} {@var{L} =} __icholt__ (@var{A}, @var{droptol}, @var{michol}) Undocumented internal function. @end deftypefn */) { if (args.length () != 3) print_usage (); double droptol = args(1).double_value (); std::string michol = args(2).string_value (); if (! args(0).iscomplex ()) { SparseMatrix L; SparseMatrix sm_l = Ftril (args(0))(0).sparse_matrix_value (); RowVector sm_col_norms = xcolnorms (sm_l, 1); ichol_t <SparseMatrix, double, ichol_mult_real, ichol_checkpivot_real> (sm_l, L, sm_col_norms.fortran_vec (), droptol, michol); return ovl (L); } else { SparseComplexMatrix L; SparseComplexMatrix sm_l = Ftril (args(0))(0).sparse_complex_matrix_value (); Array <Complex> cols_norm = xcolnorms (sm_l, 1); ichol_t <SparseComplexMatrix, Complex, ichol_mult_complex, ichol_checkpivot_complex> (sm_l, L, cols_norm.fortran_vec (), Complex (droptol), michol); return ovl (L); } } /* %!test <*51736> %! k = 4; %! n = 2^k; %! Afull = diag (ones (n,1)) / ... %! 2+triu ([zeros(n,2), [n.^-[1;1;2]*ones(1,n-2);zeros(n-3,n-2)]], 1); %! A = sparse (Afull + Afull.'); %! opts.type = "ict"; %! opts.droptol = 0; %! L = ichol (A, opts); %! assert (norm (A - L*L.'), 0, 2*eps); */ OCTAVE_END_NAMESPACE(octave)