Mercurial > octave
view libinterp/corefcn/gsvd.cc @ 22407:34ce5be04942
maint: Style check C++ code in libinterp/.
* build-env.h, build-env.in.cc, builtins.h, Cell.cc, Cell.h, __contourc__.cc,
__dispatch__.cc, __dsearchn__.cc, __ilu__.cc, __lin_interpn__.cc, __luinc__.cc,
__magick_read__.cc, __pchip_deriv__.cc, __qp__.cc, balance.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, cdisplay.c, cdisplay.h,
cellfun.cc, coct-hdf5-types.c, comment-list.cc, comment-list.h, conv2.cc,
daspk.cc, dasrt.cc, dassl.cc, data.cc, data.h, debug.cc, debug.h, defaults.cc,
defaults.in.h, defun-dld.h, defun-int.h, defun.h, det.cc, dirfns.cc, dirfns.h,
display.cc, display.h, dlmread.cc, dynamic-ld.cc, dynamic-ld.h, eig.cc,
error.cc, error.h, errwarn.h, event-queue.cc, event-queue.h, fft.cc, fft2.cc,
fftn.cc, file-io.cc, file-io.h, filter.cc, find.cc, ft-text-renderer.cc,
ft-text-renderer.h, gammainc.cc, gcd.cc, getgrent.cc, getpwent.cc, givens.cc,
gl-render.cc, gl-render.h, gl2ps-print.cc, gl2ps-print.h, graphics.cc,
graphics.in.h, gripes.h, gsvd.cc, hash.cc, help.cc, help.h, hess.cc,
hex2num.cc, hook-fcn.cc, hook-fcn.h, input.cc, input.h, interpreter.cc,
interpreter.h, inv.cc, jit-ir.cc, jit-ir.h, jit-typeinfo.cc, jit-typeinfo.h,
jit-util.cc, jit-util.h, kron.cc, load-path.cc, load-path.h, load-save.cc,
load-save.h, lookup.cc, ls-ascii-helper.cc, ls-ascii-helper.h, ls-hdf5.cc,
ls-hdf5.h, ls-mat-ascii.cc, ls-mat-ascii.h, ls-mat4.cc, ls-mat4.h, ls-mat5.h,
ls-oct-binary.cc, ls-oct-binary.h, ls-oct-text.cc, ls-oct-text.h, ls-utils.cc,
ls-utils.h, lsode.cc, lu.cc, matrix_type.cc, max.cc, mex.cc, mex.h, mexproto.h,
mgorth.cc, mxarray.in.h, nproc.cc, oct-errno.h, oct-errno.in.cc, oct-fstrm.cc,
oct-fstrm.h, oct-handle.h, oct-hdf5-types.cc, oct-hdf5-types.h, oct-hdf5.h,
oct-hist.cc, oct-hist.h, oct-iostrm.cc, oct-iostrm.h, oct-lvalue.cc,
oct-lvalue.h, oct-map.h, oct-obj.h, oct-opengl.h, oct-prcstrm.cc,
oct-prcstrm.h, oct-procbuf.cc, oct-procbuf.h, oct-stdstrm.h, oct-stream.cc,
oct-stream.h, oct-strstrm.cc, oct-strstrm.h, oct.h, octave-default-image.h,
octave-link.h, octave-preserve-stream-state.h, ordschur.cc, pager.cc, pager.h,
pinv.cc, pr-output.cc, pr-output.h, procstream.cc, procstream.h, profiler.h,
psi.cc, pt-jit.cc, pt-jit.h, quad.cc, quadcc.cc, qz.cc, rand.cc, rcond.cc,
regexp.cc, schur.cc, sighandlers.cc, sighandlers.h, sparse-xdiv.cc,
sparse-xdiv.h, sparse-xpow.cc, sparse-xpow.h, sparse.cc, spparms.cc, sqrtm.cc,
str2double.cc, strfind.cc, strfns.cc, sub2ind.cc, svd.cc, sylvester.cc,
symtab.cc, symtab.h, syscalls.cc, sysdep.cc, sysdep.h, text-renderer.cc,
text-renderer.h, time.cc, toplev.cc, toplev.h, tril.cc, tsearch.cc, txt-eng.cc,
txt-eng.h, typecast.cc, urlwrite.cc, utils.cc, utils.h, variables.cc,
variables.h, workspace-element.h, xdiv.cc, xdiv.h, xnorm.cc, xnorm.h, xpow.cc,
xpow.h, zfstream.cc, zfstream.h, deprecated-config.h, __delaunayn__.cc,
__eigs__.cc, __fltk_uigetfile__.cc, __glpk__.cc, __init_fltk__.cc,
__init_gnuplot__.cc, __osmesa_print__.cc, __voronoi__.cc, amd.cc,
audiodevinfo.cc, audioread.cc, ccolamd.cc, chol.cc, colamd.cc, convhulln.cc,
dmperm.cc, fftw.cc, gzip.cc, oct-qhull.h, qr.cc, symbfact.cc, symrcm.cc,
liboctinterp-build-info.h, liboctinterp-build-info.in.cc, ov-base-diag.h,
ov-base-int.cc, ov-base-int.h, ov-base-mat.cc, ov-base-mat.h, ov-base-scalar.h,
ov-base-sparse.cc, ov-base-sparse.h, ov-base.cc, ov-base.h, ov-bool-mat.cc,
ov-bool-mat.h, ov-bool-sparse.cc, ov-bool-sparse.h, ov-bool.cc, ov-bool.h,
ov-builtin.cc, ov-builtin.h, ov-cell.cc, ov-cell.h, ov-ch-mat.cc, ov-ch-mat.h,
ov-class.cc, ov-class.h, ov-classdef.cc, ov-classdef.h, ov-colon.cc,
ov-colon.h, ov-complex.cc, ov-complex.h, ov-cs-list.h, ov-cx-diag.cc,
ov-cx-diag.h, ov-cx-mat.cc, ov-cx-mat.h, ov-cx-sparse.cc, ov-cx-sparse.h,
ov-dld-fcn.cc, ov-dld-fcn.h, ov-fcn-handle.cc, ov-fcn-handle.h,
ov-fcn-inline.cc, ov-fcn-inline.h, ov-fcn.cc, ov-fcn.h, ov-float.cc,
ov-float.h, ov-flt-complex.cc, ov-flt-complex.h, ov-flt-cx-diag.cc,
ov-flt-cx-diag.h, ov-flt-cx-mat.cc, ov-flt-cx-mat.h, ov-flt-re-diag.cc,
ov-flt-re-diag.h, ov-flt-re-mat.cc, ov-flt-re-mat.h, ov-int-traits.h,
ov-int16.cc, ov-int16.h, ov-int32.cc, ov-int32.h, ov-int64.cc, ov-int64.h,
ov-int8.cc, ov-int8.h, ov-intx.h, ov-java.cc, ov-java.h, ov-lazy-idx.cc,
ov-lazy-idx.h, ov-mex-fcn.cc, ov-mex-fcn.h, ov-null-mat.cc, ov-null-mat.h,
ov-oncleanup.cc, ov-oncleanup.h, ov-perm.cc, ov-perm.h, ov-range.cc,
ov-range.h, ov-re-diag.cc, ov-re-diag.h, ov-re-mat.cc, ov-re-mat.h,
ov-re-sparse.cc, ov-re-sparse.h, ov-scalar.cc, ov-scalar.h, ov-str-mat.cc,
ov-str-mat.h, ov-struct.cc, ov-struct.h, ov-typeinfo.cc, ov-typeinfo.h,
ov-uint16.cc, ov-uint16.h, ov-uint32.cc, ov-uint32.h, ov-uint64.cc,
ov-uint64.h, ov-uint8.cc, ov-uint8.h, ov-usr-fcn.cc, ov-usr-fcn.h, ov.h,
ovl.cc, ovl.h, octave.cc, octave.h, 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-pm.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-fcm-pm.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-fm-pm.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.h,
op-m-cm.cc, op-m-cs.cc, op-m-m.cc, op-m-pm.cc, op-m-s.cc, op-m-scm.cc,
op-m-sm.cc, op-pm-cm.cc, op-pm-fcm.cc, op-pm-fm.cc, op-pm-m.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, options-usage.h, lex.h, parse.h, pt-all.h, pt-arg-list.cc,
pt-arg-list.h, 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.cc,
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-funcall.cc, pt-funcall.h,
pt-id.cc, pt-id.h, pt-idx.cc, pt-idx.h, pt-jump.cc, 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-stmt.cc, pt-stmt.h, pt-unop.cc,
pt-unop.h, pt-walk.h, pt.cc, pt.h, token.cc, token.h, Array-jit.cc,
Array-tc.cc, version.cc, version.in.h:
Style check C++ code in libinterp/
author | Rik <rik@octave.org> |
---|---|
date | Tue, 30 Aug 2016 21:46:47 -0700 |
parents | 6d54ecbfb50a |
children | de24ca103c21 |
line wrap: on
line source
// Copyright (C) 2016 Barbara Lócsi // Copyright (C) 2006, 2010 Pascal Dupuis <Pascal.Dupuis@uclouvain.be> // Copyright (C) 1996, 1997 John W. Eaton // // This program 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. // // This program 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 // this program; if not, see <http://www.gnu.org/licenses/>. #ifdef HAVE_CONFIG_H # include <config.h> #endif #include "dMatrix.h" #include "CMatrix.h" #include "dDiagMatrix.h" #include "gsvd.h" #include "defun.h" #include "defun-int.h" #include "error.h" #include "errwarn.h" #include "utils.h" #include "ovl.h" #include "ov.h" template <typename T> static typename gsvd<T>::Type gsvd_type (int nargout) { return ((nargout == 0 || nargout == 1) ? gsvd<T>::Type::sigma_only : (nargout > 5) ? gsvd<T>::Type::std : gsvd<T>::Type::economy); } DEFUN (gsvd, args, nargout, doc: /* -*- texinfo -*- @deftypefn {} {@var{s} =} gsvd (@var{a}, @var{b}) @deftypefnx {} {[@var{u}, @var{v}, @var{c}, @var{s}, @var{x}] =} gsvd (@var{a}, @var{b}) @deftypefnx {} {[@var{u}, @var{v}, @var{c}, @var{s}, @var{x}, @var{r}] =} gsvd (@var{a}, @var{b}) @cindex generalized singular value decomposition Compute the generalized singular value decomposition of (@var{a}, @var{b}): @tex $$ U^H A X = [I 0; 0 C] [0 R] V^H B X = [0 S; 0 0] [0 R] C*C + S*S = eye (columns (A)) I and 0 are padding matrices of suitable size R is upper triangular $$ @end tex @ifinfo @example @group u' * a * x = [I 0; 0 c] * [0 r] v' * b * x = [0 s; 0 0] * [0 r] c * c + s * s = eye (columns (a)) I and 0 are padding matrices of suitable size r is upper triangular @end group @end example @end ifinfo The function @code{gsvd} normally returns the vector of generalized singular values @tex diag (C) ./ diag (S). @end tex @ifinfo diag (r) ./ diag (s). @end ifinfo If asked for five return values, it computes @tex $U$, $V$, and $X$. @end tex @ifinfo U, V, and X. @end ifinfo With a sixth output argument, it also returns @tex R, @end tex @ifinfo r, @end ifinfo The common upper triangular right term. Other authors, like @nospell{S. Van Huffel}, define this transformation as the simultaneous diagonalization of the input matrices, this can be achieved by multiplying @tex X @end tex @ifinfo x @end ifinfo by the inverse of @tex [I 0; 0 R]. @end tex @ifinfo [I 0; 0 r]. @end ifinfo For example, @example gsvd (hilb (3), [1 2 3; 3 2 1]) @result{} 0.1055705 0.0031759 @end example @noindent and @example [u, v, c, s, x, r] = gsvd (hilb (3), [1 2 3; 3 2 1]) @result{} u = -0.965609 0.240893 0.097825 -0.241402 -0.690927 -0.681429 -0.096561 -0.681609 0.725317 v = -0.41974 0.90765 -0.90765 -0.41974 c = 0.10499 0.00000 0.00000 0.00318 s = 0.99447 0.00000 0.00000 0.99999 x = 0.408248 0.902199 0.139179 -0.816497 0.429063 -0.386314 0.408248 -0.044073 -0.911806 r = -0.14093 -1.24345 0.43737 0.00000 -3.90043 2.57818 0.00000 0.00000 -2.52599 @end example The code is a wrapper to the corresponding @sc{lapack} dggsvd and zggsvd routines. @end deftypefn */) { if (args.length () != 2) print_usage (); octave_value_list retval; octave_value argA = args(0); octave_value argB = args(1); octave_idx_type nr = argA.rows (); octave_idx_type nc = argA.columns (); octave_idx_type np = argB.columns (); if (nr == 0 || nc == 0) { if (nargout == 5) retval = ovl (identity_matrix (nc, nc), identity_matrix (nc, nc), Matrix (nr, nc), identity_matrix (nr, nr), identity_matrix (nr, nr)); else if (nargout == 6) retval = ovl (identity_matrix (nc, nc), identity_matrix (nc, nc), Matrix (nr, nc), identity_matrix (nr, nr), identity_matrix (nr, nr), identity_matrix (nr, nr)); else retval = ovl (Matrix (0, 1)); } else { if (nc != np) print_usage (); if (argA.is_real_type () && argB.is_real_type ()) { Matrix tmpA = argA.matrix_value (); Matrix tmpB = argB.matrix_value (); // FIXME: This code is still using error_state if (! error_state) { if (tmpA.any_element_is_inf_or_nan ()) error ("gsvd: B cannot have Inf or NaN values"); if (tmpB.any_element_is_inf_or_nan ()) error ("gsvd: B cannot have Inf or NaN values"); gsvd<Matrix> result (tmpA, tmpB, gsvd_type<Matrix> (nargout)); // DiagMatrix sigma = result.singular_values (); if (nargout == 0 || nargout == 1) { DiagMatrix sigA = result.singular_values_A (); DiagMatrix sigB = result.singular_values_B (); for (int i = sigA.rows() - 1; i >=0; i--) sigA.dgxelem(i) /= sigB.dgxelem(i); retval = ovl (sigA.diag()); } else { if (nargout > 5) retval = ovl (result.left_singular_matrix_A (), result.left_singular_matrix_B (), result.singular_values_A (), result.singular_values_B (), result.right_singular_matrix (), result.R_matrix ()); else retval = ovl (result.left_singular_matrix_A (), result.left_singular_matrix_B (), result.singular_values_A (), result.singular_values_B (), result.right_singular_matrix ()); } } } else if (argA.is_complex_type () || argB.is_complex_type ()) { ComplexMatrix ctmpA = argA.complex_matrix_value (); ComplexMatrix ctmpB = argB.complex_matrix_value (); if (! error_state) { if (ctmpA.any_element_is_inf_or_nan ()) error ("gsvd: A cannot have Inf or NaN values"); if (ctmpB.any_element_is_inf_or_nan ()) error ("gsvd: B cannot have Inf or NaN values"); gsvd<ComplexMatrix> result (ctmpA, ctmpB, gsvd_type<ComplexMatrix> (nargout)); // DiagMatrix sigma = result.singular_values (); if (nargout == 0 || nargout == 1) { DiagMatrix sigA = result.singular_values_A (); DiagMatrix sigB = result.singular_values_B (); for (int i = sigA.rows() - 1; i >=0; i--) sigA.dgxelem(i) /= sigB.dgxelem(i); retval = ovl (sigA.diag()); } else { if (nargout > 5) retval = ovl (result.left_singular_matrix_A (), result.left_singular_matrix_B (), result.singular_values_A (), result.singular_values_B (), result.right_singular_matrix (), result.R_matrix ()); else retval = ovl (result.left_singular_matrix_A (), result.left_singular_matrix_B (), result.singular_values_A (), result.singular_values_B (), result.right_singular_matrix ()); } } } else { // Actually, can't tell which arg is at fault err_wrong_type_arg ("gsvd", argA); //err_wrong_type_arg ("gsvd", argB); } } return retval; } /* ## a few tests for gsvd.m %!shared A, A0, B, B0, U, V, C, S, X, R, D1, D2 %! A0 = randn (5, 3); %! B0 = diag ([1 2 4]); %! A = A0; %! B = B0; ## A (5x3) and B (3x3) are full rank %!test %! [U, V, C, S, X, R] = gsvd (A, B); %! D1 = zeros (5, 3); D1(1:3, 1:3) = C; %! D2 = S; %! assert (norm (diag (C).^2 + diag (S).^2 - ones (3, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*R) <= 1e-6); %! assert (norm ((V'*B*X) - D2*R) <= 1e-6); ## A: 5x3 full rank, B: 3x3 rank deficient %!test %! B(2, 2) = 0; %! [U, V, C, S, X, R] = gsvd (A, B); %! D1 = zeros (5, 3); D1(1, 1) = 1; D1(2:3, 2:3) = C; %! D2 = [zeros(2, 1) S; zeros(1, 3)]; %! assert (norm (diag (C).^2 + diag (S).^2 - ones (2, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*R) <= 1e-6); %! assert (norm ((V'*B*X) - D2*R) <= 1e-6); ## A: 5x3 rank deficient, B: 3x3 full rank %!test %! B = B0; %! A(:, 3) = 2*A(:, 1) - A(:, 2); %! [U, V, C, S, X, R] = gsvd (A, B); %! D1 = zeros(5, 3); D1(1:3, 1:3) = C; %! D2 = S; %! assert (norm (diag (C).^2 + diag (S).^2 - ones (3, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*R) <= 1e-6); %! assert (norm ((V'*B*X) - D2*R) <= 1e-6); ## A and B are both rank deficient %!test %! B(:, 3) = 2*B(:, 1) - B(:, 2); %! [U, V, C, S, X, R] = gsvd (A, B); %! D1 = zeros(5, 2); D1(1:2, 1:2) = C; %! D2 = [S; zeros(1, 2)]; %! assert (norm (diag (C).^2 + diag (S).^2 - ones (2, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*[zeros(2, 1) R]) <= 1e-6); %! assert (norm ((V'*B*X) - D2*[zeros(2, 1) R]) <= 1e-6); ## A (now 3x5) and B (now 5x5) are full rank %!test %! A = A0.'; %! B0 = diag ([1 2 4 8 16]); %! B = B0; %! [U, V, C, S, X, R] = gsvd (A, B); %! D1 = [C zeros(3,2)]; %! D2 = [S zeros(3,2); zeros(2, 3) eye(2)]; %! assert (norm (diag (C).^2 + diag (S).^2 - ones (3, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*R) <= 1e-6); %! assert (norm ((V'*B*X) - D2*R) <= 1e-6); ## A: 3x5 full rank, B: 5x5 rank deficient %!test %! B(2, 2) = 0; %! [U, V, C, S, X, R] = gsvd (A, B); %! D1 = zeros(3, 5); D1(1, 1) = 1; D1(2:3, 2:3) = C; %! D2 = zeros(5, 5); D2(1:2, 2:3) = S; D2(3:4, 4:5) = eye (2); %! assert (norm (diag (C).^2 + diag (S).^2 - ones (2, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*R) <= 1e-6); %! assert (norm ((V'*B*X) - D2*R) <= 1e-6); ## A: 3x5 rank deficient, B: 5x5 full rank %!test %! B = B0; %! A(3, :) = 2*A(1, :) - A(2, :); %! [U, V, C, S, X, R] = gsvd (A, B); %! D1 = zeros (3, 5); D1(1:3, 1:3) = C; %! D2 = zeros (5, 5); D2(1:3, 1:3) = S; D2(4:5, 4:5) = eye (2); %! assert (norm (diag (C).^2 + diag (S).^2 - ones (3, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*R) <= 1e-6); %! assert (norm ((V'*B*X) - D2*R) <= 1e-6); ## A and B are both rank deficient %!test %! A = A0.'; B = B0.'; %! A(:, 3) = 2*A(:, 1) - A(:, 2); %! B(:, 3) = 2*B(:, 1) - B(:, 2); %! [U, V, C, S, X, R]=gsvd (A, B); %! D1 = zeros(3, 4); D1(1:3, 1:3) = C; %! D2 = eye (4); D2(1:3, 1:3) = S; D2(5,:) = 0; %! assert (norm (diag (C).^2 + diag (S).^2 - ones (3, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*[zeros(4, 1) R]) <= 1e-6); %! assert (norm ((V'*B*X) - D2*[zeros(4, 1) R]) <= 1e-6); ## A: 5x3 complex full rank, B: 3x3 complex full rank %!test %! A0 = A0 + j*randn (5, 3); %! B0 = diag ([1 2 4]) + j*diag ([4 -2 -1]); %! A = A0; %! B = B0; %! [U, V, C, S, X, R] = gsvd (A, B); %! D1 = zeros(5, 3); D1(1:3, 1:3) = C; %! D2 = S; %! assert (norm (diag (C).^2 + diag (S).^2 - ones (3, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*R) <= 1e-6); %! assert (norm ((V'*B*X) - D2*R) <= 1e-6); ## A: 5x3 complex full rank, B: 3x3 complex rank deficient %!test %! B(2, 2) = 0; %! [U, V, C, S, X, R] = gsvd (A, B); %! D1 = zeros(5, 3); D1(1, 1) = 1; D1(2:3, 2:3) = C; %! D2 = [zeros(2, 1) S; zeros(1, 3)]; %! assert (norm (diag (C).^2 + diag (S).^2 - ones (2, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*R) <= 1e-6); %! assert (norm ((V'*B*X) - D2*R) <= 1e-6); ## A: 5x3 complex rank deficient, B: 3x3 complex full rank %!test %! B = B0; %! A(:, 3) = 2*A(:, 1) - A(:, 2); %! [U, V, C, S, X, R] = gsvd (A, B); %! D1 = zeros(5, 3); D1(1:3, 1:3) = C; %! D2 = S; %! assert (norm (diag (C).^2 + diag (S).^2 - ones (3, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*R) <= 1e-6); %! assert (norm ((V'*B*X) - D2*R) <= 1e-6); ## A (5x3) and B (3x3) are both complex rank deficient %!test %! B(:, 3) = 2*B(:, 1) - B(:, 2); %! [U, V, C, S, X, R] = gsvd (A, B); %! D1 = zeros(5, 2); D1(1:2, 1:2) = C; %! D2 = [S; zeros(1, 2)]; %! assert (norm (diag (C).^2 + diag (S).^2 - ones (2, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*[zeros(2, 1) R]) <= 1e-6); %! assert (norm ((V'*B*X) - D2*[zeros(2, 1) R]) <= 1e-6); ## A (now 3x5) complex and B (now 5x5) complex are full rank ## now, A is 3x5 %!test %! A = A0.'; %! B0 = diag ([1 2 4 8 16]) + j*diag ([-5 4 -3 2 -1]); %! B = B0; %! [U, V, C, S, X, R] = gsvd (A, B); %! D1 = [C zeros(3,2)]; %! D2 = [S zeros(3,2); zeros(2, 3) eye(2)]; %! assert (norm (diag (C).^2 + diag (S).^2 - ones (3, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*R) <= 1e-6); %! assert (norm ((V'*B*X) - D2*R) <= 1e-6); ## A: 3x5 complex full rank, B: 5x5 complex rank deficient %!test %! B(2, 2) = 0; %! [U, V, C, S, X, R] = gsvd (A, B); %! D1 = zeros(3, 5); D1(1, 1) = 1; D1(2:3, 2:3) = C; %! D2 = zeros(5,5); D2(1:2, 2:3) = S; D2(3:4, 4:5) = eye (2); %! assert (norm (diag (C).^2 + diag (S).^2 - ones (2, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*R) <= 1e-6); %! assert (norm ((V'*B*X) - D2*R) <= 1e-6); ## A: 3x5 complex rank deficient, B: 5x5 complex full rank %!test %! B = B0; %! A(3, :) = 2*A(1, :) - A(2, :); %! [U, V, C, S, X, R] = gsvd (A, B); %! D1 = zeros(3, 5); D1(1:3, 1:3) = C; %! D2 = zeros(5,5); D2(1:3, 1:3) = S; D2(4:5, 4:5) = eye (2); %! assert (norm (diag (C).^2 + diag (S).^2 - ones (3, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*R) <= 1e-6); %! assert (norm ((V'*B*X) - D2*R) <= 1e-6); ## A and B are both complex rank deficient %!test %! A = A0.'; %! B = B0.'; %! A(:, 3) = 2*A(:, 1) - A(:, 2); %! B(:, 3) = 2*B(:, 1) - B(:, 2); %! [U, V, C, S, X, R] = gsvd (A, B); %! D1 = zeros(3, 4); D1(1:3, 1:3) = C; %! D2 = eye (4); D2(1:3, 1:3) = S; D2(5,:) = 0; %! assert (norm (diag (C).^2 + diag (S).^2 - ones (3, 1)) <= 1e-6); %! assert (norm ((U'*A*X) - D1*[zeros(4, 1) R]) <= 1e-6); %! assert (norm ((V'*B*X) - D2*[zeros(4, 1) R]) <= 1e-6); */