# include <cmath>
# include <iomanip>
# include <iostream>

using namespace std;

# include "r8ltt.hpp"

int main ( );
void r8ltt_det_test ( );
void r8ltt_indicator_test ( );
void r8ltt_inverse_test ( );
void r8ltt_mm_test ( );
void r8ltt_mtm_test ( );
void r8ltt_mtv_test ( );
void r8ltt_mv_test ( );
void r8ltt_print_test ( );
void r8ltt_print_some_test ( );
void r8ltt_random_test ( );
void r8ltt_sl_test ( );
void r8ltt_slt_test ( );
void r8ltt_to_r8ge_test ( );
void r8ltt_zeros_test ( );

//****************************************************************************80

int main ( )

//****************************************************************************80
//
//  Purpose:
//
//    MAIN is the main program for R8LTT_TEST.
//
//  Discussion:
//
//    R8LTT_TEST tests the R8LTT library.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    20 November 2015
//
//  Author:
//
//    John Burkardt
//
{
  timestamp ( );
  cout << "\n";
  cout << "R8LTT_TEST\n";
  cout << "  C++ version\n";
  cout << "  Test the R8LTT library.\n";

  r8ltt_det_test ( );
  r8ltt_indicator_test ( );
  r8ltt_inverse_test ( );
  r8ltt_mm_test ( );
  r8ltt_mtm_test ( );
  r8ltt_mtv_test ( );
  r8ltt_mv_test ( );
  r8ltt_print_test ( );
  r8ltt_print_some_test ( );
  r8ltt_random_test ( );
  r8ltt_sl_test ( );
  r8ltt_slt_test ( );
  r8ltt_to_r8ge_test ( );
  r8ltt_zeros_test ( );
//
//  Terminate.
//
  cout << "\n";
  cout << "R8LTT_TEST\n";
  cout << "  Normal end of execution.\n";
  cout << "\n";
  timestamp ( );

  return 0;
}
//****************************************************************************80

void r8ltt_det_test ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8LTT_DET_TEST tests R8LTT_DET.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    20 November 2015
//
//  Author:
//
//    John Burkardt
//
{
  double *a;
  double det;
  int i;
  int j;
  int n = 5;
  int seed = 123456789;

  cout << "\n";
  cout << "R8LTT_DET_TEST\n";
  cout << "  R8LTT_DET computes the determinant of an R8LTT matrix.\n";

  a = r8ltt_random ( n, seed );

  r8ltt_print ( n, a, "  The matrix A:" );
//
//  Compute the determinant.
//
  det = r8ltt_det ( n, a );

  cout << "\n";
  cout << "  Determinant is " << det << "\n";

  delete [] a;

  return;
}
//****************************************************************************80

void r8ltt_indicator_test ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8LTT_INDICATOR_TEST tests R8LTT_INDICATOR.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    20 November 2015
//
//  Author:
//
//    John Burkardt
//
{
  double *a;
  int n = 5;

  cout << "\n";
  cout << "R8LTT_INDICATOR_TEST\n";
  cout << "  R8LTT_INDICATOR sets up an indicator matrix in R8LTT format\n";
  cout << "\n";
  cout << "  Matrix order N = " << n << "\n";

  a = r8ltt_indicator ( n );

  r8ltt_print ( n, a, "  The indicator matrix:" );

  delete [] a;

  return;
}
//****************************************************************************80

void r8ltt_inverse_test ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8LTT_INVERSE_TEST tests R8LTT_INVERSE.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    20 November 2015
//
//  Author:
//
//    John Burkardt
//
{
  double *a;
  double *b;
  double *c;
  int n = 5;
  int seed;

  seed = 123456789;

  cout << "\n";
  cout << "R8LTT_INVERSE_TEST\n";
  cout << "  R8LTT_INVERSE computes the inverse of an R8LTT matrix.\n";

  a = r8ltt_random ( n, seed );

  r8ltt_print ( n, a, "  The matrix A:" );
//
//  Compute the inverse matrix B.
//
  b = r8ltt_inverse ( n, a );

  r8ltt_print ( n, b, "  The inverse matrix B:" );
//
//  Check
//
  c = r8ltt_mm ( n, a, b );

  r8ltt_print ( n, c, "  The product A * B:" );

  delete [] a;
  delete [] b;
  delete [] c;

  return;
}
//****************************************************************************80

void r8ltt_mm_test ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8LTT_MM_TEST tests R8LTT_MM.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    20 November 2015
//
//  Author:
//
//    John Burkardt
//
{
  double *a;
  double *a_ge;
  double *b;
  double *b_ge;
  double *c;
  double *c_ge;
  int n = 5;
  int seed;

  cout << "\n";
  cout << "R8LTT_MM_TEST\n";
  cout << "  R8LTT_MM computes C = A * B for R8LTT matrices.\n";
  cout << "\n";
  cout << "  Matrix order N = " << n << "\n";

  seed = 123456789;
  a = r8ltt_random ( n, seed );
  r8ltt_print ( n, a, "  Factor A:" );
  b = r8ltt_random ( n, seed );
  r8ltt_print ( n, b, "  Factor B:" );
  c = r8ltt_mm ( n, a, b );
  r8ltt_print ( n, c, "  The product C = A * B" );

  a_ge = r8ltt_to_r8ge ( n, a );
  b_ge = r8ltt_to_r8ge ( n, b );
  c_ge = r8ge_mm ( n, a_ge, b_ge );
  r8ge_print ( n, n, c_ge, "  The R8GE product C:" );

  delete [] a;
  delete [] a_ge;
  delete [] b;
  delete [] b_ge;
  delete [] c;
  delete [] c_ge;

  return;
}
//****************************************************************************80

void r8ltt_mtm_test ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8LTT_MTM_TEST tests R8LTT_MTM.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    20 November 2015
//
//  Author:
//
//    John Burkardt
//
{
  double *a;
  double *a_ge;
  double *b;
  double *b_ge;
  double *c_ge;
  int n = 5;
  int seed;

  seed = 123456789;

  cout << "\n";
  cout << "R8LTT_MTM_TEST\n";
  cout << "  R8LTT_MTM computes C = A' * B for R8LTT matrices.\n";

  a = r8ltt_random ( n, seed );
  r8ltt_print ( n, a, "  The matrix A:" );
  b = r8ltt_random ( n, seed );
  r8ltt_print ( n, b, "  The matrix B:" );

  c_ge = r8ltt_mtm ( n, a, b );
  r8ge_print ( n, n, c_ge, "  The product C = A' * B:" );
  delete [] c_ge;
//
//  Compare with an R8GE calculation.
//
  a_ge = r8ltt_to_r8ge ( n, a );
  b_ge = r8ltt_to_r8ge ( n, b );
  c_ge = r8ge_mtm ( n, a_ge, b_ge );
  r8ge_print ( n, n, c_ge, "  The R8GE product C = A' * B:" );

  delete [] a;
  delete [] a_ge;
  delete [] b;
  delete [] b_ge;
  delete [] c_ge;

  return;
}
//****************************************************************************80

void r8ltt_mtv_test ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8LTT_MTV_TEST tests R8LTT_MTV.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    20 November 2015
//
//  Author:
//
//    John Burkardt
//
{
  double *a;
  double *b;
  int n = 5;
  double *x;

  cout << "\n";
  cout << "R8LTT_MTV_TEST\n";
  cout << "  R8LTT_MTV computes a matrix product b=A'*x for an R8LTT matrix.\n";
  cout << "\n";
  cout << "  Matrix order N = " << n << "\n";

  a = r8ltt_indicator ( n );
  r8ltt_print ( n, a, "  The matrix A:" );

  x = r8vec_indicator1_new ( n );
  r8vec_print ( n, x, "  The vector X:" );

  b = r8ltt_mtv ( n, a, x );
  r8vec_print ( n, b, "  The vector b=A'*x:" );

  delete [] a;
  delete [] b;
  delete [] x;

  return;
}
//****************************************************************************80

void r8ltt_mv_test ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8LTT_MV_TEST tests R8LTT_MV
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    20 November 2015
//
//  Author:
//
//    John Burkardt
//
{
  double *a;
  double *b;
  int n = 5;
  double *x;

  cout << "\n";
  cout << "R8LTT_MV_TEST\n";
  cout << "  R8LTT_MV computes a product b=A*x for an R8LTT matrix.\n";
  cout << "\n";
  cout << "  Matrix order N = " << n << "\n";

  a = r8ltt_indicator ( n );
  r8ltt_print ( n, a, "  The R8LTT matrix A:" );

  x = r8vec_indicator1_new ( n );
  r8vec_print ( n, x, "  Vector x:" );

  b = r8ltt_mv ( n, a, x );
  r8vec_print ( n, b, "  Vector b = A*x:" );

  delete [] a;
  delete [] b;
  delete [] x;

  return;
}
//****************************************************************************80

void r8ltt_print_test ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8LTT_PRINT_TEST tests R8LTT_PRINT.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    20 November 2015
//
//  Author:
//
//    John Burkardt
//
{
  double *a;
  int n = 5;

  cout << "\n";
  cout << "R8LTT_PRINT_TEST\n";
  cout << "  R8LTT_PRINT prints an R8LTT matrix.\n";
  cout << "\n";
  cout << "  Matrix order N = " << n << "\n";

  a = r8ltt_indicator ( n );

  r8ltt_print ( n, a, "  The matrix:" );

  delete [] a;

  return;
}
//****************************************************************************80

void r8ltt_print_some_test ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8LTT_PRINT_SOME_TEST tests R8LTT_PRINT_SOME.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    20 November 2015
//
//  Author:
//
//    John Burkardt
//
{
  double *a;
  int n = 5;

  cout << "\n";
  cout << "R8LTT_PRINT_SOME_TEST\n";
  cout << "  R8LTT_PRINT_SOME prints some of an R8LTT matrix.\n";
  cout << "\n";
  cout << "  Matrix order N = " << n << "\n";

  a = r8ltt_indicator ( n );

  r8ltt_print_some ( n, a, 1, 0, 4, 3, "  Some of the matrix:" );

  delete [] a;

  return;
}
//****************************************************************************80

void r8ltt_random_test ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8LTT_RANDOM_TEST tests R8LTT_RANDOM.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    20 November 2015
//
//  Author:
//
//    John Burkardt
//
{
  double *a;
  int n;
  int seed;

  n = 5;
  seed = 123456789;

  cout << "\n";
  cout << "R8LTT_RANDOM_TEST\n";
  cout << "  R8LTT_RANDOM randomizes an R8LTT matrix.\n";
  cout << "\n";
  cout << "  Matrix order N = " << n << "\n";

  a = r8ltt_random ( n, seed );

  r8ltt_print ( n, a, "  Matrix A:" );

  delete [] a;

  return;
}
//****************************************************************************80

void r8ltt_sl_test ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8LTT_SL_TEST tests R8LTT_SL.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    20 November 2015
//
//  Author:
//
//    John Burkardt
//
{
  double *a;
  double *b;
  int n = 5;
  int seed;
  double *x;

  cout << "\n";
  cout << "R8LTT_SL_TEST\n";
  cout << "  R8LTT_SL solves a linear system A*x=b with R8LTT matrix\n";
  cout << "\n";
  cout << "  Matrix order N = " << n << "\n";

  seed = 123456789;
  a = r8ltt_random ( n, seed );

  r8ltt_print ( n, a, "  Matrix A:" );
//
//  Set the desired solution.
//
  x = r8vec_indicator1_new ( n );
//
//  Compute the corresponding right hand side.
//
  b = r8ltt_mv ( n, a, x );
  r8vec_print ( n, b, "  Right hand side b:" );
//
//  Solve the linear system.
//
  x = r8ltt_sl ( n, a, b );

  r8vec_print ( n, x, "  Solution x:" );

  delete [] a;
  delete [] b;
  delete [] x;

  return;
}
//****************************************************************************80

void r8ltt_slt_test ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8LTT_SLT_TEST tests R8LTT_SLT.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    20 November 2015
//
//  Author:
//
//    John Burkardt
//
{
  double *a;
  double *b;
  int n = 5;
  int seed;
  double *x;

  cout << "\n";
  cout << "R8LTT_SLT_TEST\n";
  cout << "  R8LTT_SLT solves a linear system A'x=b with R8LTT matrix\n";
  cout << "\n";
  cout << "  Matrix order N = " << n << "\n";

  seed = 123456789;
  a = r8ltt_random ( n, seed );

  r8ltt_print ( n, a, "  Matrix A:" );
//
//  Set the desired solution.
//
  x = r8vec_indicator1_new ( n );
//
//  Compute the corresponding right hand side.
//
  b = r8ltt_mtv ( n, a, x );

  r8vec_print ( n, b, "  Right hand side b:" );
//
//  Solve the linear system.
//
  x = r8ltt_slt ( n, a, b );

  r8vec_print ( n, x, "  Solution x:" );

  delete [] a;
  delete [] b;
  delete [] x;

  return;
}
//****************************************************************************80

void r8ltt_to_r8ge_test ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8LTT_TO_R8GE_TEST tests R8LTT_TO_R8GE.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    20 November 2015
//
//  Author:
//
//    John Burkardt
//
{
  double *a_ge;
  double *a_utt;
  int n;
  int seed;

  n = 5;
  seed = 123456789;

  cout << "\n";
  cout << "R8LTT_TO_R8GE_TEST\n";
  cout << "  R8LTT_TO_R8GE converts an R8LTT matrix to R8GE format.\n";

  a_utt = r8ltt_random ( n, seed );

  r8ltt_print ( n, a_utt, "  R8LTT matrix:" );

  a_ge = r8ltt_to_r8ge ( n, a_utt );

  r8ge_print ( n, n, a_ge, "  R8GE matrix" );

  delete [] a_ge;
  delete [] a_utt;

  return;
}
//****************************************************************************80

void r8ltt_zeros_test ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8LTT_ZEROS_TEST tests R8LTT_ZEROS.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    20 November 2015
//
//  Author:
//
//    John Burkardt
//
{
  double *a;
  int n = 5;

  cout << "\n";
  cout << "R8LTT_ZEROS_TEST\n";
  cout << "  R8LTT_ZEROS returns a zeroed out R8LTT matrix.\n";
  cout << "\n";
  cout << "  Matrix order N = " << n << "\n";

  a = r8ltt_zeros ( n );

  r8ltt_print ( n, a, "  Matrix A:" );

  delete [] a;

  return;
}