Mercurial > jwe > octave
view libinterp/corefcn/__ichol__.cc @ 21200:fcac5dbbf9ed
maint: Indent #ifdef blocks in libinterp.
* builtins.h, Cell.cc, __contourc__.cc, __dispatch__.cc, __dsearchn__.cc,
__ichol__.cc, __ilu__.cc, __lin_interpn__.cc, __pchip_deriv__.cc, __qp__.cc,
balance.cc, besselj.cc, betainc.cc, bitfcns.cc, bsxfun.cc,
c-file-ptr-stream.cc, c-file-ptr-stream.h, cellfun.cc, colloc.cc,
comment-list.cc, conv2.cc, daspk.cc, dasrt.cc, dassl.cc, data.cc, debug.cc,
defaults.cc, defaults.in.h, defun-dld.h, defun.cc, defun.h, det.cc, dirfns.cc,
display.cc, dlmread.cc, dot.cc, dynamic-ld.cc, eig.cc, ellipj.cc, error.cc,
errwarn.cc, event-queue.cc, fft.cc, fft2.cc, fftn.cc, file-io.cc, filter.cc,
find.cc, gammainc.cc, gcd.cc, getgrent.cc, getpwent.cc, getrusage.cc,
givens.cc, gl-render.cc, gl2ps-print.cc, graphics.cc, graphics.in.h, gripes.cc,
hash.cc, help.cc, hess.cc, hex2num.cc, input.cc, inv.cc, jit-ir.cc,
jit-typeinfo.cc, jit-util.cc, jit-util.h, kron.cc, load-path.cc, load-save.cc,
lookup.cc, ls-ascii-helper.cc, ls-hdf5.cc, ls-mat-ascii.cc, ls-mat4.cc,
ls-mat5.cc, ls-oct-binary.cc, ls-oct-text.cc, ls-oct-text.h, ls-utils.cc,
ls-utils.h, lsode.cc, lu.cc, luinc.cc, mappers.cc, matrix_type.cc, max.cc,
mex.h, mexproto.h, mgorth.cc, nproc.cc, oct-errno.in.cc, oct-fstrm.cc,
oct-hdf5-types.cc, oct-hdf5.h, oct-hist.cc, oct-iostrm.cc, oct-lvalue.cc,
oct-map.cc, oct-prcstrm.cc, oct-procbuf.cc, oct-stream.cc, oct-strstrm.cc,
octave-link.cc, ordschur.cc, pager.cc, pinv.cc, pr-output.cc, procstream.cc,
profiler.cc, psi.cc, pt-jit.cc, quad.cc, quadcc.cc, qz.cc, rand.cc, rcond.cc,
regexp.cc, schur.cc, sighandlers.cc, sparse-xdiv.cc, sparse-xpow.cc, sparse.cc,
spparms.cc, sqrtm.cc, str2double.cc, strfind.cc, strfns.cc, sub2ind.cc, svd.cc,
sylvester.cc, symtab.cc, syscalls.cc, sysdep.cc, sysdep.h, time.cc, toplev.cc,
tril.cc, tsearch.cc, txt-eng-ft.cc, txt-eng.cc, typecast.cc, urlwrite.cc,
utils.cc, variables.cc, xdiv.cc, xnorm.cc, xpow.cc, zfstream.cc,
__delaunayn__.cc, __eigs__.cc, __fltk_uigetfile__.cc, __glpk__.cc,
__init_fltk__.cc, __init_gnuplot__.cc, __magick_read__.cc, __osmesa_print__.cc,
__voronoi__.cc, amd.cc, audiodevinfo.cc, audioread.cc, ccolamd.cc, chol.cc,
colamd.cc, convhulln.cc, dmperm.cc, fftw.cc, oct-qhull.h, qr.cc, symbfact.cc,
symrcm.cc, oct-conf.in.cc, ov-base-diag.cc, ov-base-int.cc, ov-base-mat.cc,
ov-base-scalar.cc, ov-base-sparse.cc, ov-base.cc, ov-bool-mat.cc,
ov-bool-sparse.cc, ov-bool.cc, ov-builtin.cc, ov-cell.cc, ov-ch-mat.cc,
ov-class.cc, ov-classdef.cc, ov-colon.cc, ov-complex.cc, ov-cs-list.cc,
ov-cx-diag.cc, ov-cx-mat.cc, ov-cx-sparse.cc, ov-dld-fcn.cc, ov-fcn-handle.cc,
ov-fcn-inline.cc, ov-fcn.cc, ov-float.cc, ov-flt-complex.cc, ov-flt-cx-diag.cc,
ov-flt-cx-mat.cc, ov-flt-re-diag.cc, ov-flt-re-mat.cc, ov-int16.cc,
ov-int32.cc, ov-int64.cc, ov-int8.cc, ov-java.cc, ov-lazy-idx.cc,
ov-mex-fcn.cc, ov-null-mat.cc, ov-oncleanup.cc, ov-perm.cc, ov-range.cc,
ov-re-diag.cc, ov-re-mat.cc, ov-re-sparse.cc, ov-scalar.cc, ov-str-mat.cc,
ov-struct.cc, ov-typeinfo.cc, ov-uint16.cc, ov-uint32.cc, ov-uint64.cc,
ov-uint8.cc, ov-usr-fcn.cc, ov.cc, ovl.cc, octave.cc, 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-double-conv.cc, op-fcdm-fcdm.cc,
op-fcdm-fdm.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-float-conv.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-int-conv.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-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, pt-arg-list.cc,
pt-array-list.cc, pt-assign.cc, pt-binop.cc, pt-bp.cc, pt-cbinop.cc,
pt-cell.cc, pt-check.cc, pt-classdef.cc, pt-cmd.cc, pt-colon.cc, pt-colon.h,
pt-const.cc, pt-decl.cc, pt-eval.cc, pt-except.cc, pt-exp.cc, pt-fcn-handle.cc,
pt-funcall.cc, pt-id.cc, pt-idx.cc, pt-jump.cc, pt-loop.cc, pt-mat.cc,
pt-misc.cc, pt-pr-code.cc, pt-select.cc, pt-stmt.cc, pt-unop.cc, pt.cc,
token.cc, Array-jit.cc, Array-os.cc, Array-sym.cc, Array-tc.cc, version.cc:
Indent #ifdef blocks in libinterp.
author | Rik <rik@octave.org> |
---|---|
date | Fri, 05 Feb 2016 16:29:08 -0800 |
parents | 6982def1d416 |
children | 40de9f8f23a6 |
line wrap: on
line source
/* Copyright (C) 2014-2015 Eduardo Ramos Fernández <eduradical951@gmail.com> Copyright (C) 2013-2015 Kai T. Ohlhus <k.ohlhus@gmail.com> 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 <http://www.gnu.org/licenses/>. */ #ifdef HAVE_CONFIG_H # include <config.h> #endif #include "oct-locbuf.h" #include "defun.h" #include "error.h" #include "parse.h" // 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 (-std::imag (b)); #elif defined (HAVE_CXX_COMPLEX_REFERENCE_ACCESSORS) b.imag () = -std::imag (b); #else b = std::conj (b); #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; } // Main loop 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]; if (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, , "-*- texinfo -*-\n\ @deftypefn {} {@var{L} =} __ichol0__ (@var{A})\n\ @deftypefnx {} {@var{L} =} __ichol0__ (@var{A}, @var{michol})\n\ Undocumented internal function.\n\ @end deftypefn") { std::string michol = "off"; if (args.length ()) michol = args(1).string_value (); // In ICHOL0 algorithm the zero-pattern of the input matrix is preserved // so it's structure does not change during the algorithm. The same input // matrix is used to build the output matrix due to that fact. octave_value_list param_list; if (! args(0).is_complex_type ()) { SparseMatrix sm = args(0).sparse_matrix_value (); param_list.append (sm); sm = feval ("tril", param_list)(0).sparse_matrix_value (); ichol_0 <SparseMatrix, double, ichol_mult_real, ichol_checkpivot_real> (sm, michol); return ovl (sm); } else { SparseComplexMatrix sm = args(0).sparse_complex_matrix_value (); param_list.append (sm); sm = feval ("tril", param_list)(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; vec.resize (n); 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; vec[i] = 0; } 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]; 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 (w_data[j] == zero) { 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++; } 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, , "-*- texinfo -*-\n\ @deftypefn {} {@var{L} =} __icholt__ (@var{A})\n\ @deftypefnx {} {@var{L} =} __icholt__ (@var{A}, @var{droptol})\n\ @deftypefnx {} {@var{L} =} __icholt__ (@var{A}, @var{droptol}, @var{michol})\n\ Undocumented internal function.\n\ @end deftypefn") { int nargin = args.length (); // Default values of parameters std::string michol = "off"; double droptol = 0; // Don't repeat input validation of arguments done in ichol.m if (nargin >= 2) droptol = args(1).double_value (); if (nargin == 3) michol = args(2).string_value (); octave_value_list param_list; if (! args(0).is_complex_type ()) { Array <double> cols_norm; SparseMatrix L; param_list.append (args(0).sparse_matrix_value ()); SparseMatrix sm_l = feval ("tril", param_list)(0).sparse_matrix_value (); param_list(0) = sm_l; param_list(1) = 1; param_list(2) = "cols"; cols_norm = feval ("norm", param_list)(0).vector_value (); param_list.clear (); ichol_t <SparseMatrix, double, ichol_mult_real, ichol_checkpivot_real> (sm_l, L, cols_norm.fortran_vec (), droptol, michol); return ovl (L); } else { Array <Complex> cols_norm; SparseComplexMatrix L; param_list.append (args(0).sparse_complex_matrix_value ()); SparseComplexMatrix sm_l = feval ("tril", param_list)(0).sparse_complex_matrix_value (); param_list(0) = sm_l; param_list(1) = 1; param_list(2) = "cols"; cols_norm = feval ("norm", param_list)(0).complex_vector_value (); param_list.clear (); ichol_t <SparseComplexMatrix, Complex, ichol_mult_complex, ichol_checkpivot_complex> (sm_l, L, cols_norm.fortran_vec (), Complex (droptol), michol); return ovl (L); } } /* ## No test needed for internal helper function. %!assert (1) */