From: Karl Meerbergen (Karl.Meerbergen_at_[hidden])
Date: 2007-08-16 03:47:09
Hi Vardan,
I just received write access to the subversion boost-sandbox repository.
I am adding your file to it. I suggest the following header for your
file, to be in line with other files and to anticipate a boost license
in the future:
//
// Copyright Vardan Akopian 2007
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
#ifndef BOOST_NUMERIC_BINDINGS_LAPACK_GBSV_HPP
#define BOOST_NUMERIC_BINDINGS_LAPACK_GBSV_HPP
I would like to add myself as an author when changes have to be made to
this file, some time in the future. I suppose that you do not object.
Do you have a regression test for this file?
Thanks!
Karl
Vardan Akopian wrote:
> This reminded my that I have implemented the binding for gbsv that I
> haven't posted on the list yet. I only have the double precision
> version there (since I'm never interested in single precisions), but
> adding it should be trivial. I've used this binding extensively in my
> project, so I'm pretty sure of it's correctness.
>
> -Vardan
>
>
> On 7/15/07, Dima Sorkin <dsorkin_at_[hidden]> wrote:
>
>> Hi,
>> I frequently solve lsqr equations in my thesis research,
>> so I wrote a binding to Lapack's ZGELS, DGELS.
>>
>> The code is at lower standard than the rest of bindings
>> in the sandbox, as currently being under time pressure
>> I wrote it mainly for self usage.
>>
>> Anyway, they are attached for anybody who will find them
>> useful.
>>
>> Regards,
>> Dima.
>>
>> _______________________________________________
>> ublas mailing list
>> ublas_at_[hidden]
>> http://listarchives.boost.org/mailman/listinfo.cgi/ublas
>>
>>
>>
>------------------------------------------------------------------------
>
>#ifndef _GAIM_MATRIX_BOOST_NUMERIC_BINDINGS_LAPACK_GBSV_HPP_20050522_
>#define _GAIM_MATRIX_BOOST_NUMERIC_BINDINGS_LAPACK_GBSV_HPP_20050522_
>
>#include <boost/numeric/bindings/traits/type_traits.hpp>
>#include <boost/numeric/bindings/traits/traits.hpp>
>#include <boost/numeric/bindings/lapack/lapack.h>
>#include <boost/numeric/bindings/traits/ublas_banded.hpp>
>#include <boost/numeric/bindings/traits/ublas_vector2.hpp>
>
>#ifndef BOOST_NUMERIC_BINDINGS_NO_STRUCTURE_CHECK
># include <boost/static_assert.hpp>
># include <boost/type_traits/is_same.hpp>
>#endif
>
>
>#define LAPACK_DGBTRF FORTRAN_ID( dgbtrf )
>#define LAPACK_DGBTRS FORTRAN_ID( dgbtrs )
>
>extern "C" {
>
> /********************************************************************/
> /* linear systems */
> /********************************************************************/
>
> /* banded */
>
> void LAPACK_DGBTRF (int const* n, int const* m, int const* kl, int const* ku,
> double* ab, int const* ldab, int* ipiv, int* info);
>
> void LAPACK_DGBTRS (char const* trans, int const* n, int const* kl, int const* ku, int const* nrhs,
> double const* ab, int const* ldab, int const* ipiv,
> double* b, int const* ldb, int* info);
>
>}
>
>
>namespace boost { namespace numeric { namespace bindings {
>
> namespace lapack {
>
>
> namespace detail {
> inline
> void gbtrf (int const n, int const m, int const kl, int const ku,
> double* ab, int const ldab, int* ipiv, int* info)
> {
> LAPACK_DGBTRF (&n, &m, &kl, &ku, ab, &ldab, ipiv, info);
> }
> }
>
> template <typename MatrA, typename IVec>
> inline
> int gbtrf (MatrA& a, IVec& ipiv) {
>
>#ifndef BOOST_NUMERIC_BINDINGS_NO_STRUCTURE_CHECK
> BOOST_STATIC_ASSERT((boost::is_same<
> typename traits::matrix_traits<MatrA>::matrix_structure,
> traits::banded_t
> >::value));
> BOOST_STATIC_ASSERT((boost::is_same<
> typename traits::matrix_traits<MatrA>::ordering_type,
> traits::row_major_t
> >::value));
>#endif
>
> int const n = traits::matrix_size1 (a);
> int const m = traits::matrix_size2 (a);
> assert (traits::vector_size (ipiv) == (m < n ? m : n));
>
> // if the matrix has kl lower and ku upper diagonals, then we should have
> // allocated kl lower and kl+ku upper diagonals
> int const kl = traits::matrix_lower_bandwidth (a);
> int const ku = traits::matrix_upper_bandwidth (a) - kl;
> int const ld = traits::leading_dimension (a);
>
> assert(ku > 0);
>
> int info;
> detail::gbtrf (n, m, kl, ku,
> traits::matrix_storage (a),
> ld,
> traits::vector_storage (ipiv),
> &info);
> return info;
> }
>
>
> namespace detail {
> inline
> void gbtrs (char const trans, int const n, int const kl, int const ku, int const m,
> double const* ab, int const ldab, int const* ipiv,
> double* b, int const ldb, int* info)
> {
> LAPACK_DGBTRS (&trans, &n, &kl, &ku, &m, ab, &ldab, ipiv, b, &ldb, info);
> }
> }
>
>
> template <typename MatrA, typename MatrB, typename IVec>
> inline
> int gbtrs (char const trans, MatrA const& a, IVec const& ipiv, MatrB& b)
> {
> assert (trans == 'N' || trans == 'T' || trans == 'C');
>
>#ifndef BOOST_NUMERIC_BINDINGS_NO_STRUCTURE_CHECK
> BOOST_STATIC_ASSERT((boost::is_same<
> typename traits::matrix_traits<MatrA>::matrix_structure,
> traits::banded_t
> >::value));
>#endif
>
> int const n = traits::matrix_size1 (a);
> assert (n == traits::matrix_size2 (a));
> assert (n == traits::matrix_size1 (b));
> assert (n == traits::vector_size (ipiv));
>
> // if the matrix has kl lower and ku upper diagonals, then we should have
> // allocated kl lower and kl+ku upper diagonals
> int const kl = traits::matrix_lower_bandwidth (a);
> int const ku = traits::matrix_upper_bandwidth (a) - kl;
> int const ld = traits::leading_dimension (a);
>
> assert(ku > 0);
>
> int info;
> detail::gbtrs (trans, n, kl, ku, traits::matrix_size2 (b),
>#ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
> traits::matrix_storage (a),
>#else
> traits::matrix_storage_const (a),
>#endif
> ld,
>#ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
> traits::vector_storage (ipiv),
>#else
> traits::vector_storage_const (ipiv),
>#endif
> traits::matrix_storage (b),
> traits::leading_dimension (b),
> &info);
> return info;
> }
>
>
> }
>
>}}}
>
>#endif // _GAIM_MATRIX_BOOST_NUMERIC_BINDINGS_LAPACK_GBSV_HPP_20050522_
>
>
>------------------------------------------------------------------------
>
>_______________________________________________
>ublas mailing list
>ublas_at_[hidden]
>http://listarchives.boost.org/mailman/listinfo.cgi/ublas
>
>