Mercurial > hg > octave-lyh
comparison liboctave/numeric/sparse-dmsolve.cc @ 15271:648dabbb4c6b
build: Refactor liboctave into multiple subdirectories. Move libcruft into liboctave.
* array/Array-C.cc, array/Array-b.cc, array/Array-ch.cc, array/Array-d.cc,
array/Array-f.cc, array/Array-fC.cc, array/Array-i.cc, array/Array-idx-vec.cc,
array/Array-s.cc, array/Array-str.cc, array/Array-util.cc, array/Array-util.h,
array/Array-voidp.cc, array/Array.cc, array/Array.h, array/Array2.h,
array/Array3.h, array/ArrayN.h, array/CColVector.cc, array/CColVector.h,
array/CDiagMatrix.cc, array/CDiagMatrix.h, array/CMatrix.cc, array/CMatrix.h,
array/CNDArray.cc, array/CNDArray.h, array/CRowVector.cc, array/CRowVector.h,
array/CSparse.cc, array/CSparse.h, array/DiagArray2.cc, array/DiagArray2.h,
array/MArray-C.cc, array/MArray-d.cc, array/MArray-decl.h, array/MArray-defs.h,
array/MArray-f.cc, array/MArray-fC.cc, array/MArray-i.cc, array/MArray-s.cc,
array/MArray.cc, array/MArray.h, array/MArray2.h, array/MArrayN.h,
array/MDiagArray2.cc, array/MDiagArray2.h, array/MSparse-C.cc,
array/MSparse-d.cc, array/MSparse-defs.h, array/MSparse.cc, array/MSparse.h,
array/Matrix.h, array/MatrixType.cc, array/MatrixType.h, array/PermMatrix.cc,
array/PermMatrix.h, array/Range.cc, array/Range.h, array/Sparse-C.cc,
array/Sparse-b.cc, array/Sparse-d.cc, array/Sparse.cc, array/Sparse.h,
array/boolMatrix.cc, array/boolMatrix.h, array/boolNDArray.cc,
array/boolNDArray.h, array/boolSparse.cc, array/boolSparse.h,
array/chMatrix.cc, array/chMatrix.h, array/chNDArray.cc, array/chNDArray.h,
array/dColVector.cc, array/dColVector.h, array/dDiagMatrix.cc,
array/dDiagMatrix.h, array/dMatrix.cc, array/dMatrix.h, array/dNDArray.cc,
array/dNDArray.h, array/dRowVector.cc, array/dRowVector.h, array/dSparse.cc,
array/dSparse.h, array/dim-vector.cc, array/dim-vector.h, array/fCColVector.cc,
array/fCColVector.h, array/fCDiagMatrix.cc, array/fCDiagMatrix.h,
array/fCMatrix.cc, array/fCMatrix.h, array/fCNDArray.cc, array/fCNDArray.h,
array/fCRowVector.cc, array/fCRowVector.h, array/fColVector.cc,
array/fColVector.h, array/fDiagMatrix.cc, array/fDiagMatrix.h,
array/fMatrix.cc, array/fMatrix.h, array/fNDArray.cc, array/fNDArray.h,
array/fRowVector.cc, array/fRowVector.h, array/idx-vector.cc,
array/idx-vector.h, array/int16NDArray.cc, array/int16NDArray.h,
array/int32NDArray.cc, array/int32NDArray.h, array/int64NDArray.cc,
array/int64NDArray.h, array/int8NDArray.cc, array/int8NDArray.h,
array/intNDArray.cc, array/intNDArray.h, array/module.mk,
array/uint16NDArray.cc, array/uint16NDArray.h, array/uint32NDArray.cc,
array/uint32NDArray.h, array/uint64NDArray.cc, array/uint64NDArray.h,
array/uint8NDArray.cc, array/uint8NDArray.h:
Moved from liboctave dir to array subdirectory.
* cruft/Makefile.am, cruft/amos/README, cruft/amos/cacai.f, cruft/amos/cacon.f,
cruft/amos/cairy.f, cruft/amos/casyi.f, cruft/amos/cbesh.f, cruft/amos/cbesi.f,
cruft/amos/cbesj.f, cruft/amos/cbesk.f, cruft/amos/cbesy.f, cruft/amos/cbinu.f,
cruft/amos/cbiry.f, cruft/amos/cbknu.f, cruft/amos/cbuni.f, cruft/amos/cbunk.f,
cruft/amos/ckscl.f, cruft/amos/cmlri.f, cruft/amos/crati.f, cruft/amos/cs1s2.f,
cruft/amos/cseri.f, cruft/amos/cshch.f, cruft/amos/cuchk.f, cruft/amos/cunhj.f,
cruft/amos/cuni1.f, cruft/amos/cuni2.f, cruft/amos/cunik.f, cruft/amos/cunk1.f,
cruft/amos/cunk2.f, cruft/amos/cuoik.f, cruft/amos/cwrsk.f,
cruft/amos/dgamln.f, cruft/amos/gamln.f, cruft/amos/module.mk,
cruft/amos/xzabs.f, cruft/amos/xzexp.f, cruft/amos/xzlog.f,
cruft/amos/xzsqrt.f, cruft/amos/zacai.f, cruft/amos/zacon.f,
cruft/amos/zairy.f, cruft/amos/zasyi.f, cruft/amos/zbesh.f, cruft/amos/zbesi.f,
cruft/amos/zbesj.f, cruft/amos/zbesk.f, cruft/amos/zbesy.f, cruft/amos/zbinu.f,
cruft/amos/zbiry.f, cruft/amos/zbknu.f, cruft/amos/zbuni.f, cruft/amos/zbunk.f,
cruft/amos/zdiv.f, cruft/amos/zkscl.f, cruft/amos/zmlri.f, cruft/amos/zmlt.f,
cruft/amos/zrati.f, cruft/amos/zs1s2.f, cruft/amos/zseri.f, cruft/amos/zshch.f,
cruft/amos/zuchk.f, cruft/amos/zunhj.f, cruft/amos/zuni1.f, cruft/amos/zuni2.f,
cruft/amos/zunik.f, cruft/amos/zunk1.f, cruft/amos/zunk2.f, cruft/amos/zuoik.f,
cruft/amos/zwrsk.f, cruft/blas-xtra/cconv2.f, cruft/blas-xtra/cdotc3.f,
cruft/blas-xtra/cmatm3.f, cruft/blas-xtra/csconv2.f, cruft/blas-xtra/dconv2.f,
cruft/blas-xtra/ddot3.f, cruft/blas-xtra/dmatm3.f, cruft/blas-xtra/module.mk,
cruft/blas-xtra/sconv2.f, cruft/blas-xtra/sdot3.f, cruft/blas-xtra/smatm3.f,
cruft/blas-xtra/xcdotc.f, cruft/blas-xtra/xcdotu.f, cruft/blas-xtra/xddot.f,
cruft/blas-xtra/xdnrm2.f, cruft/blas-xtra/xdznrm2.f, cruft/blas-xtra/xerbla.f,
cruft/blas-xtra/xscnrm2.f, cruft/blas-xtra/xsdot.f, cruft/blas-xtra/xsnrm2.f,
cruft/blas-xtra/xzdotc.f, cruft/blas-xtra/xzdotu.f, cruft/blas-xtra/zconv2.f,
cruft/blas-xtra/zdconv2.f, cruft/blas-xtra/zdotc3.f, cruft/blas-xtra/zmatm3.f,
cruft/daspk/datv.f, cruft/daspk/dcnst0.f, cruft/daspk/dcnstr.f,
cruft/daspk/ddasic.f, cruft/daspk/ddasid.f, cruft/daspk/ddasik.f,
cruft/daspk/ddaspk.f, cruft/daspk/ddstp.f, cruft/daspk/ddwnrm.f,
cruft/daspk/dfnrmd.f, cruft/daspk/dfnrmk.f, cruft/daspk/dhels.f,
cruft/daspk/dheqr.f, cruft/daspk/dinvwt.f, cruft/daspk/dlinsd.f,
cruft/daspk/dlinsk.f, cruft/daspk/dmatd.f, cruft/daspk/dnedd.f,
cruft/daspk/dnedk.f, cruft/daspk/dnsd.f, cruft/daspk/dnsid.f,
cruft/daspk/dnsik.f, cruft/daspk/dnsk.f, cruft/daspk/dorth.f,
cruft/daspk/dslvd.f, cruft/daspk/dslvk.f, cruft/daspk/dspigm.f,
cruft/daspk/dyypnw.f, cruft/daspk/module.mk, cruft/dasrt/ddasrt.f,
cruft/dasrt/drchek.f, cruft/dasrt/droots.f, cruft/dasrt/module.mk,
cruft/dassl/ddaini.f, cruft/dassl/ddajac.f, cruft/dassl/ddanrm.f,
cruft/dassl/ddaslv.f, cruft/dassl/ddassl.f, cruft/dassl/ddastp.f,
cruft/dassl/ddatrp.f, cruft/dassl/ddawts.f, cruft/dassl/module.mk,
cruft/fftpack/cfftb.f, cruft/fftpack/cfftb1.f, cruft/fftpack/cfftf.f,
cruft/fftpack/cfftf1.f, cruft/fftpack/cffti.f, cruft/fftpack/cffti1.f,
cruft/fftpack/fftpack.doc, cruft/fftpack/module.mk, cruft/fftpack/passb.f,
cruft/fftpack/passb2.f, cruft/fftpack/passb3.f, cruft/fftpack/passb4.f,
cruft/fftpack/passb5.f, cruft/fftpack/passf.f, cruft/fftpack/passf2.f,
cruft/fftpack/passf3.f, cruft/fftpack/passf4.f, cruft/fftpack/passf5.f,
cruft/fftpack/zfftb.f, cruft/fftpack/zfftb1.f, cruft/fftpack/zfftf.f,
cruft/fftpack/zfftf1.f, cruft/fftpack/zffti.f, cruft/fftpack/zffti1.f,
cruft/fftpack/zpassb.f, cruft/fftpack/zpassb2.f, cruft/fftpack/zpassb3.f,
cruft/fftpack/zpassb4.f, cruft/fftpack/zpassb5.f, cruft/fftpack/zpassf.f,
cruft/fftpack/zpassf2.f, cruft/fftpack/zpassf3.f, cruft/fftpack/zpassf4.f,
cruft/fftpack/zpassf5.f, cruft/lapack-xtra/crsf2csf.f,
cruft/lapack-xtra/module.mk, cruft/lapack-xtra/xclange.f,
cruft/lapack-xtra/xdlamch.f, cruft/lapack-xtra/xdlange.f,
cruft/lapack-xtra/xilaenv.f, cruft/lapack-xtra/xslamch.f,
cruft/lapack-xtra/xslange.f, cruft/lapack-xtra/xzlange.f,
cruft/lapack-xtra/zrsf2csf.f, cruft/link-deps.mk, cruft/misc/blaswrap.c,
cruft/misc/cquit.c, cruft/misc/d1mach-tst.for, cruft/misc/d1mach.f,
cruft/misc/f77-extern.cc, cruft/misc/f77-fcn.c, cruft/misc/f77-fcn.h,
cruft/misc/i1mach.f, cruft/misc/lo-error.c, cruft/misc/lo-error.h,
cruft/misc/module.mk, cruft/misc/quit.cc, cruft/misc/quit.h,
cruft/misc/r1mach.f, cruft/mkf77def.in, cruft/odepack/cfode.f,
cruft/odepack/dlsode.f, cruft/odepack/ewset.f, cruft/odepack/intdy.f,
cruft/odepack/module.mk, cruft/odepack/prepj.f, cruft/odepack/scfode.f,
cruft/odepack/sewset.f, cruft/odepack/sintdy.f, cruft/odepack/slsode.f,
cruft/odepack/solsy.f, cruft/odepack/sprepj.f, cruft/odepack/ssolsy.f,
cruft/odepack/sstode.f, cruft/odepack/stode.f, cruft/odepack/svnorm.f,
cruft/odepack/vnorm.f, cruft/ordered-qz/README, cruft/ordered-qz/dsubsp.f,
cruft/ordered-qz/exchqz.f, cruft/ordered-qz/module.mk,
cruft/ordered-qz/sexchqz.f, cruft/ordered-qz/ssubsp.f, cruft/quadpack/dqagi.f,
cruft/quadpack/dqagie.f, cruft/quadpack/dqagp.f, cruft/quadpack/dqagpe.f,
cruft/quadpack/dqelg.f, cruft/quadpack/dqk15i.f, cruft/quadpack/dqk21.f,
cruft/quadpack/dqpsrt.f, cruft/quadpack/module.mk, cruft/quadpack/qagi.f,
cruft/quadpack/qagie.f, cruft/quadpack/qagp.f, cruft/quadpack/qagpe.f,
cruft/quadpack/qelg.f, cruft/quadpack/qk15i.f, cruft/quadpack/qk21.f,
cruft/quadpack/qpsrt.f, cruft/quadpack/xerror.f, cruft/ranlib/Basegen.doc,
cruft/ranlib/HOWTOGET, cruft/ranlib/README, cruft/ranlib/advnst.f,
cruft/ranlib/genbet.f, cruft/ranlib/genchi.f, cruft/ranlib/genexp.f,
cruft/ranlib/genf.f, cruft/ranlib/gengam.f, cruft/ranlib/genmn.f,
cruft/ranlib/genmul.f, cruft/ranlib/gennch.f, cruft/ranlib/gennf.f,
cruft/ranlib/gennor.f, cruft/ranlib/genprm.f, cruft/ranlib/genunf.f,
cruft/ranlib/getcgn.f, cruft/ranlib/getsd.f, cruft/ranlib/ignbin.f,
cruft/ranlib/ignlgi.f, cruft/ranlib/ignnbn.f, cruft/ranlib/ignpoi.f,
cruft/ranlib/ignuin.f, cruft/ranlib/initgn.f, cruft/ranlib/inrgcm.f,
cruft/ranlib/lennob.f, cruft/ranlib/mltmod.f, cruft/ranlib/module.mk,
cruft/ranlib/phrtsd.f, cruft/ranlib/qrgnin.f, cruft/ranlib/randlib.chs,
cruft/ranlib/randlib.fdoc, cruft/ranlib/ranf.f, cruft/ranlib/setall.f,
cruft/ranlib/setant.f, cruft/ranlib/setgmn.f, cruft/ranlib/setsd.f,
cruft/ranlib/sexpo.f, cruft/ranlib/sgamma.f, cruft/ranlib/snorm.f,
cruft/ranlib/tstbot.for, cruft/ranlib/tstgmn.for, cruft/ranlib/tstmid.for,
cruft/ranlib/wrap.f, cruft/slatec-err/fdump.f, cruft/slatec-err/ixsav.f,
cruft/slatec-err/j4save.f, cruft/slatec-err/module.mk,
cruft/slatec-err/xerclr.f, cruft/slatec-err/xercnt.f,
cruft/slatec-err/xerhlt.f, cruft/slatec-err/xermsg.f,
cruft/slatec-err/xerprn.f, cruft/slatec-err/xerrwd.f,
cruft/slatec-err/xersve.f, cruft/slatec-err/xgetf.f, cruft/slatec-err/xgetua.f,
cruft/slatec-err/xsetf.f, cruft/slatec-err/xsetua.f, cruft/slatec-fn/acosh.f,
cruft/slatec-fn/albeta.f, cruft/slatec-fn/algams.f, cruft/slatec-fn/alngam.f,
cruft/slatec-fn/alnrel.f, cruft/slatec-fn/asinh.f, cruft/slatec-fn/atanh.f,
cruft/slatec-fn/betai.f, cruft/slatec-fn/csevl.f, cruft/slatec-fn/d9gmit.f,
cruft/slatec-fn/d9lgic.f, cruft/slatec-fn/d9lgit.f, cruft/slatec-fn/d9lgmc.f,
cruft/slatec-fn/dacosh.f, cruft/slatec-fn/dasinh.f, cruft/slatec-fn/datanh.f,
cruft/slatec-fn/dbetai.f, cruft/slatec-fn/dcsevl.f, cruft/slatec-fn/derf.f,
cruft/slatec-fn/derfc.in.f, cruft/slatec-fn/dgami.f, cruft/slatec-fn/dgamit.f,
cruft/slatec-fn/dgamlm.f, cruft/slatec-fn/dgamma.f, cruft/slatec-fn/dgamr.f,
cruft/slatec-fn/dlbeta.f, cruft/slatec-fn/dlgams.f, cruft/slatec-fn/dlngam.f,
cruft/slatec-fn/dlnrel.f, cruft/slatec-fn/dpchim.f, cruft/slatec-fn/dpchst.f,
cruft/slatec-fn/erf.f, cruft/slatec-fn/erfc.in.f, cruft/slatec-fn/gami.f,
cruft/slatec-fn/gamit.f, cruft/slatec-fn/gamlim.f, cruft/slatec-fn/gamma.f,
cruft/slatec-fn/gamr.f, cruft/slatec-fn/initds.f, cruft/slatec-fn/inits.f,
cruft/slatec-fn/module.mk, cruft/slatec-fn/pchim.f, cruft/slatec-fn/pchst.f,
cruft/slatec-fn/r9gmit.f, cruft/slatec-fn/r9lgic.f, cruft/slatec-fn/r9lgit.f,
cruft/slatec-fn/r9lgmc.f, cruft/slatec-fn/xacosh.f, cruft/slatec-fn/xasinh.f,
cruft/slatec-fn/xatanh.f, cruft/slatec-fn/xbetai.f, cruft/slatec-fn/xdacosh.f,
cruft/slatec-fn/xdasinh.f, cruft/slatec-fn/xdatanh.f,
cruft/slatec-fn/xdbetai.f, cruft/slatec-fn/xderf.f, cruft/slatec-fn/xderfc.f,
cruft/slatec-fn/xdgami.f, cruft/slatec-fn/xdgamit.f, cruft/slatec-fn/xdgamma.f,
cruft/slatec-fn/xerf.f, cruft/slatec-fn/xerfc.f, cruft/slatec-fn/xgamma.f,
cruft/slatec-fn/xgmainc.f, cruft/slatec-fn/xsgmainc.f:
Moved from top-level libcruft to cruft directory below liboctave.
* numeric/CmplxAEPBAL.cc, numeric/CmplxAEPBAL.h, numeric/CmplxCHOL.cc,
numeric/CmplxCHOL.h, numeric/CmplxGEPBAL.cc, numeric/CmplxGEPBAL.h,
numeric/CmplxHESS.cc, numeric/CmplxHESS.h, numeric/CmplxLU.cc,
numeric/CmplxLU.h, numeric/CmplxQR.cc, numeric/CmplxQR.h, numeric/CmplxQRP.cc,
numeric/CmplxQRP.h, numeric/CmplxSCHUR.cc, numeric/CmplxSCHUR.h,
numeric/CmplxSVD.cc, numeric/CmplxSVD.h, numeric/CollocWt.cc,
numeric/CollocWt.h, numeric/DAE.h, numeric/DAEFunc.h, numeric/DAERT.h,
numeric/DAERTFunc.h, numeric/DASPK-opts.in, numeric/DASPK.cc, numeric/DASPK.h,
numeric/DASRT-opts.in, numeric/DASRT.cc, numeric/DASRT.h,
numeric/DASSL-opts.in, numeric/DASSL.cc, numeric/DASSL.h, numeric/DET.h,
numeric/EIG.cc, numeric/EIG.h, numeric/LSODE-opts.in, numeric/LSODE.cc,
numeric/LSODE.h, numeric/ODE.h, numeric/ODEFunc.h, numeric/ODES.cc,
numeric/ODES.h, numeric/ODESFunc.h, numeric/Quad-opts.in, numeric/Quad.cc,
numeric/Quad.h, numeric/SparseCmplxCHOL.cc, numeric/SparseCmplxCHOL.h,
numeric/SparseCmplxLU.cc, numeric/SparseCmplxLU.h, numeric/SparseCmplxQR.cc,
numeric/SparseCmplxQR.h, numeric/SparseQR.cc, numeric/SparseQR.h,
numeric/SparsedbleCHOL.cc, numeric/SparsedbleCHOL.h, numeric/SparsedbleLU.cc,
numeric/SparsedbleLU.h, numeric/base-aepbal.h, numeric/base-dae.h,
numeric/base-de.h, numeric/base-lu.cc, numeric/base-lu.h, numeric/base-min.h,
numeric/base-qr.cc, numeric/base-qr.h, numeric/bsxfun-decl.h,
numeric/bsxfun-defs.cc, numeric/bsxfun.h, numeric/dbleAEPBAL.cc,
numeric/dbleAEPBAL.h, numeric/dbleCHOL.cc, numeric/dbleCHOL.h,
numeric/dbleGEPBAL.cc, numeric/dbleGEPBAL.h, numeric/dbleHESS.cc,
numeric/dbleHESS.h, numeric/dbleLU.cc, numeric/dbleLU.h, numeric/dbleQR.cc,
numeric/dbleQR.h, numeric/dbleQRP.cc, numeric/dbleQRP.h, numeric/dbleSCHUR.cc,
numeric/dbleSCHUR.h, numeric/dbleSVD.cc, numeric/dbleSVD.h,
numeric/eigs-base.cc, numeric/fCmplxAEPBAL.cc, numeric/fCmplxAEPBAL.h,
numeric/fCmplxCHOL.cc, numeric/fCmplxCHOL.h, numeric/fCmplxGEPBAL.cc,
numeric/fCmplxGEPBAL.h, numeric/fCmplxHESS.cc, numeric/fCmplxHESS.h,
numeric/fCmplxLU.cc, numeric/fCmplxLU.h, numeric/fCmplxQR.cc,
numeric/fCmplxQR.h, numeric/fCmplxQRP.cc, numeric/fCmplxQRP.h,
numeric/fCmplxSCHUR.cc, numeric/fCmplxSCHUR.h, numeric/fCmplxSVD.cc,
numeric/fCmplxSVD.h, numeric/fEIG.cc, numeric/fEIG.h, numeric/floatAEPBAL.cc,
numeric/floatAEPBAL.h, numeric/floatCHOL.cc, numeric/floatCHOL.h,
numeric/floatGEPBAL.cc, numeric/floatGEPBAL.h, numeric/floatHESS.cc,
numeric/floatHESS.h, numeric/floatLU.cc, numeric/floatLU.h, numeric/floatQR.cc,
numeric/floatQR.h, numeric/floatQRP.cc, numeric/floatQRP.h,
numeric/floatSCHUR.cc, numeric/floatSCHUR.h, numeric/floatSVD.cc,
numeric/floatSVD.h, numeric/lo-mappers.cc, numeric/lo-mappers.h,
numeric/lo-specfun.cc, numeric/lo-specfun.h, numeric/module.mk,
numeric/oct-convn.cc, numeric/oct-convn.h, numeric/oct-fftw.cc,
numeric/oct-fftw.h, numeric/oct-norm.cc, numeric/oct-norm.h,
numeric/oct-rand.cc, numeric/oct-rand.h, numeric/oct-spparms.cc,
numeric/oct-spparms.h, numeric/randgamma.c, numeric/randgamma.h,
numeric/randmtzig.c, numeric/randmtzig.h, numeric/randpoisson.c,
numeric/randpoisson.h, numeric/sparse-base-chol.cc, numeric/sparse-base-chol.h,
numeric/sparse-base-lu.cc, numeric/sparse-base-lu.h, numeric/sparse-dmsolve.cc:
Moved from liboctave dir to numeric subdirectory.
* operators/Sparse-diag-op-defs.h, operators/Sparse-op-defs.h,
operators/Sparse-perm-op-defs.h, operators/config-ops.sh, operators/mk-ops.awk,
operators/module.mk, operators/mx-base.h, operators/mx-defs.h,
operators/mx-ext.h, operators/mx-inlines.cc, operators/mx-op-decl.h,
operators/mx-op-defs.h, operators/mx-ops, operators/sparse-mk-ops.awk,
operators/sparse-mx-ops, operators/vx-ops:
Moved from liboctave dir to operators subdirectory.
* system/dir-ops.cc, system/dir-ops.h, system/file-ops.cc, system/file-ops.h,
system/file-stat.cc, system/file-stat.h, system/lo-sysdep.cc,
system/lo-sysdep.h, system/mach-info.cc, system/mach-info.h, system/module.mk,
system/oct-env.cc, system/oct-env.h, system/oct-group.cc, system/oct-group.h,
system/oct-openmp.h, system/oct-passwd.cc, system/oct-passwd.h,
system/oct-syscalls.cc, system/oct-syscalls.h, system/oct-time.cc,
system/oct-time.h, system/oct-uname.cc, system/oct-uname.h, system/pathlen.h,
system/sysdir.h, system/syswait.h, system/tempnam.c, system/tempname.c:
Moved from liboctave dir to system subdirectory.
* util/base-list.h, util/byte-swap.h, util/caseless-str.h, util/cmd-edit.cc,
util/cmd-edit.h, util/cmd-hist.cc, util/cmd-hist.h, util/data-conv.cc,
util/data-conv.h, util/f2c-main.c, util/functor.h, util/glob-match.cc,
util/glob-match.h, util/kpse.cc, util/lo-array-gripes.cc,
util/lo-array-gripes.h, util/lo-cieee.c, util/lo-cutils.c, util/lo-cutils.h,
util/lo-ieee.cc, util/lo-ieee.h, util/lo-macros.h, util/lo-math.h,
util/lo-traits.h, util/lo-utils.cc, util/lo-utils.h, util/module.mk,
util/oct-alloc.cc, util/oct-alloc.h, util/oct-base64.cc, util/oct-base64.h,
util/oct-binmap.h, util/oct-cmplx.h, util/oct-glob.cc, util/oct-glob.h,
util/oct-inttypes.cc, util/oct-inttypes.h, util/oct-locbuf.cc,
util/oct-locbuf.h, util/oct-md5.cc, util/oct-md5.h, util/oct-mem.h,
util/oct-mutex.cc, util/oct-mutex.h, util/oct-refcount.h, util/oct-rl-edit.c,
util/oct-rl-edit.h, util/oct-rl-hist.c, util/oct-rl-hist.h, util/oct-shlib.cc,
util/oct-shlib.h, util/oct-sort.cc, util/oct-sort.h, util/oct-sparse.h,
util/pathsearch.cc, util/pathsearch.h, util/regexp.cc, util/regexp.h,
util/singleton-cleanup.cc, util/singleton-cleanup.h, util/sparse-sort.cc,
util/sparse-sort.h, util/sparse-util.cc, util/sparse-util.h, util/statdefs.h,
util/str-vec.cc, util/str-vec.h, util/sun-utils.h:
Moved from liboctave dir to util subdirectory.
* Makefile.am: Eliminate reference to top-level liboctave directory.
* autogen.sh: cd to new liboctave/operators directory to run config-ops.sh.
* build-aux/common.mk: Eliminate LIBCRUFT references.
* configure.ac: Eliminate libcruft top-level references. Switch test
programs to find files in liboctave/cruft subdirectory.
* OctaveFAQ.texi, install.txi, mkoctfile.1: Eliminate references to libcruft in
docs.
* libgui/src/Makefile.am, libinterp/Makefile.am, src/Makefile.am: Update
include file locations. Stop linking against libcruft.
* libinterp/corefcn/module.mk: Update location of OPT_INC files which are
now in numeric/ subdirectory.
* libinterp/dldfcn/config-module.awk: Stop linking against libcruft.
* libinterp/interpfcn/toplev.cc: Remove reference to LIBCRUFT.
* libinterp/link-deps.mk, liboctave/link-deps.mk:
Add GNULIB_LINK_DEPS to link dependencies.
* libinterp/oct-conf.in.h: Remove reference to OCTAVE_CONF_LIBCRUFT.
* liboctave/Makefile.am: Overhaul to use convenience libraries in
subdirectories.
* scripts/miscellaneous/mkoctfile.m: Eliminate reference to LIBCRUFT.
* src/mkoctfile.in.cc, src/mkoctfile.in.sh: Stop linking againt libcruft.
Eliminate references to LIBCRUFT.
| author | Rik <rik@octave.org> |
|---|---|
| date | Fri, 31 Aug 2012 20:00:20 -0700 |
| parents | liboctave/sparse-dmsolve.cc@4328e28414aa |
| children | 9ccf4ffb9fa2 |
comparison
equal
deleted
inserted
replaced
| 15270:6615a46d90ec | 15271:648dabbb4c6b |
|---|---|
| 1 /* | |
| 2 | |
| 3 Copyright (C) 2006-2012 David Bateman | |
| 4 | |
| 5 This file is part of Octave. | |
| 6 | |
| 7 Octave is free software; you can redistribute it and/or modify it | |
| 8 under the terms of the GNU General Public License as published by the | |
| 9 Free Software Foundation; either version 3 of the License, or (at your | |
| 10 option) any later version. | |
| 11 | |
| 12 Octave is distributed in the hope that it will be useful, but WITHOUT | |
| 13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 15 for more details. | |
| 16 | |
| 17 You should have received a copy of the GNU General Public License | |
| 18 along with Octave; see the file COPYING. If not, see | |
| 19 <http://www.gnu.org/licenses/>. | |
| 20 | |
| 21 */ | |
| 22 | |
| 23 #ifdef HAVE_CONFIG_H | |
| 24 #include <config.h> | |
| 25 #endif | |
| 26 | |
| 27 #include <vector> | |
| 28 | |
| 29 #include "MArray.h" | |
| 30 #include "MSparse.h" | |
| 31 #include "SparseQR.h" | |
| 32 #include "SparseCmplxQR.h" | |
| 33 #include "MatrixType.h" | |
| 34 #include "oct-sort.h" | |
| 35 #include "oct-locbuf.h" | |
| 36 #include "oct-inttypes.h" | |
| 37 | |
| 38 template <class T> | |
| 39 static MSparse<T> | |
| 40 dmsolve_extract (const MSparse<T> &A, const octave_idx_type *Pinv, | |
| 41 const octave_idx_type *Q, octave_idx_type rst, | |
| 42 octave_idx_type rend, octave_idx_type cst, | |
| 43 octave_idx_type cend, octave_idx_type maxnz = -1, | |
| 44 bool lazy = false) | |
| 45 { | |
| 46 octave_idx_type nr = rend - rst, nc = cend - cst; | |
| 47 maxnz = (maxnz < 0 ? A.nnz () : maxnz); | |
| 48 octave_idx_type nz; | |
| 49 | |
| 50 // Cast to uint64 to handle overflow in this multiplication | |
| 51 if (octave_uint64 (nr)*octave_uint64 (nc) < octave_uint64 (maxnz)) | |
| 52 nz = nr*nc; | |
| 53 else | |
| 54 nz = maxnz; | |
| 55 | |
| 56 MSparse<T> B (nr, nc, (nz < maxnz ? nz : maxnz)); | |
| 57 // Some sparse functions can support lazy indexing (where elements | |
| 58 // in the row are in no particular order), even though octave in | |
| 59 // general can't. For those functions that can using it is a big | |
| 60 // win here in terms of speed. | |
| 61 if (lazy) | |
| 62 { | |
| 63 nz = 0; | |
| 64 for (octave_idx_type j = cst ; j < cend ; j++) | |
| 65 { | |
| 66 octave_idx_type qq = (Q ? Q[j] : j); | |
| 67 B.xcidx (j - cst) = nz; | |
| 68 for (octave_idx_type p = A.cidx (qq) ; p < A.cidx (qq+1) ; p++) | |
| 69 { | |
| 70 octave_quit (); | |
| 71 octave_idx_type r = (Pinv ? Pinv[A.ridx (p)] : A.ridx (p)); | |
| 72 if (r >= rst && r < rend) | |
| 73 { | |
| 74 B.xdata (nz) = A.data (p); | |
| 75 B.xridx (nz++) = r - rst ; | |
| 76 } | |
| 77 } | |
| 78 } | |
| 79 B.xcidx (cend - cst) = nz ; | |
| 80 } | |
| 81 else | |
| 82 { | |
| 83 OCTAVE_LOCAL_BUFFER (T, X, rend - rst); | |
| 84 octave_sort<octave_idx_type> sort; | |
| 85 octave_idx_type *ri = B.xridx (); | |
| 86 nz = 0; | |
| 87 for (octave_idx_type j = cst ; j < cend ; j++) | |
| 88 { | |
| 89 octave_idx_type qq = (Q ? Q[j] : j); | |
| 90 B.xcidx (j - cst) = nz; | |
| 91 for (octave_idx_type p = A.cidx (qq) ; p < A.cidx (qq+1) ; p++) | |
| 92 { | |
| 93 octave_quit (); | |
| 94 octave_idx_type r = (Pinv ? Pinv[A.ridx (p)] : A.ridx (p)); | |
| 95 if (r >= rst && r < rend) | |
| 96 { | |
| 97 X[r-rst] = A.data (p); | |
| 98 B.xridx (nz++) = r - rst ; | |
| 99 } | |
| 100 } | |
| 101 sort.sort (ri + B.xcidx (j - cst), nz - B.xcidx (j - cst)); | |
| 102 for (octave_idx_type p = B.cidx (j - cst); p < nz; p++) | |
| 103 B.xdata (p) = X[B.xridx (p)]; | |
| 104 } | |
| 105 B.xcidx (cend - cst) = nz ; | |
| 106 } | |
| 107 | |
| 108 return B; | |
| 109 } | |
| 110 | |
| 111 #if !defined (CXX_NEW_FRIEND_TEMPLATE_DECL) | |
| 112 static MSparse<double> | |
| 113 dmsolve_extract (const MSparse<double> &A, const octave_idx_type *Pinv, | |
| 114 const octave_idx_type *Q, octave_idx_type rst, | |
| 115 octave_idx_type rend, octave_idx_type cst, | |
| 116 octave_idx_type cend, octave_idx_type maxnz, | |
| 117 bool lazy); | |
| 118 | |
| 119 static MSparse<Complex> | |
| 120 dmsolve_extract (const MSparse<Complex> &A, const octave_idx_type *Pinv, | |
| 121 const octave_idx_type *Q, octave_idx_type rst, | |
| 122 octave_idx_type rend, octave_idx_type cst, | |
| 123 octave_idx_type cend, octave_idx_type maxnz, | |
| 124 bool lazy); | |
| 125 #endif | |
| 126 | |
| 127 template <class T> | |
| 128 static MArray<T> | |
| 129 dmsolve_extract (const MArray<T> &m, const octave_idx_type *, | |
| 130 const octave_idx_type *, octave_idx_type r1, | |
| 131 octave_idx_type r2, octave_idx_type c1, | |
| 132 octave_idx_type c2) | |
| 133 { | |
| 134 r2 -= 1; | |
| 135 c2 -= 1; | |
| 136 if (r1 > r2) { octave_idx_type tmp = r1; r1 = r2; r2 = tmp; } | |
| 137 if (c1 > c2) { octave_idx_type tmp = c1; c1 = c2; c2 = tmp; } | |
| 138 | |
| 139 octave_idx_type new_r = r2 - r1 + 1; | |
| 140 octave_idx_type new_c = c2 - c1 + 1; | |
| 141 | |
| 142 MArray<T> result (dim_vector (new_r, new_c)); | |
| 143 | |
| 144 for (octave_idx_type j = 0; j < new_c; j++) | |
| 145 for (octave_idx_type i = 0; i < new_r; i++) | |
| 146 result.xelem (i, j) = m.elem (r1+i, c1+j); | |
| 147 | |
| 148 return result; | |
| 149 } | |
| 150 | |
| 151 #if !defined (CXX_NEW_FRIEND_TEMPLATE_DECL) | |
| 152 static MArray<double> | |
| 153 dmsolve_extract (const MArray<double> &m, const octave_idx_type *, | |
| 154 const octave_idx_type *, octave_idx_type r1, | |
| 155 octave_idx_type r2, octave_idx_type c1, | |
| 156 octave_idx_type c2) | |
| 157 | |
| 158 static MArray<Complex> | |
| 159 dmsolve_extract (const MArray<Complex> &m, const octave_idx_type *, | |
| 160 const octave_idx_type *, octave_idx_type r1, | |
| 161 octave_idx_type r2, octave_idx_type c1, | |
| 162 octave_idx_type c2) | |
| 163 #endif | |
| 164 | |
| 165 template <class T> | |
| 166 static void | |
| 167 dmsolve_insert (MArray<T> &a, const MArray<T> &b, const octave_idx_type *Q, | |
| 168 octave_idx_type r, octave_idx_type c) | |
| 169 { | |
| 170 T *ax = a.fortran_vec (); | |
| 171 const T *bx = b.fortran_vec (); | |
| 172 octave_idx_type anr = a.rows (); | |
| 173 octave_idx_type nr = b.rows (); | |
| 174 octave_idx_type nc = b.cols (); | |
| 175 for (octave_idx_type j = 0; j < nc; j++) | |
| 176 { | |
| 177 octave_idx_type aoff = (c + j) * anr; | |
| 178 octave_idx_type boff = j * nr; | |
| 179 for (octave_idx_type i = 0; i < nr; i++) | |
| 180 { | |
| 181 octave_quit (); | |
| 182 ax[Q[r + i] + aoff] = bx[i + boff]; | |
| 183 } | |
| 184 } | |
| 185 } | |
| 186 | |
| 187 #if !defined (CXX_NEW_FRIEND_TEMPLATE_DECL) | |
| 188 static void | |
| 189 dmsolve_insert (MArray<double> &a, const MArray<double> &b, | |
| 190 const octave_idx_type *Q, octave_idx_type r, octave_idx_type c); | |
| 191 | |
| 192 static void | |
| 193 dmsolve_insert (MArray<Complex> &a, const MArray<Complex> &b, | |
| 194 const octave_idx_type *Q, octave_idx_type r, octave_idx_type c); | |
| 195 #endif | |
| 196 | |
| 197 template <class T> | |
| 198 static void | |
| 199 dmsolve_insert (MSparse<T> &a, const MSparse<T> &b, const octave_idx_type *Q, | |
| 200 octave_idx_type r, octave_idx_type c) | |
| 201 { | |
| 202 octave_idx_type b_rows = b.rows (); | |
| 203 octave_idx_type b_cols = b.cols (); | |
| 204 octave_idx_type nr = a.rows (); | |
| 205 octave_idx_type nc = a.cols (); | |
| 206 | |
| 207 OCTAVE_LOCAL_BUFFER (octave_idx_type, Qinv, nr); | |
| 208 for (octave_idx_type i = 0; i < nr; i++) | |
| 209 Qinv[Q[i]] = i; | |
| 210 | |
| 211 // First count the number of elements in the final array | |
| 212 octave_idx_type nel = a.xcidx (c) + b.nnz (); | |
| 213 | |
| 214 if (c + b_cols < nc) | |
| 215 nel += a.xcidx (nc) - a.xcidx (c + b_cols); | |
| 216 | |
| 217 for (octave_idx_type i = c; i < c + b_cols; i++) | |
| 218 for (octave_idx_type j = a.xcidx (i); j < a.xcidx (i+1); j++) | |
| 219 if (Qinv[a.xridx (j)] < r || Qinv[a.xridx (j)] >= r + b_rows) | |
| 220 nel++; | |
| 221 | |
| 222 OCTAVE_LOCAL_BUFFER (T, X, nr); | |
| 223 octave_sort<octave_idx_type> sort; | |
| 224 MSparse<T> tmp (a); | |
| 225 a = MSparse<T> (nr, nc, nel); | |
| 226 octave_idx_type *ri = a.xridx (); | |
| 227 | |
| 228 for (octave_idx_type i = 0; i < tmp.cidx (c); i++) | |
| 229 { | |
| 230 a.xdata (i) = tmp.xdata (i); | |
| 231 a.xridx (i) = tmp.xridx (i); | |
| 232 } | |
| 233 for (octave_idx_type i = 0; i < c + 1; i++) | |
| 234 a.xcidx (i) = tmp.xcidx (i); | |
| 235 | |
| 236 octave_idx_type ii = a.xcidx (c); | |
| 237 | |
| 238 for (octave_idx_type i = c; i < c + b_cols; i++) | |
| 239 { | |
| 240 octave_quit (); | |
| 241 | |
| 242 for (octave_idx_type j = tmp.xcidx (i); j < tmp.xcidx (i+1); j++) | |
| 243 if (Qinv[tmp.xridx (j)] < r || Qinv[tmp.xridx (j)] >= r + b_rows) | |
| 244 { | |
| 245 X[tmp.xridx (j)] = tmp.xdata (j); | |
| 246 a.xridx (ii++) = tmp.xridx (j); | |
| 247 } | |
| 248 | |
| 249 octave_quit (); | |
| 250 | |
| 251 for (octave_idx_type j = b.cidx (i-c); j < b.cidx (i-c+1); j++) | |
| 252 { | |
| 253 X[Q[r + b.ridx (j)]] = b.data (j); | |
| 254 a.xridx (ii++) = Q[r + b.ridx (j)]; | |
| 255 } | |
| 256 | |
| 257 sort.sort (ri + a.xcidx (i), ii - a.xcidx (i)); | |
| 258 for (octave_idx_type p = a.xcidx (i); p < ii; p++) | |
| 259 a.xdata (p) = X[a.xridx (p)]; | |
| 260 a.xcidx (i+1) = ii; | |
| 261 } | |
| 262 | |
| 263 for (octave_idx_type i = c + b_cols; i < nc; i++) | |
| 264 { | |
| 265 for (octave_idx_type j = tmp.xcidx (i); j < tmp.cidx (i+1); j++) | |
| 266 { | |
| 267 a.xdata (ii) = tmp.xdata (j); | |
| 268 a.xridx (ii++) = tmp.xridx (j); | |
| 269 } | |
| 270 a.xcidx (i+1) = ii; | |
| 271 } | |
| 272 } | |
| 273 | |
| 274 #if !defined (CXX_NEW_FRIEND_TEMPLATE_DECL) | |
| 275 static void | |
| 276 dmsolve_insert (MSparse<double> &a, const SparseMatrix &b, | |
| 277 const octave_idx_type *Q, octave_idx_type r, octave_idx_type c); | |
| 278 | |
| 279 static void | |
| 280 dmsolve_insert (MSparse<Complex> &a, const MSparse<Complex> &b, | |
| 281 const octave_idx_type *Q, octave_idx_type r, octave_idx_type c); | |
| 282 #endif | |
| 283 | |
| 284 template <class T, class RT> | |
| 285 static void | |
| 286 dmsolve_permute (MArray<RT> &a, const MArray<T>& b, const octave_idx_type *p) | |
| 287 { | |
| 288 octave_idx_type b_nr = b.rows (); | |
| 289 octave_idx_type b_nc = b.cols (); | |
| 290 const T *Bx = b.fortran_vec (); | |
| 291 a.resize (dim_vector (b_nr, b_nc)); | |
| 292 RT *Btx = a.fortran_vec (); | |
| 293 for (octave_idx_type j = 0; j < b_nc; j++) | |
| 294 { | |
| 295 octave_idx_type off = j * b_nr; | |
| 296 for (octave_idx_type i = 0; i < b_nr; i++) | |
| 297 { | |
| 298 octave_quit (); | |
| 299 Btx[p[i] + off] = Bx[ i + off]; | |
| 300 } | |
| 301 } | |
| 302 } | |
| 303 | |
| 304 #if !defined (CXX_NEW_FRIEND_TEMPLATE_DECL) | |
| 305 static void | |
| 306 dmsolve_permute (MArray<double> &a, const MArray<double>& b, | |
| 307 const octave_idx_type *p); | |
| 308 | |
| 309 static void | |
| 310 dmsolve_permute (MArray<Complex> &a, const MArray<double>& b, | |
| 311 const octave_idx_type *p); | |
| 312 | |
| 313 static void | |
| 314 dmsolve_permute (MArray<Complex> &a, const MArray<Complex>& b, | |
| 315 const octave_idx_type *p); | |
| 316 #endif | |
| 317 | |
| 318 template <class T, class RT> | |
| 319 static void | |
| 320 dmsolve_permute (MSparse<RT> &a, const MSparse<T>& b, const octave_idx_type *p) | |
| 321 { | |
| 322 octave_idx_type b_nr = b.rows (); | |
| 323 octave_idx_type b_nc = b.cols (); | |
| 324 octave_idx_type b_nz = b.nnz (); | |
| 325 octave_idx_type nz = 0; | |
| 326 a = MSparse<RT> (b_nr, b_nc, b_nz); | |
| 327 octave_sort<octave_idx_type> sort; | |
| 328 octave_idx_type *ri = a.xridx (); | |
| 329 OCTAVE_LOCAL_BUFFER (RT, X, b_nr); | |
| 330 a.xcidx (0) = 0; | |
| 331 for (octave_idx_type j = 0; j < b_nc; j++) | |
| 332 { | |
| 333 for (octave_idx_type i = b.cidx (j); i < b.cidx (j+1); i++) | |
| 334 { | |
| 335 octave_quit (); | |
| 336 octave_idx_type r = p[b.ridx (i)]; | |
| 337 X[r] = b.data (i); | |
| 338 a.xridx (nz++) = p[b.ridx (i)]; | |
| 339 } | |
| 340 sort.sort (ri + a.xcidx (j), nz - a.xcidx (j)); | |
| 341 for (octave_idx_type i = a.cidx (j); i < nz; i++) | |
| 342 { | |
| 343 octave_quit (); | |
| 344 a.xdata (i) = X[a.xridx (i)]; | |
| 345 } | |
| 346 a.xcidx (j+1) = nz; | |
| 347 } | |
| 348 } | |
| 349 | |
| 350 #if !defined (CXX_NEW_FRIEND_TEMPLATE_DECL) | |
| 351 static void | |
| 352 dmsolve_permute (MSparse<double> &a, const MSparse<double>& b, | |
| 353 const octave_idx_type *p); | |
| 354 | |
| 355 static void | |
| 356 dmsolve_permute (MSparse<Complex> &a, const MSparse<double>& b, | |
| 357 const octave_idx_type *p); | |
| 358 | |
| 359 static void | |
| 360 dmsolve_permute (MSparse<Complex> &a, const MSparse<Complex>& b, | |
| 361 const octave_idx_type *p); | |
| 362 #endif | |
| 363 | |
| 364 static void | |
| 365 solve_singularity_warning (double) | |
| 366 { | |
| 367 // Dummy singularity handler so that LU solver doesn't flag | |
| 368 // an error for numerically rank defficient matrices | |
| 369 } | |
| 370 | |
| 371 template <class RT, class ST, class T> | |
| 372 RT | |
| 373 dmsolve (const ST &a, const T &b, octave_idx_type &info) | |
| 374 { | |
| 375 #ifdef HAVE_CXSPARSE | |
| 376 octave_idx_type nr = a.rows (); | |
| 377 octave_idx_type nc = a.cols (); | |
| 378 octave_idx_type b_nr = b.rows (); | |
| 379 octave_idx_type b_nc = b.cols (); | |
| 380 RT retval; | |
| 381 | |
| 382 if (nr < 0 || nc < 0 || nr != b_nr) | |
| 383 (*current_liboctave_error_handler) | |
| 384 ("matrix dimension mismatch in solution of minimum norm problem"); | |
| 385 else if (nr == 0 || nc == 0 || b_nc == 0) | |
| 386 retval = RT (nc, b_nc, 0.0); | |
| 387 else | |
| 388 { | |
| 389 octave_idx_type nnz_remaining = a.nnz (); | |
| 390 CXSPARSE_DNAME () csm; | |
| 391 csm.m = nr; | |
| 392 csm.n = nc; | |
| 393 csm.x = 0; | |
| 394 csm.nz = -1; | |
| 395 csm.nzmax = a.nnz (); | |
| 396 // Cast away const on A, with full knowledge that CSparse won't touch it. | |
| 397 // Prevents the methods below making a copy of the data. | |
| 398 csm.p = const_cast<octave_idx_type *>(a.cidx ()); | |
| 399 csm.i = const_cast<octave_idx_type *>(a.ridx ()); | |
| 400 | |
| 401 #if defined (CS_VER) && (CS_VER >= 2) | |
| 402 CXSPARSE_DNAME (d) *dm = CXSPARSE_DNAME(_dmperm) (&csm, 0); | |
| 403 octave_idx_type *p = dm->p; | |
| 404 octave_idx_type *q = dm->q; | |
| 405 #else | |
| 406 CXSPARSE_DNAME (d) *dm = CXSPARSE_DNAME(_dmperm) (&csm); | |
| 407 octave_idx_type *p = dm->P; | |
| 408 octave_idx_type *q = dm->Q; | |
| 409 #endif | |
| 410 OCTAVE_LOCAL_BUFFER (octave_idx_type, pinv, nr); | |
| 411 for (octave_idx_type i = 0; i < nr; i++) | |
| 412 pinv[p[i]] = i; | |
| 413 RT btmp; | |
| 414 dmsolve_permute (btmp, b, pinv); | |
| 415 info = 0; | |
| 416 retval.resize (nc, b_nc); | |
| 417 | |
| 418 // Leading over-determined block | |
| 419 if (dm->rr[2] < nr && dm->cc[3] < nc) | |
| 420 { | |
| 421 ST m = dmsolve_extract (a, pinv, q, dm->rr[2], nr, dm->cc[3], nc, | |
| 422 nnz_remaining, true); | |
| 423 nnz_remaining -= m.nnz (); | |
| 424 RT mtmp = | |
| 425 qrsolve (m, dmsolve_extract (btmp, 0, 0, dm->rr[2], b_nr, 0, | |
| 426 b_nc), info); | |
| 427 dmsolve_insert (retval, mtmp, q, dm->cc[3], 0); | |
| 428 if (dm->rr[2] > 0 && !info) | |
| 429 { | |
| 430 m = dmsolve_extract (a, pinv, q, 0, dm->rr[2], | |
| 431 dm->cc[3], nc, nnz_remaining, true); | |
| 432 nnz_remaining -= m.nnz (); | |
| 433 RT ctmp = dmsolve_extract (btmp, 0, 0, 0, | |
| 434 dm->rr[2], 0, b_nc); | |
| 435 btmp.insert (ctmp - m * mtmp, 0, 0); | |
| 436 } | |
| 437 } | |
| 438 | |
| 439 // Structurally non-singular blocks | |
| 440 // FIXME Should use fine Dulmange-Mendelsohn decomposition here. | |
| 441 if (dm->rr[1] < dm->rr[2] && dm->cc[2] < dm->cc[3] && !info) | |
| 442 { | |
| 443 ST m = dmsolve_extract (a, pinv, q, dm->rr[1], dm->rr[2], | |
| 444 dm->cc[2], dm->cc[3], nnz_remaining, false); | |
| 445 nnz_remaining -= m.nnz (); | |
| 446 RT btmp2 = dmsolve_extract (btmp, 0, 0, dm->rr[1], dm->rr[2], | |
| 447 0, b_nc); | |
| 448 double rcond = 0.0; | |
| 449 MatrixType mtyp (MatrixType::Full); | |
| 450 RT mtmp = m.solve (mtyp, btmp2, info, rcond, | |
| 451 solve_singularity_warning, false); | |
| 452 if (info != 0) | |
| 453 { | |
| 454 info = 0; | |
| 455 mtmp = qrsolve (m, btmp2, info); | |
| 456 } | |
| 457 | |
| 458 dmsolve_insert (retval, mtmp, q, dm->cc[2], 0); | |
| 459 if (dm->rr[1] > 0 && !info) | |
| 460 { | |
| 461 m = dmsolve_extract (a, pinv, q, 0, dm->rr[1], dm->cc[2], | |
| 462 dm->cc[3], nnz_remaining, true); | |
| 463 nnz_remaining -= m.nnz (); | |
| 464 RT ctmp = dmsolve_extract (btmp, 0, 0, 0, | |
| 465 dm->rr[1], 0, b_nc); | |
| 466 btmp.insert (ctmp - m * mtmp, 0, 0); | |
| 467 } | |
| 468 } | |
| 469 | |
| 470 // Trailing under-determined block | |
| 471 if (dm->rr[1] > 0 && dm->cc[2] > 0 && !info) | |
| 472 { | |
| 473 ST m = dmsolve_extract (a, pinv, q, 0, dm->rr[1], 0, | |
| 474 dm->cc[2], nnz_remaining, true); | |
| 475 RT mtmp = | |
| 476 qrsolve (m, dmsolve_extract (btmp, 0, 0, 0, dm->rr[1] , 0, | |
| 477 b_nc), info); | |
| 478 dmsolve_insert (retval, mtmp, q, 0, 0); | |
| 479 } | |
| 480 | |
| 481 CXSPARSE_DNAME (_dfree) (dm); | |
| 482 } | |
| 483 return retval; | |
| 484 #else | |
| 485 return RT (); | |
| 486 #endif | |
| 487 } | |
| 488 | |
| 489 #if !defined (CXX_NEW_FRIEND_TEMPLATE_DECL) | |
| 490 extern Matrix | |
| 491 dmsolve (const SparseMatrix &a, const Matrix &b, | |
| 492 octave_idx_type &info); | |
| 493 | |
| 494 extern ComplexMatrix | |
| 495 dmsolve (const SparseMatrix &a, const ComplexMatrix &b, | |
| 496 octave_idx_type &info); | |
| 497 | |
| 498 extern ComplexMatrix | |
| 499 dmsolve (const SparseComplexMatrix &a, const Matrix &b, | |
| 500 octave_idx_type &info); | |
| 501 | |
| 502 extern ComplexMatrix | |
| 503 dmsolve (const SparseComplexMatrix &a, const ComplexMatrix &b, | |
| 504 octave_idx_type &info); | |
| 505 | |
| 506 extern SparseMatrix | |
| 507 dmsolve (const SparseMatrix &a, const SparseMatrix &b, | |
| 508 octave_idx_type &info); | |
| 509 | |
| 510 extern SparseComplexMatrix | |
| 511 dmsolve (const SparseMatrix &a, const SparseComplexMatrix &b, | |
| 512 octave_idx_type &info); | |
| 513 | |
| 514 extern SparseComplexMatrix | |
| 515 dmsolve (const SparseComplexMatrix &a, const SparseMatrix &b, | |
| 516 octave_idx_type &info); | |
| 517 | |
| 518 extern SparseComplexMatrix | |
| 519 dmsolve (const SparseComplexMatrix &a, const SparseComplexMatrix &b, | |
| 520 octave_idx_type &info); | |
| 521 #endif |