# Created by Octave 3.4.2, Tue Jun 28 21:55:52 2011 UTC <mandrake@n6.mandriva.com>
# name: cache
# type: cell
# rows: 3
# columns: 4
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 4
funm


# name: <cell-element>
# type: sq_string
# elements: 1
# length: 803
 funm:  Matrix equivalent of function 'name'

 Usage:    B = funm(A, name)
  where    A = square non-singular matrix, provisionally
               real-valued
           B = square result matrix
        name = string, name of function to apply to A.
        args = any arguments to pass to function 'name'
               The function must accept a vector and apply
               element-wise to that vector.

 Example:  To compute sqrtm(A), you could use funm(A, 'sqrt')

 Note that you should not use funm for 'sqrt', 'log' or 'exp'; instead
 use sqrtm, logm and expm which are more robust. Similarly,
 trigonometric and hyperbolic functions (cos, sin, tan, cot, sec, csc,
 cosh, sinh, tanh, coth, sech, csch) are better handled by thfm(A,
 name), which defines them in terms of the more robust expm.



# name: <cell-element>
# type: sq_string
# elements: 1
# length: 45
 funm:  Matrix equivalent of function 'name'




# name: <cell-element>
# type: sq_string
# elements: 1
# length: 6
pgmres


# name: <cell-element>
# type: sq_string
# elements: 1
# length: 464
   Solves A x = b using the Preconditioned GMRES iterative method
   with restart a.k.a. PGMRES(m).

   rtol is the relative tolerance,
   maxit the maximum number of iterations,
   x0 the initial guess and 
   m is the restart parameter.

   A can be passed as a matrix or as a function handle or 
   inline function f such that f(x) = A*x.

   The preconditioner P can be passed as a matrix or as a function handle or 
   inline function g such that g(x) = P\x.



# name: <cell-element>
# type: sq_string
# elements: 1
# length: 80
   Solves A x = b using the Preconditioned GMRES iterative method
   with restar



# name: <cell-element>
# type: sq_string
# elements: 1
# length: 9
test_gsvd


# name: <cell-element>
# type: sq_string
# elements: 1
# length: 24
 a few tests for gsvd.m



# name: <cell-element>
# type: sq_string
# elements: 1
# length: 22
 a few tests for gsvd.



# name: <cell-element>
# type: sq_string
# elements: 1
# length: 4
thfm


# name: <cell-element>
# type: sq_string
# elements: 1
# length: 769
USAGE  y = thfm ( x, MODE )

       trigonometric/hyperbolic functions of square matrix x

MODE	cos   sin   tan   sec   csc   cot
	cosh  sinh  tanh  sech  csch  coth
       acos  asin  atan  asec  acsc  acot
       acosh asinh atanh asech acsch acoth
       sqrt  log   exp

NOTE		--- IMPORTANT ---
	This algorithm does  NOT USE an eigensystem
	similarity transformation. It maps the MODE
	functions to functions of expm, logm and sqrtm, 
       which are known to be robust with respect to
	non-diagonalizable ('defective') x

EXA	thfm( x ,'cos' )  calculates  matrix cosinus
	EVEN IF input matrix x IS NOT DIAGONALIZABLE

ASSOC	expm, sqrtm, logm, funm
 Copyright	(C) 2001 Rolf Fabian <fabian@tu-cottbus.de>
 010213
	published under current GNU GENERAL PUBLIC LICENSE



# name: <cell-element>
# type: sq_string
# elements: 1
# length: 28
USAGE  y = thfm ( x, MODE )






