# doc-cache created by Octave 10.3.0
# name: cache
# type: cell
# rows: 3
# columns: 2
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 13
mps_chebroots


# name: <cell-element>
# type: sq_string
# elements: 1
# length: 244
MPS_CHEBROOTS Compute roots of polynomials in the Chebyshev basis. 

 X = MPS_CHEBROOTS(V) computes the roots of the polynomial 

  V(1) * T_N(X) + ... + V(end) * T_0(X), 

 where T_j(X) is the degree j Chebyshev polynomial of the first kind. 



# name: <cell-element>
# type: sq_string
# elements: 1
# length: 66
MPS_CHEBROOTS Compute roots of polynomials in the Chebyshev basis.



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


# name: <cell-element>
# type: sq_string
# elements: 1
# length: 979
MPS_ROOTS Approximate the roots of a scalar polynomial

 Y = MPS_ROOTS(V) approximate the roots of the scalar polynomial
 
               V(1) * X^N + ... + V(end-1) * X + V(end).

     The approximations are computed using MPSolve. When V is a
     vector of VPA, the computation is carried out in higher
     precision arithmetic. 

 [Y, R] = MPS_ROOTS(V) additionally computes inclusion radii for the
     roots stored in the vector Y.

 [Y, R] = MPS_ROOTS(V, ALG) allows to select additional options for
     MPSolve. ALG has to be a structure of the form:

     ALG = struct ( ...
       'radius', true / false, % true if the inclusion radii are needed.
       'digits', N % Number of guaranteed digits required.
       'algorithm', 'a' or 's' % Algorithm to use
       'goal', 'i', or 'a' % Isolate or Approximate
     )

 Author: Leonardo Robol <leonardo.robol@cs.kuleuven.be>
 Copyright: 2011-2016 Leonardo Robol <leonardo.robol@cs.kuleuven.be>
 License: GPLv3 or higher



# name: <cell-element>
# type: sq_string
# elements: 1
# length: 54
MPS_ROOTS Approximate the roots of a scalar polynomial





