1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638
|
/*
Copyright (C) 2005-2015 David Bateman
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 <algorithm>
#include "ov.h"
#include "defun.h"
#include "error.h"
#include "ov-re-mat.h"
#include "ov-cx-mat.h"
#include "ov-re-sparse.h"
#include "ov-cx-sparse.h"
#include "MatrixType.h"
#include "oct-locbuf.h"
DEFUN (matrix_type, args, ,
"-*- texinfo -*-\n\
@deftypefn {Built-in Function} {@var{type} =} matrix_type (@var{A})\n\
@deftypefnx {Built-in Function} {@var{type} =} matrix_type (@var{A}, \"nocompute\")\n\
@deftypefnx {Built-in Function} {@var{A} =} matrix_type (@var{A}, @var{type})\n\
@deftypefnx {Built-in Function} {@var{A} =} matrix_type (@var{A}, \"upper\", @var{perm})\n\
@deftypefnx {Built-in Function} {@var{A} =} matrix_type (@var{A}, \"lower\", @var{perm})\n\
@deftypefnx {Built-in Function} {@var{A} =} matrix_type (@var{A}, \"banded\", @var{nl}, @var{nu})\n\
Identify the matrix type or mark a matrix as a particular type.\n\
\n\
This allows more rapid solutions of linear equations involving @var{A} to be\n\
performed.\n\
\n\
Called with a single argument, @code{matrix_type} returns the type of the\n\
matrix and caches it for future use.\n\
\n\
Called with more than one argument, @code{matrix_type} allows the type of\n\
the matrix to be defined.\n\
\n\
If the option @qcode{\"nocompute\"} is given, the function will not attempt\n\
to guess the type if it is still unknown. This is useful for debugging\n\
purposes.\n\
\n\
The possible matrix types depend on whether the matrix is full or sparse, and\n\
can be one of the following\n\
\n\
@table @asis\n\
@item @qcode{\"unknown\"}\n\
Remove any previously cached matrix type, and mark type as unknown.\n\
\n\
@item @qcode{\"full\"}\n\
Mark the matrix as full.\n\
\n\
@item @qcode{\"positive definite\"}\n\
Probable full positive definite matrix.\n\
\n\
@item @qcode{\"diagonal\"}\n\
Diagonal matrix. (Sparse matrices only)\n\
\n\
@item @qcode{\"permuted diagonal\"}\n\
Permuted Diagonal matrix. The permutation does not need to be specifically\n\
indicated, as the structure of the matrix explicitly gives this. (Sparse\n\
matrices only)\n\
\n\
@item @qcode{\"upper\"}\n\
Upper triangular. If the optional third argument @var{perm} is given, the\n\
matrix is assumed to be a permuted upper triangular with the permutations\n\
defined by the vector @var{perm}.\n\
\n\
@item @qcode{\"lower\"}\n\
Lower triangular. If the optional third argument @var{perm} is given, the\n\
matrix is assumed to be a permuted lower triangular with the permutations\n\
defined by the vector @var{perm}.\n\
\n\
@item @qcode{\"banded\"}\n\
@itemx @qcode{\"banded positive definite\"}\n\
Banded matrix with the band size of @var{nl} below the diagonal and @var{nu}\n\
above it. If @var{nl} and @var{nu} are 1, then the matrix is tridiagonal and\n\
treated with specialized code. In addition the matrix can be marked as\n\
probably a positive definite. (Sparse matrices only)\n\
\n\
@item @qcode{\"singular\"}\n\
The matrix is assumed to be singular and will be treated with a minimum norm\n\
solution.\n\
\n\
@end table\n\
\n\
Note that the matrix type will be discovered automatically on the first\n\
attempt to solve a linear equation involving @var{A}. Therefore\n\
@code{matrix_type} is only useful to give Octave hints of the matrix type.\n\
Incorrectly defining the matrix type will result in incorrect results from\n\
solutions of linear equations; it is entirely @strong{the responsibility of\n\
the user} to correctly identify the matrix type.\n\
\n\
Also, the test for positive definiteness is a low-cost test for a Hermitian\n\
matrix with a real positive diagonal. This does not guarantee that the\n\
matrix is positive definite, but only that it is a probable candidate. When\n\
such a matrix is factorized, a Cholesky@tie{}factorization is first\n\
attempted, and if that fails the matrix is then treated with an\n\
LU@tie{}factorization. Once the matrix has been factorized,\n\
@code{matrix_type} will return the correct classification of the matrix.\n\
@end deftypefn")
{
int nargin = args.length ();
octave_value retval;
if (nargin == 0)
print_usage ();
else if (nargin > 4)
error ("matrix_type: incorrect number of arguments");
else
{
bool autocomp = true;
if (nargin == 2 && args(1).is_string ()
&& args(1).string_value () == "nocompute")
{
nargin = 1;
autocomp = false;
}
if (args(0).is_scalar_type ())
{
if (nargin == 1)
retval = octave_value ("Diagonal");
else
retval = args(0);
}
else if (args(0).is_sparse_type ())
{
if (nargin == 1)
{
MatrixType mattyp;
if (args(0).is_complex_type ())
{
mattyp = args(0).matrix_type ();
if (mattyp.is_unknown () && autocomp)
{
SparseComplexMatrix m =
args(0).sparse_complex_matrix_value ();
if (!error_state)
{
mattyp = MatrixType (m);
args(0).matrix_type (mattyp);
}
}
}
else
{
mattyp = args(0).matrix_type ();
if (mattyp.is_unknown () && autocomp)
{
SparseMatrix m = args(0).sparse_matrix_value ();
if (!error_state)
{
mattyp = MatrixType (m);
args(0).matrix_type (mattyp);
}
}
}
int typ = mattyp.type ();
if (typ == MatrixType::Diagonal)
retval = octave_value ("Diagonal");
else if (typ == MatrixType::Permuted_Diagonal)
retval = octave_value ("Permuted Diagonal");
else if (typ == MatrixType::Upper)
retval = octave_value ("Upper");
else if (typ == MatrixType::Permuted_Upper)
retval = octave_value ("Permuted Upper");
else if (typ == MatrixType::Lower)
retval = octave_value ("Lower");
else if (typ == MatrixType::Permuted_Lower)
retval = octave_value ("Permuted Lower");
else if (typ == MatrixType::Banded)
retval = octave_value ("Banded");
else if (typ == MatrixType::Banded_Hermitian)
retval = octave_value ("Banded Positive Definite");
else if (typ == MatrixType::Tridiagonal)
retval = octave_value ("Tridiagonal");
else if (typ == MatrixType::Tridiagonal_Hermitian)
retval = octave_value ("Tridiagonal Positive Definite");
else if (typ == MatrixType::Hermitian)
retval = octave_value ("Positive Definite");
else if (typ == MatrixType::Rectangular)
{
if (args(0).rows () == args(0).columns ())
retval = octave_value ("Singular");
else
retval = octave_value ("Rectangular");
}
else if (typ == MatrixType::Full)
retval = octave_value ("Full");
else
retval = octave_value ("Unknown");
}
else
{
// Ok, we're changing the matrix type
if (! args(1).is_string ())
error ("matrix_type: TYPE must be a string");
else
{
std::string str_typ = args(1).string_value ();
// FIXME: why do I have to explicitly call the constructor?
MatrixType mattyp = MatrixType ();
octave_idx_type nl = 0;
octave_idx_type nu = 0;
// Use STL function to convert to lower case
std::transform (str_typ.begin (), str_typ.end (),
str_typ.begin (), tolower);
if (str_typ == "diagonal")
mattyp.mark_as_diagonal ();
if (str_typ == "permuted diagonal")
mattyp.mark_as_permuted_diagonal ();
else if (str_typ == "upper")
mattyp.mark_as_upper_triangular ();
else if (str_typ == "lower")
mattyp.mark_as_lower_triangular ();
else if (str_typ == "banded"
|| str_typ == "banded positive definite")
{
if (nargin != 4)
error ("matrix_type: banded matrix type requires 4 arguments");
else
{
nl = args(2).nint_value ();
nu = args(3).nint_value ();
if (error_state)
error ("matrix_type: band size NL, NU must be integers");
else
{
if (nl == 1 && nu == 1)
mattyp.mark_as_tridiagonal ();
else
mattyp.mark_as_banded (nu, nl);
if (str_typ == "banded positive definite")
mattyp.mark_as_symmetric ();
}
}
}
else if (str_typ == "positive definite")
{
mattyp.mark_as_full ();
mattyp.mark_as_symmetric ();
}
else if (str_typ == "singular")
mattyp.mark_as_rectangular ();
else if (str_typ == "full")
mattyp.mark_as_full ();
else if (str_typ == "unknown")
mattyp.invalidate_type ();
else
error ("matrix_type: Unknown matrix type %s", str_typ.c_str ());
if (! error_state)
{
if (nargin == 3
&& (str_typ == "upper" || str_typ == "lower"))
{
const ColumnVector perm =
ColumnVector (args(2).vector_value ());
if (error_state)
error ("matrix_type: Invalid permutation vector PERM");
else
{
octave_idx_type len = perm.length ();
dim_vector dv = args(0).dims ();
if (len != dv(0))
error ("matrix_type: Invalid permutation vector PERM");
else
{
OCTAVE_LOCAL_BUFFER (octave_idx_type, p, len);
for (octave_idx_type i = 0; i < len; i++)
p[i] = static_cast<octave_idx_type>
(perm (i))
- 1;
if (str_typ == "upper")
mattyp.mark_as_permuted (len, p);
else
mattyp.mark_as_permuted (len, p);
}
}
}
else if (nargin != 2
&& str_typ != "banded positive definite"
&& str_typ != "banded")
error ("matrix_type: Invalid number of arguments");
if (! error_state)
{
// Set the matrix type
if (args(0).is_complex_type ())
retval =
octave_value (args(0).sparse_complex_matrix_value (),
mattyp);
else
retval
= octave_value (args(0).sparse_matrix_value (),
mattyp);
}
}
}
}
}
else
{
if (nargin == 1)
{
MatrixType mattyp;
if (args(0).is_complex_type ())
{
mattyp = args(0).matrix_type ();
if (mattyp.is_unknown () && autocomp)
{
if (args(0).is_single_type ())
{
FloatComplexMatrix m;
m = args(0).float_complex_matrix_value ();
if (!error_state)
{
mattyp = MatrixType (m);
args(0).matrix_type (mattyp);
}
}
else
{
ComplexMatrix m = args(0).complex_matrix_value ();
if (!error_state)
{
mattyp = MatrixType (m);
args(0).matrix_type (mattyp);
}
}
}
}
else
{
mattyp = args(0).matrix_type ();
if (mattyp.is_unknown () && autocomp)
{
if (args(0).is_single_type ())
{
FloatMatrix m = args(0).float_matrix_value ();
if (!error_state)
{
mattyp = MatrixType (m);
args(0).matrix_type (mattyp);
}
}
else
{
Matrix m = args(0).matrix_value ();
if (!error_state)
{
mattyp = MatrixType (m);
args(0).matrix_type (mattyp);
}
}
}
}
int typ = mattyp.type ();
if (typ == MatrixType::Upper)
retval = octave_value ("Upper");
else if (typ == MatrixType::Permuted_Upper)
retval = octave_value ("Permuted Upper");
else if (typ == MatrixType::Lower)
retval = octave_value ("Lower");
else if (typ == MatrixType::Permuted_Lower)
retval = octave_value ("Permuted Lower");
else if (typ == MatrixType::Hermitian)
retval = octave_value ("Positive Definite");
else if (typ == MatrixType::Rectangular)
{
if (args(0).rows () == args(0).columns ())
retval = octave_value ("Singular");
else
retval = octave_value ("Rectangular");
}
else if (typ == MatrixType::Full)
retval = octave_value ("Full");
else
retval = octave_value ("Unknown");
}
else
{
// Ok, we're changing the matrix type
if (! args(1).is_string ())
error ("matrix_type: TYPE must be a string");
else
{
std::string str_typ = args(1).string_value ();
// FIXME: why do I have to explicitly call the constructor?
MatrixType mattyp = MatrixType (MatrixType::Unknown, true);
// Use STL function to convert to lower case
std::transform (str_typ.begin (), str_typ.end (),
str_typ.begin (), tolower);
if (str_typ == "upper")
mattyp.mark_as_upper_triangular ();
else if (str_typ == "lower")
mattyp.mark_as_lower_triangular ();
else if (str_typ == "positive definite")
{
mattyp.mark_as_full ();
mattyp.mark_as_symmetric ();
}
else if (str_typ == "singular")
mattyp.mark_as_rectangular ();
else if (str_typ == "full")
mattyp.mark_as_full ();
else if (str_typ == "unknown")
mattyp.invalidate_type ();
else
error ("matrix_type: Unknown matrix type %s",
str_typ.c_str ());
if (! error_state)
{
if (nargin == 3 && (str_typ == "upper"
|| str_typ == "lower"))
{
const ColumnVector perm =
ColumnVector (args(2).vector_value ());
if (error_state)
error ("matrix_type: Invalid permutation vector PERM");
else
{
octave_idx_type len = perm.length ();
dim_vector dv = args(0).dims ();
if (len != dv(0))
error ("matrix_type: Invalid permutation vector PERM");
else
{
OCTAVE_LOCAL_BUFFER (octave_idx_type, p, len);
for (octave_idx_type i = 0; i < len; i++)
p[i] = static_cast<octave_idx_type>
(perm (i))
- 1;
if (str_typ == "upper")
mattyp.mark_as_permuted (len, p);
else
mattyp.mark_as_permuted (len, p);
}
}
}
else if (nargin != 2)
error ("matrix_type: Invalid number of arguments");
if (! error_state)
{
// Set the matrix type
if (args(0).is_single_type ())
{
if (args(0).is_complex_type ())
retval = octave_value
(args(0).float_complex_matrix_value (),
mattyp);
else
retval = octave_value
(args(0).float_matrix_value (),
mattyp);
}
else
{
if (args(0).is_complex_type ())
retval = octave_value
(args(0).complex_matrix_value (),
mattyp);
else
retval = octave_value
(args(0).matrix_value (),
mattyp);
}
}
}
}
}
}
}
return retval;
}
/*
## FIXME:
## Disable tests for lower under-determined and upper over-determined
## matrices as this detection is disabled in MatrixType due to issues
## of non minimum norm solution being found.
%!assert (matrix_type (speye (10,10)), "Diagonal")
%!assert (matrix_type (speye (10,10)([2:10,1],:)), "Permuted Diagonal")
%!assert (matrix_type ([[speye(10,10);sparse(1,10)],[1;sparse(9,1);1]]), "Upper")
%!assert (matrix_type ([[speye(10,10);sparse(1,10)],[1;sparse(9,1);1]](:,[2,1,3:11])), "Permuted Upper")
%!assert (matrix_type ([speye(10,10),sparse(10,1);1,sparse(1,9),1]), "Lower")
%!assert (matrix_type ([speye(10,10),sparse(10,1);1,sparse(1,9),1]([2,1,3:11],:)), "Permuted Lower")
%!test
%! bnd = spparms ("bandden");
%! spparms ("bandden", 0.5);
%! a = spdiags (rand (10,3)-0.5,[-1,0,1],10,10);
%! assert (matrix_type (a), "Tridiagonal");
%! assert (matrix_type (a'+a+2*speye (10)), "Tridiagonal Positive Definite");
%! spparms ("bandden", bnd);
%!test
%! bnd=spparms ("bandden");
%! spparms ("bandden", 0.5);
%! a = spdiags (randn (10,4),[-2:1],10,10);
%! assert (matrix_type (a), "Banded");
%! assert (matrix_type (a'*a), "Banded Positive Definite");
%! spparms ("bandden", bnd);
%!test
%! a = [speye(10,10),[sparse(9,1);1];-1,sparse(1,9),1];
%! assert (matrix_type (a), "Full");
%! assert (matrix_type (a'*a), "Positive Definite");
%!assert (matrix_type (speye (10,11)), "Diagonal")
%!assert (matrix_type (speye (10,11)([2:10,1],:)), "Permuted Diagonal")
%!assert (matrix_type (speye (11,10)), "Diagonal")
%!assert (matrix_type (speye (11,10)([2:11,1],:)), "Permuted Diagonal")
%#!assert (matrix_type ([[speye(10,10);sparse(1,10)],[[1,1];sparse(9,2);[1,1]]]), "Upper")
%#!assert (matrix_type ([[speye(10,10);sparse(1,10)],[[1,1];sparse(9,2);[1,1]]](:,[2,1,3:12])), "Permuted Upper")
%!assert (matrix_type ([speye(11,9),[1;sparse(8,1);1;0]]), "Upper")
%!assert (matrix_type ([speye(11,9),[1;sparse(8,1);1;0]](:,[2,1,3:10])), "Permuted Upper")
%#!assert (matrix_type ([speye(10,10),sparse(10,1);[1;1],sparse(2,9),[1;1]]), "Lower")
%#!assert (matrix_type ([speye(10,10),sparse(10,1);[1;1],sparse(2,9),[1;1]]([2,1,3:12],:)), "Permuted Lower")
%!assert (matrix_type ([speye(9,11);[1,sparse(1,8),1,0]]), "Lower")
%!assert (matrix_type ([speye(9,11);[1,sparse(1,8),1,0]]([2,1,3:10],:)), "Permuted Lower")
%!assert (matrix_type (spdiags (randn (10,4),[-2:1],10,9)), "Rectangular")
%!assert (matrix_type (1i*speye (10,10)), "Diagonal")
%!assert (matrix_type (1i*speye (10,10)([2:10,1],:)), "Permuted Diagonal")
%!assert (matrix_type ([[speye(10,10);sparse(1,10)],[1i;sparse(9,1);1]]), "Upper")
%!assert (matrix_type ([[speye(10,10);sparse(1,10)],[1i;sparse(9,1);1]](:,[2,1,3:11])), "Permuted Upper")
%!assert (matrix_type ([speye(10,10),sparse(10,1);1i,sparse(1,9),1]), "Lower")
%!assert (matrix_type ([speye(10,10),sparse(10,1);1i,sparse(1,9),1]([2,1,3:11],:)), "Permuted Lower")
%!test
%! bnd = spparms ("bandden");
%! spparms ("bandden", 0.5);
%! assert (matrix_type (spdiags (1i*randn (10,3),[-1,0,1],10,10)), "Tridiagonal");
%! a = 1i*(rand (9,1)-0.5);
%! a = [[a;0],ones(10,1),[0;-a]];
%! assert (matrix_type (spdiags (a,[-1,0,1],10,10)), "Tridiagonal Positive Definite");
%! spparms ("bandden", bnd);
%!test
%! bnd = spparms ("bandden");
%! spparms ("bandden", 0.5);
%! assert (matrix_type (spdiags (1i*randn (10,4),[-2:1],10,10)), "Banded");
%! a = 1i*(rand (9,2)-0.5);
%! a = [[a;[0,0]],ones(10,1),[[0;-a(:,2)],[0;0;-a(1:8,1)]]];
%! assert (matrix_type (spdiags (a,[-2:2],10,10)), "Banded Positive Definite");
%! spparms ("bandden", bnd);
%!test
%! a = [speye(10,10),[sparse(9,1);1i];-1,sparse(1,9),1];
%! assert (matrix_type (a), "Full");
%! assert (matrix_type (a'*a), "Positive Definite");
%!assert (matrix_type (1i*speye (10,11)), "Diagonal")
%!assert (matrix_type (1i*speye (10,11)([2:10,1],:)), "Permuted Diagonal")
%!assert (matrix_type (1i*speye (11,10)), "Diagonal")
%!assert (matrix_type (1i*speye (11,10)([2:11,1],:)), "Permuted Diagonal")
%#!assert (matrix_type ([[speye(10,10);sparse(1,10)],[[1i,1i];sparse(9,2);[1i,1i]]]), "Upper")
%#!assert (matrix_type ([[speye(10,10);sparse(1,10)],[[1i,1i];sparse(9,2);[1i,1i]]](:,[2,1,3:12])), "Permuted Upper")
%!assert (matrix_type ([speye(11,9),[1i;sparse(8,1);1i;0]]), "Upper")
%!assert (matrix_type ([speye(11,9),[1i;sparse(8,1);1i;0]](:,[2,1,3:10])), "Permuted Upper")
%#!assert (matrix_type ([speye(10,10),sparse(10,1);[1i;1i],sparse(2,9),[1i;1i]]), "Lower")
%#!assert (matrix_type ([speye(10,10),sparse(10,1);[1i;1i],sparse(2,9),[1i;1i]]([2,1,3:12],:)), "Permuted Lower")
%!assert (matrix_type ([speye(9,11);[1i,sparse(1,8),1i,0]]), "Lower")
%!assert (matrix_type ([speye(9,11);[1i,sparse(1,8),1i,0]]([2,1,3:10],:)), "Permuted Lower")
%!assert (matrix_type (1i*spdiags(randn(10,4),[-2:1],10,9)), "Rectangular")
%!test
%! a = matrix_type (spdiags (randn (10,3),[-1,0,1],10,10), "Singular");
%! assert (matrix_type (a), "Singular");
%!assert (matrix_type (triu (ones(10,10))), "Upper")
%!assert (matrix_type (triu (ones(10,10),-1)), "Full")
%!assert (matrix_type (tril (ones(10,10))), "Lower")
%!assert (matrix_type (tril (ones(10,10),1)), "Full")
%!assert (matrix_type (10*eye (10,10) + ones (10,10)), "Positive Definite")
%!assert (matrix_type (ones (11,10)), "Rectangular")
%!test
%! a = matrix_type (ones (10,10), "Singular");
%! assert (matrix_type (a), "Singular");
%!assert (matrix_type (triu (1i*ones (10,10))), "Upper")
%!assert (matrix_type (triu (1i*ones (10,10),-1)), "Full")
%!assert (matrix_type (tril (1i*ones (10,10))), "Lower")
%!assert (matrix_type (tril (1i*ones (10,10),1)), "Full")
%!assert (matrix_type (10*eye (10,10) + 1i*triu (ones (10,10),1) -1i*tril (ones (10,10),-1)), "Positive Definite")
%!assert (matrix_type (ones (11,10)), "Rectangular")
%!test
%! a = matrix_type (ones (10,10), "Singular");
%! assert (matrix_type (a), "Singular");
*/
|