Taucs_symmetric_solver

Navigation: Up Table of Contents Package Overview Bibliography Index Title Acknowledging CGAL

CGAL::Taucs_symmetric_solver_traits<T>

Definition

The class Taucs_symmetric_solver_traits is a traits class for solving symmetric positive definite sparse linear systems using TAUCS solvers family. The default solver is the Multifrontal Supernodal Cholesky Factorization.

#include <CGAL/Taucs_solver_traits.h>

Is Model for the Concepts

Model of the SparseLinearAlgebraTraits_d concept.

Parameters

The full template declaration is:

template<class T>
class Taucs_symmetric_solver_traits;

Types

Taucs_symmetric_solver_traits<T>::Matrix
Taucs_symmetric_solver_traits<T>::Vector
Taucs_symmetric_solver_traits<T>::NT

Creation

Taucs_symmetric_solver_traits<T> solver ( const char * options[] = NULL, const void * arguments[] = NULL);

Create a TAUCS sparse linear solver for symmetric positive definite matrices. The default solver is the Multifrontal Supernodal Cholesky Factorization. See taucs_linsolve() documentation for the meaning of the options and arguments parameters.

Parameters:

options: must be persistent. arguments: must be persistent.

Operations

bool

solver.linear_solver ( Matrix A, Vector B, Vector& X, NT& D)

Solve the sparse linear system A ∗ X = B. Return true on success. The solution is then (1/D) ∗ X.

Preconditions:

A.row_dimension() == B.dimension(). A.column_dimension() == X.dimension().